Skip to content

Commit ae14306

Browse files
authored
Add problem description test case and fix typo (#113)
1 parent b9235b0 commit ae14306

File tree

2 files changed

+2
-1
lines changed

2 files changed

+2
-1
lines changed

README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -103,7 +103,7 @@ Welcome to **Data Structures and Algorithms in Go**! 🎉 This project is design
103103
* [Permutations](./backtracking/permutations_test.go)
104104
* [Generate Parentheses](./backtracking/generate_parentheses_test.go)
105105
* [Phone Letter Combinations](./backtracking/phone_letter_combinations_test.go)
106-
* [Maze](./backtracking/maze_test.go),
106+
* [Maze](./backtracking/maze_test.go)
107107
* [Sudoku](./backtracking/sudoku_test.go)
108108
* [N Queens](./backtracking/n_queens_test.go)
109109
* [Graphs](./graph/README.md)

strings/longest_substring_test.go

+1
Original file line numberDiff line numberDiff line change
@@ -20,6 +20,7 @@ func TestLongestSubstrings(t *testing.T) {
2020
{"a", ""}, // No occurrence of sequence of two characters
2121
{"ab", "ab"},
2222
{"abcc", "bcc"},
23+
{"aabbc", "aabb"},
2324
{"ada", "ada"},
2425
{"dafff", "afff"},
2526
{"assdeeeddfffha", "deeedd"},

0 commit comments

Comments
 (0)