Had three rounds after the first round did not go well. The third round was the decider, and the interviewer was very (read: sharp) focused on bug-free code and optimization in terms of data structures (not time complexity or algorithms).

Overall, it was medium-hard, especially since one has to write bug-free code in very few attempts while interacting with the interviewer, which in itself needs practice in order to not be distracted.

Questions:

1. Write ADT functions for insert, delete element, with an additional function that returns the last element inserted.

2. Task scheduler.

3. Find whether any string is repeated in a list of strings.