Nutanix SWE Intern OA Questions: 16 Experiences (Part 2 of 3)
- Company
- Nutanix
- Reports
- 16 interview reports
- Level
- Internship
- Stages
- OA
Nutanix SWE intern online tests from 2018 to 2020 gave two questions in 90 minutes, and the same handful of questions came back season after season.
At a glance
- Process: every one of these 16 tests had two questions. Eight gave a 90-minute limit (19, 22, 24, 25, 26, 27, 30, 33), seven describe camera or video recording (20, 22, 24, 25, 27, 28, 29), and two a recorded or shared screen only (31, 33). One names the platform: Glider (27).
- Asked most: Minimum Jumps to Reach the End in 4 tests, then Broken Calculator, Beautiful Row and the deci-binary split in 3 each. Three authors said outright that their questions had been asked before (20, 23, 28).
- Difficulty: opinions split. Candidate 31 drew two easy questions and 33 called the loop task simple, while 26 didn't solve the cargo task and 22 spent 80 minutes chasing two failing tests.
- Practise first: the four questions above, plus Cargo Port Ship Stops and Grumpy Owner's Calm Stretch.
Coverage: 16 test-only reports from Nov 2018 to Mar 2020, from intern, SDE intern and MTS intern applicants, posted to a board for U.S. interview reports with no city given. They are more than three years old, so the series keeps them as history: Part 1's current counts leave them out. The 2024–2025 reports in Part 1 mention a HackerRank test but don't name its questions, so these are the most recent named Nutanix intern test questions we have.
In this series
- Part 1: overview and 2024–2025 reports — the current process, question tables and 18 recent candidates
- Part 2 (current): online tests, 2018–2020
- Part 3: phone screens and loops, 2016–2022 — 20 older interview reports with full coding prompts
What came up
Almost every named question here is an array or string puzzle with a known twist. Candidate 30 called both of their questions dynamic programming, and candidate 20 thought the tests were mostly array questions. The 16 reports are the denominator.
| Topic | Reports | Last seen |
|---|---|---|
| Dynamic programming | 5 of 16 | Mar 2020 (report date) |
| Jump-array questions | 5 of 16 | Feb 2020 |
| Strings | 5 of 16 | Jan 2020 (report date) |
| Step-by-step simulation | 3 of 16 | Mar 2020 (report date) |
| Deci-binary splits | 3 of 16 | Nov 2019 (report date) |
| Sliding window | 2 of 16 | Nov 2019 (report date) |
Rows: DP 19, 21, 22, 27, 30; jumps 20, 23, 30, 33, 34; strings 23, 24, 26, 33, 34; simulation 19, 22, 26; deci-binary 25, 28, 32; sliding window 27, 29.
Questions in these tests
The Reports column names the entries. Two questions also turned up in an older live round (entry 44 in Part 3); the counts here are for tests only.
Asked in more than one test
| Question | Reports | Last seen |
|---|---|---|
| LeetCode 45-style, Minimum Jumps to Reach the End | 4: 20, 23, 30, 34 | Feb 2020 |
| LeetCode 991, Broken Calculator | 3: 19, 21, 28 | Mar 2020 (report date) |
| Beautiful Row | 3: 21, 22, 27 | Feb 2020 (report date) |
| Split a Number Into Deci-Binary Numbers | 3: 25, 28, 32 | Nov 2019 (report date) |
| Cargo Port Ship Stops | 2: 22, 26 | Jan 2020 |
| "Paint fence": Paint Fence Work Split | 2: 24, 25 | Jan 2020 (report date) |
| LeetCode 1052-style, Grumpy Owner's Calm Stretch | 2: 27, 29 | Nov 2019 (report date) |
Asked once
| Question | Reports | Last seen |
|---|---|---|
| Gumball Machines | 1: 19 | Mar 2020 (report date) |
| "String Weight" (no rules given) | 1: 23 | Jan 2020 (report date) |
| Replace Characters With the Nearest Prime Code | 1: 24 | Jan 2020 (report date) |
| "Colored LED" (rules unclear) | 1: 26 | Nov 2019 (report date) |
| "Perfect row" (no statement) | 1: 29 | Nov 2019 (report date) |
| Fewest steps to read every email | 1: 30 | Oct 2019 (report date) |
| Pizza Discount Days | 1: 32 | May 2019 (report date) |
| Every Loop in a Circular Jump Array | 1: 33 | Nov 2018 (report date) |
| LeetCode 402, Remove K Digits for the Smallest Number | 1: 33 | Nov 2018 (report date) |
| Maximum Weight of a Binary String | 1: 34 | Nov 2018 (report date) |
History: 16 online test reports, 2018–2020
19: An MTS intern test with a two-key calculator and a gumball simulation
Report date: Mar 19, 2020 · Role: MTS Intern · Location: Not stated
- Two questions in 90 minutes.
- Broken Calculator: get from n to m in as few presses as possible when the only keys are −1 and ×2 (both values at most 10,000). The author's method handled the easy cases first (equal numbers need nothing, and a larger n just counts down), then built a table of best press counts up to m, where each entry above n is worked out from the entry near its half (their sample entries: 10 from 5, 11 from 6).
- Gumball Machines, a day-by-day simulation over at most 20 days. The setup: three machines, one color each, capped at 1,000. The input: the color delivered each morning. The rules, in order of preference: refill the machine that already has that color; otherwise fill an empty machine; otherwise, when all three are stocked and none matches the delivery, dump the machine holding the fewest and refill it with the delivered color. Sales are 10 per machine per day, and every gumball is worth a cent. The answer is the total value of the dumped gumballs. The post doesn't settle every detail, such as whether the day's sales come before or after the restock.
20: A camera-on test with a 10-day deadline and a jump question
Interview date: Feb 15, 2020 · Role: Intern · Location: Not stated
- Applicants got 10 days from applying to finish the test, with camera and microphone on and only Chrome or Firefox allowed. The author, who had no referral, submitted just ahead of the cutoff.
- A repeat of an older question, given only as a coded problem number. The code is too loose to tell which problem it was.
- A simplified frog-jump question. Its coded number most likely points to Minimum Jumps to Reach the End.
The author's impression was that this company's tests are mostly array questions, solved with dynamic programming, DFS, or greedy methods.
21: Beautiful Row and Broken Calculator, then the waitlist
Report date: Feb 7, 2020 · Role: Intern · Location: Not stated · Result: Waitlisted
- A question named "Beautiful row", which the author said you can look up by name (Beautiful Row).
- Broken Calculator, which the author said was an unchanged LeetCode problem (Broken Calculator).
22: Cargo Port, Beautiful Row, and 80 minutes of debugging
Interview date: Jan 30, 2020 · Role: Intern (referred) · Location: Not stated
- Two questions in 90 minutes, with camera, screen, and audio all recorded. The author had heard that every applicant gets the test and résumés are read after it.
- Cargo Port (Cargo Port Ship Stops): a ship loads cargo in order, up to a limit on the number of items and a limit on total weight, delivers it to destination ports, and comes back to the loading port. Count how many times it stops. The author first looked for a way to minimize the stops, then noticed the task only asks for the count. One pass works: keep loading until the next item doesn't fit, sail, and add one stop for the trip back. The author's sample: five items, three ports, room for 3 items or 160 units of weight per trip, weights 30, 30, 100, 1, and 1, headed to ports 3, 3, 1, 1, and 3. Had the task asked for the fewest stops, the author added, a first trip with just two items would cut one stop.
- The author then spent about 80 minutes debugging a 6/8 test result. The weight list and the destination list could have different lengths. A check added in the last three minutes fixed it, and every test passed.
- Beautiful Row, which the author recognized as the longest bitonic subsequence and solved by joining, at each position, the longest increasing subsequence ending there and the longest decreasing subsequence starting there, minus one for the shared peak (Beautiful Row).
23: Frog Hopping again, and a String Weight question with no rules
Report date: Jan 23, 2020 · Role: Intern · Location: Not stated · Result: Test scored well; résumé under review
- Two questions. The first was Frog Hopping, and for the answer the author pointed to a well-known fewest-jumps problem: Minimum Jumps to Reach the End.
- The second was called String Weight. Only the name and a pointer to an outside answer were given, with no rules.
The author added that the pool of questions hadn't changed. Five days after posting, they heard back that the test had scored well and their résumé was being reviewed.
24: A shared new-grad and intern test with nearest-prime characters
Report date: Jan 3, 2020 · Role: Intern · Location: Not stated
- The test's title covered both new-grad and intern software roles. It had two questions and a 90-minute limit.
- The proctoring rules were strict: no earphones or headphones, ears left uncovered, the screen shared, video recorded throughout, a browser extension to install, and tab switching blocked and logged.
- Question 1: every character of a string whose ASCII code isn't prime becomes the character at the closest prime code, and the changed string is the answer (Replace Characters With the Nearest Prime Code).
- Question 2: "paint fence", given by name only. We link the fence-splitting task that entry 25, from the same season, describes in full: Paint Fence Work Split.
Nutanix was a new name to the author when the invitation came.
25: Deci-binary numbers and a 0/1 split in 90 minutes
Report date: Nov 22, 2019 · Role: SDE Intern · Location: Not stated
- Two questions in 90 minutes, with both the screen and video recorded.
- Decibinary Numbers. We read it as splitting a number into the fewest numbers made only of 0s and 1s (Split a Number Into Deci-Binary Numbers), which fits the author's two output notes: print how many numbers were used, and sort them before printing.
- Tom Sawyer And His Friends. According to the author, its input and output match a known problem: count the ways to cut a 0/1 array into pieces that each hold exactly one 1 (Paint Fence Work Split).
26: A cargo ship and a Colored LED puzzle
Report date: Nov 19, 2019 · Role: Intern · Location: Not stated · Result: Rejected
- Two questions in 90 minutes.
- Count the stops a cargo ship makes at the ports where it unloads (Cargo Port Ship Stops). The author hadn't prepared and didn't solve it.
- Colored LED. The author summed up the rule in one line: a ring of one letter wrapped around letters other than the ring's own. The examples as posted are too jumbled to show the exact rule or the input format.
27: A PhD applicant's test with odd input handling
Report date: Nov 18, 2019 · Role: Intern (PhD student) · Location: Not stated
- Two questions in 90 minutes on the Glider platform, with the camera on and the screen shared.
- The input setup was unusual. One question came with nothing but a main function; after some trial and error the author worked out that the program was expected to print its answer. In C++, array sizes were passed in as separate parameters.
- The grumpy bookstore-owner question, with its input changed a little (Grumpy Owner's Calm Stretch).
- Beautiful Row; the author's pointer was the classic longest increasing subsequence problem (Beautiful Row).
28: Gaze warnings, deci-binary numbers, and Broken Calculator
Report date: Nov 17, 2019 · Role: Intern · Location: Not stated
- Screen recording plus a live camera. On an external monitor, the proctoring tool kept flagging the author for looking away or for having company; on the laptop's own screen the warnings stopped.
- Both questions had appeared in earlier reports, the author said.
- Deci-binary numbers (Split a Number Into Deci-Binary Numbers).
- Broken Calculator, given as a coded problem number (Broken Calculator).
29: Perfect row and the grumpy bookstore owner
Report date: Nov 17, 2019 · Role: Intern · Location: Not stated
- Camera on, with screen and sound recorded. Looking toward the edge of the screen a little too long was enough to set off a warning, and the author found the tool unpleasant.
- "Perfect row", given only by name and a coded problem number. It may be the Beautiful Row question from other tests that season, but there isn't enough here to be sure.
- The grumpy bookstore-owner question (Grumpy Owner's Calm Stretch).
30: Two DP questions, a frog and a mailbox
Report date: Oct 30, 2019 · Role: Intern · Location: Not stated · Result: Waitlisted
- A test the author saw as going to every applicant: two dynamic programming questions in 90 minutes, in any language.
- Frog Hopping. The author took it to mean the fewest moves needed to get to the last position of an array (Minimum Jumps to Reach the End). Their O(n²) solution kept, for every position, the best count over earlier positions that can reach it, plus one. One test case never passed.
- Min operations to read all emails. The author located the first unread email and split the rest into cases, with a DP over prefixes that depends on whether the previous email was read, and every test passed. Which operations are allowed is never said.
31: A screen-recorded test after a recruiting event
Report date: Oct 25, 2019 · Role: Intern · Location: Not stated
The author had applied earlier through a campus recruiting event. The test recorded the screen and seemed to draw from a large pool of questions. The two questions the author drew were easy ones, and the post doesn't name them.
32: Pizza deals and the fewest 0/1 numbers
Report date: May 10, 2019 · Role: Intern (referred) · Location: Not stated
- A pizza shop has two deals: buy two on one day, or buy one on each of two back-to-back days. Given how many pizzas to buy on each day, decide whether the deals alone can cover them all (Pizza Discount Days). In the author's samples, four days needing 1, 2, 1, and 2 pizzas works, and three days needing 1, 0, and 1 doesn't.
- Build a number from as few deci-binary numbers as possible, where every digit is 0 or 1 (Split a Number Into Deci-Binary Numbers). The samples: 4 takes four 1s, and 21 takes two numbers, 10 and 11.
33: A loop-finding twist and Remove K Digits
Report date: Nov 19, 2018 · Role: Intern · Location: Not stated
- Two questions in 90 minutes, with the screen shared and no leaving the test page.
- A twist on the classic circular-array loop problem. Here a loop is any route that ends where it began, whether or not it touches every index, and the program must print each distinct loop once (Every Loop in a Circular Jump Array). The author called it simple but said to watch a few output requirements.
- Remove K Digits, unchanged from the original (Remove K Digits for the Smallest Number).
34: Weighing a binary string, then the frog again
Report date: Nov 8, 2018 · Role: Intern (referred) · Location: Not stated
The test arrived as soon as the author applied.
- Score a string of 0s and 1s. Two neighbors that differ form a pair worth 4 points, a character outside any pair is worth 1, and each flip of a character (0 to 1 or 1 to 0) costs 1 point. Flip as many characters as you like and return the highest score (Maximum Weight of a Binary String). The examples: "00" scores 3, since one flip makes a pair (4 − 1), and "011" scores 5, a pair plus a lone character. The author thought it looked hard, then found a single formula settled it.
- A frog moves along an array of numbers, none negative, each one the longest jump allowed from that spot. Find the fewest jumps from the first position to the last (Minimum Jumps to Reach the End). In the author's example, [1, 2, 1, 3, 0, 4, 1, 2, 1], the frog lands on indexes 0, 1, 3, 5, and 8, which is four jumps.
Patterns across the reports
- Proctoring that reacts to small things. Two candidates were flagged for looking away from the screen (28, 29); 28's warnings stopped once they moved from an external monitor to the laptop screen. Candidate 24 listed the strictest rules: ears uncovered, screen shared, a browser extension, and tab switches blocked and logged.
- Odd input handling. Two candidates lost time on the harness rather than the problem: 27 had to work out that the program should print its answer, and 22 spent about 80 minutes on two failing tests caused by input lists of different lengths.
Common questions
How long was the Nutanix intern OA?
Eight of these reports give the limit, and all say 90 minutes for two questions (19, 22, 24, 25, 26, 27, 30, 33). The one recent report with details, in Part 1 (entry 13), had 75 minutes on HackerRank.
Was the Nutanix OA proctored?
Yes, in most of these reports. Seven describe camera or video recording and two a recorded screen (see At a glance); candidate 20 also had to use Chrome or Firefox.
Does every Nutanix intern applicant get the OA?
Several candidates thought so. Candidate 22 had heard that everyone gets it and résumés are read afterwards, candidate 30 saw it the same way, and candidate 34 received it as soon as they applied. Candidate 20 had 10 days from applying to finish it.
What happens after the Nutanix intern OA?
Results varied: 21 and 30 were waitlisted, 26 was rejected, and 23 heard five days after posting that the test had scored well and the résumé was under review. Later steps for other candidates are in Parts 1 and 3.
Keep practicing
- Problems from these tests: Broken Calculator and Gumball Machines (19), Minimum Jumps to Reach the End (20, 23, 30, 34), Beautiful Row (21, 22, 27), Cargo Port Ship Stops (22, 26), Replace Characters With the Nearest Prime Code (24), Paint Fence Work Split (24, 25), Split a Number Into Deci-Binary Numbers (25, 28, 32), Grumpy Owner's Calm Stretch (27, 29), Pizza Discount Days (32), Every Loop in a Circular Jump Array and Remove K Digits for the Smallest Number (33), and Maximum Weight of a Binary String (34).
- Nutanix coding bank: all Nutanix algorithm problems in the question bank (sign-in needed).
- Nutanix overview: the Nutanix interview page and Nutanix hiring insights.
- More reports: the Experience feed.
In this series
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.