Welcome to the Linked List section of the DSA repository! Here you’ll find topic-wise sets, clean explanations, and Java solutions to help you master Linked Lists step-by-step.
| Set | Topics Covered | Difficulty | File |
|---|---|---|---|
| Set 1 | • Reverse Linked List • Middle of the Linked List • Merge Two Sorted Lists |
🟢 Easy | 👉 Open Set 1 |
| Set 2 | • Delete Node in a Linked List • Add Two Numbers • Remove Nth Node From End of List |
🟡 Medium | 👉 Open Set 2 |
| Set 3 | • Intersection of Two Linked Lists • Linked List Cycle • Reverse Nodes in k-Group |
🟡 Medium | 👉 Open Set 3 |
Every set contains:
- ✔️ Problem descriptions
- ✔️ Short approaches
- ✔️ Clean Java code
- ✔️ Time & space complexity
- ✔️ Easy navigation between problems
Perfect for your daily DSA documentation.
More DSA sets coming soon, Stay Tuned! 📘