Nutanix

2020-21 · unknown

1. 1

   Coding test

   Online coding round
   60 min2 questionsonline

   dynamic programming · partition · strings

   All popular languages allowed.

2. 2

   Other round

   Debugging round
   40 min1 questions

   disjoint set union · C++ comparators

   C++ code with no syntax errors.

3. 3

   Technical interview

   Interview 1 (shared coding editor)
   HackerRank CodePair60 minonline

   trees · subtree counting · offline queries · Mo's algorithm

   One problem with many progressing parts.

4. 4

   Technical interview

   Interview 2 (shared coding editor)
   HackerRank CodePair60 minonline

   grid BFS · 0-1 BFS · binary search on answer · Manhattan distance

   Difficulty rises across subparts.

Question patterns reported

The kind of problem, not the problem itself. Our practice questions are written to match these patterns.

• Codingpartition array into two groups, balance sums
• Codingminimum substrings with no repeated letters
• Otherfix logic bugs in iterative union-find code
• Technicalcount subtrees whose values satisfy a threshold, with progressive optimisation
• Technicalextend to counting by value range
• Technicalgrid multi-source delivery time, then add one facility optimally