How Dropbox Interviews in 2026: Process, Questions & What They Score

• Find all duplicate files in a file system given a list of directory paths, then rewrite your solution to use fewer operations.The single most repeated Dropbox coding prompt across independent sources. Expect the follow-up asking you to reduce I/O or hashing work.
• Given a specific application, implement an LRU cache for it.Tests O(1) get and put design using a hash map paired with a doubly linked list for eviction order.
• Write a web crawler that finds the links from all the pages it crawls. Can you make it multithreaded?Concurrency shows up often at Dropbox; be ready to discuss thread pools, visited-set synchronization and shutdown.
• Program an in-memory database with four layers of successive requirements.This is the archetype of the Dropbox CodeSignal format: one problem that grows across subtasks.
• Implement a simple, in-memory file sharing system with basic CRUD features.Tests API and data modeling for create, read, update and delete operations with no persistence layer.
• Design an in-memory file system.Tests hierarchical tree design for directories and files, including path traversal and lookup.
• Write a program to allocate and release IDs, then make it more space-efficient.Tests space-efficient ID pooling, typically via a bitset or free-list to reuse released IDs.
• Design a hit counter.Tests a sliding time-window counter built with a queue or circular buffer.
• Solve Word Pattern II.Tests backtracking to find a bijective mapping between pattern characters and substrings.
• Design a text editor.Tests data structure choice, such as a gap buffer or rope, for efficient cursor edits.
• Solve Minimum Window Substring.Tests a sliding window with a frequency map to find the smallest matching substring.
• Maximize profit from stock trading under given buy and sell constraints.Tests dynamic programming for optimal buy and sell timing under a one-share-per-day limit.
• Implement Conway's Game of Life.Tests in-place 2D grid simulation without corrupting neighbor counts mid-update.
• Solve Number of Valid Words for Each Puzzle.Tests bitmask encoding of letter sets to match words against puzzle constraints quickly.
• Solve Minimize Malware Spread.Listed in two variants; union find is the expected tool.
• Implement a simple bank system.Tests OOP account modeling with correct handling of concurrent transactions.
• Return the K largest elements from a stream of numbers.Tests using a fixed-size min-heap to track the largest values in a stream.
• Write a Sudoku solver.Tests backtracking with constraint checks across rows, columns and 3x3 subgrids.

Reported problems, listed so you know what to expect. Practice them in your own editor or on the platform you prefer; SupaCV's practice mode coaches how you talk through them.

• Design Dropbox.Yes, they ask you to design their own product. Focus on sync, chunking, dedup, metadata and conflict resolution.
• Design a cloud file-sharing service.Tests storage architecture covering chunking, metadata, permissions and share links.
• Design a notification broadcasting system.Tests fan-out delivery design and queuing for scaling to many simultaneous recipients.
• Design a recommender system feature for Dropbox that suggests files to users.Tests choice of signals and ranking approach for surfacing relevant files to a user.
• Design an API.Tests resource modeling, versioning and error handling choices for a public API.
• Design an image tagging and search system.Tests indexing and retrieval design for tag-based search across a large image set.
• Design a scheduler service with minimal latency.Tests low-latency task scheduling design, such as a priority queue or timing wheel.
• Design an IP blocking system.Tests rule matching and lookup performance for range- or location-based IP filtering.

Reported problems, listed so you know what to expect. Practice them in your own editor or on the platform you prefer; SupaCV's practice mode coaches how you talk through them.

• Tell me about yourself.
• Talk about a notable project you worked on. What was the reach of your impact on this project?
• Describe a time you had a conflict on a team, how you resolved it, and what you learned.
• Tell me about a time you disagreed with a project decision. How did you handle it?
• What was a time you brought up constructive criticism? How did it go?
• Explain a technical challenge you overcame.
• Give an example of a time you troubleshot a critical software issue.
• Share an example of solving a problem in an innovative way.
• Describe a time you had to learn a new programming language for a project.
• Tell me about a time you developed a feature based on user feedback.
• Tell me about a time you collaborated with a team to solve a difficult problem.
• Tell me about a time you maintained quality under pressure or a tight deadline.
• Tell me about a time you worked with ambiguous requirements.
• Tell me about a time you mentored someone.

• Why do you want to work at Dropbox, and what is your understanding of Dropbox's value proposition?
• What do you do in your current role, and why are you looking for a new job?
• What are you looking for in your next role?
• What drives you? What are you passionate about?
• What are your salary and equity expectations?

Dropbox's process has 11 stages, in order: Application and resume review, Recruiter screen, Online assessment or technical screen (CodeSignal), Hiring manager screen, Virtual onsite loop, Onsite: coding and debugging rounds, Onsite: system design round, Onsite: project deep dive, Onsite: behavioral / all-around round, Final review, decision and offer, Total end-to-end.

Dropbox evaluates candidates against Dropbox core values: Be worthy of trust, They win, we win, Keep it simple, Own it, Make work human.

Dropbox's question bank spans 4 categories: Coding; System design; Behavioral; Recruiter screen and motivation.

This playbook is medium confidence, compiled from 12 public sources, and last verified September 6, 2026. It describes one well-documented shape of Dropbox's interviews, not a guarantee of what any individual loop will look like.