Meta
1396 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 3499. Maximize Active Section with Trade I | Medium | 15% | TopicsStringEnumeration |
| Binary Tree Level Order Traversal II | Medium | 11.9% | TopicsTreeBreadth-First SearchBinary Tree |
| Department Top Three Salaries | Hard | 11.9% | TopicsDatabase |
| 323. Number of Connected Components in an Undirected Graph | Medium | 11.9% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| 332. Reconstruct Itinerary | Hard | 11.9% | TopicsArrayStringDepth-First SearchGraph TheorySortingHeap (Priority Queue)Eulerian CircuitEulerian PathSemi-Eulerian Graph |
| 393. UTF-8 Validation | Medium | 11.9% | TopicsArrayBit Manipulation |
| Queue Reconstruction by Height | Medium | 11.9% | TopicsArrayBinary Indexed TreeSegment TreeSorting |
| Add Two Numbers II | Medium | 11.9% | TopicsLinked ListMathStack |
| Find Largest Value in Each Tree Row | Medium | 11.9% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| Array Partition | Easy | 11.9% | TopicsArrayGreedySortingCounting Sort |
| Dota2 Senate | Medium | 11.9% | TopicsStringGreedyQueue |
| 779. K-th Symbol in Grammar | Medium | 11.9% | TopicsMathBit ManipulationRecursion |
| Design HashSet | Easy | 11.9% | TopicsArrayHash TableLinked ListDesignHash Function |
| 819. Most Common Word | Easy | 11.9% | TopicsArrayHash TableStringCounting |
| 992. Subarrays with K Different Integers | Hard | 11.9% | TopicsArrayHash TableSliding WindowCounting |
| 993. Cousins in Binary Tree | Easy | 11.9% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 1028. Recover a Tree From Preorder Traversal | Hard | 11.9% | TopicsStringTreeDepth-First SearchBinary Tree |
| 1029. Two City Scheduling | Medium | 11.9% | TopicsArrayGreedySortingHungarian AlgorithmSuccessive Shortest Path Algorithm |
| 1095. Find in Mountain Array | Hard | 11.9% | TopicsArrayBinary SearchInteractiveTernary Search |
| 1305. All Elements in Two Binary Search Trees | Medium | 11.9% | TopicsTreeDepth-First SearchBinary Search TreeSortingBinary Tree |
| 1598. Crawler Log Folder | Easy | 11.9% | TopicsArrayStringStack |
| Primary Department for Each Employee | Easy | 11.9% | TopicsDatabase |
| 2060. Check if an Original String Exists Given Two Encoded Strings | Hard | 11.9% | TopicsStringDynamic Programming |
| Root Equals Sum of Children | Easy | 11.9% | TopicsTreeBinary Tree |
| 2302. Count Subarrays With Score Less Than K | Hard | 11.9% | TopicsArrayBinary SearchSliding WindowPrefix Sum |
