Water Fountain

Problem Statement

Water Fountain Problem Description You are on a family vacation and visiting a ring road with several water fountains. Each fountain provides a certain amount of water, represented by the number of water droplets at that fountain. So there are 'n' fountains and water present at the ith fountain is water[i] . Additionally, there is a water bottle that you can fill up at each fountain. The amount of water that bottle can hold represents its capacity. It costs cost[i] for a certain number of water droplets to walk from ith fountain to the [i+1]th fountain. You begin with the empty water bottle at one of the fountains. Given two integer arrays 'water' and 'cost' representing the number of water droplets at each fountain and the cost of traveling between fountains. Find the starting fountain index where you can fill up the bottle in such a way that you can make a complete round path once in the clockwise direction without running out of water, otherwise return -1. Examples Example 1: Input: