Maximum Non-Adjacent Chocolates

medium

Coding DSAOld question · last reported Jul 2025

Requirements

The first input line gives numJars, the number of jars, N.
The second input line contains N space-separated integers, where each value is the chocolate count for one jar.
Choose jars so that no two selected jars are adjacent.
Output the greatest possible total number of chocolates.
Some jars may contain no chocolates.
Constraint: 1 < N <= 1000.

Input:

6
5 30 99 60 5 10

Output:

Explanation: selecting jars 1, 3, and 6 gives 5 + 99 + 10 = 114, which is the maximum total.

Step 1 / 5

Input

nums = [5, 30, 99, 60, 5, 10]

Expected

We have 6 jars with chocolate counts. Goal: select non-adjacent jars to maximize total chocolates.

medium

Coding DSAOld question · last reported Jul 2025

The first input line gives numJars, the number of jars, N.
The second input line contains N space-separated integers, where each value is the chocolate count for one jar.
Choose jars so that no two selected jars are adjacent.
Output the greatest possible total number of chocolates.
Some jars may contain no chocolates.
Constraint: 1 < N <= 1000.

Input:

6
5 30 99 60 5 10

Output:

Explanation: selecting jars 1, 3, and 6 gives 5 + 99 + 10 = 114, which is the maximum total.

Step 1 / 5

Input

nums = [5, 30, 99, 60, 5, 10]

Expected

We have 6 jars with chocolate counts. Goal: select non-adjacent jars to maximize total chocolates.

Step 1 / 5

Input

nums = [5, 30, 99, 60, 5, 10]

Expected

We have 6 jars with chocolate counts. Goal: select non-adjacent jars to maximize total chocolates.

Step 1 / 5

Input

nums = [5, 30, 99, 60, 5, 10]

Expected

We have 6 jars with chocolate counts. Goal: select non-adjacent jars to maximize total chocolates.