phone numbers: provided a phone number (654-876-0987), return all possible strings that the phone number could represent if 2 -> {A, B, C}, 3 -> {D, E, F}, and so on common substring: find the biggest common substring in 2 strings, "abcdef" "gbcdh" would return "bcd"
How do you find the kth smallest number in a binary search tree.
Regular expression and strStr. I was not able to give KMP algorithm to strStr
Reverse an integer without using string operations.
The coding problem in 2nd round.
We draw a person at random from the street. Then we keep drawing people until we find someone taller than the first person. What is the expected number of draws we have to wait?
Given a set of points (x,y) and an integer "n", return n number of points which are close to the origin
Given an array A of n integers, in sorted order, and an integer x. design an O(n)-time complexity algorithm to determine whether there are 2 integers in A whose sum is exactly x.
given non-zero number array A, create array B where B[i] = product of all elements in A except A[i].
First explain what a tree, then binary tree, then a binary search tree is. Now implement a function that verifies whether a binary tree is a valid binary search tree.
Viewing 881 - 890 interview questions