Given an array where each element at index i represents the range [i - arr[i], i + arr[i]] covered by a fountain, find the minimum number of fountains to cover the entire range [0, N-1].
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.