diff --git a/README.md b/README.md
index 7a40899..647f472 100644
--- a/README.md
+++ b/README.md
@@ -12,6 +12,7 @@ This Specialization is unique, because it offers two real-world projects. Advanc
 Assignments for Algorithmic Toolbox on Coursera with time and memory results from grader </br>
 
 ## Week 1
+
 ### Solving a Simple Code Problem
 Problem: [Maximum Pairwise Product](https://github.com/mablatnik/Data-Structures-And-Algorithms/tree/master/algorithmic_toolbox/week_1/maximum_pairwise_product)
 
@@ -20,6 +21,7 @@ Problem: [Maximum Pairwise Product](https://github.com/mablatnik/Data-Structures
 * C++: Max time used: 0.12/1.00, max memory used: 21045248/536870912
 
 ## Week 2
+
 ###  Prgramming Assignment: [Introduction](https://github.com/mablatnik/Data-Structures-And-Algorithms/blob/master/algorithmic_toolbox/week_2/01_introduction_problems.pdf)
 Problem: [Small Fibonacci Number](https://github.com/mablatnik/Data-Structures-And-Algorithms/tree/master/algorithmic_toolbox/week_2/01_introduction_starter_files/fibonacci) </br>
 
@@ -62,6 +64,7 @@ Advanced Problem: [Last Digit of a Partial Sum of Fibonacci Numbers](https://git
 * Python: Max time used: 0.05/5.00, max memory used: 8720384/536870912
 
 ## Week 3
+
 ###  Programming Assignment: [Greedy Algorithms](https://github.com/mablatnik/Data-Structures-And-Algorithms/blob/master/algorithmic_toolbox/week_3/02_greedy_algorithms_problems.pdf)
 Problem: [Changing Money](https://github.com/mablatnik/Data-Structures-And-Algorithms/tree/master/algorithmic_toolbox/week_3/02_greedy_algorithms_starter_files/change) </br>
 
@@ -94,6 +97,7 @@ Problem: [Pairwise Distinct Summands](https://github.com/mablatnik/Data-Structur
 * C++: Max time used: 0.00/1.00, max memory used: 9613312/536870912
 
 ## Week 4
+
 ###  Programming Assignment: [Divide and Conquer](https://github.com/mablatnik/Data-Structures-And-Algorithms/blob/master/algorithmic_toolbox/week_4/03_divide_and_conquer_problems.pdf)
 Problem: [Binary Search](https://github.com/mablatnik/Data-Structures-And-Algorithms/tree/master/algorithmic_toolbox/week_4/03_divide_and_conquer_starter_files_20160804/binary_search) </br>
 
@@ -124,6 +128,7 @@ Advanced Problem: [Points and Segments](https://github.com/mablatnik/Data-Struct
 * Python: Max time used: 0.41/20.00, max memory used: 44896256/536870912
 
 ## Week 5
+
 ### Programming Assignment: [Dynamic Programming](https://github.com/mablatnik/Data-Structures-And-Algorithms/blob/master/algorithmic_toolbox/week_5/04_dynamic_programming_problems.pdf)
 Problem: [Primitive Calculator](https://github.com/mablatnik/Data-Structures-And-Algorithms/tree/master/algorithmic_toolbox/week_5/04_dynamic_programming_starter_files/primitive_calculator) </br>
 
@@ -153,4 +158,4 @@ Advanced Problem: [Longest Common Subsequence of Three Sequences]() </br>
 
 * Python:
 * Java:
-* C++:
\ No newline at end of file
+* C++: