1. Given an unlimited stream of characters, that can only be read one character at a time, using a specific function (e.g. getChar()), and a list of patterns (e.g. "cat", "dog", "man"), write an algorithm to find all the occurrences of the patterns in the stream. 2. Perform a "test run" of the algorithm in order to assess strong points, weak points and, eventually bugs. 3. Give an estimate of the temporal complexity of the proposed algorithm (e.g. O(x))
What classes including data members and methods would you design for a coffee machine?
Draw a architecture you have worked on
None.
Given a list of words, group them by anagrams of each other.
Questions are fairly easy if you have studied CtCi, etc. you can breeze through. There is a systems design interview during the onsites so you might want to study well for that.
Delta encoding: given a list of numbers as input, output a delta encoding for the sequence.
Describe a time when you were stuck on a problem, how did you solve it, and what was the outcome?
I won't be able to share it. I don't remember them.
How do you respond to disagreement?
Viewing 3581 - 3590 interview questions