Rigorous interview lasting 8 hours. I met 7 different people, totaling 7 interviews.

The focus was primarily technical, covering data structures and algorithms through problem-solving. There were also some very theoretical questions on formal database and OO concepts.

Questions included:

• How to perform specific operations in a linked list.
• An algorithm to exit a maze given the constraint of not being able to turn left.
• How to implement recursive queries.
• Some C-related questions, among others.

How to come out of a maze, given that you can move one step at a time and you cannot turn left.

In an employee table, there is a self-reference to a boss (who is also an employee). How to find the number of people that work under a given person for their entire tree?