The interview process for the two-month summer internship involved a detailed discussion of time and space complexities.

Two medium-level DSA questions were asked:

• One on the spiral matrix problem.
• Another on a variation of the tree sum property problem.

A brief introduction was given, then we quickly jumped to printing a matrix in spiral form.

We started with the brute-force solution, then discussed the complexity and space used.

After coding the first problem, we moved to the second: a tree variation problem.

Many questions were asked to understand the problem statement, and then a basic approach was provided.

We tried enhancing the complexity and were finally able to code it satisfactorily.