I am playing a card game called 24. Cards ace to king are numbered 1 to 13. During a given round, I am provided four cards to play with from the shuffled pack. If the numbers from the four cards result in 24 then I win the round if I shout '24' first. How would you code a function for this?
The wiggle problem, given an array of integers arrange them such that alternate elements are large and small.(2,5,3,6,...)
Find some certain substrings in a array of strings.
Given a string A and B, find the smallest substring of A that contains all the characters from B. (implement solution in O(n), keep in mind chars in B can repeat)
Implement data structure "Map" storing pairs of integers (key, value) and define following member functions in O(1) runtime: void insert(key, value), void delete(key), int get(key), int getRandomKey().
Write a code to construct a tree. It should get a string and generate related tree.
Compare 2 different strings which only differ in one bit, and analyze the time and space complexity of your algorithms. Follow up: two strings are very long so that we do not have enough space for the hashmap.
Return k smallest element in a tree
given rand5() that return 1-5 uniformly produce rand7() that returns 1-7 uniformly
2.Write a C/C++ program to compute sum of N numbers.
Viewing 1421 - 1430 interview questions