Guessing game - I pick a number between 1 and 100 and you are trying to guess it. Every time you query a number I tell you if it is higher or lower. Part 1- Write the code of it, if cost of querying a number is equal. Part 2- How about if cost of querying number x is x? How would you change the algorithm?
Given two binary search trees, write function which tells if two such trees are the same – (i.e. same info in the nodes, same branching to left and right at every node).
Given a base 10 number, print the hexidecimal (base 16) representation of that number.
* Describe a balanced binary tree. * When would you want to use a balanced tree rather than a hashmap?
What sort would you use if you required tight max time bounds and wanted highly regular performance.
select a random number between 1 & 7
Given a string, find the longest substring which contains 2 unique characters. ""abcbbbbcccbdddadacb" => "bcbbbbcccb"
Implement hash table. Given a mountain of integers :: like 1 2 3 9 6 5 or 4 9 3 give the maximum
Suppose you have an arbitrarily connected graph with n nodes. Come up with an algorithm to identify each set of connected nodes (i.e. identify all the islands in the graph). What's the complexity? Can you find a solution in O(n log n)?
How to implement a queue simply using two stacks and how to implement a highly efficient queue using two stacks.
Viewing 511 - 520 interview questions