Find the max sum without using any adjacent indeces of the array.

non_adjacent.py

A = [8,1,3,4,5,10] 
ans = 22

def non_adjacent_sum(A):
    # Small cases
    if len(A) < 3:
        return max(A)

    # Base cases
    prev_prev, prev = A[0], A[1]
    curr = max(A[2] + prev_prev, prev)

    # Recursive cases
    for i in range(3, len(A)):
        prev_prev, prev = max(prev_prev, prev), curr
        curr = A[i] + prev_prev
    return max(curr, prev)

print(non_adjacent_sum(A) == ans)