Linear Structures: Linked Lists, Stacks, & Queues

Implement singly linked list operations: insertion, deletion, and reversal (iterative and recursive).

Solve linked list problems using the fast and slow pointer technique (e.g., cycle detection, middle element).

Merge two sorted linked lists into a single sorted list.

Implement a stack and solve problems involving LIFO logic (e.g., valid parentheses).

Implement a queue and solve problems requiring FIFO processing.

Apply monotonic stacks to solve problems like 'next greater element'.

Design and implement specialized data structures like a Min Stack.