oday was all about Linked Lists π§΅.
β Solved:
Reverse Linked List (Easy, confidence booster πͺ)
Merge Two Sorted Lists (Easy, smooth ride β¨)
Linked List Cycle (Easy, but took some thinking π)
Remove Nth Node From End of List (Medium β pointers game, tricky at first π)
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.
Top comments (0)