Given two lists, A and B, of sizes n and k, respectively, describe an algorithm to determine the intersection, C, of the two lists. What is the complexity of your algorithm? (The obvious solution is O(n*k)). Can you describe a solution that is faster? (An optimized solution can do it in O(n+k)).
What would u do if deadline is approaching and ur product is not finished?
Q3) Few questions on design patterns(Interpreter/ Observer/State) etc.
1) Given an array of numbers where each number has a duplicate except one, write a program to return the lone number.
Given two (huge) sets, what is an efficient way to find their intersection?
Given an integer N and an array of unsorted integers A find all pairs of numbers within A which add up to N. (This is the only question I can remember and I had trouble thinking of an answer at the time)
Telephone interview: Find largest integer from an array of integers. The integers in the array are arranged in strictly increasing (no 2 integers are same) or strictly increasing then decreasing; so like a curve and you have to find the peak. Discuss time complexity. Write code.
Test if a Binary tree is BST or not
inorder traverse of a tree without.recursive
You have a pile of coins. One of them is counterfeit, and its weight is different from the other coins. All of the other coins weigh the same. You are given a balance. How would you find the counterfeit coin? Now code it up.
Viewing 181 - 190 interview questions