Rm/fix lint problems

README.md

@@ -20,7 +20,7 @@ This learning platform offers several advantages over traditional learning metho
 * Time and Space Analysis
 * Data Structures
   * [Arrays](./array)
-  * [Strings](./string)
+  * [Strings](./strings)
   * [Linked Lists](./linkedlist)
   * [Stacks](./stack)
   * [Queues](./queue)

array/README.md

@@ -82,7 +82,7 @@ Both addition and deletion operations on arrays can be O(n) operations in Arrays
 
 ## Application
 
-Arrays are used wherever sequential data or more than one piece of data is needed. The fast read and write access to a given element makes arrays suitable for implementing other data structures such as [strings](../string), [stacks](../stack), [queues](../queue) and [hash tables](../hashtable).
+Arrays are used wherever sequential data or more than one piece of data is needed. The fast read and write access to a given element makes arrays suitable for implementing other data structures such as [strings](../strings), [stacks](../stack), [queues](../queue) and [hash tables](../hashtable).
 
 ## Rehearsal
 

string/in_memory_database.go → strings/in_memory_database.go

@@ -1,4 +1,4 @@
-package string
+package strings
 
 import (
 	"strings"

string/in_memory_database_test.go → strings/in_memory_database_test.go

@@ -1,4 +1,4 @@
-package string
+package strings
 
 import (
 	"strings"
@@ -13,8 +13,8 @@ func TestInMemoryDictionary(t *testing.T) {
 		{"EXISTS A\nSET A 1\nGET A\nEXISTS A\nUNSET A\nGET A\nEXISTS A", "false 1 true nil false"},
 		{"GET A\nBEGIN\nSET A 1\nGET A\nROLLBACK\nGET A", "nil 1 nil"},
 		{"GET A\nBEGIN\nSET A 1\nGET A\nCOMMIT\nGET A", "nil 1 1"},
+		{"SET A 1\nGET A\nBEGIN\nSET A 2\nGET A\nBEGIN\nUNSET A\nGET A\nCOMMIT\nROLLBACK\nGET A", "1 2 nil 1"},
 		{"SET A 2\nGET A\nBEGIN\nSET A 1\nGET A\nCOMMIT\nGET A\nBEGIN\nSET A 2\nGET A\nROLLBACK\nGET A", "2 1 1 2 1"},
-		{"SET A 1\nGET A\nBEGIN\nSET A 2\nGET A\nBEGIN\nUNSET A\nGET A\nCOMMIT\nGET A\nROLLBACK\nGET A", "1 2 nil nil 1"},
 	}
 
 	for i, test := range tests {

string/longest_dictionary_word.go → strings/longest_dictionary_word.go

@@ -1,4 +1,4 @@
-package string
+package strings
 
 // LongestDictionaryWordContainingKey returns the longest word in a dictionary
 // containing every letter of a key

string/longest_dictionary_word_test.go → strings/longest_dictionary_word_test.go

@@ -1,4 +1,4 @@
-package string
+package strings
 
 import (
 	"testing"

string/longest_substring.go → strings/longest_substring.go

@@ -1,4 +1,4 @@
-package string
+package strings
 
 // LongestSubstringOfTwoChars returns the longest substring of two different characters in a string
 func LongestSubstringOfTwoChars(input string) string {

string/longest_substring_test.go → strings/longest_substring_test.go

@@ -1,4 +1,4 @@
-package string
+package strings
 
 import (
 	"testing"

string/look_and_tell.go → strings/look_and_tell.go

@@ -1,4 +1,4 @@
-package string
+package strings
 
 import (
 	"strconv"

string/look_and_tell_test.go → strings/look_and_tell_test.go

@@ -1,4 +1,4 @@
-package string
+package strings
 
 import (
 	"testing"

string/number_in_english.go → strings/number_in_english.go

@@ -1,4 +1,4 @@
-package string
+package strings
 
 import (
 	"strings"

string/number_in_english_test.go → strings/number_in_english_test.go

@@ -1,4 +1,4 @@
-package string
+package strings
 
 import (
 	"testing"

string/reverse_vowels.go → strings/reverse_vowels.go

@@ -1,4 +1,4 @@
-package string
+package strings
 
 import "errors"
 

string/reverse_vowels_test.go → strings/reverse_vowels_test.go

@@ -1,4 +1,4 @@
-package string
+package strings
 
 import (
 	"testing"