Phone Interview:

1. Shallow copy, deep copy.
2. Serialization.
3. Types of thread synchronization.
4. Hash table and hash collision resolution techniques.
5. Puzzle: Join 4 dots using three lines.

1:1 interview

1. Puzzle: Find minimum floor from which a tt ball will break, if there are 100 floors and 2 tt balls.
2. In-memory cache: Design, problems, and solutions.
3. Find one/two missing numbers in 1-n numbers.

Online coding test - 2 hours

1. Can browse the net.
2. Was given an airlines portal system with API, write client code that uses the API and write some code to add more exception scenarios, errors, scalable situations, and race conditions.

Hash Collision techniques.