I received two questions. The first was print out all possible strings that a phone number can produce. For instance: 2 -> A,B,C and 3 -> D,E,F. So if the input is 23, then the output should be "AD, AE, AF, BD, etc.." The second question was if you had multiple points (x,y), find the n closest points to the origin (0,0).
Move all zeroes to end of array with minimum assignment operations
Given a string of digits, where every digit represents a letter (1->a, 2->b, 26->z). Find the number of words that we can generate from that string. For example: 123 -> abc, lc, aw. The answer: 3 456 -> def. The answer: 1
1. Given 1 billion numbers, find 100 largest numbers 2. Prefix notation +*123 = 5
How would you quickly find the kth smallest number in an unsorted array?
The first question is two find the largest and second largest value at each level of a binary tree. You don't need to return all values, just print out instead. the second question is to return a value in an array with the probability proportional to the weight of the value within the array. For example, in an array [4,5,6], return 4 with probability 4/15, 5 with 5/15 and 6 with 6/15. You are given a function that returns a random real number between 0 and 1
Given an input array like [1,2,3] and a target like 5, find all combinations of array that sum up to target. [2,3] and [3,2] counts for only 1 combination.
Write a function that finds the square root of a decimal number.
Given an integer, return all sequences of numbers that sum to it. (Example: 3 -> (1, 2), (2, 1), (1, 1, 1))
"Reverse" of the problem if finding k-th smallest element in a tree: I had to find k-th largest.
Viewing 1171 - 1180 interview questions