BigBasket 2025 aptitude
Quantitative, reasoning, and verbal drills with solutions
Bigbasket Placement Papers 2025
Overview
This page collects BigBasket placement papers from 2025 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 BigBasket patterns and recent shifts.
Download / jump links
BigBasket 2025 coding
DSA practice aligned to BigBasket online assessments
BigBasket interview experience
Round structure and tips from student reports
BigBasket prep guide
Study plan and weekly schedule
BigBasket 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 25%. By what % should consumption fall to keep expenditure same?
Reduction = r/(100+r)×100 = 25/125×100 = 20%.
Quantitative
If a number is increased by 20% and then decreased by 15%, what is the net change?
Correct answer: +2% increase
Quantitative
The ratio of boys to girls in a class is 3:2. If there are 30 students, how many are girls?
Correct answer: 12 girls
Reasoning
Find the next number: 6, 11, 21, 41, ?
×2−1 pattern → 81.
Verbal
A shopkeeper buys an article for ₹500 and sells it for ₹600. Find his profit percentage.
Correct answer: 20%
Verbal
Antonym of "Expand":
Expand ↔ contract.
Verbal
Problem: Choose the correct sentence: a) The data are incorrect b) The data is incorrect c) The datas are incorrect
"Data" can be singular or plural, but in modern usage, it's often treated as singular. "The data is incorrect" is more commonly accepted.
Quantitative
A person walks 5 km at 5 km/h and 10 km at 10 km/h. Average speed is:
Time = 1 h + 1 h = 2 h. Average = 15/2 = 7.5 km/h.
Reasoning
Find the next number: 3, 9, 27, 81, ?
×3 each → 243.
Quantitative
Find the HCF of 24 and 36.
Correct answer: 12
Quantitative
A number is increased by 25% and then decreased by 25%. Find the net percentage change.
Let original number = 100 After 25% increase: 100 + 25 = 125 After 25% decrease: 125 - (25% of 125) = 125 - 31.25 = 93.75 Net change = 100 - 93.75 = 6.25 Net percentage change = (6.25/100) × 100 = 6.25% decrease
Verbal
One of my friends _____ in Delhi.
One of + plural noun + singular verb.
Reasoning
Odd one out: Triangle, Square, Circle, Rectangle
Circle has no straight sides.
Reasoning
A is taller than B but shorter than C. D is shorter than B. Who is tallest?
C > A > B > D → C is tallest.
Reasoning
Find the next number: 3, 8, 15, 24, 35, ?
Pattern: Differences are 5, 7, 9, 11 (odd numbers) Next difference = 13 Next number = 35 + 13 = 48
Your score
0/15(0%)
Review
BigBasket exam pattern 2025
| 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: BigBasket OA
Skills emphasized: DSA, logistics, inventory systems
Languages: Java, Python
Sample BigBasket questions with solutions
These are practice-style questions aligned to patterns students report for BigBasket drives around 2025. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Quantitative aptitude (2025)
Q1: Mixture milk
Problem: A mixture has milk and water in the ratio 4:1. If 5 litres of water are added to 20 litres of mixture, what is the new milk:water ratio?
Solution: In 20 L: milk = 16 L, water = 4 L. After adding 5 L water: milk 16, water 9. Ratio = 16:9.
Answer: 16:9
Q2: CI vs SI hint
Problem: Find compound interest on ₹10,000 at 10% per annum for 2 years, compounded annually.
Solution: Amount = 10000 × (1.1)² = 10000 × 1.21 = ₹12,100. CI = 12100 − 10000 = ₹2100. (SI for same period would be ₹2000; the extra ₹100 is interest on first-year interest.)
Answer: ₹2100
Q3: Clock angle
Problem: What is the angle between the hour and minute hands at 3:00?
Solution: At 3:00 the hands are exactly 90° apart (one quarter of the circle).
Answer: 90°
Q4: Permutation basic
Problem: In how many ways can 5 different books be arranged on a shelf?
Solution: Arrangements of 5 distinct items = 5! = 120.
Answer: 120
Q5: Consecutive integers
Problem: If the sum of three consecutive integers is 72, what is the smallest of these integers?
Solution: Let the integers be x, x+1, and x+2.
x + (x+1) + (x+2) = 72 3x + 3 = 72 3x = 69 x = 23
So the integers are 23, 24, and 25.
Answer: 23
Q6: Train and pole
Problem: A train 150 meters long passes a pole in 15 seconds. What is its speed in km/h?
Solution: Distance = 150 m = 0.15 km. Time = 15 s = 15/3600 h = 1/240 h. Speed = 0.15 ÷ (1/240) = 0.15 × 240 = 36 km/h.
Faster check: 150/15 = 10 m/s → 10 × 18/5 = 36 km/h.
Answer: 36 km/h
Q7: Profit on a pen
Problem: If the cost price of a pen is ₹40 and it is sold at a 25% profit, what is the selling price?
Solution: Profit = 25% of 40 = ₹10. Selling price = 40 + 10 = ₹50.
Or SP = CP × 1.25 = 40 × 1.25 = ₹50.
Answer: ₹50
Q8: A and B together
Problem: A can finish a job in 10 days and B in 20 days. How long will they take working together?
Solution: A’s one-day work = 1/10. B’s one-day work = 1/20. Together = 1/10 + 1/20 = 3/20 per day. Time = 20/3 ≈ 6.67 days (6 days 16 hours).
Answer: 20/3 days
Coding practice (2025)
Coding Q1: Longest substring without repeating characters
Problem: Given a string s, find the length of the longest substring without repeating characters. Example: ‘abcabcbb’ → 3 (‘abc’).
Approach: Sliding window with a map (or last-seen index) of characters. Expand the right pointer; when a duplicate appears inside the window, move the left pointer past the previous occurrence.
Complexity: O(n) time
BigBasket 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: Merge overlapping intervals
Problem: Given a list of intervals [start, end], merge all overlapping intervals and return the non-overlapping set that covers the same ranges.
Approach: Sort by start time. Walk once, merging into the last interval in the result when the next start is ≤ current end; otherwise append a new interval.
Complexity: O(n log n) time from the sort
BigBasket 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: Top K frequent elements
Problem: Given an integer array and an integer k, return the k most frequent elements. Order among equals can be arbitrary unless the problem says otherwise.
Approach: Count frequencies with a hash map, then use a heap of size k (or bucket sort by frequency) to extract the top k keys.
Complexity: O(n log k) with a heap
BigBasket 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: Linked list cycle
Problem: Given the head of a linked list, return true if there is a cycle and false otherwise.
Approach: Floyd’s tortoise and hare: move one pointer one step and another two steps. If they meet, a cycle exists. If the fast pointer hits null, there is no cycle.
Complexity: O(n) time, O(1) space
BigBasket 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: Binary tree level order
Problem: Given the root of a binary tree, return the level-order traversal (breadth-first) as a list of levels.
Approach: Use a queue. For each level, drain the current queue size, collect values, and enqueue children for the next level.
Complexity: O(n) time, O(n) space
BigBasket 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: Coin change (min coins)
Problem: Given coin denominations and an amount, return the fewest coins needed to make that amount, or -1 if it is impossible.
Approach: Unbounded knapsack DP: let dp[x] be the minimum coins for amount x. For each coin, update dp[c..amount]. Initialize dp[0] = 0 and the rest to a large sentinel.
Complexity: O(amount × coins)
BigBasket 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: 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
BigBasket 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: 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
BigBasket 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 BigBasket
How the BigBasket 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 BigBasket, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, Python.
Topic weight hints
| Area | Why it matters at BigBasket |
|---|---|
| DSA | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Online Grocery 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 2025 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