fix: Change names.

Author: goloroden

README.md

@@ -6,7 +6,7 @@ codingcircle contains the examples from the YouTube Coding Cirle.
 
 So far, the following exercises have been covered:
 
-- [Playlist](./playlist/) – removing the k-th last element from a single-linked list
+- [Remove k-th last element](./removekthlastelement/) – removing the k-th last element from a single-linked list
 - [Trie](./trie/) – implementing an autocomplete feature using a trie
 
 ## Running quality assurance

playlist/documentation.go

@@ -0,0 +1,3 @@
+// Package removekthlastelement provides a single-linked list where the k-th
+// last element can be removed.
+package removekthlastelement

playlist/remove_kth_last_element_test.go

@@ -1,4 +1,4 @@
-package playlist
+package removekthlastelement
 
 func GetListValues(head *Node) []int {
 	node := head

removekthlastelement/documentation.go

@@ -1,4 +1,4 @@
-package playlist
+package removekthlastelement
 
 type Node struct {
 	Value int

playlist/get_list_values.go removekthlastelement/get_list_values.goplaylist/get_list_values.go renamed to removekthlastelement/get_list_values.go

@@ -1,4 +1,4 @@
-package playlist
+package removekthlastelement
 
 func RemoveKthLastElement(head *Node, k int) *Node {
 	lead := head

playlist/node.go removekthlastelement/node.goplaylist/node.go renamed to removekthlastelement/node.go

@@ -0,0 +1,65 @@
+package removekthlastelement_test
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+	"github.com/thenativeweb/codingcircle/removekthlastelement"
+)
+
+func TestRemoveKthLastElement(t *testing.T) {
+	t.Run("remove last element", func(t *testing.T) {
+		list :=
+			removekthlastelement.NewNode(2,
+				removekthlastelement.NewNode(3,
+					removekthlastelement.NewNode(5,
+						removekthlastelement.NewNode(7,
+							removekthlastelement.NewNode(11, nil)))))
+
+		updatedList := removekthlastelement.RemoveKthLastElement(list, 1)
+		values := removekthlastelement.GetListValues(updatedList)
+
+		assert.Equal(t, []int{2, 3, 5, 7}, values)
+	})
+
+	t.Run("remove first element", func(t *testing.T) {
+		list :=
+			removekthlastelement.NewNode(2,
+				removekthlastelement.NewNode(3,
+					removekthlastelement.NewNode(5,
+						removekthlastelement.NewNode(7,
+							removekthlastelement.NewNode(11, nil)))))
+
+		updatedList := removekthlastelement.RemoveKthLastElement(list, 5)
+		values := removekthlastelement.GetListValues(updatedList)
+
+		assert.Equal(t, []int{3, 5, 7, 11}, values)
+	})
+
+	t.Run("remove k-th last element", func(t *testing.T) {
+		list :=
+			removekthlastelement.NewNode(2,
+				removekthlastelement.NewNode(3,
+					removekthlastelement.NewNode(5,
+						removekthlastelement.NewNode(7,
+							removekthlastelement.NewNode(11, nil)))))
+
+		updatedList := removekthlastelement.RemoveKthLastElement(list, 2)
+		values := removekthlastelement.GetListValues(updatedList)
+
+		assert.Equal(t, []int{2, 3, 5, 11}, values)
+	})
+
+	t.Run("with too large k", func(t *testing.T) {
+		list :=
+			removekthlastelement.NewNode(2,
+				removekthlastelement.NewNode(3,
+					removekthlastelement.NewNode(5,
+						removekthlastelement.NewNode(7,
+							removekthlastelement.NewNode(11, nil)))))
+
+		updatedList := removekthlastelement.RemoveKthLastElement(list, 17)
+
+		assert.Nil(t, updatedList)
+	})
+}