Flipkart
93 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Maximal Square | Medium | 42.5% | TopicsArrayDynamic ProgrammingMatrix |
| 297. Serialize and Deserialize Binary Tree | Hard | 42.5% | TopicsStringTreeDepth-First SearchBreadth-First SearchDesignBinary Tree |
| 155. Min Stack | Medium | 42.5% | TopicsStackDesign |
| 91. Decode Ways | Medium | 42.5% | TopicsStringDynamic Programming |
| 287. Find the Duplicate Number | Medium | 42.5% | TopicsArrayTwo PointersBinary SearchBit ManipulationPigeonhole PrincipleFloyd's Cycle Finding Algorithm |
| 20. Valid Parentheses | Easy | 42.5% | TopicsStringStackBracket Sequences |
| 543. Diameter of Binary Tree | Easy | 42.5% | TopicsTreeDepth-First SearchBinary TreeDP on Trees |
| 146. LRU Cache | Medium | 42.5% | TopicsHash TableLinked ListDesignDoubly-Linked List |
| 78. Subsets | Medium | 42.5% | TopicsArrayBacktrackingBit Manipulation |
| Map Sum Pairs | Medium | 42.5% | TopicsHash TableStringDesignTrie |
| Split Array Largest Sum | Hard | 42.5% | TopicsArrayBinary SearchDynamic ProgrammingGreedyPrefix Sum |
| Russian Doll Envelopes | Hard | 42.5% | TopicsArrayBinary SearchDynamic ProgrammingSortingLongest Increasing Subsequence |
| 851. Loud and Rich | Medium | 42.5% | TopicsArrayDepth-First SearchGraph TheoryTopological SortDirected Acyclic Graph |
| 19. Remove Nth Node From End of List | Medium | 42.5% | TopicsLinked ListTwo Pointers |
| 55. Jump Game | Medium | 42.5% | TopicsArrayDynamic ProgrammingGreedy |
| 138. Copy List with Random Pointer | Medium | 42.5% | TopicsHash TableLinked List |
| 739. Daily Temperatures | Medium | 42.5% | TopicsArrayStackMonotonic Stack |
| 63. Unique Paths II | Medium | 42.5% | TopicsArrayDynamic ProgrammingMatrix |
