Non-Adjacent Sum
Programming Interview
Questions
Non-Adjacent Sum
Given an array nums of integers, find the maximum sum of a subset of non-adjacent elements in the array. You cannot select adjacent elements.
Input:
- nums: A list of integers.
Output: A maximum sum of non-adjacent integers.
Tests - Login / Sign up to submit your code!
Efficiency
Test Case 1
Test Case 2
Test Case 3
Test Case 4
Test Case 5
Test Case 6
Test Case 7
Test Case 8
Test Case 9
Test Case 10
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results