Anduril Interview Questions — 32 DSA Problems

28 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Anduril LeetCode questions for software engineering interviews.

• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Maximum Number of Visible Points (HARD) — Array, Math, Geometry, Sliding Window, Sorting
• Video Stitching (MEDIUM) — Array, Dynamic Programming, Greedy
• Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
• Course Schedule (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Shortest Word Distance (EASY) — Array, String
• Heaters (MEDIUM) — Array, Two Pointers, Binary Search, Sorting
• Daily Temperatures (MEDIUM) — Array, Stack, Monotonic Stack
• Course Schedule II (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Find Median from Data Stream (HARD) — Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream
• Search Suggestions System (MEDIUM) — Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue)
• Making A Large Island (HARD) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Merge Intervals (MEDIUM) — Array, Sorting
• Flatten Binary Tree to Linked List (MEDIUM) — Linked List, Stack, Tree, Depth-First Search, Binary Tree
• Shortest Word Distance II (MEDIUM) — Array, Hash Table, Two Pointers, String, Design
• Basic Calculator II (MEDIUM) — Math, String, Stack
• Flip Equivalent Binary Trees (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort
• Valid Parentheses (EASY) — String, Stack
• Number of Distinct Islands (MEDIUM) — Hash Table, Depth-First Search, Breadth-First Search, Union Find, Hash Function
• Rotting Oranges (MEDIUM) — Array, Breadth-First Search, Matrix
• Minesweeper (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Matrix
• Move Zeroes (EASY) — Array, Two Pointers
• Spiral Matrix (MEDIUM) — Array, Matrix, Simulation
• Time Based Key-Value Store (MEDIUM) — Hash Table, String, Binary Search, Design
• Insert into a Sorted Circular Linked List (MEDIUM) — Linked List
• Find the Duplicate Number (MEDIUM) — Array, Two Pointers, Binary Search, Bit Manipulation
• Snakes and Ladders (MEDIUM) — Array, Breadth-First Search, Matrix
• Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
• Game of Life (MEDIUM) — Array, Matrix, Simulation
• Basic Calculator (HARD) — Math, String, Stack, Recursion
• Race Car (HARD) — Dynamic Programming