Anduril Industries
LeetCode-medium problems wrapped in defense stories — drones, sensors, border towers — with deliberately vague prompts that grow in phases. Clarifying constraints and extending working code is what gets graded; senior screens add “what if the input were massive?”
Typical loop
- 1Recruiter screen: 30 min — why Anduril, comfort with defense work
- 2Technical phone screen: 60 min on HackerRank CodePair — one multi-phase medium (~10 min intro, ~40 coding, ~10 for your questions)
- 3Some teams add a hiring-manager call: resume plus role-specific coding
- 4Final loop, ~4 × 60 min: two coding rounds in the same multi-phase style
- 5System design / OOD round (radar-tower model, data-structure design)
- 6Behavioral with senior staff: line-by-line resume drill
Questions
Callback's practice questions and the LeetCode questions Anduril Industries has been asking, filtered together.
Practice questions
Algorithms & Data Structures · Sort both teams, pair i-th against i-th, and try both orders.
Algorithms & Data Structures · The largest nearest-sensor gap — sort one side, binary search from the other.
Algorithms & Data Structures · Interval greedy: extend coverage with the farthest-reaching clip that still connects.
Shortest Path Around Obstacles
Algorithms & Data Structures · Unit steps on a grid: BFS, and the first arrival is the answer.
Algorithms & Data Structures · Union-Find: an edge whose endpoints already share a root closes a cycle.
Algorithms & Data Structures · Unbounded knapsack in disguise — say that out loud, then roll a 1-D table.
Algorithms & Data Structures · Tokenize into groups of choices, then fold a cartesian product across them.
Algorithms & Data Structures · An undo log per open transaction: rollback replays it, commit hands it to the parent.
Algorithms & Data Structures · Two-pointer scans with no library calls — the point is proving you can.
Algorithms & Data Structures · Injected transport, upserts keyed by id, a dirty set — a small class with senior signals.
Algorithms & Data Structures · Only faced pairs matter: greedily match the smaller team into the larger.
Algorithms & Data Structures · The greedy match, written into two rows with empty slots.
Fewest Towers to Cover Every Crossing
Algorithms & Data Structures · Greedy: place each tower as far right as the leftmost uncovered crossing allows.
Algorithms & Data Structures · One formula for every dimension: the square root of the summed squared differences.
Shortest Path on a Huge Map with A*
Algorithms & Data Structures · BFS's answer, found by expanding cells in order of cost-so-far plus an admissible estimate.
Shortest Path with Terrain Costs
Algorithms & Data Structures · Unequal step costs turn BFS's queue into Dijkstra's priority queue.
Algorithms & Data Structures · A three-line grammar turns nested braces into a tiny recursive-descent parser.
Algorithms & Data Structures · Find the end of each run (or each number), emit, jump.
Algorithms & Data Structures · A read pointer and a write pointer over the same array — write never passes read.
Algorithms & Data Structures · The farthest-reach greedy again, remembering which clip won each round.
Algorithms & Data Structures · Sweep sorted clips tracking the farthest end; a start past it opens a gap.
Algorithms & Data Structures · Start at n components; every successful union merges two into one.
Algorithms & Data Structures · Kahn's algorithm: peel sensors with no pending inputs; leftovers mean a cycle.
Algorithms & Data Structures · The rod-cutting table again, charging for every cut and seeding the whole-rod sale.
Algorithms & Data Structures · Add a piece-count dimension: dp[k][L] builds on dp[k − 1][L − p].
Asked on LeetCode
54 questions · all time
- Number of IslandsmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 100.0
- Course SchedulemediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort+1frequency 79.6
- Course Schedule IImediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sortfrequency 79.6
- Video StitchingmediumArrayDynamic ProgrammingGreedyfrequency 79.6
- Daily TemperaturesmediumArrayStackMonotonic Stackfrequency 78.0
- HeatersmediumArrayTwo PointersBinary SearchSortingfrequency 78.0
- Shortest Word DistanceeasyArrayStringfrequency 78.0
- Group AnagramsmediumArrayHash TableStringSortingfrequency 74.2
- Making A Large IslandhardArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 74.2
- Maximum Number of Visible PointshardArrayMathGeometrySliding Window+1frequency 74.2
- Find Median from Data StreamhardTwo PointersDesignSortingHeap (Priority Queue)+1frequency 72.0
- Search Suggestions SystemmediumArrayStringBinary SearchTrie+2frequency 66.9
- Shortest Word Distance IImediumArrayHash TableTwo PointersString+1frequency 66.9
- Merge IntervalsmediumArraySortingQuicksortfrequency 63.7
- Push DominoesmediumTwo PointersStringDynamic Programmingfrequency 63.7
- Rotting OrangesmediumArrayBreadth-First SearchMatrixfrequency 63.7
- Shortest Path in Binary MatrixmediumArrayBreadth-First SearchMatrixfrequency 63.7
- Brace ExpansionmediumStringBacktrackingStackBreadth-First Search+1frequency 60.0
- Meeting Rooms IImediumArrayTwo PointersGreedySorting+2frequency 60.0
- Merge k Sorted ListshardLinked ListDivide and ConquerHeap (Priority Queue)Merge Sort+1frequency 60.0
- Queries on Number of Points Inside a CirclemediumArrayMathGeometryfrequency 60.0
- Race CarhardDynamic ProgrammingHeuristic SearchA* Searchfrequency 60.0
- Spiral MatrixmediumArrayMatrixSimulationfrequency 60.0
- Time Based Key-Value StoremediumHash TableStringBinary SearchDesignfrequency 60.0
- Evaluate Reverse Polish NotationmediumArrayMathStackfrequency 55.4
- Insert into a Binary Search TreemediumTreeBinary Search TreeBinary Treefrequency 55.4
- Minimum Rounds to Complete All TasksmediumArrayHash TableGreedyCountingfrequency 55.4
- Ransom NoteeasyHash TableStringCountingfrequency 55.4
- String CompressionmediumTwo PointersStringfrequency 55.4
- Accounts MergemediumArrayHash TableStringDepth-First Search+3frequency 49.5
- Balanced Binary TreeeasyTreeDepth-First SearchBinary Treefrequency 49.5
- Binary Tree Inorder TraversaleasyStackTreeDepth-First SearchBinary Treefrequency 49.5
- Buildings With an Ocean ViewmediumArrayStackMonotonic Stackfrequency 49.5
- Find the Duplicate NumbermediumArrayTwo PointersBinary SearchBit Manipulation+2frequency 49.5
- Game of LifemediumArrayMatrixSimulationfrequency 49.5
- Insert into a Sorted Circular Linked ListmediumLinked Listfrequency 49.5
- Longest Cycle in a GraphhardDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort+2frequency 49.5
- MinesweepermediumArrayDepth-First SearchBreadth-First SearchMatrixfrequency 49.5
- Palindromic SubstringsmediumTwo PointersStringDynamic Programmingfrequency 49.5
- Search in Rotated Sorted ArraymediumArrayBinary Searchfrequency 49.5
- Valid ParentheseseasyStringStackBracket Sequencesfrequency 49.5
- Verifying an Alien DictionaryeasyArrayHash TableStringfrequency 49.5
- Word Break IIhardArrayHash TableStringDynamic Programming+3frequency 49.5
- Binary Tree Vertical Order TraversalmediumHash TableTreeDepth-First SearchBreadth-First Search+2frequency 41.3
- House RobbermediumArrayDynamic Programmingfrequency 41.3
- LRU CachemediumHash TableLinked ListDesignDoubly-Linked Listfrequency 41.3
- Minimum Window SubstringhardHash TableStringSliding Windowfrequency 41.3
- Move ZeroeseasyArrayTwo Pointersfrequency 41.3
- Number of Distinct IslandsmediumArrayHash TableDepth-First SearchBreadth-First Search+4frequency 41.3
- Reverse BitseasyDivide and ConquerBit Manipulationfrequency 41.3