Urban Company Placement Papers 2025

Overview

This page is a working set of Urban Company placement papers from 2025: from student reports questions, the 2025 online assessment pattern, and step-by-step solutions. Use it to see what Urban Company actually asked in the latest cycle, how hard the rounds were, and which themes (DSA, system design, aptitude, or role-specific topics) mattered most. Practice the problems below under timed conditions, then cross-check with the interview and preparation guides if you are targeting an upcoming Urban Company drive.

2025 Updates

The 2025 Urban Company placement process maintains focus on DSA and system design with enhanced emphasis on marketplace architecture.

Urban Company Online Assessment 2025 pattern

Section	Questions	Time	Difficulty
Coding Problems	2-3	90 min	Medium-Hard

Urban Company Placement Papers 2025 - actual questions & solutions

This section contains practice questions styled on Urban Company placement papers 2025 (recent-cycle pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.

Question 1: two sum

Show solution

Problem Statement: Given an array of integers and a target, return indices of two numbers that add up to target.

Example:

Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1]

Solution (Java):

public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        int need = target - nums[i];
        if (map.containsKey(need)) return new int[]{map.get(need), i};
        map.put(nums[i], i);
    }
    return new int[]{};
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 2: detect cycle in linked list

Show solution

Problem Statement: Return true if the linked list has a cycle.

Example:

Input: 3→2→0→-4→(back to 2)
Output: true

Solution (Java):

public boolean hasCycle(ListNode head) {
    ListNode slow = head, fast = head;
    while (fast != null && fast.next != null) {
        slow = slow.next;
        fast = fast.next.next;
        if (slow == fast) return true;
    }
    return false;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 3: maximum subarray sum

Show solution

Problem Statement: Find the contiguous subarray with the largest sum.

Example:

Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4]
Output: 6  // [4, -1, 2, 1]

Solution (Java):

public int maxSubArray(int[] nums) {
    int best = nums[0], cur = nums[0];
    for (int i = 1; i < nums.length; i++) {
        cur = Math.max(nums[i], cur + nums[i]);
        best = Math.max(best, cur);
    }
    return best;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 4: rotate array right by k

Show solution

Problem Statement: Rotate the array to the right by k steps.

Example:

Input: [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]

Solution (Java):

public void rotate(int[] nums, int k) {
    k %= nums.length;
    reverse(nums, 0, nums.length - 1);
    reverse(nums, 0, k - 1);
    reverse(nums, k, nums.length - 1);
}
void reverse(int[] a, int l, int r) {
    while (l < r) { int t = a[l]; a[l++] = a[r]; a[r--] = t; }
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 5: climbing stairs

Show solution

Problem Statement: You can climb 1 or 2 steps. How many distinct ways to climb n stairs?

Example:

Input: n = 4
Output: 5

Solution (Java):

public int climbStairs(int n) {
    if (n <= 2) return n;
    int a = 1, b = 2;
    for (int i = 3; i <= n; i++) {
        int c = a + b; a = b; b = c;
    }
    return b;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 6: first non-repeating character

Show solution

Problem Statement: Return the first non-repeating character in a string, or ‘_’ if none.

Example:

Input: "swiss"
Output: 'w'

Solution (Java):

public char firstUnique(String s) {
    int[] freq = new int[256];
    for (char c : s.toCharArray()) freq[c]++;
    for (char c : s.toCharArray()) if (freq[c] == 1) return c;
    return '_';
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 7: binary tree level order

Show solution

Problem Statement: Return the level-order traversal of a binary tree.

Example:

Input: [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]

Solution (Java):

public List<List<Integer>> levelOrder(TreeNode root) {
    List<List<Integer>> res = new ArrayList<>();
    if (root == null) return res;
    Queue<TreeNode> q = new ArrayDeque<>();
    q.add(root);
    while (!q.isEmpty()) {
        int sz = q.size();
        List<Integer> level = new ArrayList<>();
        for (int i = 0; i < sz; i++) {
            TreeNode n = q.poll();
            level.add(n.val);
            if (n.left != null) q.add(n.left);
            if (n.right != null) q.add(n.right);
        }
        res.add(level);
    }
    return res;
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 8

Q8: Virtual memory is typically implemented using?

Solution:

OS uses demand paging (and sometimes segmentation) to implement virtual memory.

Answer: Demand paging

Question 9

Q9: Which data structure uses FIFO order?

Solution:

FIFO = First In First Out → Queue. Stack is LIFO.

Answer: Queue

Question 10

Q10: Which protocol is connection-oriented at the transport layer?

Solution:

TCP is connection-oriented; UDP is connectionless.

Answer: TCP

Question 11

Q11: In OOP, hiding internal details and showing only essential features is called?

Solution:

This is the definition of Encapsulation (often paired with abstraction in interviews).

Answer: Encapsulation

Key insights from 2025 Urban Company Online Assessment

1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
2. Marketplace Architecture Focus: Strong emphasis on marketplace systems, booking systems, service provider matching, location-based services
3. Time Management: 2-3 problems in 90 minutes requires excellent speed and accuracy
4. Success Rate: Only 10-15% cleared OA and advanced to interviews
5. Platform: Urban Company assessment platform or HackerRank
6. Focus Areas: Arrays, trees, graphs, dynamic programming, marketplace architecture, booking systems
7. Enhanced Emphasis: Optimal solutions, marketplace architecture, and booking system design

Urban Company 2025 interview experiences

Based on recent candidate experiences from 2025 Urban Company interviews:

2025 Interview Process:

1. Online Assessment (90 minutes): 2-3 coding problems
2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions, marketplace concepts, booking systems
3. Onsite/Virtual Interviews (4-5 rounds, 45-60 minutes each):

• Coding rounds (2-3): Algorithms, data structures, problem-solving
• System Design rounds: Marketplace architecture, booking systems, service provider matching, location-based services
• Behavioral rounds: Problem-solving approach, marketplace passion, impact

2025 Interview Trends:

• Increased emphasis on marketplace architecture and booking system design
• More focus on optimal solutions and modern marketplace technologies
• Enhanced behavioral questions about innovation and marketplace passion
• Questions about marketplace architecture and booking systems

Common 2025 Interview Topics:

• Coding: Arrays, strings, trees, graphs, dynamic programming, booking system algorithms
• System Design: Marketplace architecture, booking systems, service provider matching, location-based services
• Behavioral: Problem-solving, marketplace passion, teamwork, impact
• Urban Company Technologies: Marketplace architecture, booking systems, service provider matching, location-based services

Success Tips:

• Strong coding performance is essential - solve problems optimally
• Understand marketplace concepts, booking systems, and marketplace architecture
• Practice system design for marketplace architecture and booking systems
• Prepare examples demonstrating problem-solving and marketplace passion
• Learn Urban Company’s products and marketplace technologies
• Practice explaining your thought process clearly

For detailed interview experiences from 2025, visit Urban Company Interview Experience page.

Preparation tips for Urban Company 2025 pattern

1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, trees, graphs, DP
2. Marketplace Architecture Expertise: Strong understanding of marketplace architecture, booking systems, service provider matching
3. Practice Previous Year Papers: Solve Urban Company OA papers from 2020-2025 to understand evolving patterns
4. Time Management: Practice completing 2-3 coding problems in 90 minutes
5. LeetCode Practice: Solve 200+ LeetCode problems focusing on arrays, strings, trees, graphs (medium-hard difficulty)
6. Marketplace Focus: Practice problems related to marketplace systems and booking systems
7. System Design Mastery: Learn marketplace architecture design, booking systems, service provider matching
8. Urban Company Technologies: Learn marketplace architecture, booking systems, service provider matching, location-based services
9. Behavioral Preparation: Prepare examples using STAR format - problem-solving, marketplace passion, impact
10. Mock Tests: Take timed practice tests to improve speed and accuracy

Comments & Suggestions

Related resources

2024 papers→

Coding questions→

Interview experience→

Preparation guide→

Urban Company hub→

Similar companies

Swiggy · Zomato · Flipkart · Paytm · Ola · Meesho