Your question is Odd-Even Linked List Reordering. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
Loan records processed by Freddie Mac's Loan Product Advisor are represented as a singly linked list in arrival order. Reorder the list so that all nodes currently at odd 1-based positions appear first, followed by all nodes currently at even 1-based positions.
The relative order within the odd-position group and within the even-position group must remain unchanged. Return the head of the reordered list. You must rearrange existing next pointers, not create replacement nodes for the records.
Implement odd_even_list(head), where head is either None or the first ListNode in a singly linked list. Each node has an integer val field and a next field containing another ListNode or None. Return the head of the same nodes after reordering. Test cases represent linked lists as arrays of node values, and expected outputs use the same representation.
Positions are 1-based. Therefore, the first node belongs to the odd group, the second belongs to the even group, and so on.
def odd_even_list(head):