Topic: Greedy Algorithm Problem / Level: intermediate

Problem: Given an array of integers, maximize the sum of selected elements such that no two selected elements are adjacent.

Run the code to see the output here...