// practice ground
| # | Title | Topics | Difficulty |
|---|---|---|---|
| 1001 | Round-Robin Token Passing |
Arrays
Simulation
|
Easy |
| 1002 | Circular Buffer Overwrite Simulation |
Queues
Simulation
|
Medium |
| 1003 | Ring Array Rotation Queries |
Arrays
Simulation
|
Easy |
| 1004 | Space Station Airlock Scheduling |
Queues
Simulation
|
Medium |
| 1005 | Closest Beacon to Multiple Points |
Binary Search
Geometry
|
Medium |
| 1006 | Parallel Course Scheduling (Minimum Semesters) |
BFS
Graphs
|
Medium |
| 1007 | Sliding Window Distinct Count |
Hashing
Sliding Window
|
Easy |
| 1008 | Divide and Conquer Inversion Count |
Arrays
Divide and Conquer
|
Medium |
| 1009 | Recursive Path Sum in DAG |
Dynamic Programming
Graphs
Recursion
|
Medium |
| 1010 | Sliding Window Max Sum with Cap |
Arrays
Sliding Window
|
Medium |
| 1011 | Prime Factor Tree Depth |
Number Theory
Trees
|
Easy |
| 1012 | Weighted Interval Scheduling |
Dynamic Programming
Intervals
|
Medium |
| 1013 | Minimum Cost Path Through Ordered Checkpoints |
Dynamic Programming
Matrix
|
Hard |
| 1014 | Tree Diameter with Weighted Edges |
DFS
Trees
|
Medium |
| 1015 | Knapsack on Tree Nodes |
Dynamic Programming
Trees
|
Hard |
| 1016 | Fair Queue Token Distribution |
Greedy
Queues
|
Medium |
| 1017 | Smallest Window with K Distinct Characters |
Sliding Window
Strings
|
Medium |
| 1018 | Weighted Union-Find: Relative Position Queries |
Union Find (Disjoint Set)
|
Hard |
| 1019 | Zodiac Sign Finder |
Math
Variables
|
Easy |
| 1020 | Euler's Totient Function Calculator |
Math
Number Theory
|
Easy |
| 1021 | Median Maintaining Priority Queue |
Design
Heaps / Priority Queue
|
Medium |
| 1022 | Longest Zigzag Subsequence |
Arrays
Dynamic Programming
|
Medium |
| 1023 | Minimum Swaps to Sort an Array |
Arrays
Sorting
|
Medium |
| 1024 | K-th Missing Positive Number |
Arrays
Binary Search
|
Easy |
| 1025 | Count Subarrays with Sum Divisible by K |
Arrays
Hashing
|
Medium |
