Write an algorithm to see if a tree is a BST.
Engineer Interview Questions
933,739 engineer interview questions shared by candidates
In python code, given a json object with nested objects, write a function that flattens all the objects to a single key value dictionary. Do not use the lib that actually performs this function. { a:{b:c,d:e} } becomes {a_b:c, a_d:e} ( not, a:"b:c,d:e" }
My 30 min coding question was related to tree where all nodes were managers each node has a value which was the number of months they worked.We have to find the maximum tenure which is I remember can be calculated using the average of its child nodes.
code a function that takes 2 parameters and an algorithm, print out all the numbers between the 2 parameters that completes the algorithm
(following the previous one) You got only TWO baby bottle sample. You would like to know the max height you can drop it without breaking the bottle. Let set the unit as 1 foot. And the highest height you can reach is at N feet. So how would you find the (max) safe height? (This is the one I think is kind of brain-teaser one.)
You put a glass of water on a record turntable and begin slowly increasing the speed. What happens first - does the glass slide off, tip over, or does the water splash out.
Tell me about yourself. How do you see yourself 5 years from now. What is your weakness.
Puzzle: There are 25 horses and 5 lanes for conducting a race among them. In a minimum of how many races, would be able to find out the 3 fastest horses among them? Assumption: Speed of horses are consistent enough across races.
Another was a puzzle: A king orders 100 bottles of wine for a celebration. A courtier who's angry with the king over something puts poison in one of those bottles. The king has a way of identifying the poisoned bottle by giving a few drops of wine to a monkey. Since the poison is fast acting, the monkey will die immediately. Whats the minimum number of monkeys needed to find the poisoned bottle?
In Javascript, how would you make a variable read-only?
Viewing 491 - 500 interview questions