Last active
December 24, 2018 17:11
-
-
Save priyankvex/9c835d9efab60d8f87c3ada9ab07c80b to your computer and use it in GitHub Desktop.
Scamming the coding interview: Problem 010: Rain water trapped
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
""" | |
Scamming the coding interview | |
""" | |
def calculate_rain_water_trapped(bars): | |
n = len(bars) | |
left = [0 for i in range(0, n)] | |
# find and store the highest bar on the left for all the elements | |
left[0] = bars[0] | |
for i in range(1, n): | |
max_so_far = max(bars[i], left[i-1]) | |
left[i] = max_so_far | |
# find and store the highest bar on the right for all the elements | |
right = [0 for i in range(0, n)] | |
right[n-1] = bars[n-1] | |
for i in range(2, n+1): | |
max_so_far = max(right[n-i+1], bars[n-i]) | |
right[n-i] = max_so_far | |
# calculate the water units stored at each element | |
water = 0 | |
for i in range(0, n): | |
temp_water = min(left[i], right[i]) - bars[i] | |
water += temp_water | |
return water | |
if __name__ == '__main__': | |
bars = [3, 0, 0, 2, 0, 4] | |
water = calculate_rain_water_trapped(bars) | |
print(water) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment