diff --git a/subjects/addlinkednumbers.en.md b/subjects/addlinkednumbers.en.md
index 1daf1d0ae..00fea8fc9 100644
--- a/subjects/addlinkednumbers.en.md
+++ b/subjects/addlinkednumbers.en.md
@@ -23,8 +23,8 @@ Write a function that adds the two numbers and returns the sum as a linked list
 package main
 
 type NodeAddL struct {
-	Next *NodeAddL
-	Num  int
+    Next *NodeAddL
+    Num  int
 }
 
 func AddLinkedNumbers(num1, num1 *NodeAddL) *NodeAddL {
@@ -44,30 +44,29 @@ import (
 )
 
 func pushFront(node *NodeAddL, num int) *NodeAddL {
-	// ...
-	// Write yourself
+
 }
 
 func main() {
-	// 3 -> 1 -> 5
-	num1 := &NodeAddL{Num:5}
-	num1 = pushFront(num1, 1)
-	num1 = pushFront(num1, 3)
-
-	// 5 -> 9 -> 2
-	num2 := &NodeAddL{Num:2}
-	num2 = pushFront(num2, 9)
-	num2 = pushFront(num2, 5)
-
-	// 9 -> 0 -> 7
-	result := AddLinkedNumbers(num1, num2)
-	for tmp := result; tmp != nil; tmp = tmp.Next {
-		fmt.Print(tmp.Num)
-		if tmp.Next != nil {
-			fmt.Print(" -> ")
-		}
-	}
-	fmt.Println()
+   // 3 -> 1 -> 5
+   num1 := &NodeAddL{Num:5}
+   num1 = pushFront(num1, 1)
+   num1 = pushFront(num1, 3)
+
+   // 5 -> 9 -> 2
+   num2 := &NodeAddL{Num:2}
+   num2 = pushFront(num2, 9)
+   num2 = pushFront(num2, 5)
+
+   // 9 -> 0 -> 7
+   result := AddLinkedNumbers(num1, num2)
+   for tmp := result; tmp != nil; tmp = tmp.Next {
+      fmt.Print(tmp.Num)
+      if tmp.Next != nil {
+         fmt.Print(" -> ")
+      }
+   }
+   fmt.Println()
 }
 ```
 
diff --git a/subjects/changeorder.en.md b/subjects/changeorder.en.md
index 6a4816c4e..0c56c5641 100644
--- a/subjects/changeorder.en.md
+++ b/subjects/changeorder.en.md
@@ -24,8 +24,8 @@ You have to return pointer/reference to the beginning of new list
 package main
 
 type NodeAddL struct {
-	Next *NodeAddL
-	Num  int
+    Next *NodeAddL
+    Num  int
 }
 
 func Changeorder(node *NodeAddL) *NodeAddL {
@@ -41,26 +41,26 @@ Here is a possible program to test your function:
 package main
 
 import (
-	"fmt"
+    "fmt"
 )
 
 // I implemented pushBack for this
 
 func main() {
-	num1 := &NodeAddL{Num: 1}
-	num1 = pushBack(num1, 2)
-	num1 = pushBack(num1, 3)
-	num1 = pushBack(num1, 4)
-	num1 = pushBack(num1, 5)
-
-	result := Changeorder(num1)
-	for tmp := result; tmp != nil; tmp = tmp.Next {
-		fmt.Print(tmp.Num)
-		if tmp.Next != nil {
-			fmt.Print(" -> ")
-		}
-	}
-	fmt.Println()
+    num1 := &NodeAddL{Num: 1}
+    num1 = pushBack(num1, 2)
+    num1 = pushBack(num1, 3)
+    num1 = pushBack(num1, 4)
+    num1 = pushBack(num1, 5)
+
+    result := Changeorder(num1)
+    for tmp := result; tmp != nil; tmp = tmp.Next {
+        fmt.Print(tmp.Num)
+        if tmp.Next != nil {
+            fmt.Print(" -> ")
+        }
+    }
+    fmt.Println()
 }
 
 ```
@@ -68,7 +68,7 @@ func main() {
 Its output:
 
 ```console
-$> go build
-$> ./main
+$ go build
+$ ./main
 1 -> 3 -> 5 -> 2 -> 4
 ```
diff --git a/subjects/merge.en.md b/subjects/merge.en.md
index 4922b1dee..9f0d26344 100644
--- a/subjects/merge.en.md
+++ b/subjects/merge.en.md
@@ -66,7 +66,6 @@ Here is a possible program to test your function :
 ```go
 package main
 
-
 func main() {
   mergedTree := &TreeNodeM{}
   t1 := NewRandTree()
diff --git a/subjects/nauuo.en.md b/subjects/nauuo.en.md
index 49cf8da0d..2d9e35e03 100644
--- a/subjects/nauuo.en.md
+++ b/subjects/nauuo.en.md
@@ -37,15 +37,15 @@ Here is a possible program to test your function :
 package main
 
 import (
-	"fmt"
-	piscine ".."
+    "fmt"
+    piscine ".."
 )
 
 func main() {
-	fmt.Println(piscine.Nauuo(50, 43, 20))
-	fmt.Println(piscine.Nauuo(13, 13, 0))
-	fmt.Println(piscine.Nauuo(10, 9, 0))
-	fmt.Println(piscine.Nauuo(5, 9, 2))
+    fmt.Println(piscine.Nauuo(50, 43, 20))
+    fmt.Println(piscine.Nauuo(13, 13, 0))
+    fmt.Println(piscine.Nauuo(10, 9, 0))
+    fmt.Println(piscine.Nauuo(5, 9, 2))
 }
 ```
 
diff --git a/subjects/reverse.en.md b/subjects/reverse.en.md
index 9535f5f3a..00af63427 100644
--- a/subjects/reverse.en.md
+++ b/subjects/reverse.en.md
@@ -22,8 +22,8 @@ Write a function that reverses the list and returns pointer/reference to new lin
 package main
 
 type NodeAddL struct {
-	Next *NodeAddL
-	Num  int
+    Next *NodeAddL
+    Num  int
 }
 
 func Reverse(node *NodeAddL) *NodeAddL {
@@ -47,22 +47,21 @@ func pushBack(n *NodeAddL, num int) *NodeAddL{
 }
 
 func main() {
-	num1 := &piscine.NodeAddL{Num: 1}
-	num1 = pushBack(num1, 3)
-	num1 = pushBack(num1, 2)
-	num1 = pushBack(num1, 4)
-	num1 = pushBack(num1, 5)
-
-	result := piscine.Reverse(num1)
-	for tmp := result; tmp != nil; tmp = tmp.Next {
-		fmt.Print(tmp.Num)
-		if tmp.Next != nil {
-			fmt.Print(" -> ")
-		}
-	}
-	fmt.Println()
+    num1 := &piscine.NodeAddL{Num: 1}
+    num1 = pushBack(num1, 3)
+    num1 = pushBack(num1, 2)
+    num1 = pushBack(num1, 4)
+    num1 = pushBack(num1, 5)
+
+    result := piscine.Reverse(num1)
+    for tmp := result; tmp != nil; tmp = tmp.Next {
+        fmt.Print(tmp.Num)
+        if tmp.Next != nil {
+            fmt.Print(" -> ")
+        }
+    }
+    fmt.Println()
 }
-
 ```
 
 Its output: