1.  **Reversing Linked List**\n\tThere is a singly linkedlist of n integers where n is even. Perform the following operations on linkedlist.\n\t\t\t1.Select the segment of all n nodes and then reverse it.\n\t\t\t2.Reduce the segment size by 1 from each end and then reverse it.\n\t\t\t3.Repeat from step 2 until segment size reaches zero.\n\tReturn a reference to the head of the final linked list.\n**You are not allowed to use extra memory other than creating some new nodes required for implementations**\n**Example** : -\n\tThe initial linked list is\n\t ```1->5->2->7->8->3```\n\t Entire list of n = 6 nodes is reversed.\n\t ```3->8->7->2->5->1```\n\t ```|______________|```\n\t Move the left and right pointers in one postion to define a segment with 4 nodes, then reverse those nodes.\n\t ```3->5->2->7->8->1```\n\t ```    ___|________|___```\n\t Again move the pointers towards the center by 1 node each. Now there are two nodes to reverse.\n\t ```3->5->7->2->8->1```\n\t ```______|__|_______```\n\t After moving the pointers this time the segment has 0 nodes and the iteration stops. Return a reference to the head of the final linked list ```3->5->7->2->8->1```\n2. **Dominating xor**\n\t\tFor an array arr of n positive integers, count the unordered pairs` (i,j) (0<=i<j<n) where arr[i] xor arr[j] > arr[i] and arr[j].`\n\t\t

Reversing Linked List\n\tThere is a singly linkedlist of n integers where n is even. Perform the following operations on linkedlist.\n\t\t\t1.Select the segment