Nutanix MTS-2 (C++/Golang) Interview
Summary
I attended a hiring drive for Nutanix for an MTS-2 role, which consisted of two rounds. I successfully solved two DS/Algo problems in the first round and implemented a Memory Based Sparse File Class in the second round, which was a system coding challenge. I am currently awaiting the results.
Full Experience
Attended the Hiring drive for Nutanix for May. Consisted of 2 rounds.
HR called the night before the interview to schedule it the next day. They told me both the rounds will have DS/Algo problems to solve.
Round 1 : 2 problems (60 mins)
Solved both of them optimally in time along with all edge cases.
a. Given a string s, remove duplicate letters so that every letter appears once and only once. You must make sure your result is lexicograpically smallest one.
b. "maximize the minimum distance" problem — similar to placing cows in stalls with max spacing.
Round 2 : System Coding Round (nowhere close to what HR told me about what was expected from the interview)
Task : Implement a Memory Based Sparse File Class
I had three functions to implement. There were questions around best way for storing the data, concurrency and optimization of the functions. Also wanted to discuss about the compression algorithms but ran out of time)
HR told they will get back to me after 2 days (after they are done with the hiring drive. Hoping for the best right now!
Interview Questions (3)
Given a string s, remove duplicate letters so that every letter appears once and only once. You must make sure your result is lexicograpically smallest one.
"maximize the minimum distance" problem — similar to placing cows in stalls with max spacing.
Task : Implement a Memory Based Sparse File Class
I had three functions to implement. There were questions around best way for storing the data, concurrency and optimization of the functions. Also wanted to discuss about the compression algorithms but ran out of time)