Flipkart Data Engineer Campus Guide: Three Python Questions and One SQL Query
Prepare for Flipkart data engineer interviews with reported assessment patterns, interview questions, and preparation advice.
On this page
Last reviewed November 16, 2026.
For students applying as data engineers.
Built by the Codinzhub team from Flipkart questions and experiences that IIT students shared on Codinzhub in October and November 2026. Each one is one student's memory of their paper, so use this as a map, not a promise.
The 30-second version. Flipkart's data engineer OA at IIT (BHU) Varanasi on October 18, 2026 was 3 coding questions in Python plus 1 SQL query. The coding was medium: a string transformation, a distance problem on a line of houses, and a counting problem on a complete graph. The SQL joined three tables. Data scientists at the same campus took a very similar paper.
How this guide was built. The OA comes from questions IIT BHU students posted on Codinzhub. No student has posted data engineer interview rounds yet, so the interview section is the Codinzhub team's research and is marked.
Other Flipkart roles: SDE 1 · SDE intern · SDE 2 · SDE 3, iOS · Supply chain (Neev) · Data engineer · Data scientist · AI engineer
Round-by-round breakdown
Stage 1: Online assessment
At a glance
- Length: timed; plan for 90 minutes
- Questions per round: 3 coding (Python) and 1 SQL
- What was asked: strings, greedy on a line, counting graph partitions, a three-table SQL join
- Most common: the same questions as the data scientist paper
What students were asked:
| # | Question (our summary) | How to approach it | Practice |
|---|---|---|---|
| 1 | Transform a string by letter positions and compute a final character or score | Careful simulation with ASCII values and digit sums | String Transformation and Score |
| 2 | N houses in a row, M of them celebrating. How far is the furthest house from the nearest celebrating one? | Sort the celebrating houses; check both ends and half of each gap | Maximum Distance to a House Celebrating Christmas |
| 3 | Remove edges from a complete graph on N vertices so that exactly K connected groups remain (each group fully connected). Count the ways | Count ways to split N labelled items into K groups: Stirling numbers of the second kind, by DP | Chef and a Complete Graph, Partitioning Nodes into K Cliques |
| 4 | SQL: Company, Department and Salary tables; report per company and department | Joins, GROUP BY, aggregates | SQL Query for Company |
More questions: Browse Flipkart questions.
Stage 2: Interviews
What to expect. From our research: data roles at Flipkart usually have technical interviews on SQL, data modelling and pipelines (batch versus streaming, how you would store and process order data), plus coding in Python, then HR. Expect questions on your projects.
The Codinzhub Next-Round Playbook
- Learn the Stirling number DP; it is the hardest question on this paper.
- Write SQL joins across three tables quickly, including group-by and ordering.
- Practise Python string handling with
ordandchruntil it is automatic.
About this guide
This guide is researched and written by the Codinzhub team from what IIT students shared on Codinzhub, plus research into Flipkart's campus process where student reports are missing. Questions are our own short summaries; the practice links open the full question on Codinzhub. Sat this OA or the interviews? Share your experience on Codinzhub and we will update the guide.
Keep track of what you’ve learned.