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.
Desarrollador Backend Java Interview Questions
711,237 desarrollador backend java interview questions shared by candidates
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?
write a program to translate alphanumeric phone number to numbers only
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
Viewing 601 - 610 interview questions