Topic: Greedy Algorithm Problem / Level: beginner

Problem: 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...