Round 1: DSA + Leadership Principles (Feb 27)
Questions:
Question
- Print leaves of a Binary Tree (left to right)
- Follow-up: Print the boundary of the Binary Tree
Candidate's Approach
- Solved both questions.
- Explained the approach clearly.
- Wrote full code and performed a dry run.
- Discussed time and space complexity.
Interviewer's Feedback
No feedback provided.
Round 2: DSA + Leadership Principles (Mar 3)
Questions:
Question
- Minimum Platforms (Greedy / Sorting)
- String-based problem - Find the maximum frequency substring of size n and return that string
Candidate's Approach
- Solved both questions.
- Explained the approach clearly.
- Wrote full code and performed a dry run.
- Discussed time and space complexity.
Interviewer's Feedback
No feedback provided.
Round 3: HM Round (Awaiting)
Questions: Specific question not provided.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.