Nutanix Coding Interview Questions: 24 Tagged Problems
24 coding problems tagged Nutanix — 2 easy · 18 medium · 4 hard — with solutions in 13 languages. Plus a 2-week study plan by topic.
- Problems: 24
- By difficulty: 2 easy · 18 medium · 4 hard
- Languages: JavaScript, TypeScript, Python, Java, C++, C, C#, Go, Kotlin, Swift, Rust, PHP and Ruby
- Cost: Free on every plan; sign in to run and submit
24 problems the CodeKairo catalogue tags as commonly asked in Nutanix's coding rounds — 2 easy, 18 medium and 4 hard — each judged by hidden tests in 13 languages. The most common topics among them are Arrays (15), Strings (6) and Matrix (6). Tagged for Nutanix and no other company: Car Fleet. The tag is the catalogue's own annotation of where a problem tends to come up — not a list published by Nutanix, which CodeKairo is not affiliated with.
Nutanix study plan by topic
All 24 problems tagged Nutanix over 2 weeks, about 14 h 30 min of solving, grouped by technique in the order they build on each other — Two Pointers, Sliding Window, Prefix Sum and Binary Search and 12 more.
Week 1: Two Pointers, Sliding Window, Prefix Sum +5
12 problems on Two Pointers, Sliding Window, Prefix Sum, Binary Search, Stack, Monotonic Stack, Monotonic Queue and Matrix, easiest first within each topic.
- Happy Number Easy
- Longest Substring Without Repeating Characters Medium
- Grumpy Bookstore Owner Medium
- Swap For Longest Repeated Character Substring Medium
- Minimum Number of Flips to Make the Binary String Alternating Hard
- Maximum Sum of an Hourglass Medium
- Find Right Interval Medium
- Check If Word Is Valid After Substitutions Medium
- Car Fleet Medium
- Sliding Window Maximum Hard
- Rotate Image Medium
- Search a 2D Matrix Medium
Week 2: Simulation, Intervals, Greedy +5
12 problems on Simulation, Intervals, Greedy, Recursion, Heap, Topological Sort, Union Find and Dynamic Programming, easiest first within each topic.
- Spiral Matrix Medium
- Valid Number Hard
- Merge Intervals Medium
- Can Place Flowers Easy
- Increasing Triplet Subsequence Medium
- Broken Calculator Medium
- Decode String Medium
- Task Scheduler Medium
- Course Schedule II Medium
- Longest Increasing Path in a Matrix Hard
- Detect Cycles in 2D Grid Medium
- Best Sightseeing Pair Medium
All problems tagged Nutanix
Easy (2)
- Can Place Flowers Array, Greedy
- Happy Number Hash Table, Math, Two Pointers
Medium (18)
- Maximum Sum of an Hourglass Array, Matrix, Prefix Sum
- Broken Calculator Math, Greedy
- Find Right Interval Array, Binary Search, Sorting
- Swap For Longest Repeated Character Substring String, Sliding Window, Hash Table
- Grumpy Bookstore Owner Array, Sliding Window
- Detect Cycles in 2D Grid Array, Depth-First Search, Breadth-First Search
- Check If Word Is Valid After Substitutions String, Stack
- Best Sightseeing Pair Array, Dynamic Programming
- Increasing Triplet Subsequence Array, Greedy
- Course Schedule II Graph, Topological Sort, Heap
- Merge Intervals Array, Sorting, Intervals
- Search a 2D Matrix Array, Matrix, Binary Search
- Spiral Matrix Array, Matrix, Simulation
- Rotate Image Array, Matrix, Math
- Task Scheduler Array, Greedy, Heap
- Car Fleet Array, Stack, Sorting
- Decode String String, Stack, Recursion
- Longest Substring Without Repeating Characters String, Sliding Window, Hash Table
Hard (4)
- Valid Number String, Simulation
- Longest Increasing Path in a Matrix Array, Matrix, Dynamic Programming
- Minimum Number of Flips to Make the Binary String Alternating String, Sliding Window, Dynamic Programming
- Sliding Window Maximum Array, Sliding Window, Monotonic Queue
Topics Nutanix asks most
- Arrays 15 problems
- Strings 6 problems
- Matrix 6 problems
- Sliding Window 5 problems
- Greedy 5 problems
- Hash Table 3 problems
- Math 3 problems
- Sorting 3 problems
- Binary Search 3 problems
- Stack 3 problems
- Heap 3 problems
- Dynamic Programming 3 problems