Implement a stack that supports push, pop and mode(the one from statistics) operation. Gave an O(log n ) push and pop and O(1) mode operation.Another good question was implement atoi function. I assumed it as base 10 but was asked to support from binary to any base numbers(even base 50).
second question. No idea how to implement in O(1) time.
Most questions are around data structures. Also expect word puzzles, like write an algorithm to spell out actual numbers. E.g. 121 -> "One Hundred and Twenty One".
Having to pick up n items from a warehouse find an algorithm to minimize the cost having a cost function to go from one item to another.
Sorting a list of some random type
Explain how browser caching works
Describe red-black trees. Explain how to implement insert and delete functions on red-black trees.
You are given two arrays, design a method to produce the intersection of those arrays. Analyze its runtime.
Write a function in java to calculate all the possible palindromes in a string.
Tell me about a time you used analysis to make a business-critical decision. Walk me through the analysis and outcome.
Viewing 1231 - 1240 interview questions