Problem database last updated: June 20, 2025
5 problems · 0 Easy, 3 Medium, 2 Hard · Ranked #250 of 458
0 Easy
0% · avg 23%
3 Medium
60% · avg 59%
2 Hard
40% · avg 18%
Based on 5 reported problems, Urban Company interviews are significantly harder than average - 40% Hard vs 18% across all companies. The majority (60%) 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, Urban Company puts unusual emphasis on union-find (40% of problems, 13.6x the industry average), breadth-first-search (40% of problems, 4.8x the industry average), binary-search (40% of problems, 4.5x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (100%), binary-search (40%), depth-first-search (40%), breadth-first-search (40%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Maximum Profit in Job Scheduling We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. | Hard | Very Likely | arraybinary-searchdynamic-programming | Solve |
Number of Islands Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. | Medium | Very Likely | arraydepth-first-searchbreadth-first-search | Solve |
Surrounded Regions You are given an m x n matrix board containing letters 'X' and 'O', capture regions that are surrounded: | Medium | Very Likely | arraydepth-first-searchbreadth-first-search | Solve |
Candy There are n children standing in a line. Each child is assigned a rating value given in the integer array ratings. | Hard | Very Likely | arraygreedy | 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 |
Maximum Profit in Job Scheduling
SolveWe have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i].
Number of Islands
SolveGiven an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.
Surrounded Regions
SolveYou are given an m x n matrix board containing letters 'X' and 'O', capture regions that are surrounded:
Candy
SolveThere are n children standing in a line. Each child is assigned a rating value given in the integer array ratings.
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 Urban Company interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Urban Company interviews focus heavily on array, binary-search, depth-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. Urban Company 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.
Urban Company has been reported to ask 5 distinct coding problems. The most common topics are array, binary-search, depth-first-search. 0 are Easy difficulty, 3 are Medium, and 2 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 5 reported problems, Urban Company interviews are significantly harder than average - 40% Hard vs 18% across all companies. 60% 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, binary-search, depth-first-search. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Urban Company coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Urban Company interview with AIarrow_forward
