Anduril Coding Interview Questions
25 Anduril coding interview problems with full optimal solutions — 8 easy, 12 medium, 5 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Anduril interviewer values, and a FAQ section.
Showing 3 problems of 25
- #4hardsometimes asked
4. Median of Two Sorted Arrays
Find the median of two sorted arrays in O(log(m+n)) time. Anduril asks this hard problem to test binary-search-on-partition reasoning — the discipline of narrowing an answer space by invariant rather than by exhaustion, a mindset critical when searching configuration spaces in constrained autonomous planning.
- #23hardsometimes asked
23. Merge K Sorted Lists
Merge k sorted linked lists into one sorted list efficiently. Anduril asks this hard problem to test whether you can design an O(n log k) solution using a min-heap or divide-and-conquer — skills that translate directly to merging ordered event streams from multiple autonomous subsystems in real time.
- #127hardsometimes asked
127. Word Ladder
Find the shortest transformation sequence from one word to another by changing one letter at a time. Anduril asks this to test BFS shortest-path reasoning on an implicit graph — the ability to model a state-space as a graph and apply BFS for shortest paths is fundamental to route planning and state-space search in autonomous systems.