🔗: Reverse Linked List - LeetCode Problem Statement Given the head of a singly linked list, reverse the linked list and return the new head. Example Input: 1 -> 2 -> 3 -> 4 -> 5 Output: 5 -> 4 -> 3
Trying to get 1% better every day
Not an expert, just someone who has restarted more times than I'd like to admit. Learning DSA, building projects, and documenting the journey as I work towards becoming a better engineer.
Markdown supported · ⌘↵ to post
No responses yet.