Implement a reorderList function that takes the head of a linked list (node(0) -> node(1) -> node(2) -> .. -> node(n-1) -> node(n)) as input and reorders its nodes in the form node(0) -> node(n) -> node(1) -> node(n-1) -> node(2) -> .. .
Implement a mergeTwoLists function that takes the head nodes of two sorted linked lists as the input and returns the head of the merged linked list
Implement a reverseList function that takes the head of a linked list as the input and returns the head of the reversed linked list
The two-pointer approach provides an efficient alternative for solving problems related to substrings, subarrays, and sequences.
A Linked List uses dynamic allocation of memory to store sequential data