Brain teaser: most buckets filled with infinite number of balls that weigh 1 gram, but one bucket has balls that weigh 2 grams. How do you find the bucket that has the 2 gram balls with only one weigh in? Follow up after you solve it, is what if there are two buckets with 2 gram balls?
Given a list, how would you find duplicates.
The design rounds can seem tricky but they verify if you are thinking along the correct lines
Asked what is a semaphore?
Most of the questions weren't all that difficult and there was very little pressure in solving them. The point was really to see the process of arriving at your answer. The most difficult question was to explain the cardinality of depth first and breadth first search and explain how the algorithms could be written. I actually missed that one as I haven't looked at a text book in years. The question I remembered most was the one about having 2 eggs and dropping them off a 100 story building to determine at what floor they begin to break. What is the least amount of attempts required to determine this answer?
Second Interview: Write a function that takes a binary search tree and returns an array with the in-order permutation of the tree.
Design O(1) read/write cache
Given 2 strings, how can you determine that one string is only made of characters found in the second string.
Given a maze, find all paths from entry to exit.
Consider Str1 and Str2. Tell me the number of occurrences of the cyclic substring of str2 in str1.
Viewing 871 - 880 interview questions