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
- #1easyfrequently asked
1. Two Sum
Find two indices in an array whose values sum to a target. Anduril uses this as a warm-up to gauge hash-map fluency and whether you can reason about the time-space tradeoff before reaching for the brute-force double loop.
- #20easyfrequently asked
20. Valid Parentheses
Determine if a string of brackets is properly nested and closed. Anduril surfaces this problem in early screens because stack-based state-machine reasoning maps directly to parsing command frames and protocol headers in autonomous systems firmware.
- #21easyfrequently asked
21. Merge Two Sorted Lists
Merge two sorted linked lists into one sorted list. Anduril uses this to test pointer discipline and the ability to reason about invariants — skills that transfer to merging ordered sensor-event streams from multiple autonomous subsystems without breaking temporal ordering.
- #53easyfrequently asked
53. Maximum Subarray
Find the contiguous subarray with the largest sum. Anduril uses this to test Kadane's algorithm fluency — a classic greedy-DP technique that mirrors the running-maximum pattern used in signal processing and telemetry anomaly detection on autonomous platforms.
- #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.
- #206easyfrequently asked
206. Reverse Linked List
Reverse a singly linked list in-place. Anduril asks this to verify you can manipulate pointer-based data structures cleanly — a skill that transfers directly to managing sensor-data pipelines and ring-buffer node chains in embedded firmware.
- #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.