Flipkart interview process (2026)
Round-by-round breakdown of the Flipkart software engineering interview across 4 levels and 17 rounds: interview mode, sample questions, and worked solutions.
SDE / Software Engineering Intern (Summer, ~2-6 month; campus, off-campus, GRiD & Runway)
Difficulty: Medium · Timeline: ~2-11 weeks · Recommended prep: 6-10 weeks · Cooldown: No official published cooldown for interns. GRiD/off-campus
-
Round 0: Online MCQ / Aptitude & CS-Fundamentals Quiz (Unstop)
Assessment · ~30 min · difficulty 2/5 · elimination round
Mode of interview: Online assessment
-
Round 1: Coding Online Assessment (HackerRank / Unstop)
Assessment · 60-90 min · difficulty 3/5 · elimination round
Mode of interview: Online assessment
Sample question: Unique Paths II — Given an m x n grid where each cell is 0 (empty) or 1 (obstacle), a robot starts at the top-left and can move only right or down. Return the number of distinct paths to reach the bottom-right cell without passing through any obstacle.
-
Round 2: Technical Interview 1 (DSA + Projects)
Onsite · 30-60 min · difficulty 3/5 · elimination round
Mode of interview: Onsite or virtual onsite interview
Sample question: Combination Sum — Given an array of distinct positive integers (candidates) and a target integer, return all unique combinations of candidates that sum to target. Each candidate may be reused an unlimited number of times. Combinations are considered the same regardless of order.
-
Round 3: Technical Interview 2 (DSA / DS Design, sometimes techno-managerial)
Onsite · 30-60 min · difficulty 3/5 · elimination round
Mode of interview: Onsite or virtual onsite interview
-
Round 4: HR / Hiring-Manager & Offer
Behavioral · ~20-30 min · difficulty 1/5
Mode of interview: Live behavioral interview
SDE-1 (0-2 yrs, Bengaluru)
Difficulty: Medium · Timeline: ~3-5 weeks · Recommended prep: ~2-4 months · Cooldown: ~6-12 months
-
Round 0: Online Assessment (DSA)
Assessment · 90-120 min · difficulty 3/5 · elimination round
Mode of interview: Online assessment · HackerRank
Sample question: Gas Station (Circular Tour) — There are n gas stations on a circular route; station i has gas[i] fuel and it costs cost[i] to travel to the next station. Starting with an empty tank, return the index of the station from which you can complete the full circuit once in the clockwise direction, or -1 if impossible. A valid start is guaranteed to be unique if it exists.
-
Round 1: Technical Interview 1 (DSA)
Phone · 30-60 min · difficulty 3/5 · elimination round
Mode of interview: Remote phone or video interview
Sample question: Word Break — Given a string s and a dictionary of m words, determine whether s can be segmented into a space-separated sequence of one or more dictionary words (words may be reused). Print 'true' or 'false'.
-
Round 2: Technical Interview 2 (DSA / Problem-Solving, sometimes light LLD/OOP)
Onsite · 60-90 min · difficulty 3/5
Mode of interview: Onsite or virtual onsite interview
Sample question: Machine Coding: Design Splitwise (expense sharing) — In a 90-120 minute machine-coding round, build a working, demoable Splitwise-style expense manager: add users/groups, record expenses split equally / exactly / by percentage, and query net balances (who owes whom). Emphasis on clean OOP, SOLID, extensibility, and edge-case handling rather than distributed scale.
-
Round 3: Hiring Manager / HR Round
Behavioral · 45-60 min · difficulty 2/5
Mode of interview: Live behavioral interview
SDE-2 (Bengaluru)
Difficulty: Hard · Timeline: ~3-5 weeks · Recommended prep: ~3-6 months · Cooldown: No official policy published. LOW confidence — unverified.
-
Round 0: Machine Coding Round (Flipkart signature)
Assessment · 90 min · difficulty 4/5 · elimination round
Mode of interview: Online assessment
Sample question: Design a Subscription-based Marketplace (BigBasket-style) — Design a system where users subscribe to recurring items (not one-off purchases), stores register inventory and serviceable delivery locations, and a user can subscribe to items from any store within their delivery range. Cover entities, SQL vs NoSQL choice, microservice split, payment handling, sync vs async flows, caching, load balancing, and notifications.
-
Round 1: DSA / Problem-Solving Round
Onsite · 60 min · difficulty 3/5
Mode of interview: Onsite or virtual onsite interview
Sample question: Find Median from Data Stream — Design a structure that supports adding integers from a stream and returning the median of all elements seen so far. Read n then n integers; after each insertion print the current median (print an integer with no decimal, otherwise the exact half value).
-
Round 2: System Design (HLD)
System_design · 45-60 min · difficulty 4/5
Mode of interview: Live system design interview
Sample question: Design a Ledger / Multi-service Transaction Store — Design a ledger system that durably stores all financial transactions produced by many services. Discuss database choice and why, the entities/fields, guaranteeing correctness/immutability (append-only), inter-service communication, idempotency, and how downstream services query balances and history.
-
Round 3: Hiring Manager / Bar-Raiser (sometimes an extra mixed technical round)
Behavioral · 45-60 min · difficulty 3/5
Mode of interview: Live behavioral interview
SDE-3 / Senior SDE (Bengaluru)
Difficulty: Hard · Timeline: ~3-5 weeks · Recommended prep: ~3-6 months · Cooldown: No official policy published. LOW confidence — unverified.
-
Round 0: Machine Coding Round
Assessment · 90 min · difficulty 4/5 · elimination round
Mode of interview: Online assessment
Sample question: Design a Distributed Rate Limiter — Design a distributed rate limiter for the API gateway: choose an algorithm (token bucket / sliding-window), support per-user and global limits, and show it both with and without Redis. Cover the sliding-window/token-bucket logic, atomicity across nodes, failure modes, configurability/extensibility, and latency trade-offs.
-
Round 1: DSA Round (reduced emphasis)
Onsite · 45-60 min · difficulty 3/5
Mode of interview: Onsite or virtual onsite interview
Sample question: First Missing Positive — Given an unsorted array of n integers, find the smallest missing positive integer in O(n) time and O(1) auxiliary space. Read n then n integers; print the answer.
-
Round 2: System Design / HLD (often two design rounds)
System_design · 45-60 min · difficulty 4/5
Mode of interview: Live system design interview
Sample question: Design a Distributed Cache — Design a distributed cache (Redis/Memcached-class): partitioning via consistent hashing, replication, eviction policies (LRU/LFU/TTL), read/write paths, cache-stampede prevention (single-flight refresh, jittered expiry), hot-key sharding, and consistency vs durability trade-offs against the backing store.
-
Round 3: Hiring Manager / Behavioral
Behavioral · 45-60 min · difficulty 3/5
Mode of interview: Live behavioral interview
Other companies' interview processes
Worked sample solutions (code, design diagrams, and STAR answers) for every round are available in the FAANGPlus app: open interview processes.