Anduril Software Engineer Interview Questions

Keep getting DMs asking about my Anduril interview experience, so decided to make a post instead of answering them all separately. Step 0: Recruiter Call - Tell me about yourself. - Why are you intere

LeetCode #200: Number of Islands. Difficulty: Medium. Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix. Asked at Anduril in the last 6 months.

LeetCode #475: Heaters. Difficulty: Medium. Topics: Array, Two Pointers, Binary Search, Sorting. Asked at Anduril in the last 6 months.

LeetCode #739: Daily Temperatures. Difficulty: Medium. Topics: Array, Stack, Monotonic Stack. Asked at Anduril in the last 6 months.

LeetCode #827: Making A Large Island. Difficulty: Hard. Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix. Asked at Anduril in the last 6 months.

LeetCode #838: Push Dominoes. Difficulty: Medium. Topics: Two Pointers, String, Dynamic Programming. Asked at Anduril in the last 6 months.

LeetCode #210: Course Schedule II. Difficulty: Medium. Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort. Asked at Anduril in the last 6 months.

LeetCode #243: Shortest Word Distance. Difficulty: Easy. Topics: Array, String. Asked at Anduril in the last 6 months.

LeetCode #981: Time Based Key-Value Store. Difficulty: Medium. Topics: Hash Table, String, Binary Search, Design. Asked at Anduril in the last 6 months.

LeetCode #49: Group Anagrams. Difficulty: Medium. Topics: Array, Hash Table, String, Sorting. Asked at Anduril in the last 6 months.

LeetCode #314: Binary Tree Vertical Order Traversal. Difficulty: Medium. Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree. Asked at Anduril in the last 6 months.

LeetCode #1828: Queries on Number of Points Inside a Circle. Difficulty: Medium. Topics: Array, Math, Geometry. Asked at Anduril in the last 6 months.

LeetCode #140: Word Break II. Difficulty: Hard. Topics: Array, Hash Table, String, Dynamic Programming, Backtracking, Trie, Memoization. Asked at Anduril in the last 6 months.

LeetCode #443: String Compression. Difficulty: Medium. Topics: Two Pointers, String. Asked at Anduril in the last 6 months.

LeetCode #701: Insert into a Binary Search Tree. Difficulty: Medium. Topics: Tree, Binary Search Tree, Binary Tree. Asked at Anduril in the last 6 months.

I know, it’s Anduril, but I’m lowk unemployed lmfao Wha do the technical questions generally look like, for those of you that have interviewed there? It’s for the Software Engineer, Intelligence Syste

The coding question was: given list of integers temps, temps[i] represents the temperature at day i, return a list of for each day, how many days until a warmer day....

## Problem Implement atoi or a custom ASCII string to integer converter handling signs and overflow. ## Likely LeetCode equivalent LeetCode 8 - String to Integer (atoi) ## Tags coding, strings, parsing, embedded, phone

## Problem You are given an N x M grid where each cell is labeled with a region ID (integer). A path is given as a list of adjacent cell coordinates. Determine whether the path crosses any border (i.e., moves from one region to a different region at any step). Return the list of crossing points. ```python def find_border_crossings( grid: list[list[int]], path: list[tuple[int,int]] ) -> list[tuple[tuple[int,int], tuple[int,int]]]: # Returns list of (from_cell, to_cell) pairs where region changes pass ``` **Example:** ``` grid = [ [1, 1, 2], [1, 2, 2], [3, 3, 2] ] path = [(0,0),(0,1),(0,2),(1,2)] -> [((0,1),(0,2))] # region 1 -> 2 crossing ``` ## Follow-ups 1. How would you extend this to count the total number of unique borders (edges between distinct regions) in the entire grid? 2. If the path may jump non-adjacent cells, how do you validate that the path is geometrically continuous? 3. How would you visualize the result -- what data would you return to allow rendering of crossing markers on a map? 4. What graph algorithm would you use to find all connected components of a single region across the grid?

## Problem Implement an encoder that converts non-negative integers to and from a custom alphabet of `n` symbols, effectively treating the alphabet as a base-n number system. The first symbol represents 0. ```python def encode(n: int, alphabet: str) -> str: # encode integer n using alphabet as base-len(alphabet) digits pass def decode(s: str, alphabet: str) -> int: pass ``` **Example:** ``` alphabet = "0123456789ABCDEF" # hex encode(255, alphabet) -> "FF" decode("FF", alphabet) -> 255 alphabet = "ABCDEFGHIJKLMNOP" # custom base-16 encode(255, alphabet) -> "PP" decode("PP", alphabet) -> 255 alphabet = "01" # binary encode(10, alphabet) -> "1010" ``` ## Follow-ups 1. What happens when `n = 0`? How do you handle the edge case to return the zero symbol rather than an empty string? 2. How does this relate to Base62 encoding used in URL shorteners (alphabet = 0-9 + a-z + A-Z)? 3. How would you add padding to ensure the output is always a fixed number of digits? 4. What is the maximum integer representable by a 6-character string with a 62-symbol alphabet?