chore: implement a print linked list

Author: lupppig

arr_m.go

@@ -36,11 +36,11 @@ func arrayManipulation(n int32, queries [][]int32) int64 {
 	return max
 }
 
-func main() {
-	queries := [][]int32{
-		{1, 2, 100},
-		{2, 5, 100},
-		{3, 4, 100},
-	}
-	fmt.Println(arrayManipulation(5, queries))
-}
+// func main() {
+// 	queries := [][]int32{
+// 		{1, 2, 100},
+// 		{2, 5, 100},
+// 		{3, 4, 100},
+// 	}
+// 	fmt.Println(arrayManipulation(5, queries))
+// }

linked_list.go

@@ -0,0 +1,42 @@
+package main
+
+type node struct {
+	value int
+	next  *node
+}
+
+type list struct {
+	head *node
+}
+
+func (l *list) insert(n *node) {
+	if l.head == nil {
+		l.head = n
+	} else {
+		curr := l.head
+		for curr.next != nil {
+			curr = curr.next
+		}
+		curr.next = n
+	}
+}
+
+func main() {
+	n := &node{value: 1}
+	lst := list{}
+	n1 := &node{value: 2}
+	n2 := &node{value: 3}
+	n3 := &node{value: 4}
+	n4 := &node{value: 5}
+	lst.insert(n)
+
+	lst.insert(n1)
+	lst.insert(n2)
+	lst.insert(n3)
+	lst.insert(n4)
+
+	for n != nil {
+		println(n.value)
+		n = n.next
+	}
+}

rotate_left.go

@@ -1,14 +1,5 @@
 package main
 
-/*
- * Complete the 'rotateLeft' function below.
- *
- * The function is expected to return an INTEGER_ARRAY.
- * The function accepts following parameters:
- *  1. INTEGER d
- *  2. INTEGER_ARRAY arr
- */
-
 func rotateLeft(d int32, arr []int32) []int32 {
 	rotate := d % int32(len(arr))
 	lenArr := len(arr) - 1