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

Uber Placement Papers 2025

Overview

This page is a working set of Uber placement papers from 2025: from student reports questions, the 2025 online assessment pattern, and step-by-step solutions. Use it to see what Uber 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 Uber drive.

Uber Online Assessment 2025 pattern

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

Uber Placement Papers 2025 - actual questions & solutions

This section contains practice questions styled on Uber 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: 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 2: 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 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: 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 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: longest common prefix

Show solution

Problem Statement: Find the longest common prefix string amongst an array of strings.

Example:

Input: ["flower","flow","flight"]
Output: "fl"

Solution (Java):

public String longestCommonPrefix(String[] strs) {
    if (strs.length == 0) return "";
    String pref = strs[0];
    for (int i = 1; i < strs.length; i++) {
        while (!strs[i].startsWith(pref)) {
            pref = pref.substring(0, pref.length() - 1);
            if (pref.isEmpty()) return "";
        }
    }
    return pref;
}

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

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

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

Solution:

TCP is connection-oriented; UDP is connectionless.

Answer: TCP

Question 9

Q9: Worst-case time complexity of quicksort is?

Solution:

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

Answer: O(n²)

Question 10

Q10: Which data structure uses FIFO order?

Solution:

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

Answer: Queue

Question 11

Q11: Which normal form removes transitive dependency?

Solution:

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

Answer: 3NF

Key insights from 2025 Uber Online Assessment

  1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
  2. Transportation Systems Focus: Strong emphasis on transportation systems, surge pricing, route optimization
  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: Uber assessment platform or HackerRank
  6. Focus Areas: Arrays, trees, graphs, dynamic programming, transportation systems, surge pricing
  7. Enhanced Emphasis: Optimal solutions and transportation systems architecture

Uber 2025 interview experiences

Based on recent candidate experiences from 2025 Uber interviews:

2025 Interview Process:

  1. Online Assessment (90 minutes): 2-3 coding problems
  2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions, transportation concepts
  3. Onsite/Virtual Interviews (4-5 rounds, 45-60 minutes each):
  • Coding rounds (2-3): Algorithms, data structures, problem-solving
  • System Design rounds: Transportation systems, surge pricing, route optimization, real-time tracking
  • Behavioral rounds: Problem-solving approach, transportation passion, impact

2025 Interview Trends:

  • Increased emphasis on transportation systems architecture and surge pricing algorithms
  • More focus on optimal solutions and modern transportation technologies
  • Enhanced behavioral questions about innovation and transportation passion
  • Questions about transportation systems and surge pricing applications

Common 2025 Interview Topics:

  • Coding: Arrays, strings, trees, graphs, dynamic programming, surge pricing algorithms
  • System Design: Transportation systems, surge pricing, route optimization, real-time tracking
  • Behavioral: Problem-solving, transportation passion, teamwork, impact
  • Uber Technologies: Transportation systems, surge pricing, route optimization, real-time tracking

Success Tips:

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

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

Preparation tips for Uber 2025 pattern

  1. Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, trees, graphs, DP
  2. Transportation Systems Expertise: Strong understanding of transportation systems, surge pricing, route optimization
  3. Practice Previous Year Papers: Solve Uber 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. Transportation Focus: Practice problems related to transportation systems and surge pricing
  7. System Design Mastery: Learn transportation systems design, surge pricing, route optimization
  8. Uber Technologies: Learn transportation systems, surge pricing, route optimization, real-time tracking
  9. Behavioral Preparation: Prepare examples using STAR format - problem-solving, transportation passion, impact
  10. Mock Tests: Take timed practice tests to improve speed and accuracy

Comments & Suggestions

2024 papers

Coding questions

Interview experience

Preparation guide

Uber hub

Similar companies

Google · Amazon · Microsoft · Ola · Swiggy · Zomato