Coding questions
Bigbasket Online Assessment
Overview
Here is how public prep guides and student write-ups describe the BigBasket online assessment. This is not an official company brochure.
Inventory/delivery systems; Tata ecosystem.
Usual selection rounds
Rounds students usually mention: OA / coding → Technical → HR
| Item | From student reports |
|---|---|
| Platform | Varies |
| Online test summary | Limited high-quality public fresher OA transcripts in this research pass. Ecommerce logistics tech hiring usually coding + interviews; confirm the job listing. |
| Eligibility notes | Opening-specific |
| Branches (reported) | Confirm notification |
Online test sections
Section-level detail not verified in our source set yet - use the placement email / official PDF.
Extra notes from sources
- Check your college placement email for the platform, section order, and timing.
Sample practice question styles
These are practice questions for speed - not claimed to be from a real BigBasket live paper.
Coding Q1: 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
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: 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
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: 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
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: 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
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.
Prep tips from those student reports
- DSA
- Projects
Sources
- BigBasket careers (other)
These notes come from public reports and can differ by campus, year, and role. If your college placement email or the official careers/notification PDF says something different, follow that.