Urban Company coding interview
questions, leaked.
5 problems reported across recent Urban Company interviews. Top patterns: array, binary search, depth first search. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Urban Company's coding assessment is small but dense. Five problems total, split between medium and hard difficulty, means every question tests depth over breadth. Arrays appear in all of them. Binary search, graph traversal (DFS/BFS), and union-find show up repeatedly, often combined. You're not grinding a hundred problems here. You're nailing pattern recognition on a tight set. If you hit a wall during the live assessment, StealthCoder runs invisibly and surfaces a working solution in seconds, screen-share resistant.
Top problems at Urban Company
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Maximum Profit in Job Scheduling | HARD | 100.0 | 54% | Array · Binary Search · Dynamic Programming |
| 02 | Surrounded Regions | MEDIUM | 92.3 | 43% | Array · Depth-First Search · Breadth-First Search |
| 03 | Number of Islands | MEDIUM | 92.3 | 62% | Array · Depth-First Search · Breadth-First Search |
| 04 | Search in Rotated Sorted Array | MEDIUM | 81.3 | 43% | Array · Binary Search |
| 05 | Candy | HARD | 81.3 | 47% | Array · Greedy |
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 Urban Company OA. The proctor cannot see it. Screen share cannot detect it. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too.
Get StealthCoder- array5 · 100%
- binary search2 · 40%
- depth first search2 · 40%
- breadth first search2 · 40%
- union find2 · 40%
- matrix2 · 40%
- dynamic programming1 · 20%
- sorting1 · 20%
- greedy1 · 20%
The array topic dominates because it's the foundation for everything else on this list. Maximum Profit in Job Scheduling and Candy both require array manipulation plus secondary logic (DP, greedy). Surrounded Regions and Number of Islands look like graph problems but are array-based first. Binary search appears in two hard problems and pairs with DP or array iteration. DFS, BFS, and union-find cluster around the same two medium problems, meaning you need to see that island/region pattern and recognize all three solve it. The hard problems (Job Scheduling, Candy) test whether you can chain concepts. Drill arrays and binary search first. Then spend time on Surrounded Regions and Number of Islands because they teach you to switch between traversal methods on the same structure. StealthCoder is your hedge if you blank on the graph setup mid-OA.
Companies with similar patterns
If you prepped for Urban Company, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Urban Company.
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. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Urban Company interview FAQ
How many array problems should I solve before the Urban Company assessment?+
All five of their reported problems touch arrays, so treat it as the core. You don't need to solve hundreds of array problems, but you need to be comfortable with iteration, modification, and indexing under pressure. Focus on the five they actually ask plus 3 to 5 similar ones to build speed.
Is binary search required for this role?+
Yes. It appears in two of their five problems and pairs with either DP or array search. Maximum Profit in Job Scheduling uses it to find scheduling boundaries. Search in Rotated Sorted Array is a direct binary search test. You can't skip it.
Should I study DFS and BFS separately or together?+
Together, in the context of Surrounded Regions and Number of Islands. Both problems can be solved with either method. Studying them in parallel teaches you when to pick one over the other. Union-find solves both too, so after DFS/BFS, add union-find to your arsenal for that same set.
What's the hardest thing about their hard problems?+
Combining two or three patterns. Maximum Profit in Job Scheduling needs you to sort, then binary search, then DP. Candy requires greedy thinking plus array passes. Neither is one-liner. Plan 20 to 30 minutes per hard problem during prep.
Do I need to memorize sorting algorithms?+
No, but understand when to sort. Maximum Profit in Job Scheduling sorts by time to enable binary search. Know your language's built-in sort and when sorting unlocks the next step. One problem out of five explicitly lists sorting, so it's supporting logic, not the main skill.