// practice ground
| # | Title | Topics | Difficulty |
|---|---|---|---|
| 926 | BST Floor Query |
Binary Search Tree
|
Medium |
| 927 | BST Ceiling Query |
Binary Search Tree
|
Medium |
| 928 | Delete Range from BST |
Binary Search Tree
Trees
|
Hard |
| 929 | Merge Two Binary Search Trees into Sorted List |
Binary Search Tree
Trees
|
Medium |
| 930 | Recover Swapped Heap |
Heaps / Priority Queue
|
Hard |
| 931 | Trie Prefix Deletion |
Trie
|
Medium |
| 932 | Trie Word Frequency Update |
Hashing
Trie
|
Medium |
| 933 | Auto Complete Top-K Suggestions |
Heaps / Priority Queue
Trie
|
Hard |
| 934 | Binary Search on Infinite Sorted Stream |
Binary Search
Searching
|
Medium |
| 935 | Search in Nearly Sorted Matrix |
Binary Search
Matrix
|
Medium |
| 936 | Circular Interval Overlap Queries |
Binary Search
Intervals
|
Hard |
| 937 | Merge Adjacent Equal Intervals |
Intervals
|
Medium |
| 938 | Dynamic Interval Coverage Counter |
Hashing
Intervals
|
Hard |
| 939 | Queue With Middle Operations |
Design
Queues
|
Medium |
| 940 | Stack Supporting Median Query |
Heaps / Priority Queue
Stacks
|
Hard |
| 941 | Circular Buffer Overflow Simulation |
Queues
Simulation
|
Medium |
| 942 | Browser Tab Manager |
Design
Stacks
|
Medium |
| 943 | Sparse Matrix Compression |
Hashing
Matrix
|
Medium |
| 944 | Restore Sparse Matrix |
Matrix
|
Medium |
| 945 | Connected Components After Edge Deletion |
Graphs
Union Find (Disjoint Set)
|
Hard |
| 946 | Offline Connectivity Queries |
Graphs
Union Find (Disjoint Set)
|
Hard |
| 947 | Earliest Cycle Formation in Graph |
Graphs
Union Find (Disjoint Set)
|
Hard |
| 948 | Multi-Source Distance Queries |
BFS
Graphs
|
Medium |
| 949 | Smallest Missing Value After Updates |
Arrays
Hashing
|
Hard |
| 950 | Heap Merge Cost Simulation |
Heaps / Priority Queue
|
Medium |
