Flipkart coding interview
questions, leaked.
111 problems reported across recent Flipkart interviews. Top patterns: array, dynamic programming, greedy. The list below is what most candidates actually saw, plus the honest play if you can't grind all of it.
Flipkart's coding assessment hits you with 111 problems across all difficulty bands, but 68 of them are medium. Arrays dominate at 85 problems, followed by dynamic programming (29) and a cluster of greedy, sorting, and hash-table patterns. You're looking at a gauntlet of two-pointer work, sliding windows, and prefix sums mixed with heap operations and graph traversal. If you blank on a two-pointer or monotonic-stack pattern mid-assessment, StealthCoder surfaces a working solution in seconds while the proctor sees nothing. The real prep is drilling array manipulations first, then locking down DP and greedy strategies.
Top problems at Flipkart
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Transform Array to All Equal Elements | MEDIUM | 0.0 | 32% | Array · Greedy |
| 02 | Smallest Range Covering Elements from K Lists | HARD | 100.0 | 70% | Array · Hash Table · Greedy |
| 03 | Shortest Bridge | MEDIUM | 97.5 | 59% | Array · Depth-First Search · Breadth-First Search |
| 04 | Trapping Rain Water | HARD | 94.7 | 65% | Array · Two Pointers · Dynamic Programming |
| 05 | Maximum Points You Can Obtain from Cards | MEDIUM | 93.2 | 56% | Array · Sliding Window · Prefix Sum |
| 06 | Minimum Number of Coins to be Added | MEDIUM | 83.9 | 57% | Array · Greedy · Sorting |
| 07 | Design Movie Rental System | HARD | 83.9 | 36% | Array · Hash Table · Design |
| 08 | Capacity To Ship Packages Within D Days | MEDIUM | 81.5 | 72% | Array · Binary Search |
| 09 | Numbers With Same Consecutive Differences | MEDIUM | 81.5 | 59% | Backtracking · Breadth-First Search |
| 10 | Triples with Bitwise AND Equal To Zero | HARD | 81.5 | 59% | Array · Hash Table · Bit Manipulation |
| 11 | The Score of Students Solving Math Expression | HARD | 81.5 | 33% | Array · Math · String |
| 12 | Minimum Cost to Reach City With Discounts | MEDIUM | 81.5 | 60% | Graph · Heap (Priority Queue) · Shortest Path |
| 13 | Minimum Limit of Balls in a Bag | MEDIUM | 81.5 | 67% | Array · Binary Search |
| 14 | Minimum Total Cost to Make Arrays Unequal | HARD | 78.9 | 41% | Array · Hash Table · Greedy |
| 15 | Container With Most Water | MEDIUM | 78.9 | 58% | Array · Two Pointers · Greedy |
| 16 | Koko Eating Bananas | MEDIUM | 75.9 | 49% | Array · Binary Search |
| 17 | Longest Substring Without Repeating Characters | MEDIUM | 75.9 | 37% | Hash Table · String · Sliding Window |
| 18 | Asteroid Collision | MEDIUM | 75.9 | 46% | Array · Stack · Simulation |
| 19 | Binary Tree Maximum Path Sum | HARD | 75.9 | 41% | Dynamic Programming · Tree · Depth-First Search |
| 20 | Cherry Pickup II | HARD | 72.6 | 72% | Array · Dynamic Programming · Matrix |
| 21 | Minimum Adjacent Swaps for K Consecutive Ones | HARD | 72.6 | 42% | Array · Greedy · Sliding Window |
| 22 | Two Sum | EASY | 68.8 | 56% | Array · Hash Table |
| 23 | Strong Password Checker | HARD | 68.8 | 15% | String · Greedy · Heap (Priority Queue) |
| 24 | Create Maximum Number | HARD | 68.8 | 32% | Array · Two Pointers · Stack |
| 25 | Product of Array Except Self | MEDIUM | 68.8 | 68% | Array · Prefix Sum |
| 26 | Gas Station | MEDIUM | 64.2 | 46% | Array · Greedy |
| 27 | Course Schedule | MEDIUM | 64.2 | 49% | Depth-First Search · Breadth-First Search · Graph |
| 28 | Number of Islands | MEDIUM | 64.2 | 62% | Array · Depth-First Search · Breadth-First Search |
| 29 | Rotting Oranges | MEDIUM | 64.2 | 57% | Array · Breadth-First Search · Matrix |
| 30 | Maximum Profit in Job Scheduling | HARD | 64.2 | 54% | Array · Binary Search · Dynamic Programming |
| 31 | Edit Distance | MEDIUM | 58.7 | 59% | String · Dynamic Programming |
| 32 | Sort Colors | MEDIUM | 58.7 | 68% | Array · Two Pointers · Sorting |
| 33 | Subarray Sum Equals K | MEDIUM | 58.7 | 45% | Array · Hash Table · Prefix Sum |
| 34 | Partition Equal Subset Sum | MEDIUM | 58.7 | 48% | Array · Dynamic Programming |
| 35 | Merge Two Sorted Lists | EASY | 58.7 | 67% | Linked List · Recursion |
| 36 | Dungeon Game | HARD | 58.7 | 39% | Array · Dynamic Programming · Matrix |
| 37 | Find K-th Smallest Pair Distance | HARD | 58.7 | 46% | Array · Two Pointers · Binary Search |
| 38 | Largest Rectangle in Histogram | HARD | 58.7 | 47% | Array · Stack · Monotonic Stack |
| 39 | Binary Tree Zigzag Level Order Traversal | MEDIUM | 58.7 | 62% | Tree · Breadth-First Search · Binary Tree |
| 40 | Decode Ways | MEDIUM | 58.7 | 37% | String · Dynamic Programming |
| 41 | Median of Two Sorted Arrays | HARD | 58.7 | 44% | Array · Binary Search · Divide and Conquer |
| 42 | Maximum Width of Binary Tree | MEDIUM | 58.7 | 44% | Tree · Depth-First Search · Breadth-First Search |
| 43 | First Missing Positive | HARD | 58.7 | 41% | Array · Hash Table |
| 44 | Burst Balloons | HARD | 58.7 | 61% | Array · Dynamic Programming |
| 45 | Maximum Performance of a Team | HARD | 51.6 | 48% | Array · Greedy · Sorting |
| 46 | Search in Rotated Sorted Array | MEDIUM | 51.6 | 43% | Array · Binary Search |
| 47 | Cut Off Trees for Golf Event | HARD | 51.6 | 35% | Array · Breadth-First Search · Heap (Priority Queue) |
| 48 | Lowest Common Ancestor of a Binary Tree | MEDIUM | 51.6 | 67% | Tree · Depth-First Search · Binary Tree |
| 49 | Number of Students Unable to Eat Lunch | EASY | 51.6 | 79% | Array · Stack · Queue |
| 50 | Open the Lock | MEDIUM | 51.6 | 61% | Array · Hash Table · String |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Flipkart OA. The proctor cannot see it. Screen share cannot detect it. Built by a senior engineer who knows the OA is theater. This is the script.
Get StealthCoder- array85 · 77%
- dynamic programming29 · 26%
- greedy21 · 19%
- sorting21 · 19%
- hash table21 · 19%
- breadth first search17 · 15%
- depth first search16 · 14%
- heap priority queue16 · 14%
- string13 · 12%
- stack12 · 11%
Arrays are the spine of Flipkart's assessment. Problems like Trapping Rain Water, Maximum Points You Can Obtain from Cards, and Smallest Range Covering Elements from K Lists show they test array mastery at every level. Dynamic programming appears in nearly a third of reported problems, so don't skip it. Greedy and sorting are frequent enough that you'll see them multiple times. Hash tables and heaps cluster together in harder problems, especially design-flavored ones like Design Movie Rental System. Breadth-first search and depth-first search each appear around 15 times, so matrix traversal matters. If you're under time pressure and hit a pattern you haven't drilled, StealthCoder is your safety net during the live assessment. Focus first on array and DP, then greedy and hash-table combos.
Companies with similar patterns
If you prepped for Flipkart, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Flipkart.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by a senior engineer who knows the OA is theater. This is the script. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Flipkart interview FAQ
Should I prioritize array problems for Flipkart?+
Yes. Arrays appear in 85 of 111 problems reported. Start with two-pointer, sliding window, and prefix-sum variants. Trapping Rain Water and Maximum Points You Can Obtain from Cards are representative hard and medium examples. Array fundamentals unlock 75% of what they'll test.
How much dynamic programming do I need to know?+
DP appears in 29 problems, roughly a quarter of the test. It's not optional. Expect it mixed with arrays and strings. The Score of Students Solving Math Expression and Trapping Rain Water both fold DP into larger patterns. You need both textbook DP and how it combines with other techniques.
Is greedy understanding critical for Flipkart?+
Greedy appears in 21 problems and often overlaps with arrays and sorting. Transform Array to All Equal Elements and Minimum Number of Coins to be Added are typical examples. It's a supporting skill, not primary, but shows up enough that skipping it costs you points.
What's the hardest topic area in their assessment?+
Hard problems (33 total) cluster around design, heap operations, and multi-technique mashups. Smallest Range Covering Elements from K Lists combines array, hash table, greedy, sorting, and heap. Hard doesn't mean one skill; it means juggling five at once. Heap and hash-table strength helps.
How many easy problems should I expect?+
Only 10 of 111 are easy. Don't waste prep time there. The assessment is 61% medium and 30% hard. Your score lives or dies on medium execution and partial hard credit. Drill medium array and DP problems until they're reflexive.