Given an array A of integers and integer K, return the maximum S such that there exist i < j with A[i] + A[j] = S and S < K. If no i, j exist satisfying this equation, return -1

# Monthly Archives: January 2021

## Sum of even Fibonacci numbers less than x

By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.