Skip to content
Placement Papers - Free Placement Papers for Top CompaniesPlacement Papers - Free Placement Papers for Top CompaniesPlacement Papers

Urban Company Placement Papers 2024

Overview

This page collects Urban Company placement papers from 2024 with previous-year questions, solutions, and the 2024 exam pattern. It is useful when you want real drive history: what the OA looked like, which question types repeated, and how solutions were approached. Work through the papers below to build speed and accuracy, then compare against newer 2025 material so your prep matches both established Urban Company patterns and the latest shifts.

Urban Company Online Assessment 2024 pattern

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

Urban Company Placement Papers 2024 - actual questions & solutions

This section contains practice questions styled on Urban Company placement papers 2024 (previous-year 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: reverse a string

Show solution

Problem Statement: Given a string, return it reversed.

Example:

Input: "placement"
Output: "tnemecalp"

Solution (Java):

public String reverse(String s) {
    return new StringBuilder(s).reverse().toString();
}

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

Question 2: check palindrome

Show solution

Problem Statement: Return true if the string reads the same forward and backward (ignore case).

Example:

Input: "Level"
Output: true

Solution (Java):

public boolean isPalindrome(String s) {
    s = s.toLowerCase();
    int i = 0, j = s.length() - 1;
    while (i < j) {
        if (s.charAt(i++) != s.charAt(j--)) return false;
    }
    return true;
}

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

Question 3: merge two sorted lists

Show solution

Problem Statement: Merge two sorted linked lists and return a new sorted list.

Example:

Input: 1→2→4 , 1→3→4
Output: 1→1→2→3→4→4

Solution (Java):

public ListNode mergeTwoLists(ListNode a, ListNode b) {
    ListNode dummy = new ListNode(0), cur = dummy;
    while (a != null && b != null) {
        if (a.val <= b.val) { cur.next = a; a = a.next; }
        else { cur.next = b; b = b.next; }
        cur = cur.next;
    }
    cur.next = (a != null) ? a : b;
    return dummy.next;
}

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

Question 4: valid parentheses

Show solution

Problem Statement: Given a string of brackets, determine if it is valid.

Example:

Input: "()[]{}"
Output: true

Solution (Java):

public boolean isValid(String s) {
    Deque<Character> st = new ArrayDeque<>();
    Map<Character, Character> pair = Map.of(')', '(', ']', '[', '}', '{');
    for (char c : s.toCharArray()) {
        if (pair.containsValue(c)) st.push(c);
        else if (st.isEmpty() || st.pop() != pair.get(c)) return false;
    }
    return st.isEmpty();
}

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

Question 5: 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 6: 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 7: 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 8

Q8: Time complexity of binary search on a sorted array of n elements is?

Solution:

Each step halves the search space → O(log n).

Answer: O(log n)

Question 9

Q9: Which normal form removes transitive dependency?

Solution:

1NF: atomic values. 2NF: no partial dependency. 3NF: no transitive dependency.

Answer: 3NF

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: Worst-case time complexity of quicksort is?

Solution:

Unbalanced partitions (already sorted with bad pivot) → O(n²).

Answer: O(n²)

Key insights from 2024 Urban Company Online Assessment

  1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
  2. Marketplace Focus: Strong emphasis on marketplace 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 systems, service provider matching

Urban Company 2024 interview experiences

Based on candidate experiences from 2024 Urban Company interviews:

2024 Interview Process:

  1. Online Assessment (90 minutes): 2-3 coding problems
  2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions, marketplace concepts
  3. Onsite Interviews (4-5 rounds, 45-60 minutes each):
  • Coding rounds (2-3): Algorithms, data structures, problem-solving
  • System Design rounds: Marketplace platforms, service provider matching, location-based services, booking systems
  • Behavioral rounds: Problem-solving approach, marketplace passion, impact

Common 2024 Interview Topics:

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

Success Tips:

  • Strong coding performance is essential - solve problems optimally
  • Understand marketplace concepts and service provider matching systems
  • Practice system design for marketplace platforms and location-based services
  • 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, visit Urban Company Interview Experience page.

Preparation tips for Urban Company 2024 pattern

  1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, trees, graphs, DP
  2. Marketplace Knowledge: Strong understanding of marketplace systems, service provider matching, location-based services
  3. Practice Previous Year Papers: Solve Urban Company OA papers from 2020-2024 to understand 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 service provider matching
  7. System Design Mastery: Learn marketplace platform design, service provider matching, location-based services
  8. Urban Company Technologies: Learn marketplace platforms, service provider matching, location-based services, booking systems
  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

2025 papers

Coding questions

Interview experience

Preparation guide

Urban Company hub

Similar companies

Swiggy · Zomato · Flipkart · Paytm · Ola · Meesho