Flipkart SDE Intern Guide: Two DSA Rounds, Including the GRiD Route
Prepare for Flipkart SDE intern interviews with reported assessment patterns, interview questions, and preparation advice.
On this page
Last reviewed November 16, 2026.
For students applying for Flipkart's SDE summer internship.
Built by the Codinzhub team from Flipkart internship experiences students shared. Each one is one student's memory, so use this as a map, not a promise.
The 30-second version. Flipkart's SDE internship is a coding test, then two one-hour DSA rounds. Winners of Flipkart's GRiD hackathon skip the test and go straight to interviews. Rounds are pure DSA, with pseudocode on paper or a whiteboard, and interviewers often turn a follow-up into a deep dive on the algorithm's internals (Dijkstra, Bellman-Ford, heaps).
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: Coding test or GRiD
What to expect. A coding test similar to the SDE 1 test. GRiD winners skipped it.
Stage 2: Technical round 1
At a glance
- Length: about an hour
- Questions per round: 2
- What was asked: binary search on the answer, backtracking, graphs
- Most common: a medium problem with an optimisation follow-up
What interns were asked:
- Koko eating bananas (binary search on the speed); started from brute force, then bounded the answer by the largest pile.
- Word search on a grid with backtracking; the interviewer questioned using a set for visited cells.
- Pair array elements for the largest total, first counting pairs, then returning them; the story was long, so clarify first.
- Course schedule with DFS and Kahn's algorithm; follow-up with travel times between classrooms, which led to questions on how Dijkstra, Bellman-Ford and binary heaps work inside.
Stage 3: Technical round 2
At a glance
- Length: about an hour, no introduction
- Questions per round: 2, one of them hard
- What was asked: multi-source BFS, linked lists, tree traversal, matrix search
- Most common: rotting oranges
What interns were asked: rotting oranges (put every rotten cell in the queue first); reverse a linked list in groups of k (hard); vertical order traversal of a binary tree; search a sorted 2D matrix from the top-right corner.
The Codinzhub Next-Round Playbook
- Be ready to explain how the algorithms you use work inside, not only how to call them.
- Practise writing clean pseudocode by hand.
About this guide
This guide is researched and written by the Codinzhub team from questions and experiences students shared on Codinzhub and in public interview write-ups, rewritten in our own words. Practice links open the full question on Codinzhub. Interviewed for this role? Share your experience on Codinzhub and we will update the guide.
Keep track of what you’ve learned.