Back to Front Linked List - Amazon Top Interview Questions


Problem Statement :


Given a singly linked list node, reorder it such that we take: the last node, and then the first node, and then the second last node, and then the second node, etc.

Can you do it in \mathcal{O}(1)O(1) space?

Constraints

0 ≤ n ≤ 100,000 where n is the number of nodes in node

Example 1

Input

node = [0, 1, 2, 3]

Output

[3, 0, 2, 1]


Solution :



title-img 




                        Solution in C++ :

LLNode* solve(LLNode* node) {
    LLNode* slow = node;
    LLNode* fast = node;
    while (fast) {
        fast = fast->next;
        if (fast) {
            fast = fast->next;
            slow = slow->next;
        }
    }
    LLNode* pre = NULL;
    LLNode* cur = slow;
    LLNode* nex;
    while (cur) {
        nex = cur->next;
        cur->next = pre;
        pre = cur;
        cur = nex;
    }
    LLNode* temp = pre;
    while (temp && node) {
        LLNode* nex1 = temp->next;
        LLNode* nex2 = node->next;
        temp->next = node;
        node->next = nex1;
        temp = nex1;
        node = nex2;
    }
    return pre;
}
                    


                        Solution in Java :

import java.util.*;

/**
 * class LLNode {
 *   int val;
 *   LLNode next;
 * }
 */
class Solution {
    public LLNode solve(LLNode node) {
        LLNode fast = node, slow = node;
        while (fast != null && fast.next != null) {
            slow = slow.next;
            fast = fast.next.next;
        }
        LLNode left = node, right = reverse(slow);
        LLNode prev = new LLNode();
        LLNode dummy = prev;
        while (left != null && right != null) {
            prev.next = right;
            right = right.next;
            prev.next.next = left;
            left = left.next;
            prev = prev.next.next;
        }
        prev.next = null;
        return dummy.next;
    }

    private LLNode reverse(LLNode node) {
        LLNode prev = null, curr = node, next;
        while (curr != null) {
            next = curr.next;
            curr.next = prev;
            prev = curr;
            curr = next;
        }
        return prev;
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def split(self, head):
        tail1 = head
        tail2 = head

        while tail1 and tail2 and tail2.next and tail2.next.next:
            tail1 = tail1.next
            tail2 = tail2.next.next

        # now actually break the link!
        head2 = tail1.next
        tail1.next = None

        return head, head2

    def reverse(self, head):
        if not head or not head.next:
            return head
        prev, cur = None, head
        while cur:
            nxt = cur.next
            cur.next = prev
            prev = cur
            cur = nxt

        return prev

    def interleave(self, head, head2):
        resHead = res = LLNode(0)
        while head or head2:
            if head2:
                res.next = head2
                res = res.next
                head2 = head2.next

            if head:
                res.next = head
                res = res.next
                head = head.next

        return resHead.next

    def solve(self, head):
        # break into two halves
        head, head2 = self.split(head)

        # now reverse the second list ;)
        head2 = self.reverse(head2)

        # just alternately pick from each
        return self.interleave(head, head2)


View More Similar Problems

Dynamic Array

Create a list, seqList, of n empty sequences, where each sequence is indexed from 0 to n-1. The elements within each of the n sequences also use 0-indexing. Create an integer, lastAnswer, and initialize it to 0. There are 2 types of queries that can be performed on the list of sequences: 1. Query: 1 x y a. Find the sequence, seq, at index ((x xor lastAnswer)%n) in seqList.

View Solution →

Left Rotation

A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d

View Solution →

Sparse Arrays

There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun

View Solution →

Array Manipulation

Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu

View Solution →

Print the Elements of a Linked List

This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode

View Solution →

Insert a Node at the Tail of a Linked List

You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Input Format: You have to complete the SinglyLink

View Solution →