algoblazerEarly Access

Learn Problems Leaderboard

Loading...

‹ Back to map

Tier I · Fundamentals

Hash Maps0/9
Stacks & Queues0/8
Two Pointers0/8
Sliding Window0/10
Binary Search0/9

Tier II · Intermediate

Prefix Sums0/7
Math & Number Theory0/7
Merge Intervals0/5
Greedy0/8
Depth-First Search I0/3
Breadth-First Search I0/3
Depth-First Search II0/3
Breadth-First Search II0/5
Heaps & Priority Queues0/8
Backtracking0/7
Kadane's Algorithm0/4
Bit Manipulation0/6
Topological Sort0/6
Tries0/5
1D Linear DP0/2

Tier III · Advanced

Monotonic Stack0/9
Knapsack0/6
State Machine DP0/3
Grid DP0/3
Two-Sequence DP0/2
Longest Increasing Subsequence0/2
Tree DP0/4
Union-Find0/4
Bipartite Graphs0/3
Line Sweep0/6
Shortest Paths0/4

Tier IV · Mastery

Interval DP0/2
Bitmask DP0/1
Digit DP0/1
Segment Trees0/1
String Matching0/1

Union-Find

Tier III · Advanced

Disjoint sets with near-constant merges for connectivity and grouping.

0 / 4 clearedCore×1Silver×3

Recommended first: Depth-First Search II.

You've cleared 0 of 3 problems in these. You can dive in anyway.

Problems4

1
Minimum New Edges to ConnectCore
2
Minimum Reachable Edge WeightSilver
3
Minimum Recolor Cost for PairsSilverBeta
4
Minimum Cost to Connect All NodesSilver

‹ Tree DP Bipartite Graphs ›