Position: Software Engineer, Full Stack/Developer Experience
- Introduce what they are working on
- Technical Questions
- Merge two sorted array: just describe the algorithm and time complexity
- Merge K sorted array: write the code.
- Two Sum: an sorted array, find if there is at least a pair of two elements which the sum equals 0. Just describe the algorithm and time complexity.
I gave him two approaches: using HashMap and two pointers.
Then he asked me to write the code with two pointers.
- Three Sum: just describe the algorithm and time complexity.