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
- #42hardfrequently asked
42. Trapping Rain Water
Compute how much water can be trapped between elevation bars after a rainfall. Anduril frequently asks this hard problem because it has three distinct approaches at different space tradeoffs — they want to see you enumerate them, pick the O(n)/O(1) two-pointer solution, and explain the invariant rigorously.
- #239hardfrequently asked
239. Sliding Window Maximum
Find the maximum value in each sliding window of size k across an array. Anduril asks this hard problem because the monotonic deque pattern — maintaining a decreasing deque of candidates — is a precise data-structure technique that appears in real-time signal processing, where you need the running maximum of a bounded time window without reprocessing old data.