Suppose you have a ladder with 1000 rungs and some identical eggs. You wish to measure the hardness of the floor by finding the lowest rung at which an egg breaks when dropped. How would you do this efficiently? How many steps would this algorithm take? What if the ladder was infinitely long? Suppose that eggs are expensive and you wish to minimise the number of eggs broken?
I'm not permitted to disclose this, signed an agreement
In the telephone interview I was asked two logic questions. In the onsite interview there were three separate interviews. Two technical which involved pseudo code questions and programming questions and a CV interview
Recent books you've read Any volunteering work you've done
General run thought of cv
Describe a technical topic in simple terms
Describe why X was such an effective team.
oop, java, python, html, javascript,
Tell me a time when you had to overcome challenges
Graph traversal question, discussion about data structures
Viewing 2371 - 2380 interview questions