All Exercises

Correct!

False!

Substration of 2 numbers
- Input: 2 numbers (ex: 42 and 38)
- Output: The difference (ex: 4)

function subs(a, b) { }

function subs(a, b) {
    return a - b;
}

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)");

Submit Solution

Correct!

False!

Even or Odd number?
- Input: A number (ex: 42)
- Output: A string that is either "Even" or "Odd" (ex: "Even")

function evenOrOdd(n) { }

function evenOrOdd(n) {
    if (n % 2 === 0) {
        return "Even";
    }
    else {
        return "Odd";
    }
}

assert(evenOrOdd(42) === "Even", "Fail for evenOrOdd(42)");
assert(evenOrOdd(1) === "Odd", "Fail for evenOrOdd(1)");

Submit Solution

Correct!

False!

Find the maximum of 2 numbers
- Input: 2 numbers (ex: 42 and 38)
- Output: The biggest number (ex: 42)

function maxOfTwoNumbers(a, b) { }

function maxOfTwoNumbers(a, b) {
    if (a > b) {
        return a;
    }
    else {
        return b;
    }
}

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)");

Submit Solution

Correct!

False!

Find the maximum of 3 numbers
- Input: 3 numbers (ex: 42, 38 and 12)
- Output: The biggest number (ex: 42)

function maxOfThreeNumbers(a, b, c) { }

function maxOfThreeNumbers(a, b, c) {
    if (a > b && a > c) {
        return a;
    }
    else if (b > c) {
        return b;
    }
    else {
        return c;
    }
}

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)");

Submit Solution

Correct!

False!

Calculate the sum of all elements
Input: Array of number (ex: [2, 10, 30])
Output: The sum (ex: 42)

function sumArray(array) { }

function sumArray(array) {
    var curSum = 0;
    for (var i = 0; i < array.length; i++) {
        curSum += array[i];
    }
    return curSum;
}

assert(sumArray([2, 10, 30]) === 42, "Fail for sumArray([2, 10, 30])");
assert(sumArray([8]) === 8, "Fail for sumArray([8])");

Submit Solution

Correct!

False!

Find the maximum of a non-empty array
- Input: Array of numbers (ex: [ 3, 5, 42, 12, 38 ] )
- Output: The biggest number (ex: 42 )

function maxOfArray(numbers) { }

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;
}

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])");

Submit Solution

Correct!

False!

Find the longest word
- Input: Array of strings (ex: [ "car", "plane", "bike"])
- Output: The longest string (ex: "plane")

function findLongestWord (words) { }

function findLongestWord (words) {
    var currentMax = "";
    for (var i = 0; i < words.length; i++) {
        if (currentMax.length < words[i].length) {
            currentMax = words[i];
        }
    }
    return currentMax;
}

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"])');

Submit Solution

Correct!

False!

Finding a word inside an array
- Input: Array of strings and a string (ex: ["Madrid", "Barcelona", "Miami"] and "Paris")
- Output: A boolean that is true when the word is in the array (ex: false)

function doesWordExist(wordsArray, word) { }

function doesWordExist(wordsArray, word) {
    for (var i = 0; i < wordsArray.length; i++) {
        if (wordsArray[i] === word) {
            return true;
        }
    }
    return false;
}

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")');

Submit Solution

Correct!

False!

Get the fullname
- Input: An object with at least 2 string properties "firstname" and "lastaname" (ex: {firstname: "John", lastname: "Doe"})
- Output: A string the represents the fullname (dont' forget the space in the middle) (ex: John Doe)

function getFullname(person) { }

function getFullname(person) {
    return person.firstname + ' ' + person.lastname;
}

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'})");

Submit Solution

Correct!

False!

Find the maximum of a two dimensional array
- Input: Array of array of numbers (ex: [ [1,6], [3,8], [5,6] ] )
- Output: The maximum of everything (ex: 8 )

function maxTwoDimArray(matrix) { }

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;
}

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] ])");

Submit Solution

Correct!

False!

Build a triangle
- Input: A number "n" (ex: 2)
- Output: An array of length "n", that contains an array of "*" with a size incrementing by one each time (ex: [ ["*"],["*","*"] ])
Example output for 4:

[
    ["*"],
    ["*","*"],
    ["*","*","*"],
    ["*","*","*","*"],
]

function buildTriangle(n) { }

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;
}

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)");

Submit Solution

All Exercises

All Exercises

results matching ""

No results matching ""