How Anduril Interviews in 2026: Process, Questions & What They Score

1. 01

   Given two arrays representing two teams, arrange them in two rows for a photo so that taller players stand behind shorter ones. Which team goes in front?

   Sort both height arrays and compare them pairwise to decide which team can stand in front without blocking anyone.

2. 02

   Extend the team arrangement to teams of different sizes, where empty positions let players shift.

   Extends the pairwise greedy check to unequal team sizes, where empty positions let players shift.

3. 03

   Determine whether a valid team arrangement exists, and return an indicator if none does.

   Feasibility version of the ordering rule: detect when no valid arrangement exists and return a clear not-possible value.

4. 04

   Find the shortest distance between two points.

   Euclidean distance in 2D as the base case before obstacles are added.

5. 05

   Extend your shortest-distance solution to handle obstacles that block direct paths, then find the shortest path around them.

   Shortest path around blocked areas: BFS on a grid or Dijkstra over a graph of reachable points.

6. 06

   Follow-up to the shortest-distance question: what if the points are in space?

   Generalizes the distance calculation from 2D to a third coordinate; tests how cleanly the code extends.

7. 07

   Find the minimum sensor range needed to cover all border crossings.

   Minimum coverage range over towers and crossings: sort positions, then binary search the range or take the largest nearest-tower gap.

8. 08

   You manage a collection of robots that have tasks to perform. Keep track of the highest-priority tasks.

   Priority queue (heap) to keep the highest-priority tasks with fast insert and extract.

9. 09

   Number of Islands (count connected components in a grid).

   Connected components on a grid with DFS, BFS or union-find.

10. 10

    Maximum Number of Visible Points on a 2D plane.

    Angular sweep: convert points to angles around a fixed location, sort, and slide a window over the field of view.

11. 11

    Given a set of tasks with prerequisites, return a valid execution order, or report that none exists.

    Topological sort (Kahn or DFS) that returns an order or reports a cycle when prerequisites cannot be met.

12. 12

    How would your solution change at 10 million calls per second, or under tight memory limits?

    Scaling a working solution for high call rates and tight memory, trading time against space.

Reported problems, listed so you know what to expect. Practice them in your own editor or on the platform you prefer; SupaCV's practice mode coaches how you talk through them.

1. 01

   Implement a doubly linked list with insert, delete and search, including insertion at the beginning, end and middle.

   Doubly linked list pointer handling for insert at head, tail and middle, delete and search, including empty and one-node cases.

2. 02

   Can you refactor this to make it cleaner?

   Splitting branchy code into focused methods; tests code structure and how you take feedback mid-round.

3. 03

   Design a radar tower model for a moving ship.

   Object model for a sensor on a moving ship: classes for tower, ship and coverage, and how motion affects what the radar sees.

4. 04

   How is a ship-mounted radar system different from a ground-based product, and what difficulties do you foresee?

   Platform tradeoffs for a ship-mounted radar versus a fixed ground product, covering motion, placement and constraints.

5. 05

   Design TinyURL.

   URL shortener design: ID generation or hashing, key-value storage, caching and read-heavy scaling.

6. 06

   Design Tetris.

   Object-oriented game design: piece and board classes, rotation, collision checks and line clearing.

7. 07

   Design a system that receives signals from drones and sends back instructions.

   Ingesting drone signals and dispatching instructions: messaging, latency, reliability and high-level hardware constraints.

8. 08

   Design a real-time sensor data processor or telemetry ingestion service.

   Streaming ingestion design: high-rate sensor data, low latency, ordering, backpressure and storage.

9. 09

   Design a distributed logging system.

   Distributed logging design: collection agents, transport, durable storage, indexing and failure handling.

10. 10

    Explain a typical computer vision pipeline.

    Perception pipeline knowledge: image capture, preprocessing, model inference and output handling.

Reported problems, listed so you know what to expect. Practice them in your own editor or on the platform you prefer; SupaCV's practice mode coaches how you talk through them.

1. 01

   Walk me through your resume.

2. 02

   How would you rate your performance at your previous company? What would your manager say about you?

3. 03

   How do you make important decisions?

4. 04

   Tell me about a time you faced a moral or ethical dilemma at work.

5. 05

   Which past role did you like the most, and did you get a return offer?

6. 06

   Tell me about your biggest failure.

7. 07

   Tell me about a time you received negative feedback from your manager and how you handled it.

8. 08

   Talk me through your work experience in the past year.

9. 09

   Tell me about a time you took ownership of a project you were not originally responsible for.

10. 10

    Tell me about your past projects: their scale and scope, the technical challenges and how you solved them, and a conflict that arose and how you handled it.

11. 11

    How would you approach reducing security vulnerability resolution times across software products?

1. 01

   Why Anduril, especially when it is not a popular company for everyone?

2. 02

   What do you want to work on here: perception, backend infra, ML infra, or ML?

3. 03

   Which Anduril product do you like least?

4. 04

   Do you have any concerns about the mission or the work this position would be doing? Are you comfortable with longer hours?

5. 05

   How do you fit in a startup environment?