From 331cbb88f87e8da1c2eea58436cbd7ac9bd1866b Mon Sep 17 00:00:00 2001 From: Randell Dawson <5313213+RandellDawson@users.noreply.github.com> Date: Mon, 1 Jul 2019 06:49:24 -0700 Subject: [PATCH] fix(guide): Remove repl.it links from challenge related guide articles (English) (#36204) * fix: remove repl.it links english * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> --- .../find-the-symmetric-difference/index.md | 3 --- .../algorithms/implement-bubble-sort/index.md | 3 +-- .../implement-insertion-sort/index.md | 1 - .../algorithms/implement-merge-sort/index.md | 2 +- .../algorithms/implement-quick-sort/index.md | 2 +- .../algorithms/inventory-update/index.md | 3 --- .../algorithms/no-repeats-please/index.md | 1 - .../create-a-priority-queue-class/index.md | 2 +- .../create-and-add-to-sets-in-es6/index.md | 2 -- .../problem-1-multiples-of-3-and-5/index.md | 1 - .../problem-10-summation-of-primes/index.md | 1 - .../problem-2-even-fibonacci-numbers/index.md | 2 +- .../problem-3-largest-prime-factor/index.md | 2 +- .../index.md | 2 +- .../problem-5-smallest-multiple/index.md | 2 +- .../problem-6-sum-square-difference/index.md | 2 +- .../problem-7-10001st-prime/index.md | 2 +- .../index.md | 1 - .../index.md | 1 - .../boo-who/index.md | 1 - .../chunky-monkey/index.md | 5 ----- .../confirm-the-ending/index.md | 2 -- .../factorialize-a-number/index.md | 1 + .../falsy-bouncer/index.md | 2 -- .../index.md | 3 --- .../mutations/index.md | 2 -- .../repeat-a-string-repeat-a-string/index.md | 20 +++++++++++++++++-- .../return-largest-numbers-in-arrays/index.md | 3 --- .../slice-and-splice/index.md | 2 -- .../title-case-a-sentence/index.md | 3 --- .../truncate-a-string/index.md | 2 -- .../where-do-i-belong/index.md | 6 ------ .../chaining-if-else-statements/index.md | 2 -- .../index.md | 1 - .../index.md | 1 - .../index.md | 1 - .../basic-javascript/counting-cards/index.md | 1 - .../index.md | 1 - .../basic-javascript/golf-code/index.md | 2 -- .../introducing-else-if-statements/index.md | 2 +- .../introducing-else-statements/index.md | 1 - .../index.md | 1 - .../basic-javascript/profile-lookup/index.md | 1 - .../record-collection/index.md | 1 - .../index.md | 2 -- .../index.md | 1 - .../index.md | 1 - .../using-objects-for-lookups/index.md | 1 - .../index.md | 1 - .../index.md | 4 ++++ .../binary-agents/index.md | 3 --- .../diff-two-arrays/index.md | 3 --- .../dna-pairing/index.md | 2 -- .../drop-it/index.md | 3 --- .../everything-be-true/index.md | 3 --- .../make-a-person/index.md | 1 - .../map-the-debris/index.md | 3 --- .../missing-letters/index.md | 3 --- .../search-and-replace/index.md | 4 ---- .../seek-and-destroy/index.md | 2 -- .../smallest-common-multiple/index.md | 3 --- .../sorted-union/index.md | 4 ---- .../spinal-tap-case/index.md | 3 --- .../steamroller/index.md | 4 ---- .../sum-all-numbers-in-a-range/index.md | 3 --- .../sum-all-odd-fibonacci-numbers/index.md | 2 -- .../sum-all-primes/index.md | 5 ----- .../wherefore-art-thou/index.md | 3 --- .../cash-register/index.md | 1 - .../palindrome-checker/index.md | 3 --- .../roman-numeral-converter/index.md | 3 --- .../telephone-number-validator/index.md | 2 -- 72 files changed, 34 insertions(+), 141 deletions(-) diff --git a/guide/english/certifications/coding-interview-prep/algorithms/find-the-symmetric-difference/index.md b/guide/english/certifications/coding-interview-prep/algorithms/find-the-symmetric-difference/index.md index ede0fbc98f..0fbee075dd 100644 --- a/guide/english/certifications/coding-interview-prep/algorithms/find-the-symmetric-difference/index.md +++ b/guide/english/certifications/coding-interview-prep/algorithms/find-the-symmetric-difference/index.md @@ -85,7 +85,6 @@ In the event of *odd number of sets* the symmetric difference will include ident } ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: ### @@ -140,7 +139,6 @@ In the event of *odd number of sets* the symmetric difference will include ident sym([1, 2, 3], [5, 2, 1, 4]); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: ### @@ -175,7 +173,6 @@ In the event of *odd number of sets* the symmetric difference will include ident sym([1, 2, 3], [5, 2, 1, 4]); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: ### diff --git a/guide/english/certifications/coding-interview-prep/algorithms/implement-bubble-sort/index.md b/guide/english/certifications/coding-interview-prep/algorithms/implement-bubble-sort/index.md index 435b4552b8..828fdfd8bb 100644 --- a/guide/english/certifications/coding-interview-prep/algorithms/implement-bubble-sort/index.md +++ b/guide/english/certifications/coding-interview-prep/algorithms/implement-bubble-sort/index.md @@ -41,8 +41,7 @@ function bubbleSort(array) { return array; } ``` - - [Run Code](https://repl.it/@ezioda004/Bubble-Sort) - + ### References: - [GeeksForGeeks](https://www.geeksforgeeks.org/bubble-sort/) - [Wikipedia](https://en.wikipedia.org/wiki/Bubble_sort) diff --git a/guide/english/certifications/coding-interview-prep/algorithms/implement-insertion-sort/index.md b/guide/english/certifications/coding-interview-prep/algorithms/implement-insertion-sort/index.md index ec3727dc68..ec7f9e7495 100644 --- a/guide/english/certifications/coding-interview-prep/algorithms/implement-insertion-sort/index.md +++ b/guide/english/certifications/coding-interview-prep/algorithms/implement-insertion-sort/index.md @@ -26,7 +26,6 @@ function insertionSort(array) { return array; } ``` -- [Run Code](https://repl.it/@ezioda004/Insertion-Sort) ### References: diff --git a/guide/english/certifications/coding-interview-prep/algorithms/implement-merge-sort/index.md b/guide/english/certifications/coding-interview-prep/algorithms/implement-merge-sort/index.md index 362e8ff140..9e42190aa1 100644 --- a/guide/english/certifications/coding-interview-prep/algorithms/implement-merge-sort/index.md +++ b/guide/english/certifications/coding-interview-prep/algorithms/implement-merge-sort/index.md @@ -44,7 +44,7 @@ function mergeSort(array) { return merger(left, right); } ``` -- [Run Code](https://repl.it/@ezioda004/Merge-Sort) + ### References: - [Wikipedia](https://en.wikipedia.org/wiki/Merge_sort) - Video by [Hackerrank](https://www.youtube.com/watch?v=KF2j-9iSf4Q) diff --git a/guide/english/certifications/coding-interview-prep/algorithms/implement-quick-sort/index.md b/guide/english/certifications/coding-interview-prep/algorithms/implement-quick-sort/index.md index 4f039c6755..23a2b6ca31 100644 --- a/guide/english/certifications/coding-interview-prep/algorithms/implement-quick-sort/index.md +++ b/guide/english/certifications/coding-interview-prep/algorithms/implement-quick-sort/index.md @@ -44,7 +44,7 @@ function quickSort(array, left = 0, right = array.length-1) { return array; } ``` -- [Run Code](https://repl.it/@ezioda004/Quick-Sort) + ### Reference: - [Wikipedia](https://en.wikipedia.org/wiki/Quicksort) - [Khan Academy](https://www.khanacademy.org/computing/computer-science/algorithms/quick-sort/a/overview-of-quicksort) diff --git a/guide/english/certifications/coding-interview-prep/algorithms/inventory-update/index.md b/guide/english/certifications/coding-interview-prep/algorithms/inventory-update/index.md index b2b0ea4aca..a344bc86c5 100644 --- a/guide/english/certifications/coding-interview-prep/algorithms/inventory-update/index.md +++ b/guide/english/certifications/coding-interview-prep/algorithms/inventory-update/index.md @@ -105,7 +105,6 @@ Return the completed inventory in alphabetical order. updateInventory(curInv, newInv); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -191,7 +190,6 @@ Return the completed inventory in alphabetical order. updateInventory(curInv, newInv); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -267,7 +265,6 @@ Return the completed inventory in alphabetical order. updateInventory(curInv, newInv); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/coding-interview-prep/algorithms/no-repeats-please/index.md b/guide/english/certifications/coding-interview-prep/algorithms/no-repeats-please/index.md index e628cf66d3..27827d75af 100644 --- a/guide/english/certifications/coding-interview-prep/algorithms/no-repeats-please/index.md +++ b/guide/english/certifications/coding-interview-prep/algorithms/no-repeats-please/index.md @@ -141,7 +141,6 @@ A way to visualize this is by considering a tree that starts with the first char // Test here. permAlone('aab'); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/coding-interview-prep/data-structures/create-a-priority-queue-class/index.md b/guide/english/certifications/coding-interview-prep/data-structures/create-a-priority-queue-class/index.md index e2f8d22969..0e3537f681 100644 --- a/guide/english/certifications/coding-interview-prep/data-structures/create-a-priority-queue-class/index.md +++ b/guide/english/certifications/coding-interview-prep/data-structures/create-a-priority-queue-class/index.md @@ -120,6 +120,6 @@ class PriorityQueue { } } ``` -- [Run Code](https://repl.it/@ezioda004/Priority-Queue) + ### References: - [Wikipedia](https://en.wikipedia.org/wiki/Priority_queue) diff --git a/guide/english/certifications/coding-interview-prep/data-structures/create-and-add-to-sets-in-es6/index.md b/guide/english/certifications/coding-interview-prep/data-structures/create-and-add-to-sets-in-es6/index.md index 318d15cce2..87fd84b383 100644 --- a/guide/english/certifications/coding-interview-prep/data-structures/create-and-add-to-sets-in-es6/index.md +++ b/guide/english/certifications/coding-interview-prep/data-structures/create-and-add-to-sets-in-es6/index.md @@ -46,8 +46,6 @@ function checkSet() { checkSet(); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code - ### Code Explanation: * Creating a set object as shown in pre-written code will create the set without duplicate objects. diff --git a/guide/english/certifications/coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5/index.md b/guide/english/certifications/coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5/index.md index 8e1d8b2e62..7712878d24 100644 --- a/guide/english/certifications/coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5/index.md +++ b/guide/english/certifications/coding-interview-prep/project-euler/problem-1-multiples-of-3-and-5/index.md @@ -20,7 +20,6 @@ function multiplesOf3and5(number) { return sum; } ``` -- [Run Code](https://repl.it/@ezioda004/Project-Euler-Problem-1-Multiples-of-3-and-5) ### Reference: diff --git a/guide/english/certifications/coding-interview-prep/project-euler/problem-10-summation-of-primes/index.md b/guide/english/certifications/coding-interview-prep/project-euler/problem-10-summation-of-primes/index.md index edb1d119c3..4fd15a6b83 100644 --- a/guide/english/certifications/coding-interview-prep/project-euler/problem-10-summation-of-primes/index.md +++ b/guide/english/certifications/coding-interview-prep/project-euler/problem-10-summation-of-primes/index.md @@ -49,7 +49,6 @@ function primeSummation(n) { } ``` -- [Run Code](https://repl.it/@ezioda004/Project-Euler-Problem-10-Summation-of-primes) ### References: - Sieve of Eratosthenes [Wikipedia](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes) diff --git a/guide/english/certifications/coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers/index.md b/guide/english/certifications/coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers/index.md index 23c74cf70b..1c749ae847 100644 --- a/guide/english/certifications/coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers/index.md +++ b/guide/english/certifications/coding-interview-prep/project-euler/problem-2-even-fibonacci-numbers/index.md @@ -48,6 +48,6 @@ function fiboEvenSum(n){ return sumEven; } ``` -- [Run Code](https://repl.it/@scissorsneedfoo/Project-Euler-Problem-2-Even-Fibonacci-Numbers) + ### References: - [Wikipedia](https://en.wikipedia.org/wiki/Fibonacci_number) diff --git a/guide/english/certifications/coding-interview-prep/project-euler/problem-3-largest-prime-factor/index.md b/guide/english/certifications/coding-interview-prep/project-euler/problem-3-largest-prime-factor/index.md index a2a1999331..ae2dbe8b9a 100644 --- a/guide/english/certifications/coding-interview-prep/project-euler/problem-3-largest-prime-factor/index.md +++ b/guide/english/certifications/coding-interview-prep/project-euler/problem-3-largest-prime-factor/index.md @@ -23,7 +23,7 @@ function largestPrimeFactor(number) { return max; } ``` -- [Run Code](https://repl.it/@ezioda004/Problem-3-Largest-prime-factor) + ### Resources: - [Wikipedia](https://en.wikipedia.org/wiki/Prime_number) diff --git a/guide/english/certifications/coding-interview-prep/project-euler/problem-4-largest-palindrome-product/index.md b/guide/english/certifications/coding-interview-prep/project-euler/problem-4-largest-palindrome-product/index.md index e8e58b8078..742597c52a 100644 --- a/guide/english/certifications/coding-interview-prep/project-euler/problem-4-largest-palindrome-product/index.md +++ b/guide/english/certifications/coding-interview-prep/project-euler/problem-4-largest-palindrome-product/index.md @@ -45,7 +45,7 @@ function largestPalindromeProduct(n) { return Math.max(...res); } ``` -- [Run Code](https://repl.it/@ezioda004/Problem-4-Largest-palindrome-product) + ### References: - [Wikipedia](https://en.wikipedia.org/wiki/Palindromic_number) diff --git a/guide/english/certifications/coding-interview-prep/project-euler/problem-5-smallest-multiple/index.md b/guide/english/certifications/coding-interview-prep/project-euler/problem-5-smallest-multiple/index.md index 974c31e93f..ee9ce4b4e1 100644 --- a/guide/english/certifications/coding-interview-prep/project-euler/problem-5-smallest-multiple/index.md +++ b/guide/english/certifications/coding-interview-prep/project-euler/problem-5-smallest-multiple/index.md @@ -33,7 +33,7 @@ function smallestMult(n){ return maxLCM; } ``` -- [Run Code](https://repl.it/@ezioda004/Problem-5-Smallest-multiple) + ### References: - [Euclidean algorithm](https://en.wikipedia.org/wiki/Euclidean_algorithm) - [LCM](https://en.wikipedia.org/wiki/Least_common_multiple) diff --git a/guide/english/certifications/coding-interview-prep/project-euler/problem-6-sum-square-difference/index.md b/guide/english/certifications/coding-interview-prep/project-euler/problem-6-sum-square-difference/index.md index 39ceedb814..2f8ad0e650 100644 --- a/guide/english/certifications/coding-interview-prep/project-euler/problem-6-sum-square-difference/index.md +++ b/guide/english/certifications/coding-interview-prep/project-euler/problem-6-sum-square-difference/index.md @@ -22,7 +22,7 @@ function sumSquareDifference(n) { return (sumOfN ** 2) - sumOfNSquare; } ``` -- [Run Code](https://repl.it/@ezioda004/Problem-6-Sum-square-difference) + ### References: - [Sum of n numbers - Wikipedia](https://en.wikipedia.org/wiki/1_%2B_2_%2B_3_%2B_4_%2B_%E2%8B%AF) diff --git a/guide/english/certifications/coding-interview-prep/project-euler/problem-7-10001st-prime/index.md b/guide/english/certifications/coding-interview-prep/project-euler/problem-7-10001st-prime/index.md index 91825279aa..4992a14d2c 100644 --- a/guide/english/certifications/coding-interview-prep/project-euler/problem-7-10001st-prime/index.md +++ b/guide/english/certifications/coding-interview-prep/project-euler/problem-7-10001st-prime/index.md @@ -44,6 +44,6 @@ function nthPrime(n) { } ``` --[Run Code](https://repl.it/@ezioda004/Project-Euler-Problem-7-10001st-prime) + ### References: - [Wikipedia](https://en.wikipedia.org/wiki/Prime_number) diff --git a/guide/english/certifications/coding-interview-prep/project-euler/problem-8-largest-product-in-a-series/index.md b/guide/english/certifications/coding-interview-prep/project-euler/problem-8-largest-product-in-a-series/index.md index 148e790b9c..bc6f47ac5f 100644 --- a/guide/english/certifications/coding-interview-prep/project-euler/problem-8-largest-product-in-a-series/index.md +++ b/guide/english/certifications/coding-interview-prep/project-euler/problem-8-largest-product-in-a-series/index.md @@ -36,7 +36,6 @@ function largestProductinaSeries(n) { console.log(largestProductinaSeries(13)); ``` -- [Run Code](https://repl.it/@ezioda004/Project-Euler-Problem-8-Largest-product-in-a-series) ### References: diff --git a/guide/english/certifications/coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet/index.md b/guide/english/certifications/coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet/index.md index b931af5cb4..29b7f9ad26 100644 --- a/guide/english/certifications/coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet/index.md +++ b/guide/english/certifications/coding-interview-prep/project-euler/problem-9-special-pythagorean-triplet/index.md @@ -27,7 +27,6 @@ function specialPythagoreanTriplet(n) { specialPythagoreanTriplet(1000); ``` -- [Run Code](https://repl.it/@ezioda004/Project-Euler-Problem-9-Special-Pythagorean-triplet) ### References: - [Wikipedia](https://en.wikipedia.org/wiki/Pythagorean_triple) diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/boo-who/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/boo-who/index.md index 24187571fa..062b9d1454 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/boo-who/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/boo-who/index.md @@ -46,7 +46,6 @@ This program is very simple, the trick is to understand what a boolean primitive // test here booWho(null); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code # Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/chunky-monkey/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/chunky-monkey/index.md index fa925a3049..e6b46e92b2 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/chunky-monkey/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/chunky-monkey/index.md @@ -67,7 +67,6 @@ Finally, we need a method to do the actual splitting and we can use `Array.slice return result; } ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -94,7 +93,6 @@ Finally, we need a method to do the actual splitting and we can use `Array.slice return arr2; } ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -125,7 +123,6 @@ Finally, we need a method to do the actual splitting and we can use `Array.slice } chunkArrayInGroups(["a", "b", "c", "d"], 2); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -154,7 +151,6 @@ Finally, we need a method to do the actual splitting and we can use `Array.slice return newArr; } ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -181,7 +177,6 @@ Finally, we need a method to do the actual splitting and we can use `Array.slice } } ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/confirm-the-ending/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/confirm-the-ending/index.md index f49d486992..18f5308783 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/confirm-the-ending/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/confirm-the-ending/index.md @@ -20,8 +20,6 @@ function confirmEnding(str, target) { confirmEnding("He has to give me a new name", "name"); ``` -#### 🚀 [Run Code](https://repl.it/repls/SardonicRoundAfkgaming) - # Code Explanation: - First we use the `slice` method copy the string. - In order to get the last characters in `str` equivalent to the `target`'s length we use the `slice` method. diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/factorialize-a-number/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/factorialize-a-number/index.md index 47b523f3df..061be07ba9 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/factorialize-a-number/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/factorialize-a-number/index.md @@ -143,6 +143,7 @@ function factorialize(num, factorial = 1) { factorialize(5); ``` + #### Code Explanation: In this solution, we use Tail Recursion to optimize the the memory use. diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer/index.md index 1805ea84ab..d854e7c263 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/falsy-bouncer/index.md @@ -49,7 +49,6 @@ function bouncer(arr) { return newArray; } ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: We create a new empty array. @@ -71,7 +70,6 @@ We return the new array (newArray). return arr.filter(Boolean); } ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/find-the-longest-word-in-a-string/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/find-the-longest-word-in-a-string/index.md index 2f5d3c2083..b07c9ccf16 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/find-the-longest-word-in-a-string/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/find-the-longest-word-in-a-string/index.md @@ -50,7 +50,6 @@ Remember how to get the length of elements on the array? `Array[index].length`. return maxLength; } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -73,7 +72,6 @@ Then check for the longest word by comparing the current word to the previous on }, 0); } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -144,7 +142,6 @@ For more information on `map` Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/mutations/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/mutations/index.md index 307252eff4..24cbfe18dd 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/mutations/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/mutations/index.md @@ -49,7 +49,6 @@ title: Mutations return true; } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -76,7 +75,6 @@ If they are _all_ found, the loop will finish without returning anything and we }); } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/repeat-a-string-repeat-a-string/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/repeat-a-string-repeat-a-string/index.md index 06776d0b9a..d4409b680d 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/repeat-a-string-repeat-a-string/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/repeat-a-string-repeat-a-string/index.md @@ -48,7 +48,6 @@ Make the variable created store the current value and append the word to it. return accumulatedStr; } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -74,7 +73,6 @@ Make the variable created store the current value and append the word to it. } } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -87,6 +85,24 @@ Make the variable created store the current value and append the word to it. * Functions - Recursion +## ![:rotating_light:](https://forum.freecodecamp.com/images/emoji/emoji_one/rotating_light.png?v=3 ":rotating_light:") Advanced Code Solution: + + function repeatStringNumTimes(str, num) { + return num > 0 ? str.repeat(num) : ''; + } + + repeatStringNumTimes("abc", 3); + + +### Code Explanation: + +* This solution takes a declarative approach. +* It is similar to the third solution, except it uses the ternary operator form of the `if` statement. + +#### Relevant Links + +* JS Ternary + ## ![:clipboard:](https://forum.freecodecamp.com/images/emoji/emoji_one/clipboard.png?v=3 ":clipboard:") NOTES FOR CONTRIBUTIONS: * ![:warning:](https://forum.freecodecamp.com/images/emoji/emoji_one/warning.png?v=3 ":warning:") **DO NOT** add solutions that are similar to any existing solutions. If you think it is **_similar but better_**, then try to merge (or replace) the existing similar solution. diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/return-largest-numbers-in-arrays/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/return-largest-numbers-in-arrays/index.md index 852335b0ca..83bba55b31 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/return-largest-numbers-in-arrays/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/return-largest-numbers-in-arrays/index.md @@ -52,7 +52,6 @@ Pay close attention to the timing of the storing of variables when working with return results; } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -80,7 +79,6 @@ Pay close attention to the timing of the storing of variables when working with }); } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -103,7 +101,6 @@ Pay close attention to the timing of the storing of variables when working with return arr.map(Function.apply.bind(Math.max, null)); } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/slice-and-splice/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/slice-and-splice/index.md index c285ddb762..81bc08fa3e 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/slice-and-splice/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/slice-and-splice/index.md @@ -50,7 +50,6 @@ function frankenSplice(arr1, arr2, n) { return localArray; } ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -74,7 +73,6 @@ function frankenSplice(arr1, arr2, n) { return localArr; } ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code * Since our goal is to return the new array with out altering `arr1` or `arr2` we create a `localArr` and add all the items from `arr2` using the `slice()` function diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/title-case-a-sentence/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/title-case-a-sentence/index.md index ba863f510a..2d45a49c80 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/title-case-a-sentence/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/title-case-a-sentence/index.md @@ -56,7 +56,6 @@ We have to return a sentence with title case. This means that the first letter w return updatedTitle.join(' '); } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -83,7 +82,6 @@ Split the string by white spaces, and create a variable to track the updated tit titleCase("I'm a little tea pot"); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -99,7 +97,6 @@ We are making entire string lowercase and then converting it into array. Then we return str.toLowerCase().replace(/(^|\s)\S/g, (L) => L.toUpperCase()); } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/truncate-a-string/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/truncate-a-string/index.md index 7eb1f84133..c17f63fc6e 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/truncate-a-string/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/truncate-a-string/index.md @@ -40,7 +40,6 @@ You will need to use the slice() method and specify where to start and where to } } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -54,7 +53,6 @@ You will need to use the slice() method and specify where to start and where to return (str.length > num)?(str.slice(0,num)+"..."):str; } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/where-do-i-belong/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/where-do-i-belong/index.md index 60b948efd7..d9f0cacd03 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/where-do-i-belong/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-algorithm-scripting/where-do-i-belong/index.md @@ -50,7 +50,6 @@ If there is no index for that number then you will have to deal with that case t return arr.length; } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ## Code Explanation: @@ -74,7 +73,6 @@ If there is no index for that number then you will have to deal with that case t getIndexToIns([40, 60], 50); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ## Code Explanation: @@ -102,7 +100,6 @@ by [@HarinaPana](/u/harinapana) getIndexToIns([40, 60], 50); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ## Code Explanation: @@ -120,7 +117,6 @@ by [@faustodc](/u/faustodc) return arr.indexOf(num); } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ## Code Explanation: @@ -148,7 +144,6 @@ by [@faustodc](/u/faustodc) getIndexToIns([40, 60], 500); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ## Code Explanation: @@ -174,7 +169,6 @@ by [@nivrith](/u/nivrith) getIndexToIns([1,3,4],2); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ## Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/chaining-if-else-statements/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/chaining-if-else-statements/index.md index 9540a5f26d..82912adfb8 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/chaining-if-else-statements/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/chaining-if-else-statements/index.md @@ -53,8 +53,6 @@ function testSize(num) { } ``` -· Run code at [repl.it](https://repl.it/@AdrianSkar/Basic-JS-Chaining-ifelse-statements) - ### Code explanation The function first checks the `if` condition `(num < 5)`. If it evaluates to `true`, it returns the statement between the curly braces ("Tiny"). If it doesn't, it checks the next condition until the last `else` statement. diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-equality-operator/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-equality-operator/index.md index 4c1cf1d8f5..da897d3783 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-equality-operator/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-equality-operator/index.md @@ -30,7 +30,6 @@ function testEqual(val) { testEqual(10); ``` -· [Run code at repl.it](https://repl.it/@AdrianSkar/Basic-JS-Equality-operator) ### Code explanation The function first evaluates `if` the condition `(val == 12)` evaluates to `true`. If it does, it returns the statement between the curly braces ("Equal"). If it doesn't, it returns the next `return` statement outside them ("Not equal"). diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-inequality-operator/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-inequality-operator/index.md index 8f09728d68..1b17409c04 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-inequality-operator/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/comparison-with-the-inequality-operator/index.md @@ -30,7 +30,6 @@ function testNotEqual(val) { // Change this value to test testNotEqual(10); ``` -· Run code at [repl.it](https://repl.it/@AdrianSkar/Basic-JS-Comparison-with-the-inequality-operator). ### Code explanation The function first evaluates `if` the condition `(val != 99)` evaluates to `true`. If it does, it returns the statement between the curly braces ("Not equal"). If it doesn't, it returns the next `return` statement outside them ("Equal"). diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator/index.md index 8263dcf943..a5ab5f1d11 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/comparisons-with-the-logical-and-operator/index.md @@ -37,7 +37,6 @@ function testLogicalAnd(val) { // Change this value to test testLogicalAnd(10); ``` -· [Run code at repl.it](https://repl.it/@AdrianSkar/Basic-JS-Comparison-with-the-and-operator) ### Code explanation The function first evaluates `if` the condition `val <= 50` evaluates to `true` converting `val` to a number if necessary, then does the same with `val >=25` because of the logical AND (`&&`) operator; if both return true, the `return "Yes"` statement is executed. diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/counting-cards/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/counting-cards/index.md index a639a7787f..13c8239e10 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/counting-cards/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/counting-cards/index.md @@ -118,7 +118,6 @@ function cc(card) { // Only change code above this line } ``` -· Run code at [repl.it](https://repl.it/@AdrianSkar/Basic-JS-Counting-cards). ### Code explanation · The function first evaluates `if` the condition `card` is a value greater than `1` and lower than `7`, in which case it increments `count` by one. diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/generate-random-whole-numbers-within-a-range/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/generate-random-whole-numbers-within-a-range/index.md index 8af24cc9ac..7653381559 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/generate-random-whole-numbers-within-a-range/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/generate-random-whole-numbers-within-a-range/index.md @@ -27,7 +27,6 @@ function randomRange(myMin, myMax) { } ``` -· Run code at [repl.it](https://repl.it/@AdrianSkar/Basic-JS-Random-whole-numbers-within-range). ### Code explanation - `Math.random()` generates our random number between 0 and ≈ 0.9. diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/golf-code/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/golf-code/index.md index 69911ff01c..a14d090bad 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/golf-code/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/golf-code/index.md @@ -110,7 +110,6 @@ function golfScore(par, strokes) { // Change these values to test golfScore(5, 4); ``` -·Run at [repl.it](https://repl.it/@AdrianSkar/Basic-JS-Golf-code) ## Code explanation Since we already have an array defined in the variable `names` we can take advantage of it and use it for our return statements using indexes (eg: `names[0] is the first one`). That way, if you ever need to change a specific result you wouldn't need to look for it inside the function, it'd be at the beginning, in your array. @@ -129,7 +128,6 @@ Since we already have an array defined in the variable `names` we can take advan "Change Me"; } ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Resources diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/introducing-else-if-statements/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/introducing-else-if-statements/index.md index 0a2714f240..ba403ddb81 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/introducing-else-if-statements/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/introducing-else-if-statements/index.md @@ -71,7 +71,7 @@ function testElseIf(val) { // Change this value to test testElseIf(7); ``` -:rocket: [Run code](https://repl.it/@RyanPisuena/GoldenWorriedRuntime) + ## Code explanation The structure of an **else-if logic flow** is an initial `if` statement, one more `if-else` statements, and one final `else` statement. diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/introducing-else-statements/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/introducing-else-statements/index.md index 52f69b6b52..56228795ca 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/introducing-else-statements/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/introducing-else-statements/index.md @@ -42,7 +42,6 @@ function testElse(val) { // Change this value to test testElse(4); ``` -· [Run code at repl.it](https://repl.it/@AdrianSkar/Introducing-else-statements) ### Code explanation The function first evaluates `if` the condition `val > 5` evaluates to `true`. If it doesn't, it executes the next statement (`else { return "5 or smaller";})`. diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/multiple-identical-options-in-switch-statements/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/multiple-identical-options-in-switch-statements/index.md index de4eada73f..49b8710190 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/multiple-identical-options-in-switch-statements/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/multiple-identical-options-in-switch-statements/index.md @@ -83,7 +83,6 @@ function sequentialSizes(val) { // Change this value to test sequentialSizes(1); ``` -· Run code at [repl.it](https://repl.it/@AdrianSkar/Basic-JS-Multiple-opts-in-switch). ### Code explanation Since you already have a variable named `answer` defined and the function returns it, you can just modify its value on each group of case statements to fit the exercise requirements. diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/profile-lookup/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/profile-lookup/index.md index 358d602db2..da7e63a520 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/profile-lookup/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/profile-lookup/index.md @@ -98,7 +98,6 @@ for (var i = 0; i < contacts.length; i++){ return "No such contact"; } ``` -· Run code at [repl.it](https://repl.it/@AdrianSkar/Basic-JS-Profile-lookup). ### Code explanation This works as the last example but uses the `in` operator to look for `prop` instead of the `hasOwnProperty()` method. diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/record-collection/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/record-collection/index.md index 3800751c82..46b8852b79 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/record-collection/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/record-collection/index.md @@ -70,7 +70,6 @@ To access the value of a key in this object, you will use `collection[id][prop]` return collection; } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/returning-boolean-values-from-functions/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/returning-boolean-values-from-functions/index.md index 8904a5dd7b..68e0621d0a 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/returning-boolean-values-from-functions/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/returning-boolean-values-from-functions/index.md @@ -38,7 +38,5 @@ function isLess(a, b) { isLess(10, 15); ``` -Run code at [repl.it](https://repl.it/@AdrianSkar/Basic-Js-Returning-boolean-from-function). - ### Resources - ["Less than or equal operator (<=)" - *MDN JavaScript Reference*](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Comparison_Operators#Less_than_or_equal_operator_(%3C)) diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/selecting-from-many-options-with-switch-statements/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/selecting-from-many-options-with-switch-statements/index.md index eec0e73ad3..462af14597 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/selecting-from-many-options-with-switch-statements/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/selecting-from-many-options-with-switch-statements/index.md @@ -105,7 +105,6 @@ function caseInSwitch(val) { // Change this value to test caseInSwitch(1); ``` -· Run code at [repl.it](https://repl.it/@AdrianSkar/Basic-JS-Switch-statements). ### Code explanation Since you already have a variable defined at the beginning of the function named `answer` and it's defined as the last return statement, you can assign new values to it for each case and will return the expected answer depending on the value you pass to the function. diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/use-the-parseint-function-with-a-radix/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/use-the-parseint-function-with-a-radix/index.md index b5c08d01c1..5374ce9f84 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/use-the-parseint-function-with-a-radix/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/use-the-parseint-function-with-a-radix/index.md @@ -28,7 +28,6 @@ function convertToInteger(str) { } convertToInteger("10011"); ``` -· Run code at [repl.it](https://repl.it/@AdrianSkar/Basic-JS-Use-parseInt-with-radix). ### Code explanation - The function takes `str` and returns an integer instead of a string but "understanding" its a binary number instead of a decimal one thanks to the `radix` parameter (2). diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/using-objects-for-lookups/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/using-objects-for-lookups/index.md index 5d64a39f7d..d3b332c79b 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/using-objects-for-lookups/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/basic-javascript/using-objects-for-lookups/index.md @@ -66,7 +66,6 @@ After converting our case statements into object properties you can make use of result = lookup[val]; ``` -· Run code at [repl.it](https://repl.it/@AdrianSkar/Using-objects-for-lookups). ### Resources diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/es6/set-default-parameters-for-your-functions/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/es6/set-default-parameters-for-your-functions/index.md index 062ef1ee82..ed2c3a9533 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/es6/set-default-parameters-for-your-functions/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/es6/set-default-parameters-for-your-functions/index.md @@ -48,7 +48,6 @@ const increment = (function() { console.log(increment(5, 2)); // returns 7 console.log(increment(5)); // returns NaN ``` -[Run Code](https://repl.it/@RyanPisuena/PleasingFumblingThings) ### Code Explanation diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/functional-programming/use-higher-order-functions-map-filter-or-reduce-to-solve-a-complex-problem/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/functional-programming/use-higher-order-functions-map-filter-or-reduce-to-solve-a-complex-problem/index.md index ea754c6109..453ef04172 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/functional-programming/use-higher-order-functions-map-filter-or-reduce-to-solve-a-complex-problem/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/functional-programming/use-higher-order-functions-map-filter-or-reduce-to-solve-a-complex-problem/index.md @@ -53,6 +53,10 @@ const squareList = (arr) => { }; ``` +### Code explanation +This does basically the same but uses the `isInteger()` method to check the numbers. + + ### Resources - ["Array.prototype.map()" - *MDN JavaScript reference*](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map) diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/binary-agents/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/binary-agents/index.md index b94635d9e0..07e2c1d45b 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/binary-agents/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/binary-agents/index.md @@ -58,7 +58,6 @@ Make sure that each time you transcode a character from binary to decimal, you r // test here binaryAgent("01000001 01110010 01100101 01101110 00100111 01110100 00100000 01100010 01101111 01101110 01100110 01101001 01110010 01100101 01110011 00100000 01100110 01110101 01101110 00100001 00111111"); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code # Code Explanation: @@ -109,7 +108,6 @@ Make sure that each time you transcode a character from binary to decimal, you r // test here binaryAgent("01000001 01110010 01100101 01101110 00100111 01110100 00100000 01100010 01101111 01101110 01100110 01101001 01110010 01100101 01110011 00100000 01100110 01110101 01101110 00100001 00111111"); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code # Code Explanation @@ -133,7 +131,6 @@ Make sure that each time you transcode a character from binary to decimal, you r // test here binaryAgent("01000001 01110010 01100101 01101110 00100111 01110100 00100000 01100010 01101111 01101110 01100110 01101001 01110010 01100101 01110011 00100000 01100110 01110101 01101110 00100001 00111111"); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code # Code Explanation diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/diff-two-arrays/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/diff-two-arrays/index.md index b3d1e26615..4c7c2b9276 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/diff-two-arrays/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/diff-two-arrays/index.md @@ -63,7 +63,6 @@ The best way to go about the callback function is to check if the number from th diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5]); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -85,7 +84,6 @@ Read the comments in the code. diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5]); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -109,7 +107,6 @@ Explain solution here and add any relevant links diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/dna-pairing/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/dna-pairing/index.md index a4d0ec8ec6..440e35d2e5 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/dna-pairing/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/dna-pairing/index.md @@ -81,7 +81,6 @@ This problem does not involve rearranging the input into different combinations // test here pairElement("GCG"); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -112,7 +111,6 @@ This problem does not involve rearranging the input into different combinations //test here pairElement("GCG"); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ## Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/drop-it/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/drop-it/index.md index aa76976fad..d73fa87917 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/drop-it/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/drop-it/index.md @@ -57,7 +57,6 @@ If you still can't figure out how to solve it with shift, then try solving it wi // test here dropElements([1, 2, 3, 4], function(n) {return n >= 3;}) -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -79,7 +78,6 @@ If you still can't figure out how to solve it with shift, then try solving it wi // test here dropElements([1, 2, 3, 4], function(n) {return n >= 3;}); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -104,7 +102,6 @@ If you still can't figure out how to solve it with shift, then try solving it wi // test here dropElements([1, 2, 3, 4], function(n) {return n >= 3;}); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/everything-be-true/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/everything-be-true/index.md index 30fb52a1d6..ba0c912b7e 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/everything-be-true/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/everything-be-true/index.md @@ -59,7 +59,6 @@ You could use loops or callback functions, there are multiple ways to solve this // test here truthCheck([{"user": "Tinky-Winky", "sex": "male"}, {"user": "Dipsy", "sex": "male"}, {"user": "Laa-Laa", "sex": "female"}, {"user": "Po", "sex": "female"}], "sex"); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -85,7 +84,6 @@ You could use loops or callback functions, there are multiple ways to solve this // test here truthCheck([{"user": "Tinky-Winky", "sex": "male"}, {"user": "Dipsy", "sex": "male"}, {"user": "Laa-Laa", "sex": "female"}, {"user": "Po", "sex": "female"}], "sex"); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -106,7 +104,6 @@ You could use loops or callback functions, there are multiple ways to solve this truthCheck([{"user": "Tinky-Winky", "sex": "male"}, {"user": "Dipsy", "sex": "male"}, {"user": "Laa-Laa", "sex": "female"}, {"user": "Po", "sex": "female"}], "sex"); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person/index.md index 24c7e9a1d3..2d8d9e37b9 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/make-a-person/index.md @@ -86,7 +86,6 @@ var Person = function(firstAndLast) { var bob = new Person('Bob Ross'); bob.getFullName(); ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/map-the-debris/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/map-the-debris/index.md index 7f15bcd95f..2570834466 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/map-the-debris/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/map-the-debris/index.md @@ -68,7 +68,6 @@ Find out how to remove and add key to a JavaScript object. // test here orbitalPeriod([{name : "sputnik", avgAlt : 35873.5553}]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -109,7 +108,6 @@ Find out how to remove and add key to a JavaScript object. // test here orbitalPeriod([{name : "sputnik", avgAlt : 35873.5553}]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -139,7 +137,6 @@ Find out how to remove and add key to a JavaScript object. // test here orbitalPeriod([{name : "sputnik", avgAlt : 35873.5553}]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/missing-letters/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/missing-letters/index.md index 598f3374fb..e0ea73a0fe 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/missing-letters/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/missing-letters/index.md @@ -59,7 +59,6 @@ You will need to figure out where the missing letter is, along with handling the // test here fearNotLetter("abce"); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -96,7 +95,6 @@ You will need to figure out where the missing letter is, along with handling the // test here fearNotLetter("abce"); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -143,7 +141,6 @@ You will need to figure out where the missing letter is, along with handling the // test here fearNotLetter("abce"); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/search-and-replace/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/search-and-replace/index.md index b0aa6394af..0dce9bdfdb 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/search-and-replace/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/search-and-replace/index.md @@ -55,7 +55,6 @@ You will create a program that takes a sentence, then search for a word in it an // test here myReplace("A quick brown fox jumped over the lazy dog", "jumped", "leaped"); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -90,7 +89,6 @@ You will create a program that takes a sentence, then search for a word in it an // test here myReplace("A quick brown fox jumped over the lazy dog", "jumped", "leaped"); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -136,7 +134,6 @@ You will create a program that takes a sentence, then search for a word in it an // test here myReplace("A quick brown fox jumped over the lazy dog", "jumped", "leaped"); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -195,7 +192,6 @@ You will create a program that takes a sentence, then search for a word in it an } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ## ![:rotating_light:](https://forum.freecodecamp.com/images/emoji/emoji_one/rotating_light.png?v=3 ":rotating_light:") Advanced Code Solution Alternative 2: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/seek-and-destroy/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/seek-and-destroy/index.md index ecb07ef015..4abd165f0f 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/seek-and-destroy/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/seek-and-destroy/index.md @@ -51,7 +51,6 @@ To convert `arguments` into an array use this code `var args = Array.prototype.s return arr.filter(Boolean); } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -81,7 +80,6 @@ To convert `arguments` into an array use this code `var args = Array.prototype.s }); } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/smallest-common-multiple/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/smallest-common-multiple/index.md index fb135734f4..6e22bf69a6 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/smallest-common-multiple/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/smallest-common-multiple/index.md @@ -80,7 +80,6 @@ If you sort the array from greatest to smallest, then you can use the first two // test here smallestCommons([1,5]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -136,7 +135,6 @@ Note: If the array only has two elements, then the `for` loop never gets used an // test here smallestCommons([1,5]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -175,7 +173,6 @@ Note: If the array only has two elements, then the `for` loop never gets used an // test here smallestCommons([1,5]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sorted-union/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sorted-union/index.md index be76ca2e7b..eedda42225 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sorted-union/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sorted-union/index.md @@ -63,7 +63,6 @@ You will have to check if the current value is already on the array to be return // test here uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -120,7 +119,6 @@ uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]); // test here uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -152,7 +150,6 @@ uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]); // test here uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -181,7 +178,6 @@ uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]); // test here uniteUnique([1, 3, 2], [5, 2, 1, 4], [2, 1]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/spinal-tap-case/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/spinal-tap-case/index.md index 204111734a..af67f48a1a 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/spinal-tap-case/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/spinal-tap-case/index.md @@ -54,7 +54,6 @@ The tricky part is getting the regular expression part to work, once you do that // test here spinalCase('This Is Spinal Tap'); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -74,7 +73,6 @@ The tricky part is getting the regular expression part to work, once you do that // test here spinalCase('This Is Spinal Tap'); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -95,7 +93,6 @@ The tricky part is getting the regular expression part to work, once you do that return str.split(/\s|_|(?=[A-Z])/).join('-').toLowerCase() } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller/index.md index a98c3a57e6..1e9b1f70d8 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/steamroller/index.md @@ -60,7 +60,6 @@ You will definitely need recursion or another way to go beyond two level arrays // test here steamrollArray([1, [2], [3, [[4]]]]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -84,7 +83,6 @@ You will definitely need recursion or another way to go beyond two level arrays steamrollArray([1, [2], [3, [[4]]]]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -111,7 +109,6 @@ You will definitely need recursion or another way to go beyond two level arrays steamrollArray([1, [2], [3, [[4]]]]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -140,7 +137,6 @@ You will definitely need recursion or another way to go beyond two level arrays }); } -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-numbers-in-a-range/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-numbers-in-a-range/index.md index e547ee4557..187014f4fb 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-numbers-in-a-range/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-numbers-in-a-range/index.md @@ -45,7 +45,6 @@ Remember to that you must add all the numbers in between so this would require a sumAll([1, 4]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -77,7 +76,6 @@ Since the numbers might not be always in order, using `max()` and `min()` will h return sum; }; -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -104,7 +102,6 @@ Since the numbers might not be always in order, using `max()` and `min()` will h sumAll([1, 4]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-odd-fibonacci-numbers/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-odd-fibonacci-numbers/index.md index 642627802b..d181ccc5b2 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-odd-fibonacci-numbers/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-odd-fibonacci-numbers/index.md @@ -56,7 +56,6 @@ As you get the next odd one, don't forget to add it to a global variable that ca // test here sumFibs(4); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -95,7 +94,6 @@ As you get the next odd one, don't forget to add it to a global variable that ca // test here sumFibs(4); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes/index.md index 1b84cf0b0d..fdbd2677ea 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/sum-all-primes/index.md @@ -71,7 +71,6 @@ This problem is hard if you have to create your own code to check for primes, so // test here sumPrimes(10); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -108,7 +107,6 @@ This problem is hard if you have to create your own code to check for primes, so } //test here sumPrimes(10); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -152,7 +150,6 @@ This problem is hard if you have to create your own code to check for primes, so // test here sumPrimes(10); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -177,7 +174,6 @@ This problem is hard if you have to create your own code to check for primes, so // test here sumPrimes(13); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -205,7 +201,6 @@ This problem is hard if you have to create your own code to check for primes, so // test here sumPrimes(977); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/wherefore-art-thou/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/wherefore-art-thou/index.md index 575063c7e1..453e35ee30 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/wherefore-art-thou/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/intermediate-algorithm-scripting/wherefore-art-thou/index.md @@ -60,7 +60,6 @@ Check equivalence of `Object` in `collection` with `Object` passed as second par // test here whatIsInAName([{ first: "Romeo", last: "Montague" }, { first: "Mercutio", last: null }, { first: "Tybalt", last: "Capulet" }], { last: "Capulet" }); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -93,7 +92,6 @@ Check equivalence of `Object` in `collection` with `Object` passed as second par // test here whatIsInAName([{ first: "Romeo", last: "Montague" }, { first: "Mercutio", last: null }, { first: "Tybalt", last: "Capulet" }], { last: "Capulet" }); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -130,7 +128,6 @@ Check equivalence of `Object` in `collection` with `Object` passed as second par // test here whatIsInAName([{ first: "Romeo", last: "Montague" }, { first: "Mercutio", last: null }, { first: "Tybalt", last: "Capulet" }], { last: "Capulet" }); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/cash-register/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/cash-register/index.md index a36f2dc143..e642c0c132 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/cash-register/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/cash-register/index.md @@ -110,7 +110,6 @@ title: Cash Register // test here checkCashRegister(19.50, 20.00, [["PENNY", 1.01], ["NICKEL", 2.05], ["DIME", 3.10], ["QUARTER", 4.25], ["ONE", 90.00], ["FIVE", 55.00], ["TEN", 20.00], ["TWENTY", 60.00], ["ONE HUNDRED", 100.00]]); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/palindrome-checker/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/palindrome-checker/index.md index 8654d62713..01861de46b 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/palindrome-checker/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/palindrome-checker/index.md @@ -49,7 +49,6 @@ The `Array.prototype.split` and `Array.prototype.join` methods can be of use her str.replace(/[\W_]/g, '').toLowerCase().split('').reverse().join(''); } ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -79,7 +78,6 @@ The `Array.prototype.split` and `Array.prototype.join` methods can be of use her return true; } ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -125,7 +123,6 @@ The `Array.prototype.split` and `Array.prototype.join` methods can be of use her } ``` -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/roman-numeral-converter/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/roman-numeral-converter/index.md index 0bbd362919..7cbecbf80f 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/roman-numeral-converter/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/roman-numeral-converter/index.md @@ -60,7 +60,6 @@ You can't have more than three consecutive Roman numerals together. // test here convertToRoman(36); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -125,7 +124,6 @@ You can't have more than three consecutive Roman numerals together. // test here convertToRoman(97); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -181,7 +179,6 @@ You can't have more than three consecutive Roman numerals together. // test here convertToRoman(36); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: diff --git a/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/telephone-number-validator/index.md b/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/telephone-number-validator/index.md index 6078238d74..24e556c284 100644 --- a/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/telephone-number-validator/index.md +++ b/guide/english/certifications/javascript-algorithms-and-data-structures/javascript-algorithms-and-data-structures-projects/telephone-number-validator/index.md @@ -72,7 +72,6 @@ Start by trying to get it to validate each format from the example, each one sho } telephoneCheck("555-555-5555"); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: @@ -98,7 +97,6 @@ Start by trying to get it to validate each format from the example, each one sho } telephoneCheck("555-555-5555"); -![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") Run Code ### Code Explanation: