65+ Nutanix questions

Nutanix interview questions and how to prepare

The questions candidates report from Nutanix interviews, sorted by how often they come up, with difficulty and topics, plus original practice written in Nutanix's interview style.

ZorixOS tracks 65 community-reported Nutanix interview questions, drawn from an open-source dataset of real interview reports and sorted by how frequently each one comes up. Every question links to its source. Alongside them are 98 original ZorixOS practice questions written in Nutanix's known interview style (not claimed as asked at Nutanix), so you can rehearse the real format. Practice any of them out loud in a free AI mock interview tuned to Nutanix.

Updated July 2026

Nutanix interview questions candidates report

Community-reported from real Nutanix interviews (open-source dataset), most-asked first. Showing 60 of 65. Each links to its source.

  1. Binary Tree Cameras
    Dynamic ProgrammingTreeDepth-First SearchBinary Tree
    Hard100% asked
  2. Medium100% asked
  3. Car Fleet
    ArrayStackSortingMonotonic Stack
    Medium100% asked
  4. Medium100% asked
  5. Easy100% asked
  6. Delivering Boxes from Storage to Ports
    ArrayDynamic ProgrammingSegment TreeQueue
    Hard100% asked
  7. Detect Cycles in 2D Grid
    ArrayDepth-First SearchBreadth-First SearchUnion-Find
    Medium100% asked
  8. Medium100% asked
  9. Grumpy Bookstore Owner
    ArraySliding Window
    Medium100% asked
  10. LRU Cache
    Hash TableLinked ListDesignDoubly-Linked List
    Medium100% asked
  11. Maximum Sum of an Hourglass
    ArrayMatrixPrefix Sum
    Medium100% asked
  12. Merge Intervals
    ArraySorting
    Medium100% asked
  13. Minimum Processing Time
    ArrayGreedySorting
    Medium100% asked
  14. Online Majority Element In Subarray
    ArrayBinary SearchDesignBinary Indexed Tree
    Hard100% asked
  15. Medium100% asked
  16. Swap For Longest Repeated Character Substring
    Hash TableStringSliding Window
    Medium100% asked
  17. Group Anagrams
    ArrayHash TableStringSorting
    Medium84% asked
  18. Medium84% asked
  19. Rotate Image
    ArrayMathMatrix
    Medium84% asked
  20. Sliding Window Maximum
    ArrayQueueSliding WindowHeap (Priority Queue)
    Hard84% asked
  21. Best Sightseeing Pair
    ArrayDynamic Programming
    Medium76% asked
  22. Binary Tree Maximum Path Sum
    Dynamic ProgrammingTreeDepth-First SearchBinary Tree
    Hard76% asked
  23. Binary Tree Zigzag Level Order Traversal
    TreeBreadth-First SearchBinary Tree
    Medium76% asked
  24. Decode String
    StringStackRecursion
    Medium76% asked
  25. Longest Increasing Path in a Matrix
    ArrayDynamic ProgrammingDepth-First SearchBreadth-First Search
    Hard76% asked
  26. Maximum Frequency Stack
    Hash TableStackDesignOrdered Set
    Hard76% asked
  27. Medium76% asked
  28. Search a 2D Matrix
    ArrayBinary SearchMatrix
    Medium76% asked
  29. Medium76% asked
  30. Spiral Matrix
    ArrayMatrixSimulation
    Medium76% asked
  31. Task Scheduler
    ArrayHash TableGreedySorting
    Medium76% asked
  32. Hard76% asked
  33. Course Schedule II
    Depth-First SearchBreadth-First SearchGraph TheoryTopological Sort
    Medium67% asked
  34. Diameter of Binary Tree
    TreeDepth-First SearchBinary Tree
    Easy67% asked
  35. Medium67% asked
  36. Max Stack
    Linked ListStackDesignDoubly-Linked List
    Hard67% asked
  37. Serialize and Deserialize Binary Tree
    StringTreeDepth-First SearchBreadth-First Search
    Hard67% asked
  38. 3Sum
    ArrayTwo PointersSorting
    Medium64% asked
  39. Boundary of Binary Tree
    TreeDepth-First SearchBinary Tree
    Medium64% asked
  40. Clone Graph
    Hash TableDepth-First SearchBreadth-First SearchGraph Theory
    Medium64% asked
  41. First Missing Positive
    ArrayHash Table
    Hard64% asked
  42. Jump Game II
    ArrayDynamic ProgrammingGreedy
    Medium64% asked
  43. Longest Palindromic Subsequence
    StringDynamic Programming
    Medium64% asked
  44. Max Consecutive Ones III
    ArrayBinary SearchSliding WindowPrefix Sum
    Medium64% asked
  45. Maximum Employees to Be Invited to a Meeting
    ArrayDynamic ProgrammingDepth-First SearchGraph Theory
    Hard64% asked
  46. Meeting Rooms II
    ArrayTwo PointersGreedySorting
    Medium64% asked
  47. Merge k Sorted Lists
    Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
    Hard64% asked
  48. Min Cost to Connect All Points
    ArrayUnion-FindGraph TheoryMinimum Spanning Tree
    Medium64% asked
  49. Minimum Cost to Make All Characters Equal
    StringDynamic ProgrammingGreedy
    Medium64% asked
  50. Number of Islands
    ArrayDepth-First SearchBreadth-First SearchUnion-Find
    Medium64% asked
  51. Pacific Atlantic Water Flow
    ArrayDepth-First SearchBreadth-First SearchMatrix
    Medium64% asked
  52. Palindrome Partitioning II
    StringDynamic Programming
    Hard64% asked
  53. Path With Minimum Effort
    ArrayBinary SearchDepth-First SearchBreadth-First Search
    Medium64% asked
  54. Medium64% asked
  55. Rotate Array
    ArrayMathTwo Pointers
    Medium64% asked
  56. Set Matrix Zeroes
    ArrayHash TableMatrix
    Medium64% asked
  57. Snapshot Array
    ArrayHash TableBinary SearchDesign
    Medium64% asked
  58. Split Array Largest Sum
    ArrayBinary SearchDynamic ProgrammingGreedy
    Hard64% asked
  59. Surrounded Regions
    ArrayDepth-First SearchBreadth-First SearchUnion-Find
    Medium64% asked
  60. Top K Frequent Elements
    ArrayHash TableDivide and ConquerSorting
    Medium64% asked

These are the 60 most-reported of 65 tracked Nutanix questions. Create a free account to drill the full set with solutions and an AI interviewer.

Practice questions in Nutanix's style

Original ZorixOS questions written the way Nutanix interviews, so you rehearse the real format. Not claimed as asked at Nutanix.

  1. Imagine you are tasked with optimizing the data path for Nutanix Files, specifically handling large metadata operations for a customer with millions of small files. Describe your approach to identify bottlenecks and propose solutions, considering distributed caching, efficient indexing, and inter-node communication.

    Software EngineerSystem DesignTests: Evaluates the candidate's ability to design scalable, high-performance distributed systems and solve complex technical challenges relevant to Nutanix's product portfolio.
  2. A Nutanix AOS cluster experiences intermittent high latency for virtual machine disk I/O. You suspect a network saturation issue within a specific rack. How would you use Nutanix Prism or other tools to diagnose this problem, and what steps would you take to mitigate it?

    Software EngineerDebuggingTests: Assesses the candidate's practical debugging skills in a distributed storage and virtualization environment, mirroring real-world Nutanix operational challenges.
  3. Write a Python function that simulates the replication process for a Nutanix volume group. The function should take parameters for source and destination nodes, data block size, and network bandwidth. Consider how to handle potential failures and ensure data consistency. Assume simplified block-level replication.

    Software EngineerCoding ReasoningTests: Tests the candidate's fundamental programming skills, understanding of distributed data management concepts, and ability to translate requirements into code.
  4. Nutanix is considering introducing a new multi-cloud management plane that aggregates telemetry and orchestration across AWS, Azure, and GCP. Design the core components of this system. Focus on how you would handle authentication, data aggregation from disparate cloud APIs, and the eventual consistency of state across clouds.

    Software EngineerSystem DesignTests: Measures the candidate's ability to design complex, multi-cloud distributed systems and reason about challenges like data consistency and interoperability.
  5. Describe the data structures and algorithms you would use to implement a highly available distributed snapshotting mechanism for Nutanix objects. How would you ensure atomicity and minimize the impact on ongoing I/O operations?

    Software EngineerSystem DesignTests: Probes the candidate's knowledge of advanced data structures and algorithms for fault-tolerant distributed systems, relevant to Nutanix's core technology.
  6. Given a scenario where a Nutanix cluster's control plane is experiencing high CPU utilization, analyze the potential root causes. Discuss how you would isolate the issue, considering components like Cassandra, Zookeeper, and the distributed file system metadata services.

    Software EngineerDebuggingTests: Evaluates the candidate's understanding of Nutanix's internal architecture and their systematic approach to diagnosing control plane issues.

92+ more Nutanix-style questions are in the free library, each practiceable live with adaptive follow-ups and an honest scorecard. Start free.

Can you answer these out loud, under Nutanix-style follow-ups?

The ZorixOS AI interviewer runs a Nutanix-tuned mock interview: it asks these kinds of questions, digs into your answers, and scores you against a real hiring bar. Your first one is free.

Start your Nutanix mock interview
Nutanix Interview Questions (2026) | ZorixOS