Linear Data Structures and Common Patterns

Implement dynamic arrays with automatic resizing and analyze the amortized cost of insertions.

Implement singly and doubly linked lists, analyzing the trade-offs for insertion, deletion, and traversal operations.

Implement stacks and queues using both arrays (with circular buffering) and linked lists.

Apply the sliding window pattern to solve array and string-based subarray problems.

Apply the two-pointer technique (opposite-ends and fast/slow pointers) to solve problems on arrays and linked lists.

Detect a cycle in a linked list using Floyd's Tortoise and Hare algorithm and identify its starting point.