The interviewer gave his introduction, and then I gave mine.

After that, the technical round began. I was asked two DSA questions and was asked to:

• Code the solution
• Explain a dry run of the code
• Write the time and space complexity of the solutions.

Q1. Given a list of 0's, 1's, and 2's, sort the list in place and return it.

Q2. Given a list of strings, generate all the anagrams of each string. Put these anagrams into a list, and then put that list into another list. The anagrams should be in order of the appearance of the strings, and duplicates should be removed (e.g., 'cat' and 'tac' will have the same anagrams, so we should only return it once).