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

BigBasket coding questions

Overview

Section titled “Overview”

Practice BigBasket coding questions in the style candidates report for online assessments and technical interviews. Focus: heaps, grids/BFS, intervals, ranking.

BigBasket Coding Pattern (Candidate-Reported)

Section titled “BigBasket Coding Pattern (Candidate-Reported)”
Item Typical expectation
Problems 1-3 coding tasks depending on drive
Skills heaps, grids/BFS, intervals, ranking
Languages Java, C++, Python (confirm invite)
Bar Correctness first, then complexity

Practice Problems

Section titled “Practice Problems”

Question 1: Merge overlapping discount intervals

Section titled “Question 1: Merge overlapping discount intervals”
Show approach

Approach: Sort + merge.

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 2: Top-K selling SKUs

Section titled “Question 2: Top-K selling SKUs”
Show approach

Approach: Count + heap.

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 3: Can rider reach customer on grid

Section titled “Question 3: Can rider reach customer on grid”
Show approach

Approach: BFS on open cells.

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 4: Cart coupon stacking rules

Section titled “Question 4: Cart coupon stacking rules”
Show approach

Approach: Greedy with careful constraints.

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 5: Reorder logs / SKU strings

Section titled “Question 5: Reorder logs / SKU strings”
Show approach

Approach: Custom comparator sort.

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 6: Inventory low-stock alerts

Section titled “Question 6: Inventory low-stock alerts”
Show approach

Approach: Hash map thresholds + stream updates.

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 7: Assign nearest delivery partner

Section titled “Question 7: Assign nearest delivery partner”
Show approach

Approach: Brute force or spatial heuristics; state complexity.

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

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”

Blinkit · Swiggy · Flipkart · Nykaa · Zomato · Paytm