1class Node {
2    constructor(val) {
3        this.val = val;
4        this.next = null;
5    }
6}
7
8class LinkedList {
9    constructor() {
10        this.head = null;
11    }
12    addLast(val) {
13        let newNode = new Node(val);
14        if (!this.head) {
15            this.head = newNode;
16            return;
17        }
18        let current = this.head;
19        while (current.next) {
20            current = current.next;
21        }
22        current.next = newNode;
23    }
24    print() {
25        let outputString = '';
26        let current = this.head;
27        while (current) {
28            outputString += current.val + '->';
29            current = current.next;
30        }
31        console.log(outputString + 'null');
32    }
33    // print() {
34    //   let current = this.head;
35    //   while (current) {
36    //     process.stdout.write(current.val.toString());
37    //     current = current.next;
38    //   }
39    // }
40    size() {
41        let current = this.head;
42        let length = 0;
43        while (current) {
44            length++;
45            current = current.next;
46        }
47        return length;
48    }
49    rotatek(k) {
50        let current = this.head;
51        let prev = null;
52        let cutOffPoint = this.size() - k;
53        let movement = 0;
54        while (movement < cutOffPoint) {
55            movement++;
56            prev = current;
57            current = current.next;
58        }
59
60        let newHead = current;
61
62        let newCurrent = current;
63        prev.next = null;
64
65        while (newCurrent.next) {
66            newCurrent = newCurrent.next;
67        }
68
69        newCurrent.next = this.head;
70
71        this.head = newHead;
72    }
73}
74
75let linkedList = new LinkedList();
76linkedList.addLast(1);
77linkedList.addLast(2);
78linkedList.addLast(3);
79linkedList.addLast(4);
80linkedList.addLast(5);
81linkedList.print();
82linkedList.rotatek(2);
83 console.log("After Rotation");
84linkedList.print();
85