C Exercises: Return maximum sum such that no two elements are adjacent
C Array: Exercise-68 with Solution
Write a program in C to return the maximum sum such that no two elements are adjacent.
Visual Presentation:

Sample Solution:
C Code:
#include <stdio.h>
// Function to find the maximum sum of elements in an array such that no two elements are adjacent
int maxSumSubseq(int arr1[], int n) {
int incl = arr1[0]; // Initialize incl as the first element of the array
int excl = 0; // Initialize excl as 0, representing no elements chosen initially
int excl_new; // Temporary variable to store the updated value of excl
int i;
for (i = 1; i < n; i++) {
// Store the larger of incl and excl in excl_new
excl_new = (incl > excl) ?incl : excl;
// Update incl to the sum of the current element and excl
incl = excl + arr1[i];
// Update excl to the larger of previous excl and excl_new (which was either incl or excl)
excl = excl_new;
}
// Return the maximum of incl and excl as the final result
return ((incl > excl) ? incl : excl);
}
int main() {
int arr1[] = {1, 3, 5, 9, 7, 10, 1, 10, 100};
int n = sizeof(arr1) / sizeof(arr1[0]);
int i;
// Printing the original array
printf("The given array is : ");
for (i = 0; i < n; i++) {
printf("%d ", arr1[i]);
}
printf("\n");
// Finding and printing the maximum sum of non-adjacent elements in the array
printf("The maximum sum from the array such that no two elements are adjacent is: %d \n", maxSumSubseq(arr1, n));
return 0;
}
Sample Output:
The given array is : 1 3 5 9 7 10 1 10 100 The maximum sum from the array such that no two elements are adjacent is: 122
Flowchart:

C Programming Code Editor:
Previous: Write a program in C to search an element in a row wise and column wise sorted matrix.
Next: Write a program in C to find out the maximum difference between any two elements such that larger element appears after the smaller number.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
- Weekly Trends
- Python Interview Questions and Answers: Comprehensive Guide
- Scala Exercises, Practice, Solution
- Kotlin Exercises practice with solution
- MongoDB Exercises, Practice, Solution
- SQL Exercises, Practice, Solution - JOINS
- Java Basic Programming Exercises
- SQL Subqueries
- Adventureworks Database Exercises
- C# Sharp Basic Exercises
- SQL COUNT() with distinct
- JavaScript String Exercises
- JavaScript HTML Form Validation
- Java Collection Exercises
- SQL COUNT() function
- SQL Inner Join