Online Assessment
Questions:
- 4 DSA problems:
- 2 LeetCode Easy
- 2 LeetCode Medium
Round 1 – DSA Round
Questions:
- You are given an
n × mchessboard with a knight at(0,0). You need to determine if the knight can move to all cells on the board. The knight can revisit cells multiple times.
Candidate's Approach
- Proposed a greedy approach: If
n >= 4andm >= 4, it is always possible. - Suggested using recursion and backtracking for further discussion.
Interviewer's Feedback
- Initially thought the solution was incorrect during the follow-up question but realized it was correct after a dry run.
Round 2 – Machine Coding Round
Questions:
- Machine Coding Task: Low-Level Design (LLD) of Chess
Candidate's Approach
- Started with requirements, object design, and system flow.
- Wrote class structures as per the interviewer's request.
Interviewer's Feedback
- The interviewer had poor communication, leading to confusion and wasted time.
- Did not clarify expectations upfront, which contributed to the misunderstanding.