Maximum size subset with given sum

<script>

// JavaScript Programming solution for subset
// sum problem+ maximal subset value.

// Returns size of maximum sized subset 
// if there is a subset of set[] with 
// sun equal to given sum. It returns -1
// if there is no subset with given sum.
function isSubsetSum(set, n, sum)
{
    
    // The value of subset[i][j] will be 
    // true if there is a subset of 
    // set[0..j-1] with sum equal to i
    let subset = new Array(sum + 1);
     
    // Loop to create 2D array using 1D array
    for(var i = 0; i < subset.length; i++)
    {
        subset[i] = new Array(2);
    }
    let count = new Array(sum + 1);
         
    // Loop to create 2D array using 1D array
    for(var i = 0; i < count.length; i++)
    {
        count[i] = new Array(2);
    }

    // If sum is 0, then answer is true
    for(let i = 0; i <= n; i++) 
    {
        subset[0][i] = true;
        count[0][i] = 0;
    }

    // If sum is not 0 and set is empty,
    // then answer is false
    for(let i = 1; i <= sum; i++)
    {
        subset[i][0] = false;
        count[i][0] = -1;
    }

    // Fill the subset table in bottom up manner
    for(let i = 1; i <= sum; i++) 
    {
        for(let j = 1; j <= n; j++) 
        {
            subset[i][j] = subset[i][j - 1];
            count[i][j] = count[i][j - 1];
            
            if (i >= set[j - 1]) 
            {
                subset[i][j] = subset[i][j] ||
                subset[i - set[j - 1]][j - 1];

                if (subset[i][j])
                    count[i][j] = Math.max(count[i][j - 1],
                         count[i - set[j - 1]][j - 1] + 1);
            }
        }
    }
    return count[sum][n];
}

// Driver Code
let set = [ 2, 3, 5, 10 ];
let sum = 20;
let n = set.length;

document.write(isSubsetSum(set, n, sum));

// This code is contributed by sanjoy_62

</script>