// practice ground

Problems

# Title Topics Difficulty
426 Dynamic Bridge Planner
Dynamic Programming Graphs
Hard
427 Sliding Peak Counter
Arrays Sliding Window
Easy
428 Recursive Binary Painter
Matrix Recursion
Medium
429 Echo Trie Paths
DFS Trie
Medium
430 Priority Circle Scheduler
Heaps / Priority Queue Simulation
Medium
431 Variable Expression Tree
Trees Variables
Medium
432 Hidden Polygon Route
Geometry Graphs
Hard
433 Queue Pulse Analyzer
Math Queues
Medium
434 Mirror Segment Sort
Sorting Two Pointers
Medium
435 Crystal Tree Balance
Greedy Trees
Medium
436 Spiral Gate Network
Loops Matrix
Easy
437 Adaptive Prefix Matcher
Strings Trie
Medium
438 Prime Interval Compression
Intervals Number Theory
Medium
439 Binary Reflection Search
Binary Search Bit Manipulation
Hard
440 Conditional Number Machine
Conditionals Operators
Easy
441 Linked Orbit Merge
Linked List Simulation
Medium
442 Fortress Expansion Plan
Graphs Greedy
Hard
443 Recursive Interval Puzzle
Divide and Conquer Intervals
Hard
444 Character Frequency Chain
Characters Hashing
Easy
445 Stack Reflection Game
Stacks Strings
Medium
446 Union Fortress Builder
Graphs Union Find (Disjoint Set)
Medium
447 Skyline Binary Walker
Binary Search Tree DFS
Medium
448 Rotating Number Spiral
Math Matrix
Easy
449 Sliding Beacon Detector
Hashing Sliding Window
Medium
450 Quantum Route Divider
Divide and Conquer Graphs
Hard
Showing 426–450 of 1062