Write a function that takes in a number as input and recursively finds the sum of all numbers up to and including that number.
input: 6
output: 21
//21 = 6 + 5 + 4 + 3 + 2 + 1
Write a function called multArr
that takes in an array of numbers as an argument and recursively multiplies together all of the values in the array.
multArr([2, 3, 5]); // returns 30
multArr([5, 5, 1, 2]); //returns 50
Write a function called concatArr
that takes in an array of strings as an argument and recursively concatenates the strings together into a single string, with spaces between each original string.
concatArr(['is', 'it', 'tomorrow']); // returns 'is it tomorrow'
concatArr(['or', 'just', 'the', 'end', 'of', 'time']); //returns 'or just the end of time'
Write a function called sumEvens
that takes in an array of numbers as an argument and recursively sums only the even numbers in the array.
sumEvens([2, 3, 5, 6]); // returns 8
sumEvens([10, 5, 1, 2, 12]); //returns 24
Write a function called range
which takes in two numbers (num1, num2) as arguments. The function should return an array of numbers between num1 and num2.
range(2,10); // returns [2, 3, 4, 5, 6,7, 8, 9, 10]
range(17,20); // returns [17, 18, 19, 20]
A child is running up a staircase with n steps and can hop either 1 step 2 steps or 3 steps at a time. Write a function called 'tripleStep', that takes in an argument n
that represents the number of steps in the staircase, and returns a count of how many possible ways the child can run up the stairs.
tripleStep(3); //returns 4
tripleStep(4); //returns 7
tripleStep(5); //returns 13
tripleStep(10); //returns 274
Source: Cracking the Coding Interview
Given an infinite number of quarters, dimes, nickels, and pennies, write code to calculate the number of possible ways of giving exact change for n
cents.
In other words, write a function called coinCombos
that takes in one argument: n
, which represents the total amount of money (in cents) that you need to make change for. Your function should return the amount of possible combinations you can make to return that exact amount of change.
For example:
coinCombos(5); //returns 2
coinCombos(10); //returns 4
coinCombos(25); //returns 13
coinCombos(60); //returns 73
Source: CTCI