You have 2 jars and 50 black beads and 50 white beads. How many would you put of each color in each jar so that if a bead was randomly selected from both jars, you had the greatest chance they would match? You have to put all of the beads in the jars.
Tell me about yourself?
Write a function to multiply two arbitrarily large integers.
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.
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].
Viewing 631 - 640 interview questions