Delhivery 2026 aptitude
Quantitative, reasoning, and verbal drills with solutions
Delhivery 2026 Pattern Details
Overview
This page collects Delhivery placement papers from 2026 with practice questions, worked solutions, and the exam pattern students reported that cycle. Use it when you want drive history: what the first round looked like, which topics repeated, and how to approach solutions. Work the sets below under a timer, then compare with newer material so your prep matches both established Delhivery patterns and recent shifts.
Download / jump links
Delhivery 2026 coding
DSA practice aligned to Delhivery online assessments
Delhivery interview experience
Round structure and tips from student reports
Delhivery prep guide
Study plan and weekly schedule
Delhivery Aptitude Mock Quiz
Timed placement-style MCQs with score and explanations after you submit. Use it to check speed and accuracy before the real test.
Questions15
Time10 min
Quantitative
Price rises by 25%. By what % should consumption fall to keep expenditure the same?
Reduction = 25/(100+25)×100 = 20%.
Quantitative
The average of 5 numbers is 42. If one number 32 is removed, the new average is:
Sum = 210. New sum = 178. Average = 178/4 = 44.5.
Reasoning
Find next number: 3, 6, 12, 24, 48, ?
Pattern: Each number = previous × 2 3×2=6, 6×2=12, 12×2=24, 24×2=48 Next: 48×2 = 96
Quantitative
If the sum of the first n natural numbers is 210, what is the value of n?
Sum = n(n + 1)/2 = 210 n(n + 1) = 420 n² + n - 420 = 0 (n + 21)(n - 20) = 0 n = 20 (positive value)
Verbal
Choose the correct form: "If I _____ rich, I would travel the world."
Second conditional uses "were" for all subjects (subjunctive mood).
Verbal
Synonym of "Ancient":
Ancient means old.
Reasoning
A walks 10m North, turns right walks 5m, turns right walks 10m. Direction from start?
Correct answer: East (5m east of starting point)
Reasoning
Problem: What is the value of x? Statement 1: x² = 16 Statement 2: x > 0
From statement 1: x = 4 or -4 From statement 2: x > 0 Combining both: x = 4
Quantitative
Pipe A fills a tank in 6 hours, pipe B empties it in 8 hours. Time to fill both open:
1/6 − 1/8 = 1/24 → 24 hours.
Verbal
Each of the boys _____ given a prize.
"Each" takes singular verb → was.
Reasoning
In a row of 30 students, A is 10th from the left. Rank from the right is:
From right = 30-10+1 = 21.
Quantitative
A sum doubles in 5 years at simple interest. The rate of interest is:
For doubling, RT = 100 → R = 100/5 = 20%.
Verbal
He _____ to school every day.
Singular present.
Reasoning
If A is brother of B, B is sister of C, C is brother of D, how is D related to A?
A, B, C, D share the same generation → siblings (gender of D unknown but sibling).
Quantitative
A student scored 60, 70, and 80 in three subjects. If the weights are 2, 3, and 5 respectively, find the weighted average.
Correct answer: 73
Your score
0/15(0%)
Review
Delhivery exam pattern 2026
| Section | What shows up | Prep focus |
|---|---|---|
| Online assessment | Coding and/or MCQ filter | Weekly timed mocks |
| Technical rounds | DSA, CS fundamentals, projects | Live problem solving |
| HR / hiring manager | Motivation and communication | Specific, evidence-based answers |
First round: Delhivery OA
Skills emphasized: DSA, optimization, systems
Languages: Java, Python, Go
Sample Delhivery questions with solutions
These are practice-style questions aligned to patterns students report for Delhivery drives around 2026. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Quantitative aptitude (2026)
Q1: Consumption cut
Problem: If the price of an item rises by 25%, by what percent should consumption fall so that expenditure stays the same?
Solution: Required reduction = r/(100+r) × 100 with r = 25. = 25/125 × 100 = 20%.
Answer: 20%
Q2: Compound mark-discount
Problem: An article is marked 40% above cost and sold after a 10% discount. Find the profit percent.
Solution: SP = CP × 1.4 × 0.9 = 1.26 CP. Profit = 26%.
Answer: 26%
Q3: Loss to profit shift
Problem: An article sold at 10% loss would give 5% profit if sold for ₹60 more. Find the cost price.
Solution: 0.9P + 60 = 1.05P 60 = 0.15P P = 60 / 0.15 = ₹400.
Answer: ₹400
Q4: Worker scaling
Problem: Eight workers finish a job in 10 days. How many days will 10 workers take for the same job (same pace)?
Solution: Total man-days = 8 × 10 = 80. Days for 10 workers = 80 / 10 = 8 days.
Answer: 8 days
Q5: Distance from speed
Problem: A vehicle travels at 60 km/h for 2.5 hours. How far does it go?
Solution: Distance = speed × time = 60 × 2.5 = 150 km.
Answer: 150 km
Q6: Compound ratio
Problem: If two ratios are 3:5 and 5:7, what is the compound ratio?
Solution: Compound ratio = (3/5) × (5/7) = 3/7, written as 3:7.
Answer: 3:7
Q7: SI three years
Problem: Find simple interest on ₹5000 at 8% per annum for 3 years.
Solution: SI = 5000 × 8 × 3 / 100 = ₹1200.
Answer: ₹1200
Q8: Boat upstream
Problem: A boat’s speed in still water is 15 km/h and the stream is 3 km/h. How long to cover 36 km upstream?
Solution: Upstream speed = 15 − 3 = 12 km/h. Time = 36 / 12 = 3 hours.
Answer: 3 hours
Coding practice (2026)
Coding Q1: Binary search
Problem: Given a sorted array of distinct integers and a target, return the index of target or -1 if missing.
Approach: Maintain lo/hi. Compare mid with target and shrink the half that cannot contain it. Careful with overflow-free mid and empty arrays.
Complexity: O(log n) time
Delhivery tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q2: Move zeros
Problem: Move all zeros in an array to the end while keeping the relative order of non-zero elements.
Approach: Two pointers: write non-zeros toward the front, then fill the remainder with zeros. Or swap zeros as you scan.
Complexity: O(n) time, O(1) space
Delhivery tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q3: Rotate array
Problem: Rotate an array to the right by k steps. Example: [1,2,3,4,5,6,7], k = 3 → [5,6,7,1,2,3,4].
Approach: Normalize k %= n. Reverse the whole array, reverse the first k elements, then reverse the rest. That yields the rotation in place.
Complexity: O(n) time, O(1) space
Delhivery tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q4: First unique character
Problem: Find the first non-repeating character in a string and return its index, or -1 if none exists.
Approach: Count frequencies in one pass (hash map or array of 26 for lowercase). Second pass returns the first index with count 1.
Complexity: O(n) time
Delhivery tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q5: Stack with min
Problem: Design a stack that supports push, pop, top, and getMin in average O(1) time.
Approach: Keep a parallel min-stack (or store pairs). When pushing, also push the new minimum. When popping, pop both stacks.
Complexity: O(1) per operation amortized
Delhivery tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q6: Maximum subarray sum (Kadane)
Problem: Given an integer array, find the contiguous subarray with the largest sum and return that sum. Example: [-2,1,-3,4,-1,2,1,-5,4] → 6 (from [4,-1,2,1]).
Approach: Keep a running sum. If the running sum drops below 0, reset it to 0 before taking the next element (or track the best ending-here value). Track the global maximum as you scan once from left to right.
Complexity: O(n) time, O(1) extra space
Delhivery tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q7: Reverse a string in place
Problem: Given a mutable character array representing a string, reverse it in place without allocating another array of the same size.
Approach: Use two pointers at the start and end. Swap characters, then move inward until the pointers meet. Watch empty and single-character inputs.
Complexity: O(n) time, O(1) extra space
Delhivery tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q8: Check prime
Problem: Write a function that returns true if n is prime and false otherwise. Handle n < 2 correctly.
Approach: Return false for n < 2. Trial-divide from 2 to floor(sqrt(n)). If any divisor divides n evenly, it is composite; otherwise prime.
Complexity: O(√n) time
Delhivery tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Deep prep notes for Delhivery
How the Delhivery OA usually feels
Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For Delhivery, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, Python, Go.
Topic weight hints
| Area | Why it matters at Delhivery |
|---|---|
| DSA | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Logistics Tech awareness | Helps in managerial / HR conversations |
| Communication | Explain your approach clearly; keep a few real examples ready for HR |
14-Day sprint
- Days 1-3: Learn the 2026 pattern and take two sectional mocks
- Days 4-7: Closed practice on weak topics from your error log
- Days 8-10: Full mocks every other day; review the same day
- Days 11-14: Practice explaining projects out loud, light revision, sleep and IDs ready