// practice ground
| # | Title | Topics | Difficulty |
|---|---|---|---|
| 626 | Pipeline Pressure Equalizer |
Graphs
Greedy
|
Hard |
| 627 | Warehouse Shelf Organizer |
Arrays
Sorting
|
Easy |
| 628 | Circular Shift Register |
Bit Manipulation
Queues
|
Medium |
| 629 | Disaster Relief Planner |
Dynamic Programming
Graphs
|
Hard |
| 630 | Festival Seat Arrangement |
Arrays
Greedy
|
Medium |
| 631 | Arithmetic Tile Puzzle |
Math
Operators
|
Easy |
| 632 | Dynamic Irrigation Grid |
Matrix
Union Find (Disjoint Set)
|
Hard |
| 633 | Versioned Notebook |
Design
Stacks
|
Hard |
| 634 | Conveyor Merge Controller |
Queues
Two Pointers
|
Medium |
| 635 | Lexicographic Route Labels |
Hashing
Strings
|
Medium |
| 636 | Forest Relay Stations |
Greedy
Trees
|
Medium |
| 637 | Terrain Water Budget |
Matrix
Simulation
|
Medium |
| 638 | Binary Packet Verifier |
Bit Manipulation
Characters
|
Easy |
| 639 | Contract Conflict Resolver |
Intervals
Sorting
|
Medium |
| 640 | Recursive Factory Layout |
Divide and Conquer
Matrix
|
Hard |
| 641 | Library Borrow Tracker |
Hashing
Simulation
|
Easy |
| 642 | Drone Landing Scheduler |
Greedy
Heaps / Priority Queue
|
Medium |
| 643 | Expression Cost Minimizer |
Dynamic Programming
Strings
|
Hard |
| 644 | Beacon Signal Optimizer |
Binary Search
Geometry
|
Medium |
| 645 | Department Budget Flow |
DFS
Trees
|
Medium |
| 646 | Prime Factor Chain |
Loops
Number Theory
|
Easy |
| 647 | Multi-Queue Dispatcher |
Design
Queues
|
Hard |
| 648 | Sliding Capacity Monitor |
Arrays
Sliding Window
|
Medium |
| 649 | Polygon Fence Planner |
Dynamic Programming
Geometry
|
Hard |
| 650 | Archive Reconstruction |
Backtracking
Recursion
|
Hard |
