// practice ground
| # | Title | Topics | Difficulty |
|---|---|---|---|
| 876 | Multi-Level Permission Cascade |
DFS
Trees
|
Medium |
| 877 | Circular Relay Synchronization |
Queues
Simulation
|
Medium |
| 878 | Terrain Compression Planner |
Dynamic Programming
Matrix
|
Hard |
| 879 | Variable Lifetime Compression |
Greedy
Variables
|
Medium |
| 880 | Recursive Market Forecast |
Dynamic Programming
Recursion
|
Hard |
| 881 | Heritage Route Recovery |
BFS
Graphs
|
Medium |
| 882 | Sliding Reservoir Monitor |
Arrays
Sliding Window
|
Medium |
| 883 | Skyline Reflection Geometry |
Geometry
Math
|
Hard |
| 884 | Symbol Compression Engine |
Dynamic Programming
Strings
|
Hard |
| 885 | Recursive Supply Allocation |
Dynamic Programming
Trees
|
Hard |
| 886 | Circular Vote Redistribution |
Arrays
Greedy
|
Medium |
| 887 | Adaptive Tunnel Routing |
Binary Search
Graphs
|
Hard |
| 888 | Layered Cipher Recovery |
Hashing
Strings
|
Medium |
| 889 | Dynamic Orchard Expansion |
Trees
Union Find (Disjoint Set)
|
Medium |
| 890 | Priority Maintenance Calendar |
Heaps / Priority Queue
Intervals
|
Hard |
| 891 | Recursive Pattern Census |
Divide and Conquer
Matrix
|
Hard |
| 892 | Archive Similarity Index |
Hashing
Sorting
|
Medium |
| 893 | Modular Transit Exchange |
Graphs
Number Theory
|
Hard |
| 894 | Queue Drift Compensation |
Queues
Simulation
|
Medium |
| 895 | Observatory Resource Scheduler |
Dynamic Programming
Greedy
|
Hard |
| 896 | Check if Array Alternates Even and Odd |
Arrays
|
Easy |
| 897 | Count Strictly Increasing Adjacent Pairs |
Arrays
|
Easy |
| 898 | Find Smallest Missing Even Number |
Arrays
Math
|
Easy |
| 899 | Reverse Every Alternate Word |
Strings
|
Easy |
| 900 | Remove Consecutive Duplicate Words |
Strings
|
Easy |
