From 81f17a2f2273d0db269e57157bee18ea10b6ec6d Mon Sep 17 00:00:00 2001 From: Salman Shah Date: Sat, 11 Mar 2023 23:07:49 +0000 Subject: [PATCH] Missing instructions added for go linked list --- exercises/practice/linked-list/.docs/instructions.append.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/exercises/practice/linked-list/.docs/instructions.append.md b/exercises/practice/linked-list/.docs/instructions.append.md index 5751a2dea..1ccc8825b 100644 --- a/exercises/practice/linked-list/.docs/instructions.append.md +++ b/exercises/practice/linked-list/.docs/instructions.append.md @@ -20,7 +20,7 @@ Your `List` should have the following methods: * `First() *Node`: returns a pointer to the first node (head). * `Last() *Node`: returns a pointer to the last node (tail). * `Push(v interface{})`: insert value at the back of the list. -* `Pop() (interface{}, error)`: remove value from the back of the list. +* `Pop() (interface{}, error)`: remove value from the back of the list. function returns an error "list is empty" if Pop called on empty list. * `Unshift(v interface{}) `: insert value at the front of the list. -* `Shift() (interface{}, error)`: remove value from the front of the list. +* `Shift() (interface{}, error)`: remove value from the front of the list. function returns an error "list is empty" if Shift called on empty list. * `Reverse()`: reverse the linked list.