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
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.