After covering the foundations and recursion/backtracking, it's time to study one of the most useful dynamic data structures in competitive programming: the linked list.

Linked lists are not flashy. They don't offer random access like arrays, and they don't always win on raw speed. But they excel at flexible insertion, deletion, and pointer-based...