25 questions · from 7 interviews
Urban Company interview questions
Every question candidates reported from their Urban Company interviews, most frequently asked first. Each links to the write-up it came from, so you can see the round and how it went.
Urban Company coding and DSA questions
- 01
Vehicle Routing Allocation Problem
Given a set of partners and a set of customer time slots for a single day, allocate jobs to partners such that each job is assigned within the partner's working hours. The solution should be implemented in Node.js and TypeScript, and the code generated by an…
- 02
Aggressive Cows
The problem involved finding an optimal solution, initially approached with brute force and then optimized using binary search on the range.
- 03
Sliding Window Problem
A LeetCode medium problem requiring a standard 2-pointer sliding window approach, potentially involving a hashmap. I solved it using 2 pointers and a range query, handling edge cases without hints, resulting in a complex but time-optimized solution.
Medium · From Urban Company | SDE-1 | Interview experience
- 04
Rotting Oranges
Standard LeetCode problem. Given a grid where each cell can be empty (0), a fresh orange (1), or a rotten orange (2). Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten. Determine the minimum time until no fresh…
Medium · From Urban Company On-Campus process (August 2025)
- 05
Course Schedule II
Standard LeetCode problem. There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take…
Medium · From Urban Company On-Campus process (August 2025)
- 06
Palindrome Paths in Binary Grid
Given a 2D array of size N x M. Each cell contains either '0' or '1'. Find the number of paths from cell (0,0) to cell (N-1,M-1), such that the sequence formed by the cells is a Palindrome. Movement is restricted to right or down. Constraints: N, M <= 15.…
- 07
Decode Ways II
A message containing letters from 'A' - 'Z' can be encoded into numbers using the mapping: 'A' - '1', 'B' - '2', ..., 'Z' - '26'. Additionally, the character '' can represent any digit from '1' to '9'. Given an encoded message containing digits and the ''…
Hard · From Urban Company On-Campus process (August 2025)
- 08
Paint House IV
This is likely a variant of the 'Paint House' problem series. While the exact problem statement was not fully provided, these problems generally involve finding the minimum cost to paint a row of houses with specific constraints, such as no two adjacent…
- 09
Hard Greedy Problem
A challenging problem requiring a greedy approach. The candidate was able to solve it and code the solution, but faced issues with the online compiler taking 15 minutes to run test cases. All test cases passed once the compiler was functional.
Hard · From Urban Company 6M + FTE (Rejected)
- 10
Trie-Based Problem
A problem involving trie data structure. The candidate solved it quickly and was able to write the approach and pseudocode on paper within a few minutes.
Medium · From Urban Company 6M + FTE (Rejected)
- 11
Backspace String Combinations
Input string containing [a-z], characters. has two functionalities: 1. backspace keystroke - removes itself and a char of left 2. no keystroke - removes itself. Output all possible string outputs. Example: abc - [ac, abc]
Medium · From Urban Company | Platform Engineer | Sep 2020 [Ghost] | Gurgaon
- 12
Binary Tree Maximum Path Sum
Calculate the maximum path sum in a binary tree.
Hard · From Urban Company | Platform Engineer | Sep 2020 [Ghost] | Gurgaon
- 13
Jump Game
Given an array of non-negative integers nums, you are initially positioned at the first index, and each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index.
Medium · From Urban Company | Platform Engineer | Sep 2020 [Ghost] | Gurgaon
- 14
Jump Game II
Given an array of non-negative integers nums, you are initially positioned at the first index, and each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps.
Medium · From Urban Company | Platform Engineer | Sep 2020 [Ghost] | Gurgaon
- 15
Longest Substring Without Repeating Characters
Given a string s, find the length of the longest substring without repeating characters. The interviewer also asked me to print the string as well.
Medium · From Urban Company | Platform Engineer | Sep 2020 [Ghost] | Gurgaon
Urban Company system design questions
- 01
Membership System Design
Design a membership system, covering aspects such as class design, database schema design, entity relationships, indexing considerations, membership tiers, subscription lifecycle, renewals/upgrades, and handling expiry scenarios.
- 02
User Clickstream Data Pipeline Design
Design a user clickstream data pipeline. Explain how to fetch and store this data, clarify why direct writing to S3 is not feasible, and justify the use of Kafka as an initial data ingestion layer.
- 03
Exposing OLAP Data via API and Real-time Dashboards
Describe your approach to exposing OLAP data through an API for consumption by microservices. Additionally, explain how you would build and expose real-time dashboards based on this data.
- 04
Kafka Architecture and Scalability
Discuss Kafka architecture and how you would handle increased data size and scaling challenges.
- 05
Design a Proctored Exam System
The task was to design an online system for conducting proctored examinations. This involved creating an Entity-Relationship (ER) Diagram to model the database schema and defining the main classes for the system's architecture.
- 06
Machine Coding: Ride Booking Platform
I was asked to implement a basic ride booking platform. The requirements included: Register user and driver. Implement a pricing strategy including factors like surge, car type, distance, etc. The platform needed to show users the price for each car type to…
- 07
LLD: Design a Payment Aggregator
I was tasked with designing a payment aggregator, focusing on an optimal logic to achieve a high success rate of transactions. The interviewer had a specific preference for a callback mechanism instead of an asynchronous call to the payment gateway for…
- 08
Design a URL Shortener
Design a URL shortener system.
From Urban Company | Platform Engineer | Sep 2020 [Ghost] | Gurgaon
- 09
Sort Large File with Limited Memory
Sort a large file with limited memory (e.g., sort 10GB file with 1GB RAM).
From Urban Company | Platform Engineer | Sep 2020 [Ghost] | Gurgaon
Urban Company other questions
- 01
Data Governance Practices
Explain how your company manages Data Governance.
Urban Company interview questions FAQ
What questions are asked in Urban Company interviews?
Candidates reported 25 distinct questions across 7 Urban Company interviews. 15 coding and DSA questions, 9 system design questions, 1 other questions.
How difficult are Urban Company interview questions?
Of the questions candidates rated, 0% were easy, 73% medium and 27% hard.