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
- #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.
- #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.