Meta
1396 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Leftmost Column with at Least a One | Medium | 24.3% | TopicsArrayBinary SearchMatrixInteractive |
| 1344. Angle Between Hands of a Clock | Medium | 24.3% | TopicsMath |
| 1357. Apply Discount Every n Orders | Medium | 24.3% | TopicsArrayHash TableDesign |
| 1358. Number of Substrings Containing All Three Characters | Medium | 24.3% | TopicsHash TableStringSliding Window |
| 1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows | Hard | 24.3% | TopicsArrayBinary SearchHeap (Priority Queue)Matrix |
| Binary Search Tree Iterator II | Medium | 24.3% | TopicsStackTreeDesignBinary Search TreeBinary TreeIterator |
| 1718. Construct the Lexicographically Largest Valid Sequence | Medium | 24.3% | TopicsArrayBacktracking |
| 1773. Count Items Matching a Rule | Easy | 24.3% | TopicsArrayString |
| 1976. Number of Ways to Arrive at Destination | Medium | 24.3% | TopicsDynamic ProgrammingGraph TheoryTopological SortShortest PathDijkstra's Algorithm |
| 2553. Separate the Digits in an Array | Easy | 24.3% | TopicsArraySimulation |
| Customers Who Bought All Products | Medium | 24.3% | TopicsDatabase |
| Count Complete Tree Nodes | Medium | 24.3% | TopicsBinary SearchBit ManipulationTreeBinary Tree |
| 856. Score of Parentheses | Medium | 24.3% | TopicsStringStackBracket Sequences |
| 1283. Find the Smallest Divisor Given a Threshold | Medium | 24.3% | TopicsArrayBinary Search |
| 980. Unique Paths III | Hard | 24.3% | TopicsArrayBacktrackingBit ManipulationMatrixHamiltonian Path |
| Coin Change II | Medium | 24.3% | TopicsArrayDynamic ProgrammingKnapsack ProblemComplete Knapsack |
| 3636. Threshold Majority Queries | Hard | 24.3% | TopicsArrayHash TableBinary SearchDivide and ConquerCountingPrefix Sum |
| 3650. Minimum Cost Path with Edge Reversals | Medium | 24.3% | TopicsGraph TheoryHeap (Priority Queue)Shortest Path |
| 63. Unique Paths II | Medium | 22.3% | TopicsArrayDynamic ProgrammingMatrix |
| 93. Restore IP Addresses | Medium | 22.3% | TopicsStringBacktracking |
| Linked List Cycle II | Medium | 22.3% | TopicsHash TableLinked ListTwo PointersFloyd's Cycle Finding Algorithm |
| 144. Binary Tree Preorder Traversal | Easy | 22.3% | TopicsStackTreeDepth-First SearchBinary Tree |
| Read N Characters Given read4 II - Call Multiple Times | Hard | 22.3% | TopicsArraySimulationInteractive |
| 191. Number of 1 Bits | Easy | 22.3% | TopicsDivide and ConquerBit Manipulation |
| 228. Summary Ranges | Easy | 22.3% | TopicsArray |
