109 curated coding interview questions directly asked in Flipkart technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 100.0% | 30d |
| 417 | Pacific Atlantic Water Flow | Medium | Core DSA | Implementation / Reasoning | 61.0% | 100.0% | 6m |
| 503 | Next Greater Element II | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.4% | 87.5% | 6m |
| 1423 | Maximum Points You Can Obtain from Cards | Medium | Arrays | Sorting / Prefix / Scan | 57.7% | 87.5% | 6m |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 87.5% | 6m |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 87.5% | 6m |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 87.5% | 6m |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 87.5% | all |
| 2019 | The Score of Students Solving Math Expression | Hard | Core DSA | Implementation / Reasoning | 34.3% | 87.5% | all |
| 2093 | Minimum Cost to Reach City With Discounts | Medium | Arrays | Sorting / Prefix / Scan | 61.0% | 87.5% | all |
| 967 | Numbers With Same Consecutive Differences | Medium | Core DSA | Implementation / Reasoning | 59.2% | 87.5% | all |
| 982 | Triples with Bitwise AND Equal To Zero | Hard | Core DSA | Implementation / Reasoning | 60.0% | 87.5% | all |
| 2952 | Minimum Number of Coins to be Added | Medium | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 58.2% | 87.5% | all |
| 1760 | Minimum Limit of Balls in a Bag | Medium | Arrays | Sorting / Prefix / Scan | 66.3% | 87.5% | all |
| 1912 | Design Movie Rental System | Hard | Design | Data Structure Design | 62.2% | 87.5% | all |
| 3576 | Transform Array to All Equal Elements | Medium | Arrays | Sorting / Prefix / Scan | 33.3% | 87.5% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 75.0% | all |
| 84 | Largest Rectangle in Histogram | Hard | Core DSA | Implementation / Reasoning | 49.9% | 75.0% | all |
| 735 | Asteroid Collision | Medium | Core DSA | Implementation / Reasoning | 47.9% | 75.0% | all |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 75.0% | all |
| 134 | Gas Station | Medium | Greedy | Greedy | 48.0% | 75.0% | all |
| 3663 | Find The Least Frequent Digit | Easy | Core DSA | Implementation / Reasoning | 69.8% | 75.0% | all |
| 174 | Dungeon Game | Hard | Core DSA | Implementation / Reasoning | 41.4% | 62.5% | all |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 62.5% | all |
| 321 | Create Maximum Number | Hard | Arrays | Sorting / Prefix / Scan | 35.5% | 62.5% | all |
| 1463 | Cherry Pickup II | Hard | Core DSA | Implementation / Reasoning | 72.4% | 62.5% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 62.5% | all |
| 675 | Cut Off Trees for Golf Event | Hard | Trees | DFS / BFS | 36.4% | 62.5% | all |
| 1383 | Maximum Performance of a Team | Hard | Arrays | Sorting / Prefix / Scan | 47.8% | 62.5% | all |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 62.5% | all |
| 1190 | Reverse Substrings Between Each Pair of Parentheses | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.0% | 62.5% | all |
| 907 | Sum of Subarray Minimums | Medium | Arrays | Sorting / Prefix / Scan | 38.6% | 62.5% | all |
| 31 | Next Permutation | Medium | Backtracking | Backtracking | 45.3% | 62.5% | all |
| 850 | Rectangle Area II | Hard | Core DSA | Implementation / Reasoning | 56.1% | 62.5% | all |
| 749 | Contain Virus | Hard | Core DSA | Implementation / Reasoning | 54.9% | 62.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 50.0% | all |
| 72 | Edit Distance | Medium | Dynamic Programming | State Transition | 60.6% | 50.0% | all |
| 2385 | Amount of Time for Binary Tree to Be Infected | Medium | Trees | DFS / BFS | 65.4% | 50.0% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 50.0% | all |
| 662 | Maximum Width of Binary Tree | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 45.6% | 50.0% | all |
| 939 | Minimum Area Rectangle | Medium | Arrays | Sorting / Prefix / Scan | 55.4% | 50.0% | all |
| 1011 | Capacity To Ship Packages Within D Days | Medium | Binary Search | Binary Search | 73.9% | 50.0% | all |
| 1094 | Car Pooling | Medium | Core DSA | Implementation / Reasoning | 56.4% | 50.0% | all |
| 135 | Candy | Hard | Core DSA | Implementation / Reasoning | 48.5% | 50.0% | all |
| 496 | Next Greater Element I | Easy | Stack / Queue | Monotonic Stack / Simulation | 76.1% | 50.0% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 50.0% | all |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 50.0% | all |
| 399 | Evaluate Division | Medium | Core DSA | Implementation / Reasoning | 64.2% | 50.0% | all |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 50.0% | all |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 50.0% | all |
| 62 | Unique Paths | Medium | Core DSA | Implementation / Reasoning | 66.8% | 50.0% | all |
| 1192 | Critical Connections in a Network | Hard | Graphs | BFS / DFS / Topological Sort | 59.7% | 50.0% | all |
| 787 | Cheapest Flights Within K Stops | Medium | Heap | Priority Queue | 41.8% | 50.0% | all |
| 407 | Trapping Rain Water II | Hard | Core DSA | Two Pointers | 64.1% | 50.0% | all |
| 221 | Maximal Square | Medium | Core DSA | Implementation / Reasoning | 50.3% | 50.0% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 37.5% | all |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 37.5% | all |
| 85 | Maximal Rectangle | Hard | Core DSA | Implementation / Reasoning | 58.8% | 37.5% | all |
| 124 | Binary Tree Maximum Path Sum | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 42.3% | 37.5% | all |
| 162 | Find Peak Element | Medium | Binary Search | Binary Search | 47.0% | 37.5% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 37.5% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 37.5% | all |
| 416 | Partition Equal Subset Sum | Medium | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 49.5% | 37.5% | all |
| 542 | 01 Matrix | Medium | Arrays | Sorting / Prefix / Scan | 53.9% | 37.5% | all |
| 632 | Smallest Range Covering Elements from K Lists | Hard | Linked List | Two Pointers | 70.1% | 37.5% | all |
| 741 | Cherry Pickup | Hard | Core DSA | Implementation / Reasoning | 39.5% | 37.5% | all |
| 934 | Shortest Bridge | Medium | Core DSA | Implementation / Reasoning | 59.5% | 37.5% | all |
| 1235 | Maximum Profit in Job Scheduling | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 37.5% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 37.5% | all |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 37.5% | all |
| 863 | All Nodes Distance K in Binary Tree | Medium | Trees | DFS / BFS | 67.7% | 37.5% | all |
| 1105 | Filling Bookcase Shelves | Medium | Core DSA | Implementation / Reasoning | 68.6% | 37.5% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 37.5% | all |
| 424 | Longest Repeating Character Replacement | Medium | Strings | Hashing / Sliding Window | 59.7% | 37.5% | all |
| 113 | Path Sum II | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 62.2% | 37.5% | all |
| 332 | Reconstruct Itinerary | Hard | Core DSA | Implementation / Reasoning | 44.6% | 37.5% | all |
| 669 | Trim a Binary Search Tree | Medium | Trees; Binary Search | DFS / BFS; Binary Search | 66.7% | 37.5% | all |
| 153 | Find Minimum in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 54.7% | 37.5% | all |
| 450 | Delete Node in a BST | Medium | Trees | DFS / BFS | 54.7% | 37.5% | all |
| 2750 | Ways to Split Array Into Good Subarrays | Medium | Arrays | Sorting / Prefix / Scan | 35.1% | 37.5% | all |
| 1482 | Minimum Number of Days to Make m Bouquets | Medium | Arrays | Sorting / Prefix / Scan | 56.6% | 37.5% | all |
| 16 | 3Sum Closest | Medium | Arrays | Sorting / Prefix / Scan | 48.6% | 37.5% | all |
| 373 | Find K Pairs with Smallest Sums | Medium | Arrays | Sorting / Prefix / Scan | 41.9% | 37.5% | all |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 37.5% | all |
| 222 | Count Complete Tree Nodes | Easy | Trees | DFS / BFS | 72.6% | 37.5% | all |
| 895 | Maximum Frequency Stack | Hard | Arrays; Stack / Queue | Sorting / Prefix / Scan; Monotonic Stack / Simulation | 66.8% | 37.5% | all |
| 1552 | Magnetic Force Between Two Balls | Medium | Core DSA | Implementation / Reasoning | 72.1% | 37.5% | all |
| 2751 | Robot Collisions | Hard | Core DSA | Implementation / Reasoning | 61.6% | 37.5% | all |
| 451 | Sort Characters By Frequency | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 75.3% | 37.5% | all |
| 881 | Boats to Save People | Medium | Core DSA | Implementation / Reasoning | 61.8% | 37.5% | all |
| 366 | Find Leaves of Binary Tree | Medium | Trees | DFS / BFS | 81.3% | 37.5% | all |
| 658 | Find K Closest Elements | Medium | Core DSA | Implementation / Reasoning | 49.7% | 37.5% | all |
| 540 | Single Element in a Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 59.3% | 37.5% | all |
| 726 | Number of Atoms | Hard | Core DSA | Implementation / Reasoning | 65.1% | 37.5% | all |
| 297 | Serialize and Deserialize Binary Tree | Hard | Trees; Design | DFS / BFS; Data Structure Design | 60.8% | 37.5% | all |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 37.5% | all |
| 1584 | Min Cost to Connect All Points | Medium | Core DSA | Implementation / Reasoning | 70.9% | 37.5% | all |
| 91 | Decode Ways | Medium | Dynamic Programming | State Transition | 38.0% | 37.5% | all |
| 287 | Find the Duplicate Number | Medium | Arrays | Sorting / Prefix / Scan | 64.3% | 37.5% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 37.5% | all |
| 32 | Longest Valid Parentheses | Hard | Strings | Hashing / Sliding Window | 38.8% | 37.5% | all |
| 543 | Diameter of Binary Tree | Easy | Trees | DFS / BFS | 65.5% | 37.5% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 37.5% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 37.5% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 37.5% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 37.5% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 37.5% | all |
| 911 | Online Election | Medium | Core DSA | Implementation / Reasoning | 52.9% | 37.5% | all |
| 78 | Subsets | Medium | Backtracking | Backtracking | 82.3% | 37.5% | all |