Geeksforgeeks

X

DAYS

:

HOUR

:

MINS

:

SEC

Error

Copied to Clipboard

Given an array **Arr **of size **N** containing positive integers. Find the maximum sum of a subsequence such that no two numbers in the sequence should be adjacent in the array.

**Example 1:**

**Input:
**N = 6
Arr[] = {5, 5, 10, 100, 10, 5}
**Output:** 110
**Explanation:** If you take indices 0, 3
and 5, then Arr[0]+Arr[3]+Arr[5] =
5+100+5 = 110.

**Example 2:**

**Input:
**N = 4
Arr[] = {3, 2, 7, 10}
**Output:** 13
**Explanation: **3 and 10 forms a non
continuous subsequence with maximum
sum.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **findMaxSum()** which takes the array of integers **arr **and **n**** **as parameters and returns an integer denoting the answer.

**Expected Time Complexity:** O(N)

**Expected Auxiliary Space:** O(1)

**Constraints:**

1 ≤ N ≤ 10^{6}

1 ≤ Arr_{i} ≤ 10^{7}

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Max Sum without Adjacents

...