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)).
Given a random array with integers, find every pair that sum up to a certain number.
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.
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.
inorder traverse of a tree without.recursive
Given an int array, find the sequence of elements that has the largest sum
1. Finding first non repeated character in an array 2. Linux command to list files containing specific string 3. Mysql query related to Group by Second phone interview 1. create a doubly linked list out of that tree where each node represents sum of all nodes in the same vertical line. 2. Implement search for a sorted rotated array.
Design a data structure where insertion, deletion, data access and get random element are all done in O(1), i.e., constant time. (Without using STL or Hash tables)
Many sticks with length, every time combine two, the cost is the sum of two sticks' length. Finally, it will become a stick, what's the minimum cost?
One of the question was on Designing & Code a TTL Cache with some modifications
Viewing 181 - 190 interview questions