Anduril LeetCode Questions
55 questions all-time · 8 easy · 40 medium · 7 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 100 | 0.6% |
| 2 | Course Schedule II Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 82 | 0.6% |
| 3 | Video Stitching Array, Dynamic Programming, Greedy | Medium | 82 | 0.5% |
| 4 | Heaters Array, Two Pointers, Binary Search, Sorting | Medium | 81 | 0.4% |
| 5 | Daily Temperatures Array, Stack, Monotonic Stack | Medium | 81 | 0.7% |
| 6 | Shortest Word Distance Array, String | Easy | 81 | 0.7% |
| 7 | Course Schedule Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 81 | 0.5% |
| 8 | Maximum Number of Visible Points Array, Math, Geometry, Sliding Window, Sorting | Hard | 77 | 0.4% |
| 9 | Making A Large Island Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Hard | 77 | 0.6% |
| 10 | Group Anagrams Array, Hash Table, String, Sorting | Medium | 75 | 0.7% |
| 11 | Search Suggestions System Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue) | Medium | 75 | 0.7% |
| 12 | Find Median from Data Stream Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream | Hard | 75 | 0.5% |
| 13 | Shortest Word Distance II Array, Hash Table, Two Pointers, String, Design | Medium | 69 | 0.6% |
| 14 | Merge Intervals Array, Sorting | Medium | 66 | 0.5% |
| 15 | Spiral Matrix Array, Matrix, Simulation | Medium | 62 | 0.6% |
| 16 | Merge k Sorted Lists Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort | Hard | 62 | 0.6% |
| 17 | Rotting Oranges Array, Breadth-First Search, Matrix | Medium | 62 | 0.6% |
| 18 | Race Car Dynamic Programming | Hard | 62 | 0.4% |
| 19 | Queries on Number of Points Inside a Circle Array, Math, Geometry | Medium | 62 | 0.9% |
| 20 | Time Based Key-Value Store Hash Table, String, Binary Search, Design | Medium | 58 | 0.5% |
| 21 | String Compression Two Pointers, String | Medium | 58 | 0.6% |
| 22 | Meeting Rooms II Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum | Medium | 58 | 0.5% |
| 23 | Minimum Rounds to Complete All Tasks Array, Hash Table, Greedy, Counting | Medium | 58 | 0.6% |
| 24 | Shortest Path in Binary Matrix Array, Breadth-First Search, Matrix | Medium | 58 | 0.5% |
| 25 | Push Dominoes Two Pointers, String, Dynamic Programming | Medium | 58 | 0.6% |
| 26 | Ransom Note Hash Table, String, Counting | Easy | 58 | 0.7% |
| 27 | Game of Life Array, Matrix, Simulation | Medium | 52 | 0.7% |
| 28 | Snakes and Ladders Array, Breadth-First Search, Matrix | Medium | 52 | 0.5% |
| 29 | Find the Duplicate Number Array, Two Pointers, Binary Search, Bit Manipulation | Medium | 52 | 0.6% |
| 30 | Insert into a Sorted Circular Linked List Linked List | Medium | 52 | 0.4% |
| 31 | Minesweeper Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 52 | 0.7% |
| 32 | Valid Parentheses String, Stack | Easy | 52 | 0.4% |
| 33 | Evaluate Reverse Polish Notation Array, Math, Stack | Medium | 52 | 0.6% |
| 34 | Accounts Merge Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find, Sorting | Medium | 52 | 0.6% |
| 35 | Palindromic Substrings Two Pointers, String, Dynamic Programming | Medium | 52 | 0.7% |
| 36 | Verifying an Alien Dictionary Array, Hash Table, String | Easy | 52 | 0.6% |
| 37 | Word Break II Array, Hash Table, String, Dynamic Programming, Backtracking, Trie, Memoization | Hard | 52 | 0.6% |
| 38 | Insert into a Binary Search Tree Tree, Binary Search Tree, Binary Tree | Medium | 52 | 0.7% |
| 39 | Buildings With an Ocean View Array, Stack, Monotonic Stack | Medium | 52 | 0.8% |
| 40 | Brace Expansion String, Backtracking, Stack, Breadth-First Search, Sorting | Medium | 52 | 0.7% |
| 41 | Flip Equivalent Binary Trees Tree, Depth-First Search, Binary Tree | Medium | 43 | 0.7% |
| 42 | Flatten Binary Tree to Linked List Linked List, Stack, Tree, Depth-First Search, Binary Tree | Medium | 43 | 0.7% |
| 43 | Search in Rotated Sorted Array Array, Binary Search | Medium | 43 | 0.5% |
| 44 | Move Zeroes Array, Two Pointers | Easy | 43 | 0.6% |
| 45 | Number of Distinct Islands Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Sorting, Matrix, Hash Function | Medium | 43 | 0.6% |
| 46 | Two Sum Array, Hash Table | Easy | 43 | 0.6% |
| 47 | Max Area of Island Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 43 | 0.7% |
| 48 | Binary Tree Vertical Order Traversal Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree | Medium | 43 | 0.6% |
| 49 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 43 | 0.5% |
| 50 | Rotate Image Array, Math, Matrix | Medium | 43 | 0.8% |
| 51 | Surrounded Regions Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 43 | 0.5% |
| 52 | House Robber Array, Dynamic Programming | Medium | 43 | 0.5% |
| 53 | Balanced Binary Tree Tree, Depth-First Search, Binary Tree | Easy | 43 | 0.6% |
| 54 | Binary Tree Inorder Traversal Stack, Tree, Depth-First Search, Binary Tree | Easy | 43 | 0.8% |
| 55 | Minimum Window Substring Hash Table, String, Sliding Window | Hard | 43 | 0.5% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.