Arrays, Lists and Log Scans

The four problems here don't share one pattern. One is a matrix walk, one is a linked list rewrite, one is an array puzzle, and one is a log scan over a time window. What they share is bookkeeping, where every bound and pointer has to land exactly right.

Two of them have come up together as the two problems in a one-hour MTS-2 round. That leaves about fifteen minutes for the first and thirty for the second, so practice them back to back against a clock.

One comes with a follow-up that asks you to restore the input afterward, which the textbook answer can't handle. The log question looks easy, but sorting the times as strings breaks it.

Code quality gets its own score at Nutanix, and these four problems show it quickly. A matrix walk with unnamed bounds is hard to read even when it runs, and so is a list rewrite juggling six loose pointers. Name your variables and keep each step short.

NutanixPremium lesson · Coding round

The 4 Nutanix problems are below.

1. 1A Premium questionCoding · Medium
2. 2A Premium questionCoding · Hard
3. 3A Premium questionCoding · Hard

+ 1 more in this lesson

Each with hints, the follow-up and a tested solution.

Get the Nutanix questions

$49 a year · all 100 companies · cancel anytime

From 131 Nutanix reports, forum threads behind logins and write-ups in Chinese.

Read a free Nutanix lesson firstAlready a member? Sign in