Bugl pattern tracks for building problem-solving fluency
Day Streak
Tracks Started
Mastered
Use hash maps for O(1) lookups and frequency counting.
703 problems · 2585 puzzles
Two pointers reduce O(n²) to O(n) on sorted data.
103 problems · 577 puzzles
Slide a window to find optimal subarrays/substrings.
117 problems · 619 puzzles
LIFO for bracket matching, monotonic sequences.
105 problems · 561 puzzles
O(log n) search by halving search space.
128 problems · 689 puzzles
Pointer manipulation for reversals and cycle detection.
53 problems · 467 puzzles
DFS and BFS on binary trees.
212 problems · 1175 puzzles
O(log n) min/max tracking for streaming data.
83 problems · 538 puzzles
Try all possibilities: choose, recurse, unchoose.
90 problems · 639 puzzles
Prefix tree for string operations.
35 problems · 202 puzzles
DFS/BFS on nodes and edges.
187 problems · 992 puzzles
Dijkstra, MST, topological sort for weighted graphs.
39 problems · 321 puzzles
Single-variable state DP for sequences.
240 problems · 1401 puzzles
Two-variable DP for grids and strings.
153 problems · 762 puzzles
Locally optimal choices for global optimum.
282 problems · 1126 puzzles
Sort and process intervals for scheduling.
37 problems · 317 puzzles
Matrix ops and number theory.
358 problems · 1417 puzzles
XOR, AND, OR, shifts for binary ops.
111 problems · 543 puzzles