Maximum Sum of Non-Adjacent Elements

📋 Problem Description

Given an array of positive integers, find the maximum sum of elements such that no two selected elements are adjacent in the array.

You can only choose elements that are not next to each other. The goal is to maximize the total sum of chosen numbers.

Example 1

Input: nums = [3, 2, 7, 10]
Output: 13
Explanation: Choose elements 3 and 10 → sum = 13.

I WOUD LIKE TO WORK ON THIS

Start by locating the Java source file where this basic program belongs; no file or test is named in the issue. Implement the maximum-sum behavior described for non-adjacent positive integers and verify it against the provided [3, 2, 7, 10] example, which should produce 13.

Written by the indexing model from the issue text.