🧩 Hiring Drive Experience

**R1**: [All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/description/) 
**Follow-up**: Solve without using extra memory.

**R2**: [Smallest Subsequence of Distinct Characters](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/description/)
**Follow-up**: Modify to get the largest subsequence.

**R3**: Distributed Job Scheduler – Machine Coding, focus on thread safety, strong focus on writing modular code.

**R4**: MoveInSync – High-level design (routing matching, schedules etc).

**R5**: Hiring Manager Round – Discussion around projects, approach, and salary.

**R6**: Key-Value DB – Discussed CAP trade-offs and master-slave design.
(This additional round was conducted as they couldn’t finalize candidates after R5 — a bit unusual.)

[Offer Details](https://leetcode.com/discuss/post/7168779/offer-evaluation-india-by-anonymous_user-wqxk/)

🧩 Hiring Drive ExperienceR1: All Nodes Distance K in Binary Tree
Follow-up: Solve without using extra memory.R2: Smallest Subsequence of Distinct Characters
Follow-up: Modify to get the largest subsequence.R3: Distributed Job Scheduler – Machine Codi