w3resource

JavaScript: Least number of perfect square that sums upto n

JavaScript Math: Exercise-106 with Solution

Fewest Perfect Squares Sum

Write a JavaScript program that accepts an integer (n) as input and calculates the lowest number of exact square numbers that sum to n.

In mathematics, a square number or perfect square is an integer that is the square of an integer; in other words, it is the product of some integer with itself. For example, 9 is a square number, since it equals 32 and can be written as 3 × 3.

Example:
Input: 12
Output: 3
Explanation: 12 = 32 + 12 + 12
Input: 63
Output: 4
Explanation: 63 = 72 + 32 + 22 + 12.

Test Data:
(12) -> 3
(13) -> 2
(63) -> 4

Sample Solution:

JavaScript Code:

/**
 * Function to find the least number of perfect squares that sum up to a given number.
 * @param {number} n - The target number.
 * @returns {number} - The least number of perfect squares that sum up to the target number.
 */
function test(n) {
    // Array to store the least number of perfect squares for each number from 0 to n
    var maps = [];
    maps[0] = 0;
    maps[1] = 1;
    maps[2] = 2;
    maps[3] = 3;
    
    // Dynamic programming approach to calculate the least number of perfect squares
    for (var i = 3; i <= n; i++) {
        maps[i] = maps[i-1] + 1;
        for (var j = 1; j*j <= i; j++) {
            maps[i] = Math.min(maps[i], maps[i-j*j] + 1);
        }
    }
    
    return maps[n];
}

// Test cases
n = 12;
console.log("Number n = " + n);
console.log("Least number of perfect squares that sum up to n: " + test(n));
n = 13;
console.log("Number n = " + n);
console.log("Least number of perfect squares that sum up to n: " + test(n));
n = 63;
console.log("Number n = " + n);
console.log("Least number of perfect squares that sum up to n: " + test(n));

Output:

Number n = 12
Least number of perfect square that sums upto n: 3
Number n = 13
Least number of perfect square that sums upto n: 2
Number n = 63
Least number of perfect square that sums upto n: 4

Flowchart:

JavaScript: Least number of perfect square that sums upto n.

Live Demo:

See the Pen javascript-math-exercise-106 by w3resource (@w3resource) on CodePen.


Improve this sample solution and post your code through Disqus.

Previous: Conversion of integers to English words.
Next: Power of three.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Become a Patron!

Follow us on Facebook and Twitter for latest update.

It will be nice if you may share this link in any developer community or anywhere else, from where other developers may find this content. Thanks.

https://www.w3resource.com/javascript-exercises/javascript-math-exercise-106.php