Problem Challenge 2

Name: Grokking the Coding Interview: Patterns for Coding Questions
Author: Design Gurus

We'll cover the following

- - Rotate a LinkedList (medium)
- - Try it yourself

Rotate a LinkedList (medium) #

Given the head of a Singly LinkedList and a number ‘k’, rotate the LinkedList to the right by ‘k’ nodes.

Try it yourself #

Try solving this question here:

Java

Python3

C++

from __future__ import print_function
 
 
class Node:
  def __init__(self, value, next=None):
    self.value = value
    self.next = next
 
  def print_list(self):
    temp = self
    while temp is not None:
      print(temp.value, end=" ")
      temp = temp.next
    print()
 
 
def rotate(head, rotations):
  # TODO: Write your code here
  return head
 
 
def main():
  head = Node(1)
  head.next = Node(2)
  head.next.next = Node(3)
  head.next.next.next = Node(4)
  head.next.next.next.next = Node(5)
  head.next.next.next.next.next = Node(6)
 
  print("Nodes of original LinkedList are: ", end='')
  head.print_list()
  result = rotate(head, 3)
  print("Nodes of rotated LinkedList are: ", end='')
  result.print_list()
 
 
main()
 

Output

0.491s

Nodes of original LinkedList are: 1 2 3 4 5 6 Nodes of rotated LinkedList are: 1 2 3 4 5 6

Mark as Completed

← Back

Solution Review: Problem Challenge 1

Solution Review: Problem Challenge 2