Reorder list

Input: head = [1,2,3,4] Output: [1,4,2,3] First find the middle of the list Second reverse the second half Third merge the two lists Find the middle of the list by using the fast pointer/slow pointer technique. //given ListNode head ListNode fast =...