Nutanix SWE Intern Phone Screens: 20 Experiences (Part 3 of 3)
- Company
- Nutanix
- Reports
- 20 interview reports
- Level
- Internship
- Stages
- OA → Phone screen → Onsite
Nutanix SWE intern phone screens from 2016 to 2022 asked classic coding tasks, often two per round, and some teams added OS and concurrency questions.
At a glance
- Process: usually an online test, an HR or recruiter call, one or two phone or video technical rounds, and on some loops a hiring manager or team lead (35, 36, 39, 44). In the newest one (35), the test came on Nov 2, video rounds on Nov 18 and 22, and a verbal offer the same day as the second.
- Asked most: trees and linked lists (35, 36, 42, 43, 46, 49), string parsing (35, 36, 48, 52, 54) and OS or concurrency questions (38, 42, 46). In the winter of 2018–19, four of six phone rounds had two coding questions (46, 48, 49, 50).
- Difficulty: candidate 42 didn't find the questions hard and 43 called the real task fairly easy; 38 needed hints on both the repair task and the duplicate search, and 54 needed several hints on the rectangle task.
- Practise first: Find the Duplicate in a Read-Only Array, Repair a Producer-Consumer Buffer, Kth Largest Element in an Array and Merge Two Sorted Linked Lists.
Coverage: 20 interview reports from Sep 2016 to Nov 2022: intern, MTS intern, Infra intern, Perf Software Engineer intern and Internal Tools / Dev Productivity intern applicants, from San Jose (2), California (1), "United States" (1) and a board for U.S. interview reports with no city (16). They are more than three years old, so the series keeps them as history, outside Part 1's current counts. They hold most of the full coding prompts we have for Nutanix intern interviews.
In this series
- Part 1: overview and 2024–2025 reports — the current process, question tables and 18 recent candidates
- Part 2: online tests, 2018–2020 — 16 test-only reports and the questions that kept coming back
- Part 3 (current): phone screens and loops, 2016–2022
What came up
Résumé talk is again the most common thread, in 12 of these 20 reports, and in one round (52) it filled all 40 minutes. On the coding side, tree and string-parsing tasks lead.
| Topic | Reports | Last seen |
|---|---|---|
| Résumé, projects and background | 12 of 20 | Nov 2022 |
| Trees and BSTs | 5 of 20 | Nov 2022 |
| Strings and parsing | 5 of 20 | Nov 2022 |
| Arrays, search and k-th element | 4 of 20 | Apr 2021 (report date) |
| Behavioral questions | 3 of 20 | Nov 2022 |
| OS and concurrency | 3 of 20 | Apr 2021 (report date) |
| Linked lists | 2 of 20 | Nov 2022 |
| Recursion and backtracking | 2 of 20 | Feb 2022 |
| Design (system design, a simple ML design) | 2 of 20 | Oct 2020 |
| Writing a data structure as a class | 2 of 20 | Jan 2019 (report date) |
| Graphs | 2 of 20 | Jan 2019 (report date) |
| Databases | 1 of 20 | Nov 2017 (report date) |
| Geometry | 1 of 20 | Sep 2016 (report date) |
Rows: résumé 35, 36, 37, 38, 39, 40, 44, 45, 48, 49, 52, 53; trees 35, 36, 42, 43, 46; strings 35, 36, 48, 52, 54; arrays 38, 42, 46, 51; behavioral 35, 37, 51; OS 38, 42, 46; linked lists 35, 49; recursion 37, 45; design 39, 42; classes 48, 53; graphs 50, 52.
Questions in these reports
Each question below was named by one candidate; the Reports column gives the entry.
Algorithms: trees, lists and data-structure classes
| Question | Reports | Last seen |
|---|---|---|
| Build a BST From a List | 1: 35 | Nov 2022 |
| Delete Even-Valued Nodes From a Linked List | 1: 35 | Nov 2022 |
| Build a tree from a set of given nodes | 1: 36 | Apr 2022 |
| LeetCode 215, Kth Largest Element in an Array | 1: 42 | Feb 2020 (report date) |
| LeetCode 230, Kth Smallest Element in a BST | 1: 42 | Feb 2020 (report date) |
| Outline of a Binary Tree | 1: 43 | Jan 2020 |
| K Largest and K Smallest Values | 1: 46 | Jan 2019 (report date) |
| Inorder Predecessor in a BST | 1: 46 | Jan 2019 (report date) |
| Resizable Hash Map | 1: 48 | Jan 2019 (report date) |
| LeetCode 21, Merge Two Sorted Linked Lists | 1: 49 | Jan 2019 (report date) |
| LeetCode 160, Where Two Linked Lists Meet | 1: 49 | Jan 2019 (report date) |
| Intersection of two lists (list type not stated) | 1: 50 | Jan 2019 (report date) |
| Priority Queue Class | 1: 53 | Nov 2017 (report date) |
Algorithms: strings and parsing
| Question | Reports | Last seen |
|---|---|---|
| Collapse Runs of Repeated Characters | 1: 35 | Nov 2022 |
| Anagram Words in a Sentence | 1: 36 | Apr 2022 |
| An email-address regular expression | 1: 48 | Jan 2019 (report date) |
| Solve a Linear Equation in x | 1: 52 | Oct 2018 |
| Word Appears Exactly N Times | 1: 54 | Sep 2016 (report date) |
Algorithms: arrays, recursion, graphs and other
| Question | Reports | Last seen |
|---|---|---|
| LeetCode 37, Sudoku Solver | 1: 37 | Feb 2022 |
| LeetCode 287, Find the Duplicate in a Read-Only Array | 1: 38 | Apr 2021 (report date) |
| "Paint fence": Paint Fence Work Split | 1: 44 | Dec 2019 |
| "Grumpy broker": Grumpy Owner's Calm Stretch | 1: 44 | Dec 2019 |
| Print All File and Folder Paths | 1: 44 | Dec 2019 |
| Odd Numbers Up and Back | 1: 45 | Jan 2019 (report date) |
| Start and End of a Trip From Shuffled Tickets | 1: 50 | Jan 2019 (report date) |
| LeetCode 33, Search in a Rotated Sorted Array | 1: 51 | Dec 2018 (report date) |
| Does a jump array contain a cycle? | 1: 52 | Oct 2018 |
| Course Order, Lowest Number First | 1: 52 | Oct 2018 |
| Overlap Area of Two Rectangles | 1: 54 | Sep 2016 (report date) |
Debugging and code repair
| Question | Reports | Last seen |
|---|---|---|
| Repair a Producer-Consumer Buffer | 1: 38 | Apr 2021 (report date) |
Behavioral (BQ)
| Question | Reports | Last seen |
|---|---|---|
| What makes you a good fit for this internship? | 1: 35 | Nov 2022 |
| What do you hope to gain from this internship? | 1: 35 | Nov 2022 |
| Which computer science courses have you found interesting? | 1: 51 | Dec 2018 (report date) |
CS fundamentals
| Question | Reports | Last seen |
|---|---|---|
| Mutexes and semaphores | 2: 38, 46 | Apr 2021 (report date) |
| How familiar are you with Go, and with Python? | 1: 35 | Nov 2022 |
| What is a segmentation fault? | 1: 38 | Apr 2021 (report date) |
| Virtual memory and its link to physical memory | 1: 38 | Apr 2021 (report date) |
| Process versus thread | 1: 38 | Apr 2021 (report date) |
| Explain a cache protocol | 1: 42 | Feb 2020 (report date) |
| What happens during a system call | 1: 46 | Jan 2019 (report date) |
| Binary tree, hash map or vector: when to use each | 1: 46 | Jan 2019 (report date) |
| SQL versus NoSQL; MySQL and MongoDB | 1: 53 | Nov 2017 (report date) |
History: 20 phone screens and loops, 2016–2022
35: Internal tools / Dev Productivity, Summer 2023: an OA, two video rounds, and an offer the same day
Interview dates: Nov 2–22, 2022 · Role: Internal Tools / Dev Productivity Intern, Summer 2023 · Location: Not stated · Result: Offer
Applied online on Oct 24. Online test on Nov 2, first video interview on Nov 18, second on Nov 22, and a verbal offer that same day.
Online assessment (HackerRank, 60 minutes, camera on)
- Two questions, both easy.
- Given a list of integers, build a binary search tree. The statement spelled out the pseudocode, so the job was to implement it (Build a BST From a List).
- Given a C-style linked list, delete every node with an even value (Delete Even-Valued Nodes From a Linked List).
Video interview 1, two engineers
- Coding in a shared Google Doc: squeeze each block of identical neighboring characters down to one, so aabbccdeeeaaabbb becomes abcdeab (Collapse Runs of Repeated Characters). Because the candidate began typing at once, the interviewers asked for the approach before any more code.
- Follow-ups asked why the Java answer used a StringBuilder and whether it could use less memory; by the end the interviewer pointed out it could get by with one fewer char.
- Résumé questions: how messages were encrypted in a private chat project, and a detailed walkthrough of a web portal project with a few light questions on React.
- Time left over went to the candidate's own questions.
Video interview 2, team lead
- What makes you a good fit?
- What do you hope to gain from this internship?
- How familiar are you with Go? And with Python?
- The candidate's own questions.
36: Three interviews in one day, then an offer pulled over the start date
Interview date: Apr 27, 2022 · Role: Intern (title not given) · Location: Not stated · Result: Offer withdrawn, then rejected
- Mar 24: HR asked whether the candidate was interested. A system problem followed, and HR went quiet.
- Apr 15: HR followed up and set up a phone screen right away.
- Apr 27, three interviews:
- Given a sentence, pick out the words that use the same letters as one another (Anagram Words in a Sentence).
- Build a tree from a set of given nodes. No more detail was given.
- Hiring manager, with résumé questions.
- May 3: an offer call, but the start dates didn't line up and the offer was taken back. The candidate stayed in touch, and on May 9 a formal rejection came. HR's reason was another candidate available to begin earlier.
37: Perf software engineering intern: Sudoku in a bare text editor
Interview dates: Feb 15–16, 2022 · Role: Perf Software Engineer Intern · Location: Not stated
- Feb 2: applied on LinkedIn. Feb 3: an HR email asked to book a call with no technical part.
- Feb 7: a relaxed HR call about the résumé. HR recommended brushing up on operating systems ahead of the video rounds, then passed the candidate on before hanging up.
- Feb 15 and 16: two 60-minute video interviews, each with two senior engineers. The author felt the seniors cared more about talking than about how many practice problems a candidate had drilled.
- Round 1, which held the loop's single coding task: write an algorithm that solves a Sudoku, typed into a bare text editor, with no complexity target (Sudoku Solver). The two seniors seemed to like an exchange of ideas, the author felt, and their own tip follows from that: check unclear points with the interviewers, and plan the solution in plain steps before typing code.
- Round 2, behavioral only: more serious than the first, with open-ended questions the author didn't list.
The author felt the company's tagged problem list didn't help, and that the interviewers favored behavioral questions built around a past situation. A later reply that appears to be from the author says the summer internship ran three months and ended with a return offer.
38: An MTS intern applying late: OS fundamentals, producer-consumer, and a read-only duplicate
Report date: Apr 29, 2021 · Role: Software Engineering Intern (MTS) · Location: Not stated · Result: Rejected
The application went in through LinkedIn in about March. No online test came, which the candidate put down to applying late; HR emailed to set up a call. Then came two 45-minute technical phone screens, back to back.
Phone screen 1 (booked for 45 minutes, lasted about an hour)
- Ten minutes on the résumé.
- Operating systems basics: what a segmentation fault is; what virtual memory is and what ties it to physical memory; mutexes, spinlocks, semaphores, and condition variables; processes versus threads.
- Producer-consumer code with pieces missing. The candidate had to name the race condition that appears with several producers or consumers and then repair the producer-consumer code three ways: first a mutex, then a semaphore, then a condition variable. They needed some hints but covered most of it.
The overrun meant phone screen 2 started with no pause in between.
Phone screen 2
- Ten minutes on the résumé.
- Find the Duplicate in a Read-Only Array. The setup: n + 1 unsorted values, all between 1 and n, so some value must repeat; spotting that was the warm-up. The candidate's answers (brute force, a hash set, sorting, each with its costs) didn't meet the real constraints, which came next: the array can't be modified, no extra memory is allowed, and the solution must beat O(n²). The intended route, which the candidate only reached through a hint, was binary search over the value range, and the code they wrote didn't satisfy the interviewer.
Result: a rejection, which the candidate blames on the second screen's code. Their takeaway is that OS and concurrency basics matter a lot on some Nutanix teams.
39: A fall 2020 loop with an easy ML design question
Interview dates: Oct 9–Nov 2, 2020 · Role: Intern (title not given) · Location: Not stated · Result: Offer
- Sep 12: applied. Oct 5: an HR call was scheduled, and on Oct 9 it covered interest and the résumé.
- Oct 23: two technical interviews back to back, covering a LeetCode-medium problem, the résumé, and an easy ML design question.
- Nov 2: the hiring manager, on résumé projects.
- Nov 18: verbal offer.
HR later told the author one interviewer had rated them highly, which came as a relief after a hiring-manager round they thought went poorly.
40: A Summer 2021 phone interview, still waiting to hear back
Interview date: Oct 2020 · Role: Software Intern, Summer 2021 · Location: United States · Result: No feedback yet
One phone interview, which the candidate said went okay:
- The coding was pitched around a LeetCode medium; the candidate didn't say which problem.
- The interviewer also asked concept questions tied to what the candidate had already worked on.
41: A three-step path to a San Jose MTS intern offer, spring 2020
Offer date: Spring 2020 · Role: MTS Intern · Location: San Jose, CA · Result: Offer
The candidate, a computer science master's student who hadn't yet held a full-time job, listed only the steps:
- Coding screen: two coding questions, neither described.
- Phone interview: technical.
- HR conversation.
42: Infra intern: two k-th element questions with a threading follow-up
Interview dates: Jan 2020 (online test in late November 2019) · Role: Infra Intern · Location: Not stated · Result: Offer
- Online assessment in late November 2019.
- Two phone screens in the second half of January 2020. The post lists the questions without splitting them by round:
- Kth Largest Element in an Array and Kth Smallest Element in a BST, both given as coded LeetCode numbers.
- A follow-up for both: could multithreading speed them up?
- A system design question that wasn't named, and an explanation of a cache protocol.
- A verbal offer arrived one day after the second screen.
The candidate didn't find the questions hard and described the interviewers as very nice.
43: A misheard question, then a binary tree's outline
Interview date: Jan 22, 2020 · Role: Intern · Location: Not stated
- The candidate, an undergraduate, took the online test in late November 2019. Silence followed until, the week before this call, an HR email asked to book an interview.
- Phone interview. Mishearing the question, the candidate wrote a preorder traversal for ten minutes, and the interviewer waited until it was done before setting them straight. The real task, which the candidate found fairly easy, was to print a binary tree's border from left to right (Outline of a Binary Tree). The exact walk isn't spelled out; our version goes down the left side, along the leaves, and back up the right side.
44: A Summer 2020 intern in California: recorded test, then listing every folder path live
Interview date: Dec 2019 · Role: Summer 2020 Intern · Location: California
Online coding test: 90 minutes, proctored on camera with sound
- "Paint fence", in the author's words, which they said is on LeetCode. The post doesn't say which version was asked; we link the fence-splitting task described in entry 25 (Part 2) that season: Paint Fence Work Split.
- "Grumpy broker", which reads like the classic bookstore-owner problem about a grumpy shopkeeper: Grumpy Owner's Calm Stretch.
Per the author, the proctoring tool reacts to even faint background sounds.
Live technical round, 45 minutes, with recording on
- Roughly a quarter hour on the résumé.
- Then live coding, in C++ or Python by choice. The program had to list the full path of each file and folder, producing lines such as
/,/foo,/foo/a,/combinations, and/combinations/locker(Print All File and Folder Paths). How the input was given isn't in the post.
Hiring manager
- Named as the last step; nothing else is said about it.
45: A recursion task with no loops allowed
Report date: Jan 19, 2019 · Role: Intern (career-fair applicant) · Location: Not stated · Result: Rejected
First-round phone interview
- Introducing themselves.
- A close look at a systems project the candidate had built.
- One programming task: write odd(start, end), which prints every odd number climbing from start to end, then descending back to start, so odd(1, 7) prints 1 3 5 7 5 3 1. Loops of any kind, helper functions, and global variables were all off limits, which leaves one recursive function (Odd Numbers Up and Back).
46: Concepts went fine, the coding less so
Report date: Jan 19, 2019 (interview more than a week earlier) · Role: Intern · Location: Not stated · Result: Expected a rejection; no reply yet
The candidate described the process as an online test and an HR call followed by team matching, with interviews only for teams that pick you and, they believed, a rejection otherwise.
Second-round phone interview
- Concepts: mutexes and semaphores; system calls, and what a running program goes through when it makes one; and when a binary tree, a hash map, or a vector is the right choice.
- Coding 1: from an array of integers, give back both the k biggest and the k smallest numbers (K Largest and K Smallest Values).
- Coding 2: you get a binary search tree plus a pointer to some node in it; find the node that precedes it in an inorder walk (Inorder Predecessor in a BST).
The concept answers went well, but the coding answers weren't perfect. The candidate had flown into the U.S. the day before and was still jet-lagged, and HR had gone quiet after the candidate wrote asking for a result.
47: San Jose MTS intern, offered in January 2019
Offer date: Jan 18, 2019 · Role: MTS Intern · Location: San Jose, CA · Result: Offer
The author was studying for a master's in computer science and had a year of earlier work in an MTS research and development job. Steps in the order given:
- Coding screen: two coding questions, with no detail given.
- HR conversation.
- Technical phone interviews: two of them.
48: A growable hash map and an email regex
Report date: Jan 16, 2019 · Role: Intern (referred) · Location: Not stated
Phone interview, two questions
- The interviewer opened by describing the company, talked through the candidate's projects, and asked for a GitHub link to look at one of them.
- Build your own hash map that grows when it fills up. A plain map came easily; the growing was the hard part (Resizable Hash Map).
- With time running short: a regular expression that accepts valid email addresses.
To the candidate, Nutanix phone questions seemed to stray from the common patterns.
49: Two linked-list questions in a second phone round
Report date: Jan 15, 2019 · Role: Intern · Location: Not stated
Second-round phone interview
- Combine two sorted linked lists into a single sorted one (Merge Two Sorted Linked Lists).
- Two linked lists run into each other; find the node where they meet (Where Two Linked Lists Meet).
- A self-introduction, the candidate's interests, and their projects.
50: An MTS intern screen taken from abroad, then thrown out
Report date: Jan 4, 2019 · Role: MTS Intern · Location: Not stated · Result: HR asked to redo the round
- Early September 2018: applied online. Mid-to-late November: the online test invitation, then about a week to arrange the next step.
- Early December: an HR call. Planning to spend the holidays outside the U.S., the candidate asked to interview soon, and HR forwarded their details to the hiring manager.
- Dec 20: a date for the technical phone interview finally came through. HR said it couldn't wait for the candidate's return, then never sent the interviewer the candidate's Skype contact.
Technical phone interview
- Intersection of two lists. Another company had given the candidate this exact question and wanted tries; here one loop did the job. What kind of lists they were isn't stated.
- A stack of flight tickets forms one connected trip, possibly with cycles, given in shuffled order. Return where the trip starts and where it ends. For a→b, b→c, c→a, a→d the answer is (a, d) (Start and End of a Trip From Shuffled Tickets).
The connection kept dropping. For the final ten minutes the only channel left was typed notes in the shared IDE, and the interviewer used it to ask for the time complexity. Both answers were finished and passed the candidate's own tests, and the interviewer said they could call it good. A day later HR wanted to hold the round again.
51: Favorite courses and a rotated array
Report date: Dec 27, 2018 · Role: Intern (referred) · Location: Not stated
Phone interview
- Behavioral: which computer science courses the candidate had found interesting.
- Technical: binary search in a rotated sorted array (Search in a Rotated Sorted Array).
52: One candidate's fall 2018: a passed test, an equation parser, then 40 minutes on Paxos
Interview dates: Oct 2018 (posts Oct 15–27; phone 1 on Oct 19) · Role: Intern (career-fair applicant) · Location: Not stated
Online assessment (passed), screen recorded
- Each index i of an array points to the index a[i] steps ahead of it; tell whether following the pointers can go around in a cycle. The candidate checked from every position with a visited array. Whether the steps wrap around the end of the array isn't stated.
- A twist on course prerequisites: print an order to take the courses in, and when more than one order works, prefer the lower-numbered course (Course Order, Lowest Number First). Looking back, the candidate suspected their approach was wrong, though it passed the six visible tests.
Phone interview 1 (Oct 19)
- Solve a one-variable linear equation that comes as a string, such as "4x -1 = x + 2", and give x back as a double. Only plus and minus appear, the coefficients are integers, and a case like x = x doesn't need handling. Support for parentheses was the follow-up if time allowed (Solve a Linear Equation in x).
The candidate noted that most of the Nutanix reports they had found came from experienced hires.
Phone interview 2 (posted Oct 27)
- About 40 minutes, all résumé, with someone who appeared to lead a testing-platform team at a senior level. The interviewer kept coming back to the candidate's Paxos project: its scenarios, its corner cases, and its bottlenecks. There was no coding, which puzzled the candidate.
53: Summer 2018 internship: databases, then a priority queue
Report date: Nov 8, 2017 · Role: Intern, Summer 2018 (referred) · Location: Not stated
- HR screen about two weeks before, on the projects in the résumé.
- Phone interview: a résumé chat; SQL versus NoSQL and what MySQL and MongoDB are good and bad at; then coding.
- The only coding task: a queue where every value carries a priority, and each dequeue hands back whichever value ranks highest (Priority Queue Class). A side note says enqueue might not need to store a priority; it isn't explained. A big-O discussion followed. The candidate then spotted a mistake in the code, but the clock ran out before they could correct it.
54: The oldest report: an on-campus hour in 2016
Report date: Sep 23, 2016 (interview that week) · Role: Intern (career-fair applicant) · Location: Not stated · Result: Moved on to a phone round
The candidate, an undergraduate, handed in a résumé at a career fair and had an interview invitation that evening.
On-campus interview, one hour, two questions
- Given a string, a count n, and a word, check that the word occurs n times, no more and no fewer. Any non-letter character separates words, so the job is to break the string into words while tallying the target (Word Appears Exactly N Times). After that came the complexity and how to speed it up.
- Two axis-aligned rectangles, each described by its bottom-left and top-right corners: compute how much area they have in common (Overlap Area of Two Rectangles). The candidate needed several hints.
The candidate came out thinking it had gone badly, then got the call for the next round.
Patterns across the reports
- Two coding questions per phone round, winter 2018–19. Four of the six phone interviews from that winter had two coding questions (46, 48, 49, 50) and two had one (45, 51). The 2016 on-campus hour also had two (54). Later rounds more often had one task (37, 43, 53), and one second round had no coding at all (52).
- Systems questions on some teams. Three candidates were asked OS or concurrency questions (38, 42, 46), and in a fourth loop HR suggested reviewing operating systems before the video rounds (37). Candidate 38's takeaway was that these basics matter a lot on some Nutanix teams.
- Interviewers who wanted the plan first. Candidate 35 was stopped and asked for the approach before writing more code, and candidate 37 felt the interviewers liked talking ideas through.
Common questions
How many coding questions were in a Nutanix intern phone screen?
Usually one or two. See the first pattern above: two was common in winter 2018–19, while the 2020–2022 rounds that named their tasks mostly had one.
Did Nutanix ask operating systems questions in intern interviews?
Some teams did. Candidate 38 had segmentation faults, virtual memory and four kinds of locks before a producer-consumer repair, 46 had mutexes, semaphores and system calls, and 42 had a cache protocol and a threading follow-up.
How fast did Nutanix make offers?
Fast in some loops: 35 had a verbal offer on the day of the second video round, 42 one day after the second phone screen, and 39 about two weeks after the hiring-manager round. Candidate 36's offer was withdrawn when the start dates didn't line up.
Keep practicing
- Problems from these reports: Build a BST From a List, Delete Even-Valued Nodes From a Linked List and Collapse Runs of Repeated Characters (35), Anagram Words in a Sentence (36), Sudoku Solver (37), Find the Duplicate in a Read-Only Array (38), Kth Largest Element in an Array and Kth Smallest Element in a BST (42), Outline of a Binary Tree (43), Print All File and Folder Paths (44), Odd Numbers Up and Back (45), K Largest and K Smallest Values and Inorder Predecessor in a BST (46), Resizable Hash Map (48), Merge Two Sorted Linked Lists and Where Two Linked Lists Meet (49), Start and End of a Trip From Shuffled Tickets (50), Search in a Rotated Sorted Array (51), Course Order, Lowest Number First and Solve a Linear Equation in x (52), Priority Queue Class (53), and Word Appears Exactly N Times and Overlap Area of Two Rectangles (54).
- Debugging project: Repair a Producer-Consumer Buffer (38), plus more in the Nutanix project coding bank.
- Nutanix coding and behavioral banks: the question bank and the behavioral 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.