Cracking The Code.Did You Know Efficient & Working Code Really Matters: Google Interview

"Coding is just like talking to a unknown girl. Once you talked to her with guts, the next time you'll never afraid",Really? Yes , try it Now !!! Everything here is for education and learning purpose only , individual holds rights on outer posts/links etc. Team Cracking The Code

About Me

Given a stream of characters, find the first non-repeating character from stream. You need to tell the first non-repeating character in O(1) time at any moment.

Given an array of integers of size N, if M elements are removed from it the rest of the elements will be in sorted order. What is a good algorithm to find those M elements?

Print the objects of an array in the order of decreasing frequency. PS: Please make sure order of object should remain same

How would you design a logging system for something like Google , you should be able to query for the number of times a URL was opened within two time frames.

Find the largest contiguous rectangle having all 1's in matrix of size m*n ; Matrix have only 0 and 1 .

Find the minimal required number of white balls to achieve below criteria

Given a BST, maximum and minimum value, find the sum of nodes with values between the above range

Given 2 arrays A,B, where x(A.length) < y(B.length), we want to insert (y - x) 0's to A at various places such that A*B is minimum. For instance, if A = (1, -1) and B = (1,2, 3, 4), then inserting two 0's in the middle of A such that A = (1, 0, 0, -1) would minimize

assume that dictionary has only 5 words... APPLE,APE,BABY,BALL,CAT write a program which will accept a string and list all possible words in the dictionary which start with that string.

Say you have an HTML file which contains more than 100,000 characters. How do you extract all the Phone Numbers from it

Given a website you have to find number of hits in the last second, last minute and last hour.

Given a signature, compute the lexicographically smallest permutation of [1,2,....n].

Find All subsubsequence of size r in given array of length n

Given a string array， return all groups of strings that are anagrams

You have N computers and [Ca, Cb] means a is connected to b and this connectivity is symmetric and transitive. then write a program which checks that all computers are interconnected and talk two each other

Maximum Sum Subsequence in an unsorted array of size n

Design a new programming language GOOGELY.