08. Linked Lists & Stacks

🧠 Strategy

1. Linked Lists: Master the "Fast & Slow Pointer" technique for cycles and middles. Always use a Dummy Head for merge/delete operations.
2. Stacks: Use for nested logic (parentheses) and "Monotonic Stacks" (Next Greater Element).
3. Queues: Essential for Sliding Windows (Deque) and Level Order traversals.

---

🟢 Linked List: Basics

• Design Linked List
• Delete Middle Node
• Middle Element Of Linked List
• Reverse Linked List
• Reverse Link List II
• K Reverse Linked List
• Swap List Nodes In Pairs
• Remove Duplicates From Sorted List
• Flatten Nested List Iterator

🟡 Linked List: Advanced

• Remove Nth Node From List End
• List Cycle
• Remove Loop From Linked List
• Palindrome List
• Reorder List
• Sort List
• Merge Two Sorted Lists
• Merge K Sorted Lists
• Flatten A Linked List
• Add Two Numbers As Lists
• Copy List
• Clone A Linked List
• LRU Cache

🟠 Stacks: Logic & Parsing

• Min Stack
• Balanced Paranthesis
• Redundant Braces
• Double Character Trouble
• Passing Game
• Simplify Directory Path
• Evaluate Expression
• Infix To Postfix
• Check Two Bracket Expressions
• Sort Stack Using Another Stack

🔴 Stacks: Monotonic & Areas

• Nearest Smaller Element
• Next Greater
• Largest Rectangle In Histogram
• Maximum Rectangle
• MAX and MIN
• All Subarrays

🟣 Queues & Deques

• Reversing Elements Of Queue
• Task Scheduling
• Perfect Numbers
• N Integers Containing Only 1 2 3
• Unique Letter
• Parking Ice Cream Truck
• Sum Of Min And Max
• Maximum Frequency Stack

---