Problem Statement Given an integer B and a linked list A of length N. From the middle of the Linked List towards the beginning, we have to determine the value of the Bth node. Return -1 if such an ele
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.