Dropbox Interview Questions — 25 DSA Problems

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

Most frequently asked Dropbox LeetCode questions for software engineering interviews.

• Simple Bank System (MEDIUM) — Array, Hash Table, Design, Simulation
• Find Duplicate File in System (MEDIUM) — Array, Hash Table, String
• Game of Life (MEDIUM) — Array, Matrix, Simulation
• Web Crawler (MEDIUM) — String, Depth-First Search, Breadth-First Search, Interactive
• Web Crawler Multithreaded (MEDIUM) — Depth-First Search, Breadth-First Search, Concurrency
• Word Pattern II (MEDIUM) — Hash Table, String, Backtracking
• Minimize Malware Spread II (HARD) — Array, Hash Table, Depth-First Search, Breadth-First Search, Union Find, Graph
• Minimize Malware Spread (HARD) — Array, Hash Table, Depth-First Search, Breadth-First Search, Union Find, Graph
• Seat Reservation Manager (MEDIUM) — Design, Heap (Priority Queue)
• Design Hit Counter (MEDIUM) — Array, Binary Search, Design, Queue, Data Stream
• Check If It Is a Good Array (HARD) — Array, Math, Number Theory
• Design a Text Editor (HARD) — Linked List, String, Stack, Design, Simulation, Doubly-Linked List
• Two Sum (EASY) — Array, Hash Table
• Median of Two Sorted Arrays (HARD) — Array, Binary Search, Divide and Conquer
• Word Pattern (EASY) — Hash Table, String
• Number of Valid Words for Each Puzzle (HARD) — Array, Hash Table, String, Bit Manipulation, Trie
• Word Break II (HARD) — Array, Hash Table, String, Dynamic Programming, Backtracking, Trie, Memoization
• Grid Illumination (HARD) — Array, Hash Table
• Letter Combinations of a Phone Number (MEDIUM) — Hash Table, String, Backtracking
• Max Area of Island (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Guess the Word (HARD) — Array, Math, String, Interactive, Game Theory
• Top K Frequent Elements (MEDIUM) — Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect
• Merge Intervals (MEDIUM) — Array, Sorting
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Number of Islands II (HARD) — Array, Hash Table, Union Find