Question

Given an array and a number. We have to find the maximum sum of two numbers from an array which is less than the given number.

Answer 1

Step-by-step explanation:

Naive Approach: We can find maximum sum of subarray by running two loops. But the time complecxity will be O(N*N). Efficient Approach: The subarray having maximum sum can be found by using sliding window. If curr_sum is less than sum include array elements to it.