nutanix logo
Nutanix· IC4/5

Nutanix Hacker rank assesment

Posted
4 Feb 2026
423 reads

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:

  1. 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

  1. 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)

  2. 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)

  1. 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.

  2. 02

    Jump Game VI

    Data Structures & Algorithms

    Jump Game VI

    Open the problem
  3. 03

    Min Cost to Connect All Points

    Data Structures & Algorithms

    Min Cost to Connect All Points

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Nutanix recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!