Nutanix Hacker rank assesment
- Posted
- 4 Feb 2026
Summary
I underwent a 2-hour online assessment for an IC4/5 role at Nutanix, which served as an interview experience. I found it challenging due to the time constraint and faced three algorithmic problems: Maximum Quantity, Jump Game VI, and Min Cost to Connect All Points.
How it went
Gave a OA of nutanix (IC4/5 role) List of question asked in 2 hour:
- Maximum Quantity (Machines + maxPower)
Given power[i] and quantity[i], pick a subset so that sum(power) <= maxPower and sum(quantity) is maximized.
0/1 Knapack but meet in middle is optimal because of constraint
-
Jump Game VI https://leetcode.com/problems/jump-game-vi/description/
Solved using DP + monotonic queue (first did with normal loop of range but TLE happened used queue)
-
Min Cost to Connect All Points
https://leetcode.com/problems/min-cost-to-connect-all-points/2D DP after sorting but failed later realised it is MST
Found it tough for 2 hour timeline
Questions asked (3)
- 01
Maximum Quantity (Knapsack Variant)
Data Structures & Algorithms
Given power[i] and quantity[i], pick a subset so that sum(power) <= maxPower and sum(quantity) is maximized.
- 02
- 03
Min Cost to Connect All Points
Data Structures & Algorithms
Open the problemMin Cost to Connect All Points