🚀 Day 5 of LeetCode Grind

oday was all about Linked Lists 🧵.

✅ Solved:

1. Reverse Linked List (Easy, confidence booster 💪)

2. Merge Two Sorted Lists (Easy, smooth ride ✨)

3. Linked List Cycle (Easy, but took some thinking 🔄)

4. Remove Nth Node From End of List (Medium — pointers game, tricky at first 👀)

5. Add Two Numbers (Medium — felt like a mini project itself, lots of debugging 😅)

🔑 Takeaway:

Easy ones built momentum.

Medium ones tested patience but also gave that “aha!” moment.

Linked lists are slowly starting to feel less scary, more like puzzles 🧩.

Tomorrow: continuing the grind → maybe tackling some stack/queue problems.