// practice ground
| # | Title | Topics | Difficulty |
|---|---|---|---|
| 451 | Echo Forest Navigator |
DFS
Trees
|
Medium |
| 452 | Crystal Prefix Matcher |
Hashing
Trie
|
Medium |
| 453 | Circular Relay Race |
Queues
Simulation
|
Easy |
| 454 | Prime Ring Expansion |
Backtracking
Number Theory
|
Hard |
| 455 | Shadow Interval Coverage |
Greedy
Intervals
|
Medium |
| 456 | Binary Signal Mirror |
Bit Manipulation
Strings
|
Easy |
| 457 | Dynamic Maze Collapse |
BFS
Graphs
|
Hard |
| 458 | Matrix Reflection Score |
Math
Matrix
|
Medium |
| 459 | Variable Dependency Cycle |
Graphs
Variables
|
Hard |
| 460 | Linked Pair Rotation |
Linked List
Two Pointers
|
Medium |
| 461 | Adaptive Stack Builder |
Design
Stacks
|
Medium |
| 462 | Hidden Route Decoder |
Graphs
Strings
|
Hard |
| 463 | Alternating Spiral Fill |
Matrix
Simulation
|
Easy |
| 464 | Balanced Component Score |
Arrays
Union Find (Disjoint Set)
|
Hard |
| 465 | Recursive Skyline Merge |
Divide and Conquer
Geometry
|
Medium |
| 466 | Beacon Radius Search |
Binary Search
Geometry
|
Medium |
| 467 | Sliding Color Window |
Characters
Sliding Window
|
Easy |
| 468 | Crystal Merge Scheduler |
Greedy
Heaps / Priority Queue
|
Hard |
| 469 | Operator Chain Evaluator |
Loops
Operators
|
Easy |
| 470 | Recursive Grid Painter |
Matrix
Recursion
|
Medium |
| 471 | Fortress Supply Lines |
Dynamic Programming
Graphs
|
Hard |
| 472 | Character Orbit |
Arrays
Characters
|
Easy |
| 473 | Prefix Evolution Tree |
Trees
Trie
|
Medium |
| 474 | Interval Energy Flow |
Intervals
Simulation
|
Medium |
| 475 | Quantum Search Divide |
Divide and Conquer
Searching
|
Hard |
