Round 1
Questions:
Not exactly the same problem but it uses the below concept:
Vertical Order Traversal of a Binary Tree
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions: Minimum Insertions to Balance a Parentheses String
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3
Questions: LLD for a chess game focusing on entities, functionality, relationships, and design patterns.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Status: Rejected in LLD.
Learnings: LLD requires hands-on practice. After the interview, I learned and tried coding it. Attached is the link to the post: LLD Chess Game Design.