
- Javascript Basics Tutorial
- Javascript - Home
- Javascript - Overview
- Javascript - Syntax
- Javascript - Enabling
- Javascript - Placement
- Javascript - Variables
- Javascript - Operators
- Javascript - If...Else
- Javascript - Switch Case
- Javascript - While Loop
- Javascript - For Loop
- Javascript - For...in
- Javascript - Loop Control
- Javascript - Functions
- Javascript - Events
- Javascript - Cookies
- Javascript - Page Redirect
- Javascript - Dialog Boxes
- Javascript - Void Keyword
- Javascript - Page Printing
- JavaScript Objects
- Javascript - Objects
- Javascript - Number
- Javascript - Boolean
- Javascript - Strings
- Javascript - Arrays
- Javascript - Date
- Javascript - Math
- Javascript - RegExp
- Javascript - HTML DOM
- JavaScript Advanced
- Javascript - Error Handling
- Javascript - Validations
- Javascript - Animation
- Javascript - Multimedia
- Javascript - Debugging
- Javascript - Image Map
- Javascript - Browsers
- JavaScript Useful Resources
- Javascript - Questions And Answers
- Javascript - Quick Guide
- Javascript - Functions
- Javascript - Resources
Subset with maximum sum in JavaScript
We are required to write a JavaScript function that takes in an array of integers. Our function is required find the subset of non−adjacent elements with the maximum sum.
And finally, the function should calculate and return the sum of that subset.
For example −
If the input array is −
const arr = [3, 5, 7, 8, 10];
Then the output should be 20 because the non−adjacent subset of numbers will be 3, 7 and 10.
Example
The code for this will be −
const arr = [3, 5, 7, 8, 10]; const maxSubsetSum = (arr = []) => { let min = −Infinity const helper = (arr, ind) => { if ( ind < 0 ){ return min }; let inc = helper(arr, ind−2); let notInc = helper(arr, ind−1); inc = inc == min ? arr[ind] : Math.max(arr[ind], arr[ind] + inc); return Math.max( inc, notInc ); }; return helper(arr, arr.length − 1); }; console.log(maxSubsetSum(arr));
Output
And the output in the console will be −
20
- Related Articles
- Maximum size subset with given sum in C++
- Maximum subset with bitwise OR equal to k in C++
- Subset Sum Problem
- Maximum Possible Sum of Products in JavaScript
- Maximum contiguous sum of subarray in JavaScript
- Achieving maximum possible pair sum in JavaScript
- Partition Equal Subset Sum in C++
- Sum of subset differences in C++
- Maximum subarray sum in circular array using JavaScript
- Find the sum of maximum difference possible from all subset of a given array in Python
- C++ Largest Subset with Sum of Every Pair as Prime
- Maximum product subset of an array in C++
- Maximum Subarray Sum with One Deletion in C++
- Number of pairs with maximum sum in C++
- Maximum product subset of an array in C++ program

Advertisements