Flipkart
93 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 45. Jump Game II | Medium | 52% | TopicsArrayDynamic ProgrammingGreedy |
| 4. Median of Two Sorted Arrays | Hard | 42.5% | TopicsArrayBinary SearchDivide and Conquer |
| 124. Binary Tree Maximum Path Sum | Hard | 42.5% | TopicsDynamic ProgrammingTreeDepth-First SearchBinary TreeDP on Trees |
| Dungeon Game | Hard | 42.5% | TopicsArrayDynamic ProgrammingMatrix |
| 200. Number of Islands | Medium | 42.5% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| 560. Subarray Sum Equals K | Medium | 42.5% | TopicsArrayHash TablePrefix Sum |
| Smallest Range Covering Elements from K Lists | Hard | 42.5% | TopicsArrayHash TableGreedySliding WindowSortingHeap (Priority Queue) |
| 662. Maximum Width of Binary Tree | Medium | 42.5% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| Cherry Pickup | Hard | 42.5% | TopicsArrayDynamic ProgrammingMatrix |
| 934. Shortest Bridge | Medium | 42.5% | TopicsArrayDepth-First SearchBreadth-First SearchMatrix |
| 1011. Capacity To Ship Packages Within D Days | Medium | 42.5% | TopicsArrayBinary Search |
| 1094. Car Pooling | Medium | 42.5% | TopicsArraySortingHeap (Priority Queue)SimulationPrefix Sum |
| 75. Sort Colors | Medium | 42.5% | TopicsArrayTwo PointersSortingQuicksortBubble Sort |
| 48. Rotate Image | Medium | 42.5% | TopicsArrayMathMatrix |
| Delete Node in a BST | Medium | 42.5% | TopicsTreeBinary Search TreeBinary Tree |
| 2750. Ways to Split Array Into Good Subarrays | Medium | 42.5% | TopicsArrayMathDynamic Programming |
| Evaluate Division | Medium | 42.5% | TopicsArrayStringDepth-First SearchBreadth-First SearchUnion-FindGraph TheoryShortest PathBellman–Ford AlgorithmFloyd–Warshall Algorithm |
| 3Sum Closest | Medium | 42.5% | TopicsArrayTwo PointersSorting |
| 210. Course Schedule II | Medium | 42.5% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort |
| 895. Maximum Frequency Stack | Hard | 42.5% | TopicsHash TableStackDesignOrdered Set |
| 1552. Magnetic Force Between Two Balls | Medium | 42.5% | TopicsArrayBinary SearchSorting |
| 451. Sort Characters By Frequency | Medium | 42.5% | TopicsHash TableStringSortingHeap (Priority Queue)Bucket SortCounting |
| Find Leaves of Binary Tree | Medium | 42.5% | TopicsTreeDepth-First SearchBinary TreeDP on Trees |
| Find K Closest Elements | Medium | 42.5% | TopicsArrayTwo PointersBinary SearchSliding WindowSortingHeap (Priority Queue) |
| Number of Atoms | Hard | 42.5% | TopicsHash TableStringStackSorting |
