DP world coding interview
questions, leaked.
7 problems reported across recent DP world interviews. Top patterns: array, sorting, tree. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
DP World's assessment hits you with 7 problems across medium and hard difficulty, no easy gimmes. Arrays dominate the question pool with five appearances, but they're paired with sorting, hashing, binary search, and tree traversal in ways that force you to see the same data structure from multiple angles. You'll face rotting oranges spreading through a matrix, servers handling requests with sliding windows, and tree cameras placed for coverage. If you blank on a pattern mid-assessment, StealthCoder runs invisibly and surfaces a working solution in seconds. The real edge is knowing which topics to drill and which to trust yourself on.
Top problems at DP world
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Set Intersection Size At Least Two | HARD | 100.0 | 45% | Array · Greedy · Sorting |
| 02 | Count Zero Request Servers | MEDIUM | 100.0 | 34% | Array · Hash Table · Sliding Window |
| 03 | Rotting Oranges | MEDIUM | 100.0 | 57% | Array · Breadth-First Search · Matrix |
| 04 | Binary Tree Cameras | HARD | 87.6 | 47% | Dynamic Programming · Tree · Depth-First Search |
| 05 | All Nodes Distance K in Binary Tree | MEDIUM | 87.6 | 66% | Hash Table · Tree · Depth-First Search |
| 06 | Search in Rotated Sorted Array | MEDIUM | 87.6 | 43% | Array · Binary Search |
| 07 | Capacity To Ship Packages Within D Days | MEDIUM | 87.6 | 72% | Array · Binary Search |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual DP world OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code.
Get StealthCoder- array5 · 71%
- sorting2 · 29%
- tree2 · 29%
- depth first search2 · 29%
- binary tree2 · 29%
- hash table2 · 29%
- breadth first search2 · 29%
- binary search2 · 29%
- greedy1 · 14%
- dynamic programming1 · 14%
Array problems form your core study list, but they're never isolated. Every array problem in DP World's assessment demands a secondary skill: sorting, binary search, hashing, or a greedy insight. Sorting appears twice. Binary search, hash tables, and tree-based traversal (DFS and BFS) each show up twice as well. This means you can't just memorize array patterns; you need fluency switching between techniques on the same problem type. Binary Tree and Depth-First Search pair up consistently, especially in the harder problems like Binary Tree Cameras, which combines DFS with dynamic programming. Start with array-plus-sorting and array-plus-binary-search problems because they're foundational. Then move to the tree and search problems. Dynamic programming and greedy appear once each, so they're lower priority unless you already have weak spots there. If you hit a tree camera or matrix-search problem live and your intuition stalls, StealthCoder is your hedge.
Companies with similar patterns
If you prepped for DP world, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass DP world.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code. Works on HackerRank, CodeSignal, CoderPad, and Karat.
DP world interview FAQ
How many array problems should I solve before the DP World assessment?+
Five array problems appear in their assessment. Drill at least 3 to 4 variations pairing arrays with sorting, binary search, or hashing. Since every array problem here has a secondary skill attached, focus on problems that combine techniques rather than pure array manipulation.
Should I study binary search before tree problems for DP World?+
Yes. Two binary search problems appear in their top list (Search in Rotated Sorted Array and Capacity To Ship Packages), and they're medium difficulty. Master those first because binary search is a prerequisite for the harder array problems. Tree problems come next.
Is dynamic programming necessary for DP World's assessment?+
It appears once (Binary Tree Cameras), paired with DFS and binary trees. It's not the main focus, but the problem itself is hard. If you're weak on DP, practice that specific problem. Don't spend a week on DP fundamentals when array plus sorting or binary search will cover more ground.
What's the hardest topic combination in DP World's problems?+
Binary Tree Cameras (hard) combines dynamic programming, tree traversal, and DFS reasoning. Set Intersection Size At Least Two (hard) layers greedy logic with sorting and array manipulation. These two stand out. If you nail tree traversal and greedy, you're ahead.
How much time should I spend on matrix and sliding window problems?+
Matrix and sliding window each appear once in their assessment. They're worth practicing because Rotting Oranges (matrix plus BFS) and Count Zero Request Servers (sliding window plus hashing) test your ability to blend techniques. Don't neglect them, but prioritize the five array problems first.