Leetcode, Interval, Interview Questions, Google, Meta.
amazing number, then for starting indices [i+1, length(A)-1] and as well [0, i-A[i]], it will be an amazing number. After we have computed all the ranges of starting indices for each index ‘i’, we can use the above problem of finding the maximum overlapping point among these ranges and set that as