Pivot linked list

Hard

You're given a linked list that contains numbers, along with a single integer known as a pivot.

Write a function that reorganizes the linked list such that nodes with numbers less than the pivot appear before the nodes with numbers greater than or equal to the pivot.

For example, if your function is given the following linked list and pivot:

linked_list =  (1) -> (5) -> (7) -> (2)
pivot = 3

Your function should return the following linked list:

(1) -> (2) -> (5) -> (7)

Note that after partitioning the nodes around the pivot, the order that the nodes appear in the original list should be preserved in the output.

Try it first

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

def pivot_list(head: Node, pivot: int) -> Node:
    #implement pivot_list
    return head

1class Node:
2    def __init__(self, data):
3        self.data = data
4        self.next = None
5
6def pivot_list(head: Node, pivot: int) -> Node:
7    #implement pivot_list
8    return head
9

Solution

8 Essential Linked Lists Coding Interview Problems

Master Linked Lists by trying the coding challenges below.

Want to confidently pass your next coding interview?

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.