Linked Lists and Trees

Pointer and tree problems come up often in Splunk's coding rounds. Each one rests on a well-known idea, and the bugs live in the edge cases, like an empty list or a list where every value is the same.

The set starts with a problem that uses two pointers and a dummy head, a habit that pays off in the rest. The others each need one careful idea, such as stopping after one full lap, a copy in place of a delete, or a walk that keeps any node from showing up twice.

Draw each one before you code it. Three boxes and a few arrows on the shared screen catch most pointer slips early. Then run the smallest inputs by hand, since a two-node list and a one-node tree find more bugs than a big random case.

SplunkPremium lesson · Coding round

The 4 Splunk problems are below.

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

+ 1 more in this lesson

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

Get the Splunk questions

$49 a year · all 100 companies · cancel anytime

From 20,000+ candidate reports, forum threads behind logins and write-ups in Chinese.

Read a free Splunk lesson firstAlready a member? Sign in