Topic: Greedy Algorithm Problem / Level: beginner

Problem: You are given an array of integers. Find the maximum sum of a subsequence where no two elements are adjacent.

Run the code to see the output here...