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 2 problems of 25
- #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.
- #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.