Back to Blog

The 15 Algorithm Challenges I Solved in May

June 01, 2020

I don’t you, but it seems to me that the year is flying away too fast. I’m looking for a remote position this year, so I’ve decided to work too hard: build tools, write blog posts, help people in forums, and of course work on algorithms.

Last month, May, I did work on around 15 challenges on FreecodeCamp and LeetCode. Let’s take a look at them. I’ll try to add some explanations, if necessary.

-1- Sum All Numbers in a Range

The link to the challenge is here.

The Challenge Description

We’ll pass you an array of two numbers. Return the sum of those two numbers plus the sum of all the numbers between them. The lowest number will not always come first.
For example, sumAll([4,1]) should return 10 because sum of all the numbers between 1 and 4 (both inclusive) is 10.

My Solution

function sumAll(arr) {
   * 1. Let's sort the array to ensure that we have:
   * - small value on the left and
   * - big number on the right
   * E.g. [4, 1] => [1, 4]
  arr.sort((a, b) => a - b)

  let res = arr[0] + arr[1] // 2. Set res with the sum of the 2 values in the array (1 + 4)

  // 3. Iterate over the second value of the array (4)
  for (let i = arr[0] + 1; i < arr[1]; i += 1) {
    res += i // 4. add the current value to res
  return res // 5. return res

sumAll([1, 4])

If you run the test with this code, you’ll get 100% tests pass.

Let’s another way to resolve this challenge.

Alternative Solution and Improvement

The solution above is the way I did when working on that algorithm challenge. But there are many other ways to do so. And you can also improve the my code to make it robust.

Let’s see how.


Although our code seems to works properly in the context of this challenge, it has some weaknesses. Let’s find them.

Our code only assumes that the user we always submit the right argument when this is not true in the real world.

  • What happens if the user calls the function without any argument at all?
  • What if the argument is not an array?
  • What if the array contains more than 2 values or it contains a mix of string and numbers?

We should handle all these situations. In programming, there’s a saying that says never trust user input.

First thing first, the requirements for our function to run properly:

  • the parameter must exist
  • it must be an array
  • the array should only contain 2 numbers

Then the implementation:

if (!arr) return "The parametor is required and must not be empty"
if (!Array.isArray(arr)) return "The parametor must be an array"
if (arr.length != 2) return "The array must be of length 2"

Putting all together, we get this

function sumAll(arr) {
  if (
    arr &&
    Array.isArray(arr) &&
    arr.length == 2 &&
    typeof arr[0] == "number" &&
    typeof arr[1] == "number"
  ) {
    arr.sort((a, b) => a - b)
    let res = arr[0] + arr[1]

    for (let i = arr[0] + 1; i < arr[1]; i += 1) {
      res += i
    return res
  } else {
    return "There'se something wrong with your argument. Please check it and try again"

sumAll([1, 4])

Here we start by checking the validity of the argument sent by the user. If something is wrong, the function can’t proceed and tells the user to check for the argument.

Alternative Solutions

The solution above is the way I did when I was working on the challenge. But I can see another way to do it and you’ve got another too.

Here’s the idea.

  • generate all array items in the range of first value - second value. E.g.: [1, 4] => [1, 2, 3, 4].
  • get the sum by using reduce() method.

Let’s implement the idea above.

function sumAll(arr) {
 if(/*check arr validity here*/){
    arr.sort((a,b) => a - b)

    const newArr = [] // create a new arr

    for(let i = arr[0]; i <= arr[1]; i += 1) newArr.push(i) // add items to the new arr

    return newArr.reduce((acc, cur) => acc + cur)
 } else {
     return 'There\'se something wrong with your argument. Please check it and try again'


-2- Slice and Splice


You are given two arrays and an index. Use the array methods slice and splice to copy each element of the first array into the second array, in order. Begin inserting elements at index n of the second array. Return the resulting array. The input arrays should remain the same after the function runs.

function frankenSplice(arr1, arr2, n) {
  return arr2
frankenSplice([1, 2, 3], [4, 5, 6], 1)


-3- Confirm the Ending

I’ve written a detailed post about this here. No time? Read below.

Let’s first take the challenge description.

Check if a string (first argument, str) ends with the given target string (second argument, target). This challenge can be solved with the .endsWith() method, which was introduced in ES2015. But for the purpose of this challenge, we would like you to use one of the JavaScript substring methods instead.

function confirmEnding(str, target) {
  return str
confirmEnding("Bastian", "n")

And here’s the final solution.

function confirmEnding(str, target) {
  const newStr = str.split(" ").join("")
  const strL = newStr.length
  const targetL = target.length
  const targetIdx = strL - targetL
  const subStr = newStr.substring(targetIdx)

  return subStr == target

confirmEnding("I am a test", "st")

-4- Repeat a String

This challenge is available following this link. It is stated as this:

Repeat a given string str (first argument) for num times (second argument). Return an empty string if num is not a positive number.

function repeatStringNumTimes(str, num) {
  return str

repeatStringNumTimes("abc", 3)

My solution is

-5- Finders Keepers

Click here to go to the challenge.

Create a function that looks through an array (first argument) and returns the first element in the array that passes a truth test (second argument). If no element passes the test, return undefined.

function findElement(arr, func) {
  let num = 0
  return num
findElement([1, 2, 3, 4], num => num % 2 === 0)

-6- Boo who


Check if a value is classified as a boolean primitive. Return true or false.

Boolean primitives are true and false.

function booWho(bool) {
  return bool


-7- Where do I Belong

Go to the challenge.

Return the lowest index at which a value (second argument) should be inserted into an array (first argument) once it has been sorted. The returned value should be a number.
For example, getIndexToIns([1,2,3,4], 1.5) should return 1 because it is greater than 1 (index 0), but less than 2 (index 1).
Likewise, getIndexToIns([20,3,5], 19) should return 2 because once the array has been sorted it will look like [3,5,20] and 19 is less than 20 (index 2) and greater than 5 (index 1).

function getIndexToIns(arr, num) {
 return num;

getIndexToIns([40, 60], 50);

-8- Mutations

This challenge can be retrieved here.

Return true if the string in the first element of the array contains all of the letters of the string in the second element of the array.
For example, [“hello”, “Hello”], should return true because all of the letters in the second string are present in the first, ignoring case.
The arguments [“hello”, “hey”] should return false because the string “hello” does not contain a “y”.
Lastly, [“Alien”, “line”], should return true because all of the letters in “line” are present in “Alien”.

function mutation(arr) {
 return arr;

mutation(["hello", "hey"]);

-9- Title Case a Sentence

Challenge link

Return the provided string with the first letter of each word capitalized. Make sure the rest of the word is in lower case.

For the purpose of this exercise, you should also capitalize connecting words like “the” and “of”.

function titleCase(str) {
 return str;

titleCase("I'm a little tea pot");

-10- Falsy Bouncer


-11- Diff Two Arrays

Challenge link.

-12- Seek and Destroy

Go here to find the link.




Abel is a Software Engeneer and CS Instructor. He spends much of his time contributiong to FLOSS and helping beginners. If you think this is great and shoud continue, consider supporting him.