Flipkart: Software Development Engineer 1
Flipkart's SDE-1 loop is described by candidate reports as an online assessment (about 90 minutes and two to four data-structure problems), a DSA round, a machine-coding or system-thinking round and a hiring-manager conversation. A fresher track via the GRiD competition is reported to give SDE-1 offers to finalists. Most format details come from experienced-hire and candidate posts, so confirm yours with the recruiter.
25 questions · 4 rounds · updated Nov 2026
How the interview works
- Online assessment: Two to four coding problems, around 90 minutes in one report.
- DSA round: One or two medium problems, 50 to 60 minutes, thinking aloud.
- Machine coding or system thinking: Write modular working code for a problem, then explain it; design discussion.
- Hiring manager round: Projects, ownership and goals; can turn technical.
Sample questions
- 01
Design the classes for a parking lot system (low-level design).
MediumLow-level design
Model answer
What the interviewer checks
Clean object modelling, SOLID, extensibility and handling concurrency for spot allocation.
How to answer
Requirements: several floors; spot types (bike, compact, large, EV); vehicles park in a fitting spot; tickets at entry; payment at exit by duration and type; display free spots. Classes: • ParkingLot (singleton or injected): floors, entry and exit gates, `findSpot(vehicle)`. • Floor: a list of ParkingSpot, plus free counts per type. • ParkingSpot: id, type, isFree, `assign(vehicle)`, `release()`. • Vehicle (abstract) → Bike, Car, Truck, each with a required SpotType. • Ticket: id, vehicle, spot, entryTime. • SpotAllocationStrategy (interface) → NearestFirst, EVPriority: the strategy pattern, so the rule can change without editing ParkingLot. • PricingStrategy (interface) → HourlyPricing, WeekendPricing. • Payment → Cash, UPI, Card. Flow: the entry gate calls `lot.findSpot(vehicle)` → `spot.assign()` → issues a Ticket. The exit gate calculates the fee with PricingStrategy → takes payment → `spot.release()`. Concurrency: two gates may grab the same spot, so make assign atomic (synchronized, or a compare-and-set on isFree), or hand out spots from a per-type thread-safe queue. Extensions to mention: reservations, a display board updated through an observer, and monthly passes.
- 02
Merge overlapping intervals. Example: [[1,3],[2,6],[8,10],[15,18]] → [[1,6],[8,10],[15,18]]
MediumSorting
Approach and solution
Approach
Sort by start. Walk through; if the current interval starts at or before the end of the last merged one, extend that end; otherwise start a new interval.
def merge(intervals): out = [] for s, e in sorted(intervals): if out and s <= out[-1][1]: out[-1][1] = max(out[-1][1], e) else: out.append([s, e]) return out assert merge([[1, 3], [2, 6], [8, 10], [15, 18]]) == [[1, 6], [8, 10], [15, 18]] assert merge([[1, 4], [4, 5]]) == [[1, 5]]Complexity: O(n log n) for the sort, O(n) for the output.
- 03
Return the k most frequent elements. Example: [1,1,1,2,2,3], k = 2 → [1, 2]
MediumHashing
Approach and solution
Approach
Count with a hash map, then either use a heap of size k (O(n log k)) or bucket sort by frequency (O(n)), because a frequency can be at most n.
from collections import Counter def top_k(a, k): buckets = [[] for _ in range(len(a) + 1)] for x, c in Counter(a).items(): buckets[c].append(x) out = [] for c in range(len(a), 0, -1): for x in buckets[c]: out.append(x) if len(out) == k: return out return out assert top_k([1, 1, 1, 2, 2, 3], 2) == [1, 2]Complexity: O(n) time and space.
22 more questions, members only
- Online assessment4
- DSA round10
- Machine coding and design round5
- Hiring manager round6
Members also get how to answer each question and a preparation plan for this company.
See plans from ₹399Every question and answer is written by Hirecept and the code is run before it is published. How a company runs its process comes from candidate reports and public pages, and companies change it, so treat that part as a guide, not a promise.