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 8 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.
- #49mediumsometimes asked
49. Group Anagrams
Cluster a list of strings so that anagrams appear in the same group. Anduril uses this to test hash-map key design — choosing the canonical form of a key is the same challenge as selecting a canonical state representation when deduplicating path-planning states in a search algorithm.
- #70easysometimes asked
70. Climbing Stairs
Count the number of distinct ways to reach the top of a staircase taking 1 or 2 steps at a time. Anduril asks this to introduce dynamic programming thinking — recognizing that dp[n] = dp[n-1] + dp[n-2] is the same recurrence as Fibonacci, and seeing how memoization converts exponential recursion to linear time.
- #121easysometimes asked
121. Best Time to Buy and Sell Stock
Find the maximum profit from a single buy-sell transaction in a price series. Anduril uses this as a single-pass greedy problem — the same linear scan logic applies to processing time-series sensor streams for anomaly detection in autonomous systems.
- #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.
- #139mediumsometimes asked
139. Word Break
Determine whether a string can be segmented into words from a given dictionary. Anduril uses this DP problem to test whether you can formulate a 1D DP recurrence, recognize subproblem overlap, and choose appropriate memoization — skills that map to parsing structured command protocols with a fixed grammar.
- #704easysometimes asked
704. Binary Search
Search a sorted array for a target value in O(log n) time. Anduril asks this to verify you can implement binary search bug-free — off-by-one errors in loop invariants are a classic source of hard-to-reproduce bugs in firmware, and they watch for them carefully.