Problem database last updated: June 20, 2025
7 problems · 0 Easy, 5 Medium, 2 Hard · Ranked #195 of 458
0 Easy
0% · avg 23%
5 Medium
71% · avg 59%
2 Hard
29% · avg 18%
Based on 7 reported problems, DP world interviews are significantly harder than average - 29% Hard vs 18% across all companies. The majority (71%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, DP world puts unusual emphasis on binary-tree (28.6% of problems, 5.8x the industry average), tree (28.6% of problems, 5.1x the industry average), breadth-first-search (28.6% of problems, 3.4x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (71.4%), breadth-first-search (28.6%), hash-table (28.6%), sorting (28.6%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Rotting Oranges You are given an m x n grid where each cell can have one of three values: | Medium | Very Likely | arraybreadth-first-searchmatrix | Solve |
Count Zero Request Servers You are given an integer n denoting the total number of servers and a 2D 0-indexed integer array logs, where logs[i] = [serverid, time] denotes that the server... | Medium | Very Likely | arrayhash-tablesliding-window | Solve |
Set Intersection Size At Least Two You are given a 2D integer array intervals where intervals[i] = [starti, endi] represents all the integers from starti to endi inclusively. | Hard | Very Likely | arraygreedysorting | Solve |
All Nodes Distance K in Binary Tree Given the root of a binary tree, the value of a target node target, and an integer k, return an array of the values of all nodes that have a distance k from the... | Medium | Very Likely | hash-tabletreedepth-first-search | Solve |
Binary Tree Cameras You are given the root of a binary tree. We install cameras on the tree nodes where each camera at a node can monitor its parent, itself, and its immediate chil... | Hard | Very Likely | dynamic-programmingtreedepth-first-search | Solve |
Capacity To Ship Packages Within D Days A conveyor belt has packages that must be shipped from one port to another within days days. | Medium | Very Likely | arraybinary-search | Solve |
Search in Rotated Sorted Array There is an integer array nums sorted in ascending order (with distinct values). | Medium | Very Likely | arraybinary-search | Solve |
Rotting Oranges
SolveYou are given an m x n grid where each cell can have one of three values:
Count Zero Request Servers
SolveYou are given an integer n denoting the total number of servers and a 2D 0-indexed integer array logs, where logs[i] = [serverid, time] denotes that the server...
Set Intersection Size At Least Two
SolveYou are given a 2D integer array intervals where intervals[i] = [starti, endi] represents all the integers from starti to endi inclusively.
All Nodes Distance K in Binary Tree
SolveGiven the root of a binary tree, the value of a target node target, and an integer k, return an array of the values of all nodes that have a distance k from the...
Binary Tree Cameras
SolveYou are given the root of a binary tree. We install cameras on the tree nodes where each camera at a node can monitor its parent, itself, and its immediate chil...
Capacity To Ship Packages Within D Days
SolveA conveyor belt has packages that must be shipped from one port to another within days days.
Search in Rotated Sorted Array
SolveThere is an integer array nums sorted in ascending order (with distinct values).
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent DP world interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
DP world interviews focus heavily on array, breadth-first-search, hash-table problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. DP world interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
DP world has been reported to ask 7 distinct coding problems. The most common topics are array, breadth-first-search, hash-table. 0 are Easy difficulty, 5 are Medium, and 2 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 7 reported problems, DP world interviews are significantly harder than average - 29% Hard vs 18% across all companies. 71% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, breadth-first-search, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real DP world coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a DP world interview with AIarrow_forward
