Algorithmic thinking for competitive programming — scanning, accumulation, two-pointer patterns.
2D arrays, grid traversal, and building toward CCC Question 5 problems.
Depth-First Search on grids — flood fill, island counting, and maze solving.
Heap data structure, priority queues, and practical exercises using Python's heapq module.
Frequency counting, Top-K Frequent Elements, and CCC Bronze Count problem.
Build adjacency lists, detect cycles with DFS, and find valid course orderings.