inverted_bisection

README

Inverted Bisection

Write a function that takes in the head of a Singly Linked List, inverts its bisection in place (i.e., doesn't create a brand new list), and returns its new head.

Inverting a Linked List's bisection means inverting the order of the nodes in the list's two halves; see the sample inputs and outputs for examples.

Each LinkedList node has an integer value as well as a next node pointing to the next node in the list or to None / null if it's the tail of the list.

You can assume that the input Linked List will always have at least one node; in other words, the head will never be None / null.

Sample Input #1

  head = 0 -> 1 -> 2 -> 3 -> 4 -> 5 // the head node with value 0

Sample Output #1

  2 -> 1 -> 0 -> 5 -> 4 -> 3 // the new head node with value 2

Sample Input #2

  head = 0 -> 1 -> 2 -> 3 -> 4 -> 5 -> 6 // the head node with value 0

Sample Output #2

  2 -> 1 -> 0 -> 3 -> 6 -> 5 -> 4 // the new head node with value 2

Documentation

Index

• type LinkedList
  • func InvertedBisection(head *LinkedList) *LinkedList

Types

type LinkedList

type LinkedList struct {
	Value int
	Next  *LinkedList
}

func InvertedBisection

func InvertedBisection(head *LinkedList) *LinkedList

InvertedBisection O(n) time | O(1) space - where n is the number of nodes in the Linked List