• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Password Predictor

October 9, 2014 by Dhaval Dave

Danny has a possible list of passwords of Manny’s facebook account. All passwords length is odd. But Danny knows that Manny is a big fan of palindromes. So, his password and reverse of his password both should be in the list.
You have to print the length of Manny’s password and it’s middle character.
Note : The solution will be unique.

INPUT
The first line of input contains the integer N, the number of possible passwords.
Each of the following N lines contains a single word, its length being an odd number greater than 2 and lesser than 14. All characters are lowercase letters of the English alphabet.

OUTPUT
The first and only line of output must contain the length of the correct password and its central letter.

CONSTRAINTS
1 < = N <= 100

Sample Input
4
abc
def
feg
cba

Sample Output
3 b

Logic :

Store each password and its reverse in hash function.
for each password search weather its reverse is existing in hash or not.

If yes, return length+middle element of it.
else continue.

#include <stdio.h>
#include <iostream>
#include <string>
#include <unordered_map>

using namespace std;
#define MAX 100
string reverse(string temp){
    //cout<<” In function “<<temp;
    char pwd[temp.length()];
    int j=0;
    for(int i=(temp.length())-1;i>=0;i–,j++){
        pwd[j]=temp[i];
    }
    pwd[j]=’’;
    string str(pwd);
    return str;
}
int findPassword(string password[],int k){
    string temp;
    char *op;
    unordered_map<string, string> ht;
    for(int i=0;i<k;i++){
        if(password[i].length()%2 == 0 ) {cout<<“error in length” ; return 0 ;}    
        temp=password[i];
        ht.insert(make_pair(temp,reverse(temp)));
        if(ht.find(reverse(temp))!=ht.end()){
            //cout<<temp<< “<=>” <<reverse(temp)<<endl ;
            cout<<password[i].length()<<” “<<temp[(password[i].length())/2];
            return 1;
        }//if
    }//for
    return 0;
}
int main(){

    string password[MAX];
    unordered_map<string, string> ht;

    int i=0, j=0, k=0, t=0;
    cin>>t;
    k=t;
    while(t){
        cin>>password[i];
        –t; ++i;
    }
    findPassword(password,k);

}//main

see working code here : http://ideone.com/WqbO5v

Новости видео

Similar Articles

Filed Under: Adobe Interview Questions, Amazon Interview Question, Hacker Earth Questions, Interview Questions, problem Tagged With: string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Walmart Labs Interview Experience

Sort Stack in place

Stock Buy Sell to Maximize Profit

Knight Tour Problem (Graph – Breadth First Search)

Binary Tree in Java

Adobe Interview Questions 8 month Exp

Practo Hiring Experience

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Sequence Finder Dynamic Programming

Find and print longest consecutive number sequence in a given sequence in O(n)

flattens 2 D linked list to a single sorted link list

simple sql injection

Singly linked list

Circular Linked List

Wrong Directions given find minimum moves so that he can reach to the destination

Convert number to words java

Fibonacci Hashing & Fastest Hashtable

Test Cases for Round Function

SAP Off Campus Hiring_ March 2015 Verbal Skills

BFS (Breath First Search)

Given a float number convert it into the string WITHOUT using any inbuilt Function

strtok()

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Print Power Set of a Set

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Python Dictionaries

Maximum size of square sub matrix with all 1’s in a binary matrix

Leetcode: Edit Distance

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Memory Efficient LinkedList

Copyright © 2025 · Genesis Framework · WordPress · Log in