Skip to content

Commit 4f6531c

Browse files
committed
fixed links for testing in READMEs for challenges
1 parent 757e0c7 commit 4f6531c

File tree

5 files changed

+5
-5
lines changed

5 files changed

+5
-5
lines changed

challenge_1/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ Example: Given s = "hello", return "olleh".
88

99
- Try to make the solution as short and simple as possible in your respective language of choice.
1010

11-
##[Testing](#https://github.com/YearOfProgramming/2017Challenges/tree/testing#testing)
11+
##[Testing](https://github.com/YearOfProgramming/2017Challenges/tree/testing#testing)
1212

1313
Expected intput:
1414

challenge_2/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@ example: given array = [2,3,4,2,3,5,4,6,4,6,9,10,9,8,7,8,10,7] your program shou
1111
- attempt to search through the array with characters
1212
extra credit: given array = [2,a,l,3,l,4,k,2,3,4,a,6,c,4,m,6,m,k,9,10,9,8,7,8,10,7] your program should return: c
1313

14-
[Testing](#https://github.com/YearOfProgramming/2017Challenges/tree/testing#testing)
14+
[Testing](https://github.com/YearOfProgramming/2017Challenges/tree/testing#testing)
1515

1616
Expected input:
1717

challenge_3/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88

99
for example, given array = [2,2,3,7,5,7,7,7,4,7,2,7,4,5,6,7,7,8,6,7,7,8,10,12,29,30,19,10,7,7,7,7,7,7,7,7,7] your program should return 7
1010

11-
[Testing](#https://github.com/YearOfProgramming/2017Challenges/tree/testing#testing)
11+
[Testing](https://github.com/YearOfProgramming/2017Challenges/tree/testing#testing)
1212

1313
Expected input:
1414

challenge_4/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -14,6 +14,6 @@ after your program runs, it should return a tree that looks like this
1414

1515
- Your program should run on any size tree. What is the runtime and space of your algorithm? Do you think it's reasonable? These are important questions you should ask yourself when creating these types of solutions.
1616

17-
[Testing](#https://github.com/YearOfProgramming/2017Challenges/tree/testing#testing)
17+
[Testing](https://github.com/YearOfProgramming/2017Challenges/tree/testing#testing)
1818

1919
There is no automated testing for this challenge.

challenge_5/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -28,7 +28,7 @@ If you did all of that correctly, then you should be able to use my test.py file
2828

2929
This is the first unit test I've written in python so go easy on the criticism ;) but it is still indeed welcome.
3030

31-
[Testing](#https://github.com/YearOfProgramming/2017Challenges/tree/testing#testing)
31+
[Testing](https://github.com/YearOfProgramming/2017Challenges/tree/testing#testing)
3232

3333
Expected input:
3434

0 commit comments

Comments
 (0)