Dunzo Coding Questions

Overview

Practice Dunzo coding questions in the style candidates report for online assessments and technical interviews. Focus: arrays, strings, hashing, and clean edge cases.

Dunzo coding pattern

Item	Typical expectation
Problems	1-3 coding tasks depending on drive
Skills	arrays, strings, hashing, and clean edge cases
Languages	Java, C++, Python (confirm invite)
Bar	Correctness first, then complexity

Practice problems

Question 1: level order tree traversal

Show approach

Approach: BFS queue.

Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
  // fill logic
}

Complexity: State time/space before coding. Test empty input and single-element cases.

Question 2: detect linked list cycle

Show approach

Approach: Floyd tortoise-hare.

from collections import defaultdict
def solve(arr):
  # fill logic
  return arr

Complexity: State time/space before coding. Test empty input and single-element cases.

Question 3: maximum subarray

Show approach

Approach: Running best ending here.

Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
  // fill logic
}

Complexity: State time/space before coding. Test empty input and single-element cases.

Question 4: clone complexity: explain o vs o

Show approach

Approach: Always state constraints first.

from collections import defaultdict
def solve(arr):
  # fill logic
  return arr

Complexity: State time/space before coding. Test empty input and single-element cases.

Question 5: two sum

Show approach

Approach: Hash map complement lookup.

Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
  // fill logic
}

Complexity: State time/space before coding. Test empty input and single-element cases.

Question 6: valid parentheses

Show approach

Approach: Stack matching.

from collections import defaultdict
def solve(arr):
  # fill logic
  return arr

Complexity: State time/space before coding. Test empty input and single-element cases.

Question 7: merge two sorted arrays/lists

Show approach

Approach: Two pointers.

Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++) {
  // fill logic
}

Complexity: State time/space before coding. Test empty input and single-element cases.

Pattern drill plan (2 weeks)

Day	Drill
Mon	Arrays + hashing (2 problems)
Tue	Two pointers / sliding window
Wed	Stacks / strings
Thu	Trees or graphs basics
Fri	Timed mock (2 problems / 90 min)
Sat	Re-solve Friday misses cold
Sun	Light CS theory + rest

Common coding mistakes

Coding before reading constraints
Passing samples but failing hidden tests
Silent complexity (cannot explain Big-O in interview)
Switching languages mid-prep
Never practicing on the real OA editor style

Comments & Suggestions

Preparation guide

Aptitude / mock quiz

Interview experience

Dunzo hub

Similar companies

Swiggy · Zomato · Ola · Google · Amazon · Microsoft