diff --git a/subjects/listreverse.en.md b/subjects/listreverse.en.md
index a602a052a..bbe15d797 100644
--- a/subjects/listreverse.en.md
+++ b/subjects/listreverse.en.md
@@ -9,17 +9,17 @@ Write a function `ListReverse` that reverses the elements order of a given linke
 ### Expected function and structure
 
 ```go
-type node struct {
-	data interface{}
-	next *node
+type NodeL struct {
+	Data interface{}
+	Next *NodeL
 }
 
-type list struct {
-	head *node
-	tail *node
+type List struct {
+	Head *NodeL
+	Tail *NodeL
 }
 
-func ListReverse(l *list) {
+func ListReverse(l *List) {
 }
 ```
 
@@ -36,18 +36,18 @@ import (
 )
 
 func main() {
-	link := &list{}
+	link := &piscine.List{}
 
-	listPushBack(link, 1)
-	listPushBack(link, 2)
-	listPushBack(link, 3)
-	listPushBack(link, 4)
+	piscine.ListPushBack(link, 1)
+	piscine.ListPushBack(link, 2)
+	piscine.ListPushBack(link, 3)
+	piscine.ListPushBack(link, 4)
 
-	listReverse(link)
+	piscine.ListReverse(link)
 
-	for link.head != nil {
-		fmt.Println(link.head.data)
-		link.head = link.head.next
+	for link.Head != nil {
+		fmt.Println(link.Head.Data)
+		link.Head = link.Head.Next
 	}
 }
 ```