The first one is, given a tree, each node contains a digit. Calculate the sum of all numbers formed by paths from root to leaf. The second one is given a string, remove all 'b's and duplicate all 'a's.
Developer Support Engineer Interview Questions
1,135,937 developer support engineer interview questions shared by candidates
1 of very few questions that were not in STAR format: where do you see yourself in the next 5 years? (This is not a question about your ambition for the future, it's about whether you plan on sticking with this position in GM)
Having an infinite supply of water and two containers, one for 3 liters and one for 5 liters, how would you measure 4 liters?
How would you find the pairs of numbers that added to some specific number in an array.
Find all anagrams in a file. Improve the running time to O(n).
Write an algorithm to see if a tree is a BST.
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.)
Viewing 541 - 550 interview questions