Meta
1396 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Apply Transform Over Each Element in Array | Easy | 8.5% | Topics— |
| Event Emitter | Medium | 8.5% | Topics— |
| 2962. Count Subarrays Where Max Element Appears at Least K Times | Medium | 8.5% | TopicsArraySliding Window |
| Ugly Number II | Medium | 8.5% | TopicsHash TableMathDynamic ProgrammingHeap (Priority Queue) |
| 2915. Length of the Longest Subsequence That Sums to Target | Medium | 8.5% | TopicsArrayDynamic ProgrammingKnapsack Problem0-1 Knapsack |
| 581. Shortest Unsorted Continuous Subarray | Medium | 8.5% | TopicsArrayTwo PointersStackGreedySortingMonotonic Stack |
| 1609. Even Odd Tree | Medium | 8.5% | TopicsTreeBreadth-First SearchBinary Tree |
| Split Linked List in Parts | Medium | 8.5% | TopicsLinked List |
| 374. Guess Number Higher or Lower | Easy | 8.5% | TopicsBinary SearchInteractive |
| 2058. Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium | 8.5% | TopicsLinked List |
| Scramble String | Hard | 8.5% | TopicsStringDynamic Programming |
| Max Stack | Hard | 8.5% | TopicsLinked ListStackDesignDoubly-Linked ListOrdered Set |
| 1221. Split a String in Balanced Strings | Easy | 8.5% | TopicsStringGreedyCounting |
| Smallest Range Covering Elements from K Lists | Hard | 8.5% | TopicsArrayHash TableGreedySliding WindowSortingHeap (Priority Queue) |
| Insert into a Binary Search Tree | Medium | 8.5% | TopicsTreeBinary Search TreeBinary Tree |
| 1639. Number of Ways to Form a Target String Given a Dictionary | Hard | 8.5% | TopicsArrayStringDynamic Programming |
| Add Two Promises | Easy | 8.5% | Topics— |
| The Maze II | Medium | 8.5% | TopicsArrayDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)MatrixShortest PathDijkstra's AlgorithmHeuristic SearchA* Search |
| 1760. Minimum Limit of Balls in a Bag | Medium | 8.5% | TopicsArrayBinary Search |
| Longest Substring with At Least K Repeating Characters | Medium | 8.5% | TopicsHash TableStringDivide and ConquerSliding Window |
| 2593. Find Score of an Array After Marking All Elements | Medium | 8.5% | TopicsArrayHash TableSortingHeap (Priority Queue)Simulation |
| Design Circular Deque | Medium | 8.5% | TopicsArrayLinked ListDesignQueue |
| Number Complement | Easy | 8.5% | TopicsBit Manipulation |
| My Calendar I | Medium | 8.5% | TopicsArrayBinary SearchDesignSegment TreeOrdered Set |
| 1886. Determine Whether Matrix Can Be Obtained By Rotation | Easy | 8.5% | TopicsArrayMatrix |
