Dropbox Coding Interview Questions
28 Dropbox coding interview problems with full optimal solutions — 16 easy, 10 medium, 2 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Dropbox interviewer values, and a FAQ section.
Showing 10 problems of 28
- #16mediumfoundational
16. LRU Cache
Design a fixed-capacity cache that evicts the least-recently-used entry — Dropbox's sync engine relies on this exact policy to keep hot file metadata in memory without blowing heap budgets.
- #18mediumfoundational
18. Number of Islands
Count distinct connected regions in a binary grid — Dropbox draws on this pattern when resolving which file clusters have been independently modified across disconnected clients during a conflict sweep.
- #19mediumfoundational
19. Meeting Rooms II
Find the minimum number of conference rooms needed for a set of meetings — Dropbox maps this directly to how many concurrent file-version locks the sync layer must hold at peak conflict time.
- #20mediumfoundational
20. Implement Trie (Prefix Tree)
Build a prefix tree that supports insert, search, and startsWith — Dropbox uses a trie variant to power instant path-autocomplete in the desktop client as you type a destination folder.
- #23mediumfoundational
23. Find All Anagrams in a String
Find every start index where a permutation of a pattern appears in a string — Dropbox applies the sliding-window frequency technique when scanning file content for duplicate chunks during deduplication.
- #24mediumfoundational
24. Longest Increasing Subsequence
Find the length of the longest strictly increasing subsequence — Dropbox uses a variant of this algorithm when identifying the longest sequence of non-conflicting file versions to establish a clean merge baseline.
- #25mediumfoundational
25. Flatten Nested List Iterator
Build a lazy iterator that traverses a recursive list structure depth-first — Dropbox engineers recognize this pattern immediately as a model for walking a nested folder hierarchy without loading all entries into memory at once.
- #26mediumfoundational
26. Group Anagrams
Cluster strings that are anagrams of each other into groups — Dropbox applies content-addressable hashing for the same reason: two files with identical byte-frequency fingerprints are dedup candidates regardless of filename.
- #27mediumfoundational
27. Word Search
Determine whether a word exists by tracing adjacent cells in a 2D grid — Dropbox maps this to path-finding in a file-system graph where each directory is a cell and you must navigate without revisiting a node.
- #28mediumfoundational
28. Top K Frequent Elements
Return the k most frequently occurring integers from an array — Dropbox uses frequency ranking to surface the most-accessed file types in a user's account, driving smart sync-priority decisions.