Algorithms and Search Foundations
Not startedStart with visible list work, reuse that search language for binary search, and then carry the branch into one live graph bench for adjacency, BFS, DFS, and visited-state behavior.
Recap mode stays available, but it becomes useful after you save some local progress in the track.