Nutanix | MTS3 | IE (cleared)
Summary
Interview Experience
🧩 Hiring Drive Experience R1: All Nodes Distance K in Binary TreeFollow-up: Solve without using extra memory. R2: Smallest Subsequence of Distinct CharactersFollow-up: Modify to get the largest subsequence. R3: Distributed Job Scheduler – Machine Coding, focus on thread safety, strong focus ...


