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
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.
Signed NDA
Given a sorted array of integers in increasing order (can contain duplicates), return the last index of a specified target integer, or return -1 otherwise. Thus 1, 2, 2, 3, 4 and the target is 2, the function should return 2.
1. Find the minimum number of train stations required given a list of departure and arrival times. 2. The online screens had a couple of SAT style questions and some debugging questions.
Viewing 731 - 740 interview questions