// practice ground
| # | Title | Topics | Difficulty |
|---|---|---|---|
| 951 | K-th Smallest Pair Sum |
Arrays
Heaps / Priority Queue
|
Hard |
| 952 | Linked List Segment Reversal by Value |
Linked List
|
Medium |
| 953 | Split Linked List Into Alternate Chains |
Linked List
|
Medium |
| 954 | Binary Search on Floating Point Answer |
Binary Search
Math
|
Medium |
| 955 | Maximum Equal Prefix Length |
Hashing
Strings
|
Medium |
| 956 | Prefix XOR Query Processor |
Arrays
Bit Manipulation
|
Medium |
| 957 | Dynamic Character Frequency Queries |
Characters
Hashing
|
Medium |
| 958 | Matrix Region Rotation Queries |
Matrix
Simulation
|
Hard |
| 959 | Find Minimal Dominating Vertex |
Graphs
Greedy
|
Hard |
| 960 | Shortest Alternate Color Path |
BFS
Graphs
|
Hard |
| 961 | Union Find With Component Sizes |
Union Find (Disjoint Set)
|
Medium |
| 962 | Detect Redundant Directed Edge Online |
Graphs
Union Find (Disjoint Set)
|
Hard |
| 963 | Prefix Compression Dictionary |
Strings
Trie
|
Medium |
| 964 | Persistent Binary Search Tree Queries |
Binary Search Tree
Design
|
Hard |
| 965 | Dynamic Trie With Rollback |
Design
Trie
|
Hard |
| 966 | Compressed Trie Memory Optimizer |
Strings
Trie
|
Hard |
| 967 | Binary Search on Dynamic Answer Space |
Binary Search
Dynamic Programming
|
Hard |
| 968 | Fully Dynamic Interval Union |
Design
Intervals
|
Hard |
| 969 | Interval Containment Query Engine |
Binary Search
Intervals
|
Hard |
| 970 | Offline Rectangle Stabbing Queries |
Divide and Conquer
Geometry
|
Hard |
| 971 | Union Find With Rollback Operations |
Design
Union Find (Disjoint Set)
|
Hard |
| 972 | K-th Ancestor Queries With Updates |
Binary Search
Trees
|
Hard |
| 973 | Dynamic Lowest Common Ancestor |
Binary Search
Trees
|
Hard |
| 974 | Heavy Path Color Queries |
Segment Tree
Trees
|
Hard |
| 975 | Centroid Decomposition Distance Queries |
Divide and Conquer
Trees
|
Hard |
