// practice ground
| # | Title | Topics | Difficulty |
|---|---|---|---|
| 376 | Twin Binary Streams |
Bit Manipulation
Simulation
|
Medium |
| 377 | Boundary Echo |
Loops
Matrix
|
Easy |
| 378 | Interval Reflection |
Intervals
Math
|
Medium |
| 379 | Priority Cascade |
Greedy
Heaps / Priority Queue
|
Hard |
| 380 | Hidden Root Value |
DFS
Trees
|
Medium |
| 381 | Operator Maze |
Conditionals
Operators
|
Easy |
| 382 | Skyline Compression |
Arrays
Divide and Conquer
|
Hard |
| 383 | Recursive Treasure Hunt |
Backtracking
Recursion
|
Hard |
| 384 | Prefix Relay Network |
Graphs
Trie
|
Hard |
| 385 | Collapsing Kingdoms |
Dynamic Programming
Union Find (Disjoint Set)
|
Hard |
| 386 | Linked Segment Shuffle |
Linked List
Sorting
|
Medium |
| 387 | Prime Bridge Builder |
Graphs
Number Theory
|
Hard |
| 388 | Elastic Search Range |
Binary Search
Searching
|
Medium |
| 389 | Queue Reflection |
Arrays
Queues
|
Easy |
| 390 | Rolling Fortress |
Matrix
Sliding Window
|
Hard |
| 391 | Stack Fusion Engine |
Dynamic Programming
Stacks
|
Hard |
| 392 | Alternating Divisor Trail |
Number Theory
Recursion
|
Medium |
| 393 | Quantum Priority Merge |
Divide and Conquer
Heaps / Priority Queue
|
Hard |
| 394 | Hidden Cycle Detector |
Hashing
Linked List
|
Medium |
| 395 | Balanced Interval Queue |
Intervals
Queues
|
Hard |
| 396 | Variable Dependency Solver |
Graphs
Variables
|
Medium |
| 397 | Binary Compass |
Bit Manipulation
Geometry
|
Medium |
| 398 | Recursive Market Planner |
Greedy
Recursion
|
Hard |
| 399 | Echo Sorting Network |
Simulation
Sorting
|
Medium |
| 400 | Crystal Portal Escape |
Backtracking
Graphs
|
Hard |
