Jobra
🐞Step 1 of Jobra:AI Debugging Rounds
DSA+AIPreparing you for both.
JOBRA · AI DEBUG ROUND (PREVIEW)sum.cpp
// buggy snippet
int total(vector<int>& a, int n) {
    int sum = 0;
    for (int i = 0; i <= n; i++) { // 🐞        sum += a[i];
    }
    return sum;
}
A real codebase. A real bug. You + AI.

Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.

Prompt:Correct the loop condition
Tap 'Let Jobra fix it' below to simulate AI debugging...

Flipkart SDE 1 Campus Interview Guide: Two Back-to-Back DSA Rounds, From an IIT BHU Experience

5 min read

Prepare for Flipkart software engineer interviews with reported assessment patterns, interview questions, and preparation advice.

In this article
On this page

Last reviewed November 16, 2026.

For students interviewing for SDE 1.

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 hires freshers on campus as SDE 1. After a coding test, students face DSA interview rounds with three questions each, often with pseudocode first, then working code against test cases the interviewer loads into the editor. Interviewers push for the optimal solution and then extend the problem (repeat it k times, with no extra space). Time is the real enemy: plan to finish each question in about 12 minutes.

How this guide was built. One IIT BHU student shared their full SDE 1 interview on Codinzhub this season. Where their report does not cover a stage, we used the Codinzhub team's research into Flipkart's campus process and mark it.

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

What to expect. From our research: SDE 1 candidates take an online coding test before interviews. Flipkart hires a large campus batch each year (several hundred SDEs), so the test is the main filter.

Stage 2: Technical round 1

At a glance

  • Length: about an hour
  • Questions per round: 3, after a short introduction
  • What was asked: two pointers, picking from both ends of an array, reordering by indexes
  • Most common: brute force first, then the optimal version

What the IIT BHU student was asked:

  1. Squares of a sorted array (with negatives), returned sorted. Write pseudocode only. Use two pointers from both ends.
  2. Pick exactly k elements from the two ends of an array to get the largest sum. They gave an O(2^k) recursion first and were asked to optimise. The O(k) answer: take all k from the left, then slide one at a time to the right.
  3. Reorder an array according to a given index array, using no extra space. They explained the constant-space idea and were not asked to code it. Follow-up: repeat the reordering k times, still with no extra space. Time ran out with only two minutes to think.

Stage 3: Technical round 2

At a glance

  • Length: about an hour, with no introduction
  • Questions per round: 3
  • What was asked: binary search, heaps, hashing
  • Most common: working code that must pass loaded test cases

What the IIT BHU student was asked:

  1. Row with the most 1s in a sorted 0-1 matrix. They gave three approaches: O(m·n), binary search per row in O(m log n), and the O(m + n) staircase walk. The interviewer then switched to first and last position of a value in a sorted array and wanted working code that passed test cases loaded into the IDE.
  2. Sliding window median. Brute force O(n·k log k) first, then two heaps (max-heap left, min-heap right) with lazy deletion for O(n log k). Explaining the approach was enough.
  3. Group strings and design an integer hash that gives every group a unique value. A string key was not accepted. Their answer, mapping each letter to a prime and multiplying, did not fully satisfy the interviewer.

Earlier Flipkart campus drives

What to expect. Students from earlier drives describe the same shape, which helps fill in the stages above.

  • Coding test: 2 or 3 questions in 90 minutes on HackerRank. One drive had a counting formula question, an array question where brute force passed 7 of 11 tests, and a maze-style "Marathon" question. In that drive, 22 of 150 students were shortlisted and 10 waitlisted. Another had a doubling-value walk through an array (watch for overflow) and a memoised recursion question.
  • Technical 1 (easy): three short questions such as the missing number in 1 to N in better than O(n log n). Most who solved all three moved on.
  • Technical 2 (hard): the sum of minimums of all subarrays (monotonic stack, O(n)), a top-k problem solved with a min-heap, and a matrix problem. Interviewers gave hints. Another drive asked to reverse the vowels in each word and to find the k nearest sellers to a Flipkart warehouse (heap; know why heapify is O(n)).
  • Hiring manager: a relaxed 1 to 1.5 hours on projects, college life, strengths and weaknesses, where you see yourself in five years, and why Flipkart. In one drive, 9 of 12 finalists got a 6-month internship plus full-time offer.

Stage 4: Later rounds

What to expect. From our research: Flipkart's SDE loop often adds a machine coding round (build a small working system in about 90 minutes, judged on clean, extensible code) or a design round, then an HR round. Confirm with your placement cell which rounds your drive has.

More from Codinzhub: every college and every year

These are the other 10 questions and experiences for this role on Codinzhub, from all colleges and drives, newest first.

Question or experienceCollege or driveTypePosted
Next Lexicographical PermutationIITOA question2026-11-02
Count Ways to Split a Complete Graph into K Connected ComponentsNot statedOA question2026-10-19
Maximum Distance to Celebrate ChristmasNot statedOA question2026-10-18
Alphabetical Position TransformationNot statedOA question2026-10-18
Flipkart SDE 1 Interview ExperienceIIT BHU 2026Interview experience2026-10-16
Select Cities for a Storage FacilityIndian Institute of TechnologyOA question2026-09-14
Flipkart Online AssessmentNITOA question2026-09-09
Subset Sum with Exact Subset SizeIIIT BhubaneswarOA question2026-08-04
Priority Queue Removal SumIIIT BhubaneswarOA question2026-08-04
Find the Missing VariableIIIT BhubaneswarOA question2026-08-04

Topics to prioritise

Two pointers, prefix and suffix sums, binary search, heaps, in-place array tricks and hashing, plus clean object-oriented code for a possible machine coding round.

The Codinzhub Next-Round Playbook

  • Say the brute force in one line, then go straight to the optimal one; time is short.
  • Practise writing code that compiles first time; test cases get run live.
  • For every array problem, ask yourself the follow-up: can I do it in place, or k times?
  • Prepare one integer hashing idea (for example, polynomial hashing of letter counts) before the interview.

FAQ

Do I need to code every question?

No. Some questions only needed pseudocode or an explained approach; others needed passing code.

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.

Ready for the next topic?

Keep track of what you’ve learned.