How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent DRW interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
D
DRW Coding Interview Questions
5 problems · 1 Easy, 4 Medium, 0 Hard · Ranked #247 of 458
Difficulty breakdown
1 Easy
20% · avg 23%
4 Medium
80% · avg 59%
0 Hard
0% · avg 18%
Top topics
graph
60%20.2x
depth-first-search
40%4.4x
breadth-first-search
40%4.8x
array
20%
dynamic-programming
20%
string
20%
Interview profile
Based on 5 reported problems, DRW interviews are easier than average - only 0% Hard compared to 18% across all companies. The majority (80%) 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, DRW puts unusual emphasis on graph (60% of problems, 20.2x the industry average), breadth-first-search (40% of problems, 4.8x the industry average), depth-first-search (40% of problems, 4.4x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are graph (60%), depth-first-search (40%), breadth-first-search (40%), array (20%). Problems below are sorted by frequency, the ones at the top are asked most often.
All 5 problems
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. | Easy | Very Likely | arraydynamic-programming | Solve |
Remove Duplicate Letters Given a string s, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicographical or... | Medium | Likely | stringstackgreedy | Solve |
Minimum Fuel Cost to Report to the Capital There is a tree (i.e., a connected, undirected graph with no cycles) structure country network consisting of n cities numbered from 0 to n - 1 and exactly n - 1... | Medium | Likely | treedepth-first-searchbreadth-first-search | Solve |
Reorder Routes to Make All Paths Lead to the City Zero There are n cities numbered from 0 to n - 1 and n - 1 roads such that there is only one way to travel between two different cities (this network form a tree). L... | Medium | Likely | depth-first-searchbreadth-first-searchgraph | Solve |
Maximal Network Rank There is an infrastructure of n cities with some number of roads connecting these cities. Each roads[i] = [ai, bi] indicates that there is a bidirectional road... | Medium | Likely | graph | Solve |
Best Time to Buy and Sell Stock
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
EasyVery Likely
arraydynamic-programming
Remove Duplicate Letters
SolveGiven a string s, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicographical or...
MediumLikely
stringstackgreedy
Minimum Fuel Cost to Report to the Capital
SolveThere is a tree (i.e., a connected, undirected graph with no cycles) structure country network consisting of n cities numbered from 0 to n - 1 and exactly n - 1...
MediumLikely
treedepth-first-searchbreadth-first-search
Reorder Routes to Make All Paths Lead to the City Zero
SolveThere are n cities numbered from 0 to n - 1 and n - 1 roads such that there is only one way to travel between two different cities (this network form a tree). L...
MediumLikely
depth-first-searchbreadth-first-searchgraph
Maximal Network Rank
SolveThere is an infrastructure of n cities with some number of roads connecting these cities. Each roads[i] = [ai, bi] indicates that there is a bidirectional road...
MediumLikely
graph
Preparing for your DRW coding interview
DRW interviews focus heavily on graph, depth-first-search, breadth-first-search 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. DRW 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.
Frequently Asked Questions
What coding problems does DRW ask in interviews?add
DRW has been reported to ask 5 distinct coding problems. The most common topics are graph, depth-first-search, breadth-first-search. 1 are Easy difficulty, 4 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
How hard are DRW coding interviews?add
Based on 5 reported problems, DRW interviews are easier than average - only 0% Hard compared to 18% across all companies. 80% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
How should I prepare for a DRW coding interview?add
Start with the highest-frequency problems listed on this page. Focus on the core topics: graph, depth-first-search, breadth-first-search. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Other companies to explore
Ready to ace your DRW interview?
Simulate a real DRW coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a DRW interview with AIarrow_forward