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

Dunzo Placement Papers 2024

Overview

This page collects Dunzo 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 Dunzo patterns and the latest shifts.

Dunzo Online Assessment 2024 pattern

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

Dunzo Placement Papers 2024 - actual questions & solutions

This section contains practice questions styled on Dunzo 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: 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 2: 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 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: 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 5: 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 6: 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 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: 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: 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

Question 10

Q10: Which data structure uses FIFO order?

Solution:

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

Answer: Queue

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 Dunzo Online Assessment

  1. Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
  2. Logistics Focus: Strong emphasis on logistics systems, route optimization, delivery management
  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: Dunzo assessment platform or HackerRank
  6. Focus Areas: Arrays, trees, graphs, dynamic programming, logistics systems, route optimization

Dunzo 2024 interview experiences

Based on candidate experiences from 2024 Dunzo interviews:

2024 Interview Process:

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

Common 2024 Interview Topics:

  • Coding: Arrays, strings, trees, graphs, dynamic programming, route optimization algorithms
  • System Design: Logistics platforms, route optimization, delivery management, real-time tracking
  • Behavioral: Problem-solving, logistics passion, teamwork, impact
  • Dunzo Technologies: Logistics platforms, route optimization, delivery management, real-time tracking

2024 Interview Questions Examples:

  • Delivery Route Optimization
  • Design Dunzo’s logistics platform (System Design)
  • Design Dunzo’s route optimization system (System Design)
  • Logistics and delivery algorithms

Success Tips:

  • Strong coding performance is essential - solve problems optimally
  • Understand logistics concepts and route optimization systems
  • Practice system design for logistics platforms and route optimization
  • Prepare examples demonstrating problem-solving and logistics passion
  • Learn Dunzo’s products and logistics technologies
  • Practice explaining your thought process clearly

For detailed interview experiences, visit Dunzo Interview Experience page.

Preparation tips for Dunzo 2024 pattern

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

Comments & Suggestions

2025 papers

Coding questions

Interview experience

Preparation guide

Dunzo hub

Similar companies

Swiggy · Zomato · Ola · Google · Amazon · Microsoft