AvraamMavridis · cherouvim · Nov 23, 2019 · Nov 23, 2019 · Nov 23, 2019 · Nov 23, 2019
diff --git a/README.md b/README.md
@@ -90,4 +90,4 @@
 - <a href="https://github.com/AvraamMavridis/FE-questions-answers/blob/master/exercises/exercise64.md">64. Find whether there exists a pair of elements, one from S1 and one from S2, that add up to x in O(n)</a>
 - <a href="https://github.com/AvraamMavridis/FE-questions-answers/blob/master/exercises/exercise65.md">65. Find the k smallest elements of an unsorted set of n integers in O(n + k log n)</a>
 
-<a href="https://github.com/AvraamMavridis/FE-questions-answers/blob/master/exerciseUtils.md">Various Utils helpful to generate test data</a>
+<a href="https://github.com/AvraamMavridis/FE-questions-answers/blob/master/exercises/exerciseUtils.md">Various Utils helpful to generate test data</a>
diff --git a/algorithms/binarySearch.md b/algorithms/binarySearch.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Implemenent Binary Search in an array
 

diff --git a/algorithms/countSort.md b/algorithms/countSort.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Implemenent CountingSort.
 

diff --git a/algorithms/heapify.md b/algorithms/heapify.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Create a maxHeap
 

diff --git a/algorithms/insertionSort.md b/algorithms/insertionSort.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Implemenent insertionSort.
 

diff --git a/algorithms/mergeSort.md b/algorithms/mergeSort.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Implemenent Merge Sort.
 

diff --git a/algorithms/quickSort.md b/algorithms/quickSort.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Implemenent QuickSort
 

diff --git a/algorithms/radixSort.md b/algorithms/radixSort.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Implemenent LSD (less-significant-bit) Radix Sort.
 

diff --git a/algorithms/selectionSort.md b/algorithms/selectionSort.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Implemenent Selection Sort.
 

diff --git a/exercises/exercise3.md b/exercises/exercise3.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 Create nested object from multiple string paths
 

diff --git a/exercises/exercise4.md b/exercises/exercise4.md
@@ -1,4 +1,4 @@
-## Exersice
+## Exercise
 
 For each of the following problems, give an algorithm that finds the desired numbers within the given amount of time. To keep your answers brief, feel free to use known algorithms as subroutines. For the example, S={6,13,19,3,8}, 19−3 maximizes the difference, while 8−6 minimizes the difference.
 

diff --git a/test.md b/test.md
@@ -0,0 +1,3 @@
+foobar
+
+[test 123](algorithms/mergeSort.md)