As a Software Engineer at Flipkart, you are at the heart of India’s most influential e-commerce ecosystem. You will be responsible for building, scaling, and optimizing the systems that handle massive concurrency, complex logistics, and millions of daily transactions. Your work directly impacts the user experience, from the speed of the checkout flow to the reliability of our recommendation engines and inventory management systems. This role is critical because Flipkart operates at a scale that presents unique engineering challenges. You will not just be writing code; you will be solving problems related to distributed systems, high-availability architecture, and data consistency. Whether you are working on the core retail platform, supply chain logistics, or quick-commerce initiatives like Flipkart Minutes, you will be expected to balance rapid innovation with system stability.
Online Assessment
reportedCandidates undergo an online assessment to evaluate their theoretical knowledge and practical engineering skills.
What to demonstrate
- Candidates undergo an online assessment to evaluate their theoretical knowledge and practical engineering skills
- Depth in Prefix Computation (Running Max/Min)
How to prepare
- Answer aloud and timed: Given an array of integers representing task processing times, calculate the "idle time" defined as the difference between the running max and min processing time.
- Answer aloud and timed: Find the smallest number in an infinite set of positive integers [1, 2, 3,...].
Problem-Solving Round
reportedCandidates participate in a round focused on problem-solving abilities.
What to demonstrate
- Candidates participate in a round focused on problem-solving abilities
- Depth in Prefix Computation (Running Max/Min)
How to prepare
- Answer aloud and timed: Solve medium-to-hard level problems involving Monotonic Stacks and Graphs.
- Answer aloud and timed: Implement solutions for Dynamic Programming problems of varying difficulty.
Machine Coding Round
reportedThis round tests candidates' coding skills through practical machine coding tasks.
What to demonstrate
- This round tests candidates' coding skills through practical machine coding tasks
- Depth in Prefix Computation (Running Max/Min)
How to prepare
- Answer aloud and timed: Implement a full working Conference Room Booking System with support for various features and edge cases.
- Answer aloud and timed: Design the core system for Flipkart Minutes, an instant delivery platform.
Design Discussion
reportedCandidates engage in discussions about system design to assess their design capabilities.
What to demonstrate
- Candidates engage in discussions about system design to assess their design capabilities
- Depth in Prefix Computation (Running Max/Min)
How to prepare
- Answer aloud and timed: Explain the design of a search feature, such as for IRCTC, focusing on database schema and high-level architecture.
- Answer aloud and timed: Discuss serialization with hashing techniques in the context of data storage or transmission.
Hiring Manager Round
reportedThe final round evaluates cultural alignment and long-term potential with the hiring manager.
What to demonstrate
- The final round evaluates cultural alignment and long-term potential with the hiring manager
- Depth in Prefix Computation (Running Max/Min)
How to prepare
- Prepare two projects you led end to end, each with the decision you owned and what it cost.
- Have three questions about the team's roadmap and how success is measured in the first six months.
PracHub editorial advice for the preparation topics above.
Prepare for Ambiguity
In design rounds, the interviewer may give a very open-ended prompt. Use this as an opportunity to ask clarifying questions and define the system boundaries yourself.
Test Your Code
During the machine coding round, always write test cases for your code. It shows you think about reliability and edge cases.
Focus on Trade-offs
Never suggest a technology or design pattern without explaining why you chose it over the alternatives.
Stay Calm
If you feel stuck, communicate your thought process. Interviewers are often looking for how you approach a problem rather than just the final answer.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Given an array of integers representing task processing times, calculate the "idle time" defined as the differ
Given an array of integers representing task processing times, calculate the "idle time" defined as the difference between the running max and min processing time.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Find the smallest number in an infinite set of positive integers [1, 2, 3,...].
Find the smallest number in an infinite set of positive integers [1, 2, 3,...].
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Solve medium-to-hard level problems involving Monotonic Stacks and Graphs.
Solve medium-to-hard level problems involving Monotonic Stacks and Graphs.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Implement solutions for Dynamic Programming problems of varying difficulty.
Implement solutions for Dynamic Programming problems of varying difficulty.
Approach
- Restate the input: its shape, its size, and what is guaranteed about it.
- Name the brute-force solution and its complexity before improving on it.
- Choose the data structure from the access pattern, not from familiarity.
- State the target complexity and say which constraint rules the naive version out.
Follow-up
- How does this change if the input no longer fits in memory?
- What is the worst case, and how likely is it on real data?
Hold a per-tenant active cap against concurrent creates
A tenant on the standard plan may hold at most 50 resources with status='active'. The create handler runs SELECT count(*) FROM resource WHERE tenant_id = $1 AND status = 'active', compares to 50, then inserts. Two creates arrive 3 ms apart on different instances and the tenant lands at 51. Name the anomaly, say whether PostgreSQL 16 READ COMMITTED or REPEATABLE READ prevents it and why, then give an implementation that holds the cap at READ COMMITTED with the exact statements. Finally, say what changes when the cap is 'at most one running export per tenant' on job_run.
Approach
- Name it: write skew. The two transactions read an overlapping set and write disjoint rows, so there is no row-level conflict for the engine to detect and each commit is individually legal.
- Rule out the levels precisely. READ COMMITTED takes a fresh snapshot per statement and takes no lock on the counted rows, so both see 49. PostgreSQL's REPEATABLE READ is snapshot isolation: it removes non-repeatable reads and phantoms within the snapshot but still admits write skew, because the anomaly is not a re-read of a changed row, it is a read of a set that a concurrent transaction invalidates. Only SERIALIZABLE closes it, by tracking the read dependency and aborting one transaction with SQLSTATE 40001 — a guarantee that exists only if the application re-runs the whole transaction from the read.
- Convert the set predicate into a single-row conflict: keep tenant.active_resource_count and run UPDATE tenant SET active_resource_count = active_resource_count + 1 WHERE tenant_id = $1 AND active_resource_count < 50 in the same transaction as the INSERT. Zero affected rows is the cap, returned as 409. The row lock serialises the decision at any isolation level, and contention is bounded to one tenant's row — which is also the fair-scheduling unit, unlike a global counter that would convoy every tenant behind one row.
- State the cost you just took on: a counter is a second source of truth that can drift, so every path that changes status must adjust it inside the same transaction, and a periodic reconciliation has to exist, with resource_revision as the authority for what the count should have been.
Follow-up
- A resource moves from archived back to active. Which statements change, and what breaks if the counter update and the status change land in different transactions?
- The cap becomes plan-dependent and a plan can change mid-month. Where does the number 50 live, and who reads it?
Replace offset paging on the resource feed with keyset
resource holds resource_id, tenant_id, owner_user_id, title, body_ref, version, status ('draft','active','archived','deleted'), created_at, updated_at, deleted_at, with an index on (tenant_id, status, updated_at DESC, resource_id DESC). The listing endpoint returns active resources for one tenant, newest update first, 50 per page, today with LIMIT 50 OFFSET n. Tenants reach page 400 and rows are created while they read. Write the keyset query, define what the cursor carries and how it is encoded, and say which part of the index each predicate uses. Assume PostgreSQL 16.
Approach
- Name the two failures separately. OFFSET 20000 makes the server produce and discard 20,000 rows, so page cost grows with depth rather than with page size. Independently, any write that changes how many rows sort above the offset moves the window between two fetches, and the direction decides which anomaly you get: an insert lands at the head of updated_at DESC and pushes already-returned rows down past the boundary, so they are returned a second time; a delete above the offset, or a row whose updated_at is bumped above the cursor, pulls rows up and one is never returned at all. Nothing in the response reveals either.
- Write the seek: WHERE tenant_id = $1 AND status = 'active' AND (updated_at, resource_id) < ($2, $3) ORDER BY updated_at DESC, resource_id DESC LIMIT 50. The row-value comparison is one index range rather than a disjunction, and both columns are NOT NULL, which is what makes that comparison well defined.
- Map each predicate onto the index: tenant_id and status are equality on the leading columns, (updated_at, resource_id) is the range, and the ORDER BY matches the index order so no Sort node appears and the scan stops after 50 rows. The DESC in the definition only matters for mixed directions — a plain ascending btree on the same columns is read backwards for this query.
- Put both sort columns in the cursor and nothing the client can tamper with into another tenant: base64 of (updated_at, resource_id), validated server-side, with tenant_id taken from the principal.
Follow-up
- The client asks for 'jump to page 400'. What do you offer instead, and what does the honest version cost?
- Sort order becomes user-selectable across four columns. How many indexes is that, and which would you refuse to add?
Implement a full working Conference Room Booking System with support for various features and edge cases.
Implement a full working Conference Room Booking System with support for various features and edge cases.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Design the core system for Flipkart Minutes, an instant delivery platform.
Design the core system for Flipkart Minutes, an instant delivery platform.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Explain the design of a search feature, such as for IRCTC, focusing on database schema and high-level architec
Explain the design of a search feature, such as for IRCTC, focusing on database schema and high-level architecture.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Discuss serialization with hashing techniques in the context of data storage or transmission.
Discuss serialization with hashing techniques in the context of data storage or transmission.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
Exports duplicate a row range about once a week
Roughly once a week an export writes a file containing a duplicated range of rows. The affected job_run rows show attempt = 1, status = succeeded, one started_at, and a lease_owner naming a different host from the one whose logs show the job starting. Leases last 30 seconds and are heartbeated every 10 from inside the handler; lease_expires_at is computed on the worker and compared against the database's now(). Find the mechanism, and give a fix that holds even if you cannot fix the clocks.
Approach
- Start from the fact that eliminates the obvious answer. attempt = 1 means no retry was recorded, so this is not a re-run after failure; two workers ran the same row concurrently and the takeover path never touched the counter. lease_owner naming a host other than the one that started the job is the same statement from the other side.
- Enumerate the mechanisms that cause a premature takeover, then find the signal that separates them. Either the lease genuinely expired because the heartbeat did not fire, which is what happens when the heartbeat runs on the handler's own thread and the handler makes a long blocking call, or it only appeared expired because two clocks disagree, since lease_expires_at is written from the worker's clock and evaluated against the database's. The discriminator is the distribution: incidents clustered on the longest exports indict the heartbeat, incidents clustered on one host indict skew. Measure both, and measure each host's offset against the database directly.
- Read the reclaim query precisely. In PostgreSQL now() is transaction start time, not statement time, so a reclaimer holding a long transaction compares against an older timestamp than expected; clock_timestamp() is the statement-time function. This is worth ruling in or out before you redesign anything, because it changes which rows look expired.
- Remove the second clock rather than trying to synchronise it. Issue and extend the lease in the database, with lease_expires_at = now() + interval '30 seconds' in both the claim and the heartbeat, so exactly one clock is ever compared and worker skew stops mattering to this predicate.
Follow-up
- The displaced worker has already streamed half the file to object storage. What makes that side effect safe to repeat?
- You now count takeovers. What alert fires on that counter, and at what threshold?
Built from the rounds and topics Flipkart candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the Flipkart loop
- Write out the reported sequence: Online Assessment, Problem-Solving Round, Machine Coding Round, Design Discussion, Hiring Manager Round.
- For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.
Deliverable: A one-page map of the 5 reported rounds, with the weakest marked.
02Work Prefix Computation (Running Max/Min)
- Spend the session on Prefix Computation (Running Max/Min), which Flipkart candidates report being tested on.
- Write one worked example in Prefix Computation (Running Max/Min) and time yourself on it.
Deliverable: One timed worked example in Prefix Computation (Running Max/Min).
03Work Hashing (Hash Functions)
- Spend the session on Hashing (Hash Functions), which Flipkart candidates report being tested on.
- Write one worked example in Hashing (Hash Functions) and time yourself on it.
Deliverable: One timed worked example in Hashing (Hash Functions).
04Work Array Manipulation
- Spend the session on Array Manipulation, which Flipkart candidates report being tested on.
- Write one worked example in Array Manipulation and time yourself on it.
Deliverable: One timed worked example in Array Manipulation.
05Answer out loud: Data Structures & Algorithms
- Answer aloud, timed: Given an array of integers representing task processing times, calculate the "idle time" defined as the difference between the running max and min processing time.
- Answer aloud, timed: Find the smallest number in an infinite set of positive integers [1, 2, 3,...].
Deliverable: Spoken answers to 2 reported Data Structures & Algorithms question(s), under time.
06Answer out loud: Machine Coding & System Design
- Answer aloud, timed: Implement a full working Conference Room Booking System with support for various features and edge cases.
- Answer aloud, timed: Design the core system for Flipkart Minutes, an instant delivery platform.
Deliverable: Spoken answers to 2 reported Machine Coding & System Design question(s), under time.
07Dry run for Flipkart
- Run one full mock under time, then write down the two questions you most want to ask your interviewers.
Deliverable: A completed timed mock and two questions to ask.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
Turn a code review disagreement into a decision
A colleague's change updates a row with UPDATE resource SET version = version + 1 WHERE resource_id = $1 AND version = $2 and treats an affected-row count of zero as a successful no-op. You read that as a silently lost update; they think returning 200 is friendlier to clients than returning a conflict. Describe how you have handled a review disagreement of this shape: what goes in the comment, when you leave the thread, and who decides. Then write the comment you would leave here, in under 80 words.
Approach
- Sort the disagreement before writing anything. A silently discarded write is a correctness claim about data; the choice between 409 and 412 is taste. Only the first justifies blocking a merge, and saying which one you are doing is most of the value of the comment.
- Make the claim reproducible in the comment itself with an interleaving rather than a principle: A reads version 7, B reads version 7, B commits version 8, A's predicate matches zero rows, A is told it succeeded and A's edit is gone.
- Offer the alternative with its cost attached: return 409 carrying the current version and the revision that won, so the client can re-read and re-apply. Note that automatic retry is not the fix, because a retry re-reads the winner's state and reapplies an intent formed against data that no longer exists.
- Apply an escalation rule you can state: two round trips on the thread, then a call, and the service's owner decides rather than the reviewer. A reviewer who cannot be overruled is a bottleneck with extra steps.
Follow-up
- Where would you put the test that fails if someone reintroduces the swallowed zero rowcount?
- The author says clients cannot handle a 409. How do you check whether that is true?
Unblock an engineer without taking the keyboard
A teammate has spent two days on a job handler that occasionally writes duplicate rows. They are certain the queue is delivering twice by mistake. You suspect a lease expiring under a slow handler, so the job is running concurrently with itself. Describe how you have unblocked someone in this position: what you asked before offering a hypothesis, what you showed them rather than told them, and what you left them owning. Then say what you would do if their theory turned out to be the right one.
Approach
- Ask before diagnosing, and ask for things answerable from data they already have: the attempt count on the job rows that produced duplicates, the handler's observed duration against its lease expiry, and whether the duplicate rows share a natural key that a unique constraint could have caught.
- Teach the shape rather than the answer. A lease cannot distinguish a dead worker from a slow one, so a handler that outruns its lease is running twice by design, and deploys deliver the other half by killing handlers mid-run on every rollout. Both of their candidate theories produce identical duplicate rows, which is why the evidence has to come from timings rather than from argument.
- Hand over a checklist they execute: a natural key on every write the handler performs so the second copy collides rather than appends, the record of intent written before any external effect, a lease heartbeat while running, and the metric that shows it working.
- Keep ownership with them deliberately. Pair on the first write, then step back; if you finish it yourself you have closed one ticket and left the same person stuck on the next redelivery.
Follow-up
- How would you distinguish a genuine double-delivery from a lease expiry using only the data already stored?
- Their handler calls an external endpoint before recording that it did. What do you tell them to change first?
Argue against a design, lose, and commit anyway
Describe a design you argued against and lost. State the failure you predicted as a named mechanism, not a feeling about complexity: two services that would need one transaction, a projection with no rebuild path, a write path with no idempotency key. Say what evidence you brought, what the decision maker weighed instead, and what you did after the decision was made: what you instrumented, what you wrote down, and whether the prediction came true. Five minutes.
Approach
- State the prediction in falsifiable form up front: the mechanism, the condition that triggers it, and the observable outcome. A prediction that cannot be checked also cannot be credited to you later.
- Show the evidence you had at the time and label each piece honestly as measured, analogous, or intuition. Keeping the intuition is fine; disguising it as data is the thing that erodes your standing in the next argument.
- Represent the opposing case at full strength, including the constraint you did not control: a fixed date, a team boundary, or the fact that the decision was cheap to reverse and yours was not.
- Make disagree-and-commit concrete. Name the artefact you left behind so the prediction could be settled without you: the alert and its threshold, the counter on the dashboard, the decision note that recorded the trade-off and the condition that would revisit it.
Follow-up
- What threshold on that alert would have proved you right, and did anyone ever look at it?
- If the same proposal arrived tomorrow with the same deadline, would you argue it the same way?
- 01
A colleague's change updates a row with UPDATE resource SET version = version + 1 WHERE resource_id = $1 AND version = $2 and treats an affected-row count of zero as a successful no-op. You read that as a silently lost update; they think returning 200 is friendlier to clients than returning a conflict. Describe how you have handled a review disagreement of this shape: what goes in the comment, when you leave the thread, and who decides. Then write the comment you would leave here, in under 80 words.
- 02
A teammate has spent two days on a job handler that occasionally writes duplicate rows. They are certain the queue is delivering twice by mistake. You suspect a lease expiring under a slow handler, so the job is running concurrently with itself. Describe how you have unblocked someone in this position: what you asked before offering a hypothesis, what you showed them rather than told them, and what you left them owning. Then say what you would do if their theory turned out to be the right one.
- 03
Describe a design you argued against and lost. State the failure you predicted as a named mechanism, not a feeling about complexity: two services that would need one transaction, a projection with no rebuild path, a write path with no idempotency key. Say what evidence you brought, what the decision maker weighed instead, and what you did after the decision was made: what you instrumented, what you wrote down, and whether the prediction came true. Five minutes.
What should I expect during the "debrief" round?
The debrief is an internal meeting where your interviewers discuss your performance across all rounds. It is not an interview itself, but a final assessment of your feedback to determine if you meet the bar for the role.
Flipkart Software Engineer candidate reports ↗How much time should I spend on Machine Coding vs. DSA?
Both are equally critical. DSA is your gateway to the later rounds, but the Machine Coding round is often the "make or break" stage for SDE2 and above. Practice writing complete, compilable code without an IDE if possible.
Flipkart Software Engineer candidate reports ↗Is the interview process different for the different Flipkart entities?
While the core engineering bar remains consistent across the organization, specific teams (like those working on quick-commerce or logistics) may focus more heavily on system design and real-world concurrency problems.
Flipkart Software Engineer candidate reports ↗What topics does Flipkart test in interviews?
Flipkart interviews most often cover Problem Solving, Case study analysis, Vanilla JavaScript, Root Cause Analysis (RCA), and System Design. The exact emphasis depends on the specific role you apply for.
Flipkart Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
No official company page is cited. Rounds and questions come from candidate reports and PracHub editorial material; each source shows the date it was read.
- 01Flipkart Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
Candidate reports · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
PracHub page · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
PracHub page · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
Cognition Software Engineer Interview Guide
What Cognition asks Software Engineer candidates, from reported rounds and questions.
Vercel Software Engineer Interview Guide
Debugging practice for Vercel software engineer prep built on a reproduction you trust, narrowing to the smallest failing input, and changing one variable per run so the result stays attributable.
Together Ai Software Engineer Interview Guide
Failure-handling practice for Together Ai software engineer candidates: requests whose outcome a timeout leaves unknown, where a retry is safe, and deduplicating at the receiver instead of assuming exactly-once delivery.
Spotify Software Engineer Interview Guide
Timed practice for Spotify software engineer candidates who lose time to the clock: short problems taken end to end, then reviewed against a written rubric rather than a passing test run.