A Common-Sense Guide to Data Structures and Algorithms in JavaScript, Volume 1

Exercises

The following exercises provide you with the opportunity to practice with dynamic programming. The solutions to these exercises are found in the section ​Chapter 12​.

1. The following function accepts an array of numbers and returns the sum, as long as a particular number doesn’t bring the sum above 100. If adding a particular number will make the sum higher than 100, that number is ignored. However, this function makes unnecessary recursive calls. Fix the code to eliminate the unnecessary recursion:

   function addUntil100(array) {
     if (array.length === 0) { return 0; }
   
     if (array[0] + addUntil100(array.slice(1)) > 100) {
       return addUntil100(array.slice(1));
     } else {
       return array[0] + addUntil100(array.slice(1)); ...