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

Delhivery coding questions

Overview

Section titled “Overview”

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

Delhivery Coding Pattern (Candidate-Reported)

Section titled “Delhivery Coding Pattern (Candidate-Reported)”
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

Section titled “Practice Problems”

Question 1: Maximum subarray (Kadane)

Section titled “Question 1: Maximum subarray (Kadane)”
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 2: Clone complexity: explain O(n) vs O(n^2)

Section titled “Question 2: Clone complexity: explain O(n) vs O(n^2)”
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 3: Two Sum

Section titled “Question 3: 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 4: Valid parentheses

Section titled “Question 4: 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 5: Merge two sorted arrays/lists

Section titled “Question 5: 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.

Question 6: Binary search on sorted array

Section titled “Question 6: Binary search on sorted array”
Show approach

Approach: Lo/hi mid carefully.

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: Level order tree traversal

Section titled “Question 7: 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.

Pattern Drill Plan (2 Weeks)

Section titled “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

Section titled “Common Coding Mistakes”
  1. Coding before reading constraints
  2. Passing samples but failing hidden tests
  3. Silent complexity (cannot explain Big-O in interview)
  4. Switching languages mid-prep
  5. Never practicing on the real OA editor style
Section titled “Related Resources”

Similar Companies

Section titled “Similar Companies”

Swiggy · Flipkart · Amazon · Blinkit · Zomato · Paytm