Graph Search and Connectivity

Graph problems turn up across the Anduril process, in onsite rounds and final rounds alike. Some screens lean on cycle detection with union-find and DFS, and the loops reach for both grids and networks.

The three problems here build on each other. In the first you learn to mark what you've seen, so nothing gets counted twice. Next, the edges get a direction, and the last one asks a harder question about cycles. Get each base version running before you reach for the faster one.

The Anduril angle

A lot of Anduril's software is a graph underneath. Lattice ties sensors, towers and vehicles into one shared picture. A prompt may describe that kind of system and never say "node," so name the graph out loud early. Then ask about what the prompt leaves out, like whether the input can be empty and which way an edge points. Each answer changes a line of your code.

AndurilPremium lesson · Coding round

The 3 Anduril problems are below.

1. 1A Premium questionCoding · Medium · Signature problem
2. 2A Premium questionCoding · Medium · Frequently asked
3. 3A Premium questionCoding · Hard

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

Get the Anduril 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 Anduril lesson firstAlready a member? Sign in