Max Sum Non-Adjacent Subsequence | Dataford Interview Questions

Given a list of integers, write a function to find the maximum sum of a non-adjacent subsequence.

Implement max_non_adjacent_sum(nums). Return an integer, and allow the empty subsequence, so an input containing only negative values returns 0. The input contains at least one integer.

Constraints

1 <= nums.length <= 1000
-10^9 <= nums[i] <= 10^9
The empty subsequence is allowed

Function Signature

def max_non_adjacent_sum(nums):

Your question is Max Sum Non-Adjacent Subsequence. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given a list of integers, write a function to find the maximum sum of a non-adjacent subsequence.

Implement max_non_adjacent_sum(nums). Return an integer, and allow the empty subsequence, so an input containing only negative values returns 0. The input contains at least one integer.

Constraints

1 <= nums.length <= 1000
-10^9 <= nums[i] <= 10^9
The empty subsequence is allowed

Function Signature

def max_non_adjacent_sum(nums):

Your question is Max Sum Non-Adjacent Subsequence. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.