Snowflake
100 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 10. Regular Expression Matching | Hard | 47.6% | TopicsStringDynamic ProgrammingRecursion |
| 787. Cheapest Flights Within K Stops | Medium | 47.6% | TopicsDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)Shortest Path |
| 2265. Count Nodes Equal to Average of Subtree | Medium | 47.6% | TopicsTreeDepth-First SearchBinary Tree |
| Longest Univalue Path | Medium | 47.6% | TopicsTreeDepth-First SearchBinary TreeDP on Trees |
| 13. Roman to Integer | Easy | 47.6% | TopicsHash TableMathString |
| 827. Making A Large Island | Hard | 47.6% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| 917. Reverse Only Letters | Easy | 47.6% | TopicsTwo PointersString |
| 947. Most Stones Removed with Same Row or Column | Medium | 47.6% | TopicsHash TableDepth-First SearchUnion-FindGraph TheoryBipartite Graph |
| 841. Keys and Rooms | Medium | 47.6% | TopicsDepth-First SearchBreadth-First SearchGraph Theory |
| 1166. Design File System | Medium | 47.6% | TopicsHash TableStringDesignTrie |
| 994. Rotting Oranges | Medium | 47.6% | TopicsArrayBreadth-First SearchMatrix |
| 1494. Parallel Courses II | Hard | 47.6% | TopicsDynamic ProgrammingBit ManipulationGraph TheoryBitmaskDirected Acyclic Graph |
| Campus Bikes | Medium | 47.6% | TopicsArraySortingHeap (Priority Queue) |
| 261. Graph Valid Tree | Medium | 47.6% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| 3092. Most Frequent IDs | Medium | 47.6% | TopicsArrayHash TableHeap (Priority Queue)Ordered Set |
| Populating Next Right Pointers in Each Node | Medium | 38.6% | TopicsLinked ListTreeDepth-First SearchBreadth-First SearchBinary Tree |
| Populating Next Right Pointers in Each Node II | Medium | 38.6% | TopicsLinked ListTreeDepth-First SearchBreadth-First SearchBinary Tree |
| Basic Calculator II | Medium | 38.6% | TopicsMathStringStack |
| Meeting Rooms II | Medium | 38.6% | TopicsArrayTwo PointersGreedySortingHeap (Priority Queue)Prefix Sum |
| Encode and Decode Strings | Medium | 38.6% | TopicsArrayStringDesign |
| Integer to English Words | Hard | 38.6% | TopicsMathStringRecursion |
| 295. Find Median from Data Stream | Hard | 38.6% | TopicsTwo PointersDesignSortingHeap (Priority Queue)Data Stream |
| 105. Construct Binary Tree from Preorder and Inorder Traversal | Medium | 38.6% | TopicsArrayHash TableDivide and ConquerTreeBinary Tree |
| 2467. Most Profitable Path in a Tree | Medium | 38.6% | TopicsArrayTreeDepth-First SearchBreadth-First SearchGraph Theory |
| N-Queens II | Hard | 38.6% | TopicsBacktrackingAlgorithm X |
