This was mainly a LLD round. Design a parking lot, you had to write a code and submit it.
In this round, I was given 2 coding questions
- Find the ordering of tasks from given dependencies
- Given a binary tree how do you remove all the half nodes
I was eliminated after this round