From 0c6a074c21aaebd5064eefb51167989bc2f6c94a Mon Sep 17 00:00:00 2001
From: Maxence Bouret <maxence.bouret@gmail.com>
Date: Tue, 27 Mar 2018 17:44:03 +0200
Subject: [PATCH 1/8] Add of exercises

---
 README.md                  |   4 +-
 SUMMARY.md                 |   2 +
 exercises/README.md        |   4 +
 exercises/all_exercises.md | 215 +++++++++++++++++++++++++++++++++++++
 4 files changed, 224 insertions(+), 1 deletion(-)
 create mode 100644 exercises/README.md
 create mode 100644 exercises/all_exercises.md

diff --git a/README.md b/README.md
index 7ec588c8..f12141a5 100644
--- a/README.md
+++ b/README.md
@@ -1,6 +1,8 @@
-Learn Javascript
+Learn the basics of Javascript
 ======
 
+This book is based from [Learn Javascript made by Gitbook](https://www.gitbook.com/book/gitbookio/javascript/details). Ironhack adapted it a little so it has more exercises and it prepare yourself for our Technical Interviews!
+
 This book will teach you the basics of programming and Javascript. Whether you are an experienced programmer or not, this book is intended for everyone who wishes to learn the JavaScript programming language.
 
 ![Screen](./assets/intro.png)
diff --git a/SUMMARY.md b/SUMMARY.md
index fb6a379d..09d479fa 100644
--- a/SUMMARY.md
+++ b/SUMMARY.md
@@ -37,4 +37,6 @@
     * [Delete](objects/delete.md)
     * [Enumeration](objects/enumeration.md)
     * [Global footprint](objects/global_footprint.md)
+* [Exercises](exercises/README.md)
+    * [All Exercises](exercises/all_exercises.md)
 
diff --git a/exercises/README.md b/exercises/README.md
new file mode 100644
index 00000000..699197b4
--- /dev/null
+++ b/exercises/README.md
@@ -0,0 +1,4 @@
+# Exercises
+
+Now it's time to practise everything to consolidate your knowledge and make sure you understood everything!
+
diff --git a/exercises/all_exercises.md b/exercises/all_exercises.md
new file mode 100644
index 00000000..7fa7b10d
--- /dev/null
+++ b/exercises/all_exercises.md
@@ -0,0 +1,215 @@
+# All Exercises
+
+
+{% exercise %}
+Substration of 2 numbers
+
+{% initial %}
+// Exercise 1: Substration of 2 numbers
+function subs(a, b) {
+} 
+
+{% solution %}
+function subs(a, b) {
+    return a - b;
+} 
+
+{% validation %}
+assert(subs(42, 38) === 4);
+assert(subs(38, 42) === -4);
+assert(subs(100,100) === 0);
+
+{% endexercise %}
+
+
+
+{% exercise %}
+Define a function named `negate` that takes `add1` as argument and returns a function, that returns the negation of the value returned by `add1`. (Things get a bit more complicated ;) )
+{% initial %}
+var add1 = function (x) {
+    return x + 1;
+};
+
+var negate = function(func) {
+    // TODO
+};
+
+// Should return -6
+// Because (5+1) * -1 = -6
+negate(add1)(5);
+
+{% solution %}
+var add1 = function (x) {
+    return x + 1;
+}
+
+var negate = function(func) {
+    return function(x) {
+        return -1 * func(x);
+    }
+}
+
+negate(add1)(5);
+{% validation %}
+assert(negate(add1)(5) === -6);
+{% endexercise %}
+
+
+```javascript
+// Try to solve has many exercises as possible
+// You can go to https://repl.it/languages/javascript to test your code
+// Send your code the person that sent you the challenge, for example by saving the code in Repl.it and sharing the link
+
+// To help solving it, you can find  
+
+// Good luck ;)
+
+// Exercise 0 (Example): Function that returns the sum of 2 numbers
+function sum(a, b) {
+  var result = a + b;
+  return result;
+} 
+console.log("> Exercice 0 --- Should display 42");
+console.log(sum(20, 22));
+
+
+// Exercise 1: Substration of 2 numbers
+function subs(a, b) {
+} 
+console.log("\n> Exercice 1 --- Should display 4");
+console.log(subs(42, 38));
+
+
+// Exercise 2: Find the maximum
+function maxOfTwoNumbers(a, b) {
+} 
+console.log("\n> Exercice 2 --- Should display 6");
+console.log(maxOfTwoNumbers(2, 6));
+
+
+// Exercise 3: Find the longest word
+// Hint: you can use a variable "currentMax". In the example, its value would be: 0, 3, 5, 42, 42, 42
+function maxOfArray(numbers) {
+}
+console.log("\n> Exercice 3 --- Should display 42");
+console.log(maxOfArray([ 3, 5, 42, 12, 38 ]));
+
+
+// Exercise 4: Find the longest word
+function findLongestWord (words) {
+}
+var words = [
+  "mystery",
+  "brother",
+  "aviator",
+  "crocodile",
+  "pearl",
+  "orchard",
+  "crackpot"
+];
+console.log("\n> Exercice 4 --- Should display 'crocodile'");
+console.log(findLongestWord(words));
+
+
+// Exercise 5: Calculate the sum of all elements
+function sumArray (array) {
+}
+console.log("\n> Exercice 5 --- Should display 20");
+console.log(sumArray([6, 3, 1, 10]));
+
+// Exercise 6: Calculate the average of all elements
+function averageNumbers (array) {
+}
+console.log("\n> Exercice 6 --- Should display 5");
+console.log(averageNumbers([6, 3, 1, 10]));
+
+
+// Exercise 7: Calculate the average length of all elements
+function averageWordLength (array) {
+}
+var words = [
+  "seat",
+  "correspond",
+  "linen",
+  "motif",
+  "hole",
+  "smell",
+  "smart",
+  "chaos",
+  "fuel",
+  "palace"
+];
+console.log("\n> Exercice 7 --- Should display 5.3");
+console.log(averageWordLength(words));
+
+
+// Exercise 8: Finding a string inside an array
+function doesWordExist (wordsArray, word) {
+}
+var words = [
+  "machine",
+  "subset",
+  "trouble",
+  "starting",
+  "matter",
+  "eating",
+  "truth",
+  "disobedience"
+];
+console.log("\n> Exercice 8 --- Should display true, false");
+console.log(doesWordExist(words, "matter"));
+console.log(doesWordExist(words, "dog"));
+
+
+// Exercise 9: Counting Repetion
+function howManyTimes (words, word) {
+}
+var words = [
+  "machine",
+  "matter",
+  "subset",
+  "trouble",
+  "starting",
+  "matter",
+  "eating",
+  "matter",
+  "truth",
+  "disobedience",
+  "matter"
+];
+console.log("\n> Exercice 9 --- Should display 4, 0");
+console.log(howManyTimes(words, "matter"));
+console.log(howManyTimes(words, "dog"));
+
+
+// Exercise 10 (bonus): find the greatest product, on a row or a on column
+// In the following example, the greatest product is on the second column (3 and 4) and its value is 12 (3*4). 
+//   [  [1,3]
+//      [2,4]  ]
+function greatestProduct (matrix) {
+}
+var matrix = [
+  [08,02,22,97,38,15,0,40,0,75,04,05,07,78,52,12,50,77,91,08],
+  [49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48,04,56,62,0],
+  [81,49,31,73,55,79,14,29,93,71,40,67,53,88,30,03,49,13,36,65],
+  [52,70,95,23,04,60,11,42,69,24,68,56,01,32,56,71,37,02,36,91],
+  [22,31,16,71,51,67,63,89,41,92,36,54,22,40,40,28,66,33,13,80],
+  [24,47,32,60,99,03,45,02,44,75,33,53,78,36,84,20,35,17,12,50],
+  [32,98,81,28,64,23,67,10,26,38,40,67,59,54,70,66,18,38,64,70],
+  [67,26,20,68,02,62,12,20,95,63,94,39,63,08,40,91,66,49,94,21],
+  [24,55,58,05,66,73,99,26,97,17,78,78,96,83,14,88,34,89,63,72],
+  [21,36,23,09,75,0,76,44,20,45,35,14,0,61,33,97,34,31,33,95],
+  [78,17,53,28,22,75,31,67,15,94,03,80,04,62,16,14,09,53,56,92],
+  [16,39,05,42,96,35,31,47,55,58,88,24,0,17,54,24,36,29,85,57],
+  [86,56,0,48,35,71,89,07,05,44,44,37,44,60,21,58,51,54,17,58],
+  [19,80,81,68,05,94,47,69,28,73,92,13,86,52,17,77,04,89,55,40],
+  [04,52,08,83,97,35,99,16,07,97,57,32,16,26,26,79,33,27,98,66],
+  [88,36,68,87,57,62,20,72,03,46,33,67,46,55,12,32,63,93,53,69],
+  [04,42,16,73,38,25,39,11,24,94,72,18,08,46,29,32,40,62,76,36],
+  [20,69,36,41,72,30,23,88,34,62,99,69,82,67,59,85,74,04,36,16],
+  [20,73,35,29,78,31,90,01,74,31,49,71,48,86,81,16,23,57,05,54],
+  [01,70,54,71,83,51,54,69,16,92,33,48,61,43,52,01,89,19,67,48],
+];
+console.log("\n> Exercice 10 (bonus)");
+console.log(greatestProduct(matrix));
+```

From eccd9836ff47927325c0fe29df4548244fe04adc Mon Sep 17 00:00:00 2001
From: Maxence Bouret <maxence.bouret@gmail.com>
Date: Tue, 27 Mar 2018 17:56:51 +0200
Subject: [PATCH 2/8] Add of exercise 2

---
 exercises/all_exercises.md | 72 +++++++++++++++++++++++++-------------
 1 file changed, 48 insertions(+), 24 deletions(-)

diff --git a/exercises/all_exercises.md b/exercises/all_exercises.md
index 7fa7b10d..9c7ca760 100644
--- a/exercises/all_exercises.md
+++ b/exercises/all_exercises.md
@@ -1,6 +1,6 @@
 # All Exercises
 
-
+<!-- Exercise 1 -->
 {% exercise %}
 Substration of 2 numbers
 
@@ -15,43 +15,67 @@ function subs(a, b) {
 } 
 
 {% validation %}
-assert(subs(42, 38) === 4);
-assert(subs(38, 42) === -4);
-assert(subs(100,100) === 0);
+assert(subs(42, 38) === 4, "Testing subs(42, 38)");
+assert(subs(38, 42) === -4, "Testing subs(38, 42)");
+assert(subs(100,100) === 0, "Testing subs(100,100)");
+
+{% endexercise %}
+
+<!-- Exercise 2 -->
+{% exercise %}
+Substration of 2 numbers
+
+{% initial %}
+function subs(a, b) {
+
+
+
+
+    
+} 
+
+{% solution %}
+function subs(a, b) {
+    return a - b;
+} 
+
+{% validation %}
+assert(subs(42, 38) === 4, "Testing subs(42, 38)");
+assert(subs(38, 42) === -4, "Testing subs(38, 42)");
+assert(subs(100,100) === 0, "Testing subs(100,100)");
 
 {% endexercise %}
 
 
 
+<!-- Exercise 2 -->
 {% exercise %}
-Define a function named `negate` that takes `add1` as argument and returns a function, that returns the negation of the value returned by `add1`. (Things get a bit more complicated ;) )
+Find the maximum
+
 {% initial %}
-var add1 = function (x) {
-    return x + 1;
-};
+function maxOfTwoNumbers(a, b) {
 
-var negate = function(func) {
-    // TODO
-};
 
-// Should return -6
-// Because (5+1) * -1 = -6
-negate(add1)(5);
 
-{% solution %}
-var add1 = function (x) {
-    return x + 1;
-}
 
-var negate = function(func) {
-    return function(x) {
-        return -1 * func(x);
+  
+}  
+
+{% solution %}
+function maxOfTwoNumbers(a, b) {
+    if (a > b) {
+        return a;
     }
-}
+    else {
+        return b;
+    }
+} 
 
-negate(add1)(5);
 {% validation %}
-assert(negate(add1)(5) === -6);
+assert(maxOfTwoNumbers(42, 38) === 42, "Testing maxOfTwoNumbers(42, 38)");
+assert(maxOfTwoNumbers(38, 42) === 42, "Testing maxOfTwoNumbers(38, 42)");
+assert(maxOfTwoNumbers(100,100) === 100, "Testing maxOfTwoNumbers(100,100)");
+
 {% endexercise %}
 
 

From 00b84388482864f3858bf3adf26eff2ed29e3357 Mon Sep 17 00:00:00 2001
From: Maxence Bouret <maxence.bouret@gmail.com>
Date: Tue, 27 Mar 2018 18:16:32 +0200
Subject: [PATCH 3/8] Add of exercise 3

---
 exercises/all_exercises.md | 172 +++++++++++++++++++++++++++++++------
 1 file changed, 147 insertions(+), 25 deletions(-)

diff --git a/exercises/all_exercises.md b/exercises/all_exercises.md
index 9c7ca760..0c84dd7e 100644
--- a/exercises/all_exercises.md
+++ b/exercises/all_exercises.md
@@ -7,6 +7,11 @@ Substration of 2 numbers
 {% initial %}
 // Exercise 1: Substration of 2 numbers
 function subs(a, b) {
+
+
+
+
+
 } 
 
 {% solution %}
@@ -21,60 +26,177 @@ assert(subs(100,100) === 0, "Testing subs(100,100)");
 
 {% endexercise %}
 
+
+
 <!-- Exercise 2 -->
 {% exercise %}
-Substration of 2 numbers
+Find the maximum of 2 numbers
 
 {% initial %}
-function subs(a, b) {
+function maxOfTwoNumbers(a, b) {
+}  
+
+{% solution %}
+function maxOfTwoNumbers(a, b) {
+    if (a > b) {
+        return a;
+    }
+    else {
+        return b;
+    }
+} 
+
+{% validation %}
+assert(maxOfTwoNumbers(42, 38) === 42, "Testing maxOfTwoNumbers(42, 38)");
+assert(maxOfTwoNumbers(38, 42) === 42, "Testing maxOfTwoNumbers(38, 42)");
+assert(maxOfTwoNumbers(100,100) === 100, "Testing maxOfTwoNumbers(100,100)");
 
+{% endexercise %}
 
 
+<!-- Exercise 2.1 -->
+{% exercise %}
+Find the maximum of 3 numbers
 
-    
-} 
+{% initial %}
+function maxOfThreeNumbers(a, b) {
+}  
 
 {% solution %}
-function subs(a, b) {
-    return a - b;
+function maxOfThreeNumbers(a, b) {
+    if (a > b && a > c) {
+        return a;
+    }
+    else if (b > c) {
+        return b;
+    }
+    else {
+        return c;
+    }
 } 
 
 {% validation %}
-assert(subs(42, 38) === 4, "Testing subs(42, 38)");
-assert(subs(38, 42) === -4, "Testing subs(38, 42)");
-assert(subs(100,100) === 0, "Testing subs(100,100)");
+assert(maxOfThreeNumbers(42, 38, 12) === 42, "Testing maxOfThreeNumbers(42, 38, 12)");
+assert(maxOfThreeNumbers(38, 42, 12) === 42, "Testing maxOfThreeNumbers(38, 42, 12)");
+assert(maxOfThreeNumbers(12, 38, 42) === 42, "Testing maxOfThreeNumbers(12, 38, 42)");
 
 {% endexercise %}
 
+<!-- Exercise 3 -->
+{% exercise %}
+Find the maximum of a non-empty array
 
+{% initial %}
+function maxOfArray(numbers) {
+}
 
-<!-- Exercise 2 -->
+{% solution %}
+function maxOfArray(numbers) {
+    if (numbers.length === 0) {
+        return null;
+    }
+    var currentMax = numbers[0];
+    for (var i = 1; i < numbers.length; i++) {
+        if (currentMax < numbers[i]) {
+            currentMax = numbers[i];
+        }
+    }
+    return currentMax;
+}
+
+{% validation %}
+assert(maxOfArray([42, 38, 12]) === 42, "Testing maxOfArray([42, 38, 12])");
+assert(maxOfArray([38, 42, 12]) === 42, "Testing maxOfArray([38, 42, 12])");
+assert(maxOfArray([12, 38, 42]) === 42, "Testing maxOfArray([12, 38, 42])");
+
+{% endexercise %}
+
+
+<!-- Exercise  -->
 {% exercise %}
-Find the maximum
 
 {% initial %}
-function maxOfTwoNumbers(a, b) {
 
 
+{% solution %}
 
 
-  
-}  
+{% validation %}
+assert(maxOfThreeNumbers(42, 38, 12) === 42, "Testing maxOfThreeNumbers(42, 38, 12)");
+assert(maxOfThreeNumbers(38, 42, 12) === 42, "Testing maxOfThreeNumbers(38, 42, 12)");
+assert(maxOfThreeNumbers(12, 38, 42) === 42, "Testing maxOfThreeNumbers(12, 38, 42)");
+
+{% endexercise %}
+
+
+
+<!-- Exercise  -->
+{% exercise %}
+
+{% initial %}
+
 
 {% solution %}
-function maxOfTwoNumbers(a, b) {
-    if (a > b) {
-        return a;
-    }
-    else {
-        return b;
-    }
-} 
+
 
 {% validation %}
-assert(maxOfTwoNumbers(42, 38) === 42, "Testing maxOfTwoNumbers(42, 38)");
-assert(maxOfTwoNumbers(38, 42) === 42, "Testing maxOfTwoNumbers(38, 42)");
-assert(maxOfTwoNumbers(100,100) === 100, "Testing maxOfTwoNumbers(100,100)");
+assert(maxOfThreeNumbers(42, 38, 12) === 42, "Testing maxOfThreeNumbers(42, 38, 12)");
+assert(maxOfThreeNumbers(38, 42, 12) === 42, "Testing maxOfThreeNumbers(38, 42, 12)");
+assert(maxOfThreeNumbers(12, 38, 42) === 42, "Testing maxOfThreeNumbers(12, 38, 42)");
+
+{% endexercise %}
+
+
+
+<!-- Exercise  -->
+{% exercise %}
+
+{% initial %}
+
+
+{% solution %}
+
+
+{% validation %}
+assert(maxOfThreeNumbers(42, 38, 12) === 42, "Testing maxOfThreeNumbers(42, 38, 12)");
+assert(maxOfThreeNumbers(38, 42, 12) === 42, "Testing maxOfThreeNumbers(38, 42, 12)");
+assert(maxOfThreeNumbers(12, 38, 42) === 42, "Testing maxOfThreeNumbers(12, 38, 42)");
+
+{% endexercise %}
+
+
+
+<!-- Exercise  -->
+{% exercise %}
+
+{% initial %}
+
+
+{% solution %}
+
+
+{% validation %}
+assert(maxOfThreeNumbers(42, 38, 12) === 42, "Testing maxOfThreeNumbers(42, 38, 12)");
+assert(maxOfThreeNumbers(38, 42, 12) === 42, "Testing maxOfThreeNumbers(38, 42, 12)");
+assert(maxOfThreeNumbers(12, 38, 42) === 42, "Testing maxOfThreeNumbers(12, 38, 42)");
+
+{% endexercise %}
+
+
+
+<!-- Exercise  -->
+{% exercise %}
+
+{% initial %}
+
+
+{% solution %}
+
+
+{% validation %}
+assert(maxOfThreeNumbers(42, 38, 12) === 42, "Testing maxOfThreeNumbers(42, 38, 12)");
+assert(maxOfThreeNumbers(38, 42, 12) === 42, "Testing maxOfThreeNumbers(38, 42, 12)");
+assert(maxOfThreeNumbers(12, 38, 42) === 42, "Testing maxOfThreeNumbers(12, 38, 42)");
 
 {% endexercise %}
 

From b47cf7b93bb62e12700ba08821fd6d964f393922 Mon Sep 17 00:00:00 2001
From: Maxence Bouret <maxence.bouret@gmail.com>
Date: Wed, 28 Mar 2018 01:59:06 +0200
Subject: [PATCH 4/8] Add of exercises and some courses

---
 SUMMARY.md                  |  10 +-
 arrays/array_methods.md     |  32 +++
 exercises/all_exercises.md  | 383 +++++++++++++++++-------------------
 functions/higher_order.md   |   2 +-
 objects/delete.md           |  14 --
 objects/enumeration.md      |  20 --
 objects/global_footprint.md |  18 --
 objects/mutable.md          |  10 -
 objects/prototype.md        |  43 ----
 objects/reference.md        |  33 ++--
 10 files changed, 233 insertions(+), 332 deletions(-)
 create mode 100644 arrays/array_methods.md
 delete mode 100644 objects/delete.md
 delete mode 100644 objects/enumeration.md
 delete mode 100644 objects/global_footprint.md
 delete mode 100644 objects/mutable.md
 delete mode 100644 objects/prototype.md

diff --git a/SUMMARY.md b/SUMMARY.md
index 09d479fa..97662053 100644
--- a/SUMMARY.md
+++ b/SUMMARY.md
@@ -21,22 +21,18 @@
 * [Arrays](arrays/README.md)
     * [Indices](arrays/indices.md)
     * [Length](arrays/length.md)
+    * [Array Methods](arrays/array_methods.md)
 * [Loops](loops/README.md)
     * [For](loops/for.md)
     * [While](loops/while.md)
     * [Do...While](loops/dowhile.md)
 * [Functions](functions/README.md)
     * [Declare](functions/declare.md)
-    * [Higher order](functions/higher_order.md)
+    * [Higher order (Advanced)](functions/higher_order.md)
 * [Objects](objects/README.md)
     * [Creation](objects/creation.md)
     * [Properties](objects/properties.md)
-    * [Mutable](objects/mutable.md)
-    * [Reference](objects/reference.md)
-    * [Prototype](objects/prototype.md)
-    * [Delete](objects/delete.md)
-    * [Enumeration](objects/enumeration.md)
-    * [Global footprint](objects/global_footprint.md)
+    * [Reference (Advanced)](objects/reference.md)
 * [Exercises](exercises/README.md)
     * [All Exercises](exercises/all_exercises.md)
 
diff --git a/arrays/array_methods.md b/arrays/array_methods.md
new file mode 100644
index 00000000..536d8baf
--- /dev/null
+++ b/arrays/array_methods.md
@@ -0,0 +1,32 @@
+# Push
+
+You can insert elements inside an array with their method `push`. In fact, there is many other properties:
+- `push(n)`: Add the element `n` at the end
+- `pop()`: Remove the last element
+- `sort()`: Sort the array by lexicographical order
+
+```javascript
+var array = [1, 2, 4];
+array.push(8);
+// Now array = [1, 2, 4, 8]
+```
+
+{% exercise %}
+Add the city "Paris" to cities and sort it
+{% initial %}
+var cities = ["Madrid", "Barcelona", "Miami"];
+
+
+var a =
+{% solution %}
+var cities = ["Madrid", "Barcelona", "Miami"];
+cities.push("Paris");
+cities.sort();
+
+{% validation %}
+assert (cities.length === 4);
+assert (cities[0] === "Barcelona");
+assert (cities[1] === "Madrid");
+assert (cities[2] === "Miami");
+assert (cities[3] === "Paris");
+{% endexercise %}
\ No newline at end of file
diff --git a/exercises/all_exercises.md b/exercises/all_exercises.md
index 0c84dd7e..90d33863 100644
--- a/exercises/all_exercises.md
+++ b/exercises/all_exercises.md
@@ -1,36 +1,63 @@
 # All Exercises
 
-<!-- Exercise 1 -->
+
+<!-- Exercise -->
 {% exercise %}
-Substration of 2 numbers
+Substration of 2 numbers<br>
+- <u>Input</u>: 2 numbers (ex: <code>42</code> and <code>38</code>) <br>
+- <u>Output</u>: The difference (ex: <code>4</code>)
 
 {% initial %}
-// Exercise 1: Substration of 2 numbers
 function subs(a, b) {
+} 
 
+{% solution %}
+function subs(a, b) {
+    return a - b;
+} 
+
+{% validation %}
+assert(subs(42, 38) === 4, "Fail for subs(42, 38)");
+assert(subs(38, 42) === -4, "Fail for subs(38, 42)");
+assert(subs(100,100) === 0, "Fail for subs(100,100)");
+
+{% endexercise %}
 
 
 
+<!-- Exercise -->
+{% exercise %}
+Even or Odd number?<br>
+- <u>Input</u>: A number (ex: <code>42</code>) <br>
+- <u>Output</u>: A string that is either "Even" or "Odd" (ex: <code>"Even"</code>)
 
+{% initial %}
+function evenOrOdd(n) {
 } 
 
 {% solution %}
-function subs(a, b) {
-    return a - b;
+function evenOrOdd(n) {
+    if (n % 2 === 0) {
+        return "Even";
+    }
+    else {
+        return "Odd";
+    }
 } 
 
 {% validation %}
-assert(subs(42, 38) === 4, "Testing subs(42, 38)");
-assert(subs(38, 42) === -4, "Testing subs(38, 42)");
-assert(subs(100,100) === 0, "Testing subs(100,100)");
+assert(evenOrOdd(42) === "Even", "Fail for evenOrOdd(42)");
+assert(evenOrOdd(1) === "Odd", "Fail for evenOrOdd(1)");
 
 {% endexercise %}
 
 
 
-<!-- Exercise 2 -->
+<!-- Exercise -->
 {% exercise %}
-Find the maximum of 2 numbers
+Find the maximum of 2 numbers <br>
+- <u>Input</u>: 2 numbers (ex: <code>42</code> and <code>38</code>) <br>
+- <u>Output</u>: The biggest number (ex: <code>42</code>)
 
 {% initial %}
 function maxOfTwoNumbers(a, b) {
@@ -47,23 +74,25 @@ function maxOfTwoNumbers(a, b) {
 } 
 
 {% validation %}
-assert(maxOfTwoNumbers(42, 38) === 42, "Testing maxOfTwoNumbers(42, 38)");
-assert(maxOfTwoNumbers(38, 42) === 42, "Testing maxOfTwoNumbers(38, 42)");
-assert(maxOfTwoNumbers(100,100) === 100, "Testing maxOfTwoNumbers(100,100)");
+assert(maxOfTwoNumbers(42, 38) === 42, "Fail for maxOfTwoNumbers(42, 38)");
+assert(maxOfTwoNumbers(38, 42) === 42, "Fail for maxOfTwoNumbers(38, 42)");
+assert(maxOfTwoNumbers(100,100) === 100, "Fail for maxOfTwoNumbers(100,100)");
 
 {% endexercise %}
 
 
-<!-- Exercise 2.1 -->
+<!-- Exercise -->
 {% exercise %}
-Find the maximum of 3 numbers
+Find the maximum of 3 numbers <br>
+- <u>Input</u>: 3 numbers (ex: <code>42</code>, <code>38</code> and <code>12</code>) <br>
+- <u>Output</u>: The biggest number (ex: <code>42</code>)
 
 {% initial %}
-function maxOfThreeNumbers(a, b) {
+function maxOfThreeNumbers(a, b, c) {
 }  
 
 {% solution %}
-function maxOfThreeNumbers(a, b) {
+function maxOfThreeNumbers(a, b, c) {
     if (a > b && a > c) {
         return a;
     }
@@ -76,15 +105,45 @@ function maxOfThreeNumbers(a, b) {
 } 
 
 {% validation %}
-assert(maxOfThreeNumbers(42, 38, 12) === 42, "Testing maxOfThreeNumbers(42, 38, 12)");
-assert(maxOfThreeNumbers(38, 42, 12) === 42, "Testing maxOfThreeNumbers(38, 42, 12)");
-assert(maxOfThreeNumbers(12, 38, 42) === 42, "Testing maxOfThreeNumbers(12, 38, 42)");
+assert(maxOfThreeNumbers(42, 38, 12) === 42, "Fail for maxOfThreeNumbers(42, 38, 12)");
+assert(maxOfThreeNumbers(38, 42, 12) === 42, "Fail for maxOfThreeNumbers(38, 42, 12)");
+assert(maxOfThreeNumbers(12, 38, 42) === 42, "Fail for maxOfThreeNumbers(12, 38, 42)");
 
 {% endexercise %}
 
-<!-- Exercise 3 -->
+
+<!-- Exercise  -->
 {% exercise %}
-Find the maximum of a non-empty array
+Calculate the sum of all elements<br>
+<u>Input</u>: Array of number (ex: <code>[2, 10, 30]</code>) <br>
+<u>Output</u>: The sum (ex: <code>42</code>)
+
+{% initial %}
+function sumArray(array) {
+}
+
+{% solution %}
+function sumArray(array) {
+    var curSum = 0;
+    for (var i = 0; i < array; i++) {
+        curSum += array[i];
+    }
+    return curSum;
+}
+
+{% validation %}
+assert(sumArray([2, 10, 30]) === 42, "Fail for sumArray([2, 10, 30])");
+assert(sumArray([8]) === 8, "Fail for sumArray([8])");
+
+{% endexercise %}
+
+
+
+<!-- Exercise -->
+{% exercise %}
+Find the maximum of a non-empty array <br>
+- <u>Input</u>: Array of numbers (ex: <code>[ 3, 5, 42, 12, 38 ]</code> ) <br>
+- <u>Output</u>: The biggest number (ex: <code>42</code> )
 
 {% initial %}
 function maxOfArray(numbers) {
@@ -105,44 +164,72 @@ function maxOfArray(numbers) {
 }
 
 {% validation %}
-assert(maxOfArray([42, 38, 12]) === 42, "Testing maxOfArray([42, 38, 12])");
-assert(maxOfArray([38, 42, 12]) === 42, "Testing maxOfArray([38, 42, 12])");
-assert(maxOfArray([12, 38, 42]) === 42, "Testing maxOfArray([12, 38, 42])");
+assert(maxOfArray([42, 38, 12]) === 42, "Fail for maxOfArray([42, 38, 12])");
+assert(maxOfArray([38, 42, 12]) === 42, "Fail for maxOfArray([38, 42, 12])");
+assert(maxOfArray([12, 38, 42]) === 42, "Fail for maxOfArray([12, 38, 42])");
 
 {% endexercise %}
 
 
-<!-- Exercise  -->
+
+
+<!-- Exercise -->
 {% exercise %}
+Find the longest word <br>
+- <u>Input</u>: Array of strings (ex: <code>[ "car", "plane", "bike"]</code>) <br>
+- <u>Output</u>: The longest string (ex: <code>"plane"</code>)
 
 {% initial %}
-
+function findLongestWord (words) {
+}
 
 {% solution %}
+function findLongestWord (words) {
+    var currentMax = "";
+    for (var i = 0; i < words.length; i++) {
+        if (currentMax.length < words[i].length) {
+            currentMax = words[i];
+        }
+    }
+    return currentMax;
+}
 
 
 {% validation %}
-assert(maxOfThreeNumbers(42, 38, 12) === 42, "Testing maxOfThreeNumbers(42, 38, 12)");
-assert(maxOfThreeNumbers(38, 42, 12) === 42, "Testing maxOfThreeNumbers(38, 42, 12)");
-assert(maxOfThreeNumbers(12, 38, 42) === 42, "Testing maxOfThreeNumbers(12, 38, 42)");
+assert(findLongestWord([ "car", "plane", "bike"]) === "plane", 'Fail for findLongestWord([ "car", "plane", "bike"])');
+assert(findLongestWord([ "mystery", "brother", "aviator", "crocodile", "pearl", "orchard", "crackpot"]) === "crocodile", 'Fail for findLongestWord([ "mystery", "brother", "aviator", "crocodile", "pearl", "orchard", "crackpot"])');
 
 {% endexercise %}
 
 
 
+
+
+
+
 <!-- Exercise  -->
 {% exercise %}
+Finding a word inside an array<br>
+- <u>Input</u>: Array of strings and a string (ex: <code>["Madrid", "Barcelona", "Miami"]</code> and <code>"Paris"</code>) <br>
+- <u>Output</u>: A boolean that is true when the word is in the array (ex: <code>false</code>)
 
 {% initial %}
-
+function doesWordExist(wordsArray, word) {
+}
 
 {% solution %}
-
+function doesWordExist(wordsArray, word) {
+    for (var i = 0; i < wordsArray.length; i++) {
+        if (wordsArray[i] === word) {
+            return true;
+        }
+    }
+    return false;
+}
 
 {% validation %}
-assert(maxOfThreeNumbers(42, 38, 12) === 42, "Testing maxOfThreeNumbers(42, 38, 12)");
-assert(maxOfThreeNumbers(38, 42, 12) === 42, "Testing maxOfThreeNumbers(38, 42, 12)");
-assert(maxOfThreeNumbers(12, 38, 42) === 42, "Testing maxOfThreeNumbers(12, 38, 42)");
+assert(doesWordExist(["Madrid", "Barcelona", "Miami"], "Paris") === false, 'Fail for doesWordExist(["Madrid", "Barcelona", "Miami"], "Paris")');
+assert(doesWordExist(["Madrid", "Barcelona", "Miami"], "Madrid") === true, 'Fail for doesWordExist(["Madrid", "Barcelona", "Miami"], "Madrid")');
 
 {% endexercise %}
 
@@ -150,212 +237,102 @@ assert(maxOfThreeNumbers(12, 38, 42) === 42, "Testing maxOfThreeNumbers(12, 38,
 
 <!-- Exercise  -->
 {% exercise %}
+Get the fullname<br>
+- <u>Input</u>: An object with at least 2 string properties "firstname" and "lastaname" (ex: <code>{firstname: "John", lastname: "Doe"}</code>) <br>
+- <u>Output</u>: A string the represents the fullname (dont' forget the space in the middle) (ex: <code>John Doe</code>)
 
 {% initial %}
-
+function getFullname(person) {
+}
 
 {% solution %}
-
+function getFullname(person) {
+    return person.firstname + ' ' + person.lastname;
+}
 
 {% validation %}
-assert(maxOfThreeNumbers(42, 38, 12) === 42, "Testing maxOfThreeNumbers(42, 38, 12)");
-assert(maxOfThreeNumbers(38, 42, 12) === 42, "Testing maxOfThreeNumbers(38, 42, 12)");
-assert(maxOfThreeNumbers(12, 38, 42) === 42, "Testing maxOfThreeNumbers(12, 38, 42)");
+assert(getFullname({firstname: 'John', lastname: 'Doe'}) === 'John Doe', "Fail for getFullname({firstname: 'John', lastname: 'Doe'})");
+assert(getFullname({firstname: 'A', lastname: 'B'}) === 'A B', "Fail for getFullname({firstname: 'A', lastname: 'B'})");
 
 {% endexercise %}
 
 
 
-<!-- Exercise  -->
+
+<!-- Exercise -->
 {% exercise %}
+Find the maximum of a two dimensional array <br>
+- <u>Input</u>: Array of array of numbers (ex: <code>[ [1,6], [3,8], [5,6] ]</code> ) <br>
+- <u>Output</u>: The maximum of everything (ex: <code>8</code> )
 
 {% initial %}
-
+function maxTwoDimArray(matrix) {
+}
 
 {% solution %}
-
+function maxTwoDimArray(matrix) {
+    var currentMax = 0;
+    for (var row = 0; row < matrix.length; row++) {
+        for (var col = 0; col < matrix[row].length; col++) {
+            if (currentMax < matrix[row][col]) {
+                currentMax = matrix[row][col];
+            }
+        }
+    }
+    return currentMax;
+}
 
 {% validation %}
-assert(maxOfThreeNumbers(42, 38, 12) === 42, "Testing maxOfThreeNumbers(42, 38, 12)");
-assert(maxOfThreeNumbers(38, 42, 12) === 42, "Testing maxOfThreeNumbers(38, 42, 12)");
-assert(maxOfThreeNumbers(12, 38, 42) === 42, "Testing maxOfThreeNumbers(12, 38, 42)");
+assert(maxTwoDimArray([[42]]) === 42, "Fail for maxTwoDimArray([[42]])");
+assert(maxTwoDimArray([ [1,6], [3,8], [5,6] ]) === 8, "Fail for maxTwoDimArray([ [1,6], [3,8], [5,6] ])");
 
 {% endexercise %}
 
 
 
+
+
 <!-- Exercise  -->
 {% exercise %}
+Build a triangle<br>
+- <u>Input</u>: A number "n" (ex: <code>2</code>) <br>
+- <u>Output</u>: An array of length "n", that contains an array of "*" with a size incrementing by one each time  (ex: <code>[ ["*"],["*","*"] ]</code>)<br>
+Example output for 4:<br>
+<code style="white-space: pre;">[
+    ["*"],
+    ["*","*"],
+    ["*","*","*"],
+    ["*","*","*","*"],
+]</code>
 
 {% initial %}
-
+function buildTriangle(n) {
+}
 
 {% solution %}
-
+function buildTriangle(n) {
+  var res = [];
+  for (var row = 0; row < n; row++) {
+      res.push([]);
+      for (var col = 0; col < row+1; col++) {
+          res[row].push("*");
+      }
+  }
+  return res;
+}
 
 {% validation %}
-assert(maxOfThreeNumbers(42, 38, 12) === 42, "Testing maxOfThreeNumbers(42, 38, 12)");
-assert(maxOfThreeNumbers(38, 42, 12) === 42, "Testing maxOfThreeNumbers(38, 42, 12)");
-assert(maxOfThreeNumbers(12, 38, 42) === 42, "Testing maxOfThreeNumbers(12, 38, 42)");
+assert(buildTriangle(1).length === 1, "Fail for buildTriangle(1)");
+assert(buildTriangle(5).length === 5, "Fail for buildTriangle(5)");
+assert(buildTriangle(5) && buildTriangle(5)[3].length === 4, "Fail for buildTriangle(5)");
+assert(buildTriangle(5) && buildTriangle(5)[3][3] === "*", "Fail for buildTriangle(5)");
 
 {% endexercise %}
 
 
-```javascript
-// Try to solve has many exercises as possible
-// You can go to https://repl.it/languages/javascript to test your code
-// Send your code the person that sent you the challenge, for example by saving the code in Repl.it and sharing the link
-
-// To help solving it, you can find  
-
-// Good luck ;)
-
-// Exercise 0 (Example): Function that returns the sum of 2 numbers
-function sum(a, b) {
-  var result = a + b;
-  return result;
-} 
-console.log("> Exercice 0 --- Should display 42");
-console.log(sum(20, 22));
-
-
-// Exercise 1: Substration of 2 numbers
-function subs(a, b) {
-} 
-console.log("\n> Exercice 1 --- Should display 4");
-console.log(subs(42, 38));
-
-
-// Exercise 2: Find the maximum
-function maxOfTwoNumbers(a, b) {
-} 
-console.log("\n> Exercice 2 --- Should display 6");
-console.log(maxOfTwoNumbers(2, 6));
-
 
-// Exercise 3: Find the longest word
-// Hint: you can use a variable "currentMax". In the example, its value would be: 0, 3, 5, 42, 42, 42
-function maxOfArray(numbers) {
-}
-console.log("\n> Exercice 3 --- Should display 42");
-console.log(maxOfArray([ 3, 5, 42, 12, 38 ]));
 
 
-// Exercise 4: Find the longest word
-function findLongestWord (words) {
-}
-var words = [
-  "mystery",
-  "brother",
-  "aviator",
-  "crocodile",
-  "pearl",
-  "orchard",
-  "crackpot"
-];
-console.log("\n> Exercice 4 --- Should display 'crocodile'");
-console.log(findLongestWord(words));
-
-
-// Exercise 5: Calculate the sum of all elements
-function sumArray (array) {
-}
-console.log("\n> Exercice 5 --- Should display 20");
-console.log(sumArray([6, 3, 1, 10]));
 
-// Exercise 6: Calculate the average of all elements
-function averageNumbers (array) {
-}
-console.log("\n> Exercice 6 --- Should display 5");
-console.log(averageNumbers([6, 3, 1, 10]));
 
 
-// Exercise 7: Calculate the average length of all elements
-function averageWordLength (array) {
-}
-var words = [
-  "seat",
-  "correspond",
-  "linen",
-  "motif",
-  "hole",
-  "smell",
-  "smart",
-  "chaos",
-  "fuel",
-  "palace"
-];
-console.log("\n> Exercice 7 --- Should display 5.3");
-console.log(averageWordLength(words));
-
-
-// Exercise 8: Finding a string inside an array
-function doesWordExist (wordsArray, word) {
-}
-var words = [
-  "machine",
-  "subset",
-  "trouble",
-  "starting",
-  "matter",
-  "eating",
-  "truth",
-  "disobedience"
-];
-console.log("\n> Exercice 8 --- Should display true, false");
-console.log(doesWordExist(words, "matter"));
-console.log(doesWordExist(words, "dog"));
-
-
-// Exercise 9: Counting Repetion
-function howManyTimes (words, word) {
-}
-var words = [
-  "machine",
-  "matter",
-  "subset",
-  "trouble",
-  "starting",
-  "matter",
-  "eating",
-  "matter",
-  "truth",
-  "disobedience",
-  "matter"
-];
-console.log("\n> Exercice 9 --- Should display 4, 0");
-console.log(howManyTimes(words, "matter"));
-console.log(howManyTimes(words, "dog"));
-
-
-// Exercise 10 (bonus): find the greatest product, on a row or a on column
-// In the following example, the greatest product is on the second column (3 and 4) and its value is 12 (3*4). 
-//   [  [1,3]
-//      [2,4]  ]
-function greatestProduct (matrix) {
-}
-var matrix = [
-  [08,02,22,97,38,15,0,40,0,75,04,05,07,78,52,12,50,77,91,08],
-  [49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48,04,56,62,0],
-  [81,49,31,73,55,79,14,29,93,71,40,67,53,88,30,03,49,13,36,65],
-  [52,70,95,23,04,60,11,42,69,24,68,56,01,32,56,71,37,02,36,91],
-  [22,31,16,71,51,67,63,89,41,92,36,54,22,40,40,28,66,33,13,80],
-  [24,47,32,60,99,03,45,02,44,75,33,53,78,36,84,20,35,17,12,50],
-  [32,98,81,28,64,23,67,10,26,38,40,67,59,54,70,66,18,38,64,70],
-  [67,26,20,68,02,62,12,20,95,63,94,39,63,08,40,91,66,49,94,21],
-  [24,55,58,05,66,73,99,26,97,17,78,78,96,83,14,88,34,89,63,72],
-  [21,36,23,09,75,0,76,44,20,45,35,14,0,61,33,97,34,31,33,95],
-  [78,17,53,28,22,75,31,67,15,94,03,80,04,62,16,14,09,53,56,92],
-  [16,39,05,42,96,35,31,47,55,58,88,24,0,17,54,24,36,29,85,57],
-  [86,56,0,48,35,71,89,07,05,44,44,37,44,60,21,58,51,54,17,58],
-  [19,80,81,68,05,94,47,69,28,73,92,13,86,52,17,77,04,89,55,40],
-  [04,52,08,83,97,35,99,16,07,97,57,32,16,26,26,79,33,27,98,66],
-  [88,36,68,87,57,62,20,72,03,46,33,67,46,55,12,32,63,93,53,69],
-  [04,42,16,73,38,25,39,11,24,94,72,18,08,46,29,32,40,62,76,36],
-  [20,69,36,41,72,30,23,88,34,62,99,69,82,67,59,85,74,04,36,16],
-  [20,73,35,29,78,31,90,01,74,31,49,71,48,86,81,16,23,57,05,54],
-  [01,70,54,71,83,51,54,69,16,92,33,48,61,43,52,01,89,19,67,48],
-];
-console.log("\n> Exercice 10 (bonus)");
-console.log(greatestProduct(matrix));
-```
diff --git a/functions/higher_order.md b/functions/higher_order.md
index 66984ad9..d5c6a0f1 100644
--- a/functions/higher_order.md
+++ b/functions/higher_order.md
@@ -1,4 +1,4 @@
-# Higher Order Functions
+# Higher Order (Advanced)
 
 Higher order functions are functions that manipulate other functions.
 For example, a function can take other functions as arguments and/or produce a function as its return value.
diff --git a/objects/delete.md b/objects/delete.md
deleted file mode 100644
index b4b5cf1b..00000000
--- a/objects/delete.md
+++ /dev/null
@@ -1,14 +0,0 @@
-# Delete
-`delete` can be used to **remove a property** from an object. It will remove a property from the
-object if it has one. It will not look further in the prototype chain.
-Removing a property from an object may allow a property from the prototype chain to shine through:
-```js
-var adult = {age:26},
-    child = Object.create(adult);
-    child.age = 8;
-
-delete child.age;
- /* Remove age property from child, revealing the age of the prototype, because then it is not overriden. */
-var prototypeAge = child.age;
- // 26, because child does not have its own age property.
-```
diff --git a/objects/enumeration.md b/objects/enumeration.md
deleted file mode 100644
index 2e4c49dd..00000000
--- a/objects/enumeration.md
+++ /dev/null
@@ -1,20 +0,0 @@
-# Enumeration
-The `for in` statement can loop over all of the property names in an object. The enumeration will include functions and prototype properties.
-```js
-var fruit = {
-    apple: 2,
-    orange:5,
-    pear:1
-},
-sentence = 'I have ',
-quantity;
-for (kind in fruit){
-    quantity = fruit[kind];
-    sentence += quantity+' '+kind+
-                (quantity===1?'':'s')+
-                ', ';
-}
- // The following line removes the trailing coma.
-sentence = sentence.substr(0,sentence.length-2)+'.';
- // I have 2 apples, 5 oranges, 1 pear.
-```
diff --git a/objects/global_footprint.md b/objects/global_footprint.md
deleted file mode 100644
index 86de8075..00000000
--- a/objects/global_footprint.md
+++ /dev/null
@@ -1,18 +0,0 @@
-# Global footprint
-If you are developing a module, which might be running on a web page, which also runs other modules, then you must beware the variable name overlapping.
-
-Suppose we are developing a counter module:
-```js
-var myCounter = {
-    number : 0,
-    plusPlus : function(){
-        this.number : this.number + 1;
-    },
-    isGreaterThanTen : function(){
-        return this.number > 10;
-    }
-}
-```
-> ***Note:*** this technique is often used with closures, to make the internal state immutable from the outside.
-
-The module now takes only one variable name — `myCounter`. If any other module on the page makes use of such names like `number` or `isGreaterThanTen` then it's perfectly safe, because we will not override each others values;
diff --git a/objects/mutable.md b/objects/mutable.md
deleted file mode 100644
index c5ead5f8..00000000
--- a/objects/mutable.md
+++ /dev/null
@@ -1,10 +0,0 @@
-# Mutable
-The difference between objects and primitive values is that **we can change objects**, whereas primitive values are immutable.
-```js
-var myPrimitive = "first value";
-    myPrimitive = "another value";
- // myPrimitive now points to another string.
-var myObject = { key: "first value"};
-    myObject.key = "another value";
- // myObject points to the same object.
-```
diff --git a/objects/prototype.md b/objects/prototype.md
deleted file mode 100644
index 43bb815a..00000000
--- a/objects/prototype.md
+++ /dev/null
@@ -1,43 +0,0 @@
-# Prototype
-Every object is linked to a prototype object from which it inherits properties.
-
-All objects created from object literals (`{}`) are automatically linked to Object.prototype, which is an object that comes standard with JavaScript.
-
-When a JavaScript interpreter (a module in your browser) tries to find a property, which You want to retrieve, like in the following code:
-```js
-var adult = {age: 26},
-    retrievedProperty = adult.age;
- // The line above
-```
-First, the interpreter looks through every property the object itself has. For example, `adult` has only one own property — `age`. But besides that one it actually has a few more properties, which were inherited from Object.prototype.
-```js
-var stringRepresentation = adult.toString();
- // the variable has value of '[object Object]'
-```
-
-`toString` is an Object.prototype's property, which was inherited. It has a value of a function, which returns a string representation of the object. If you want it to return a more meaningful representation, then you can override it. Simply add a new property to the adult object.
-
-```js
-adult.toString = function(){
-    return "I'm "+this.age;
-}
-```
-If you call the `toString` function now, the interpreter will find the new property in the object itself and stop.
-
-Thus the interpreter retrieves the first property it will find on the way from the object itself and further through its prototype.
-
-To set your own object as a prototype instead of the default Object.prototype, you can invoke `Object.create` as follows:
-
-```js
-var child = Object.create(adult);
- /* This way of creating objects lets us easily replace the default Object.prototype with the one we want. In this case, the child's prototype is the adult object. */
-child.age = 8;
- /* Previously, child didn't have its own age property, and the interpreter had to look further to the child's prototype to find it.
- Now, when we set the child's own age, the interpreter will not go further.
- Note: adult's age is still 26. */
-var stringRepresentation = child.toString();
- // The value is "I'm 8".
- /* Note: we have not overridden the child's toString property, thus the adult's method will be invoked. If adult did not have toString property, then Object.prototype's toString method would be invoked, and we would get "[object Object]" instead of "I'm 8" */
-```
-
-`child`'s prototype is `adult`, whose prototype is `Object.prototype`. This sequence of prototypes is called **prototype chain**.
diff --git a/objects/reference.md b/objects/reference.md
index 798e1e85..bfb8e3e6 100644
--- a/objects/reference.md
+++ b/objects/reference.md
@@ -1,20 +1,21 @@
-# Reference
+# Reference (Advanced)
+
+The difference between objects and primitive values is that **we can change objects**, whereas primitive values are immutable. 
+
 Objects are **never copied**. They are passed around by reference.
+
 ```js
- // Imagine I had a pizza
-var myPizza = {slices: 5};
- // And I shared it with You
-var yourPizza = myPizza;
- // I eat another slice
-myPizza.slices = myPizza.slices - 1;
-var numberOfSlicesLeft = yourPizza.slices;
- // Now We have 4 slices because myPizza and yourPizza
- // reference to the same pizza object.
-var a = {}, b = {}, c = {};
- // a, b, and c each refer to a
- // different empty object
-a = b = c = {};
- // a, b, and c all refer to
- // the same empty object
+var myPrimitive1 = "first value";
+var myPrimitive2 = myPrimitive1;
+myPrimitive2 = "second value";
+
+var myObject1 = { key: "first value"};
+var myObject2 = myObject1;
+myObject2.key = "second value";
+
+// myPrimitive1 = "first value"
+// myPrimitive2 = "second value"
 
+// myObject1 = { key: "second value"}
+// myObject2 = { key: "second value"}
 ```

From 06faa223a03a0307c0ba16701b247301090d7fe6 Mon Sep 17 00:00:00 2001
From: Maxence Bouret <maxence.bouret@gmail.com>
Date: Tue, 10 Apr 2018 01:59:02 +0200
Subject: [PATCH 5/8] Add of summary/

---
 SUMMARY.md        |   1 +
 summary/README.md | 110 ++++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 111 insertions(+)
 create mode 100644 summary/README.md

diff --git a/SUMMARY.md b/SUMMARY.md
index 97662053..2a9212e8 100644
--- a/SUMMARY.md
+++ b/SUMMARY.md
@@ -33,6 +33,7 @@
     * [Creation](objects/creation.md)
     * [Properties](objects/properties.md)
     * [Reference (Advanced)](objects/reference.md)
+* [Summary](summary/README.md)
 * [Exercises](exercises/README.md)
     * [All Exercises](exercises/all_exercises.md)
 
diff --git a/summary/README.md b/summary/README.md
new file mode 100644
index 00000000..32a0d915
--- /dev/null
+++ b/summary/README.md
@@ -0,0 +1,110 @@
+# Summary
+
+## Basics
+```javascript
+var float = 3.1416;
+var integer = 42;
+var boolean = true;
+var n = null;
+```
+
+## Numbers
+```javascript
+var x = 0;  // =  0
+x = x + 10; // = 10
+x += 5;     // = 15
+x++;        // = 16
+```
+
+## Strings
+```javascript
+var firstname = "John";
+var lastname = "Doe";
+var fullname = firstname + " " + lastname; // = "John Doe"
+var size = fullname.length; // = 8
+```
+
+## Conditional Logic
+```javascript
+if(country === 'England') { 
+  // ...
+} else if(country === 'France') {
+  // ...
+} else if(country === 'Germany') {
+  // ...
+} else {
+  // ...
+}
+
+// AND
+if(x > 10 && x < 20) {
+  // ...
+}
+
+// OR
+if(x < 10 || x > 20) {
+  // ...
+}
+```
+
+
+
+
+## Arrays
+```javascript
+// Creation
+var cars = ["Mazda", "Tesla", "Chevy", "Ford"];
+
+// Access
+var myCar = cars[1]; // = "Tesla"
+
+// Length
+let nb = cars.length; // = 4
+
+// Add a new element
+cars.push("Peugeot"); // = ["Mazda", "Tesla", "Chevy", "Ford", "Peugeot"]
+
+// Sort
+cars.sort(); // = ["Chevy", "Ford", "Mazda", "Peugeot", "Tesla"]
+```
+
+## Loops
+```javascript
+// For i from 0 to 10 excluded and incremented by 1
+for(var i = 0; i < 10; i++){
+  // do this code ten-times
+}
+
+while(condition){
+  // do it as long as condition is true
+}
+```
+
+## Functions
+```javascript
+function myFunctionName(param1, param2, param3) {
+  return param1 + param2 + param3;
+}
+```
+
+## Objects
+```javascript
+var myEmptyObject = {};
+
+var language = {
+  name: 'JavaScript',
+  isSupportedByBrowsers: true,
+  createdIn: 1995,
+  author:{
+    firstName: 'Brendan',
+    lastName: 'Eich'
+  },
+  getAuthorFullName: function(){
+    return this.author.firstName + " " + this.author.lastName;    
+  }
+};
+language.name; // = "JavaScript"
+language["name"]; // = "JavaScript"
+language.author.lastName; // = "Eich"
+language.getAuthorFullName(); // = "Brendan Eich"
+```
\ No newline at end of file

From fa153f076e00a766a68b2b084722db143c0898f1 Mon Sep 17 00:00:00 2001
From: Maxence Bouret <maxence.bouret@gmail.com>
Date: Tue, 10 Apr 2018 22:33:50 +0200
Subject: [PATCH 6/8] Fix

---
 SUMMARY.md              |  2 +-
 arrays/array_methods.md |  3 ---
 loops/dowhile.md        | 35 -----------------------------------
 3 files changed, 1 insertion(+), 39 deletions(-)
 delete mode 100644 loops/dowhile.md

diff --git a/SUMMARY.md b/SUMMARY.md
index 2a9212e8..7002f437 100644
--- a/SUMMARY.md
+++ b/SUMMARY.md
@@ -25,7 +25,6 @@
 * [Loops](loops/README.md)
     * [For](loops/for.md)
     * [While](loops/while.md)
-    * [Do...While](loops/dowhile.md)
 * [Functions](functions/README.md)
     * [Declare](functions/declare.md)
     * [Higher order (Advanced)](functions/higher_order.md)
@@ -35,5 +34,6 @@
     * [Reference (Advanced)](objects/reference.md)
 * [Summary](summary/README.md)
 * [Exercises](exercises/README.md)
+    <!-- TODO: create guided exercises  -->
     * [All Exercises](exercises/all_exercises.md)
 
diff --git a/arrays/array_methods.md b/arrays/array_methods.md
index 536d8baf..b3065096 100644
--- a/arrays/array_methods.md
+++ b/arrays/array_methods.md
@@ -15,9 +15,6 @@ array.push(8);
 Add the city "Paris" to cities and sort it
 {% initial %}
 var cities = ["Madrid", "Barcelona", "Miami"];
-
-
-var a =
 {% solution %}
 var cities = ["Madrid", "Barcelona", "Miami"];
 cities.push("Paris");
diff --git a/loops/dowhile.md b/loops/dowhile.md
deleted file mode 100644
index ad3e9fe7..00000000
--- a/loops/dowhile.md
+++ /dev/null
@@ -1,35 +0,0 @@
-# Do...While Loop
-
-The do...while statement creates a loop that executes a specified statement until the test condition evaluates to be false. The condition is evaluated after executing the statement. 
-Syntax for do... while is 
-
-```javascript
-do{
-    // statement
-}
-while(expression) ; 
-```
-
-Lets for example see how to print numbers less than 10 using `do...while` loop:
-
-```
-var i = 0;
-do {
-    document.write(i + " ");
-    i++; // incrementing i by 1  
-} while (i < 10);
-```
-
->***Note***: `i = i + 1` can be written `i++`.
-
-
-{% exercise %}
-Using a do...while-loop, print numbers between less than 5.
-{% initial %}
-var i = 0;
-{% solution %}
-var i = 0;
-do {
-    i++; // incrementing i by 1 
-} while (i < 5);
-{% endexercise %}

From 628bc536d6c7d8c84bd670ff6fdee03f7545e14b Mon Sep 17 00:00:00 2001
From: Maxence Bouret <maxence.bouret@gmail.com>
Date: Tue, 10 Apr 2018 22:35:05 +0200
Subject: [PATCH 7/8] Fix

---
 exercises/all_exercises.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/exercises/all_exercises.md b/exercises/all_exercises.md
index 90d33863..ea69a516 100644
--- a/exercises/all_exercises.md
+++ b/exercises/all_exercises.md
@@ -125,7 +125,7 @@ function sumArray(array) {
 {% solution %}
 function sumArray(array) {
     var curSum = 0;
-    for (var i = 0; i < array; i++) {
+    for (var i = 0; i < array.length; i++) {
         curSum += array[i];
     }
     return curSum;

From df43384a7cac59dd8434374a7f372d43e70b8ee7 Mon Sep 17 00:00:00 2001
From: Maxence Bouret <maxence@ironhack.com>
Date: Wed, 11 Apr 2018 14:46:25 +0200
Subject: [PATCH 8/8] Test change

---
 README.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/README.md b/README.md
index f12141a5..6b54c71a 100644
--- a/README.md
+++ b/README.md
@@ -8,3 +8,5 @@ This book will teach you the basics of programming and Javascript. Whether you a
 ![Screen](./assets/intro.png)
 
 JavaScript (*JS for short*) is the programming language that enables web pages to respond to user interaction beyond the basic level. It was created in 1995, and is today one of the most famous and used programming languages.
+
+<!-- Test Sacha -->