Given a BST with leaf nodes having a numeric value, and nodes having the sum of values of its two children. Find an algorithm to find the maximum node within a tree.
Programmer Trainee Interview Questions
712,403 programmer trainee interview questions shared by candidates
How to implement a queue simply using two stacks and how to implement a highly efficient queue using two stacks.
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?
select a random number between 1 & 7
write a program to translate alphanumeric phone number to numbers only
Given a series of words written using a scrambled alphabet, figure out what order the letters of the alphabet are in.
Difference between RB trees and B trees?
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)?
Viewing 601 - 610 interview questions