Phone Screening 1:

Given an array, find all pairs that add up to a given sum. Generalize on finding more than two elements that can add to the given sum. Discuss data structure operations complexity in relation to the data structures used for coding the solution to this problem (going from hashes/dictionaries, then extrapolating to BSTs and red-black trees). Questions on my working experience.

Phone Screening 2:

Generate a maze. Each cell can be a free space, a wall, a starting point, or the end point.

I tried an incremental solution by randomly choosing the type of cell as I progressed through the maze. I managed to finish, but there was no time left for any questions. Obviously, my solution was not good enough.

Good luck, everyone!