**Max Array Sum**

### Problem Statement :

Given an array of integers, find the subset of non-adjacent elements with the maximum sum. Calculate the sum of that subset. It is possible that the maximum sum is 0, the case when all elements are negative. For example, given an array arr = [ -2, 1 , 3, -4, 5 ] we have the following possible subsets. These exclude the empty subset and single element subsets which are also valid. Subset Sum [-2, 3, 5] 6 [-2, 3] 1 [-2, -4] -6 [-2, 5] 3 [1, -4] -3 [1, 5] 6 [3, 5] 8 Our maximum subset sum is 8. Note that any individual element is a subset as well. Function Description Complete the maxSubsetSum function in the editor below. It should return an integer representing the maximum subset sum for the given array. maxSubsetSum has the following parameter(s): arr: an array of integers Input Format The first line contains an integer, n. The second line contains n space-separated integers arr[ i ]. Constraints 1 <= n <= 10^5 - 10^4 <= arr[ i ] <= 10^4 Output Format Return the maximum sum described in the statement. Sample Input 0 5 3 7 4 6 5 Sample Output 0 13

### Solution :

` ````
Solution in C :
int dp[100005];
int maxSubsetSum(vector<int> arr) {
dp[0]=max(0,arr[0]);
if(arr.size()==1)
return dp[0];
for(int i=1;i<arr.size();i++)
{
dp[i]=max(dp[i-2],max(dp[i-1],dp[i-2]+arr[i]));
}
int n=arr.size();
return max(dp[n-1],dp[n-2]);
}
```

## View More Similar Problems

## Tree: Preorder Traversal

Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's

View Solution →## Tree: Postorder Traversal

Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the

View Solution →## Tree: Inorder Traversal

In this challenge, you are required to implement inorder traversal of a tree. Complete the inorder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values. Input Format Our hidden tester code passes the root node of a binary tree to your $inOrder* func

View Solution →## Tree: Height of a Binary Tree

The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height : image Function Description Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer. getHeight or height has the following parameter(s): root: a reference to the root of a binary

View Solution →## Tree : Top View

Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example : 1 \ 2 \ 5 / \ 3 6 \ 4 Top View : 1 -> 2 -> 5 -> 6 Complete the function topView and print the resulting values on a single line separated by space.

View Solution →## Tree: Level Order Traversal

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F

View Solution →