Problem Given a singly linked list, split it into two linked lists. These linked lists will contain the alternate nodes from the given linked list. Examples Example 1: head = [1,2,3,4,5] Output: [ [1, 3, 5], [2, 4] ] ...
Problem Given a linked list with head pointer and a number n. Split the linked list into two halves such that first half contains 1/n elements and remaining linkedlist contains remaining elements. Return the head of the second list or the right partition pointer. Examples Example 1: Input: head = [1, 2, 3, 4, 5, 6, 7, 8], n = 2 Output: [5, 6, 7, 8] Explanation: As n = 2, we have 2 lists like this [ [1, 2, 3, 4], [5, 6, 7, 8] ] and we return the list with head at 5. ...
Problem Given a list, split it into two sublists — one for the front half, and one for the back half. If the number of elements is odd, the extra element should go in the front list. Examples Example 1: Input: head = [1,2,3,4,5 Output: [ [1,2,3], [4,5] ] ...