Snap
83 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Game of Life | Medium | 79.5% | TopicsArrayMatrixSimulation |
| 312. Burst Balloons | Hard | 79.5% | TopicsArrayDynamic Programming |
| Binary Tree Vertical Order Traversal | Medium | 79.5% | TopicsHash TableTreeDepth-First SearchBreadth-First SearchSortingBinary Tree |
| 347. Top K Frequent Elements | Medium | 79.5% | TopicsArrayHash TableDivide and ConquerSortingHeap (Priority Queue)Bucket SortCountingQuickselect |
| 377. Combination Sum IV | Medium | 79.5% | TopicsArrayDynamic Programming |
| 402. Remove K Digits | Medium | 79.5% | TopicsStringStackGreedyMonotonic Stack |
| Frog Jump | Hard | 79.5% | TopicsArrayDynamic Programming |
| Ternary Expression Parser | Medium | 79.5% | TopicsStringStackRecursion |
| 443. String Compression | Medium | 79.5% | TopicsTwo PointersString |
| Word Abbreviation | Hard | 79.5% | TopicsArrayStringGreedyTrieSorting |
| 1754. Largest Merge Of Two Strings | Medium | 79.5% | TopicsTwo PointersStringGreedy |
| 964. Least Operators to Express Number | Hard | 79.5% | TopicsMathDynamic ProgrammingMemoization |
| Best Time to Buy and Sell Stock III | Hard | 67.6% | TopicsArrayDynamic Programming |
| Evaluate Division | Medium | 67.6% | TopicsArrayStringDepth-First SearchBreadth-First SearchUnion-FindGraph TheoryShortest PathBellman–Ford AlgorithmFloyd–Warshall Algorithm |
| 91. Decode Ways | Medium | 67.6% | TopicsStringDynamic Programming |
| Best Meeting Point | Hard | 67.6% | TopicsArrayMathSortingMatrix |
| 2258. Escape the Spreading Fire | Hard | 67.6% | TopicsArrayBinary SearchBreadth-First SearchMatrix |
| 56. Merge Intervals | Medium | 62% | TopicsArraySortingQuicksort |
| 79. Word Search | Medium | 62% | TopicsArrayStringBacktrackingDepth-First SearchMatrix |
| 1249. Minimum Remove to Make Valid Parentheses | Medium | 62% | TopicsStringStack |
| Basic Calculator III | Hard | 62% | TopicsMathStringStackRecursion |
| Basic Calculator | Hard | 62% | TopicsMathStringStackRecursion |
| 2316. Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | 62% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| 207. Course Schedule | Medium | 54.8% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryTopological SortDirected Acyclic Graph |
| 231. Power of Two | Easy | 54.8% | TopicsMathBit ManipulationRecursion |
