MAXIMUM WATER TRAPPED
+========+
Time: 30 minutes - 1 hour
Difficulty: Hard
Languages: Any
+========+
Given an array of non-negative integers representing a landscape, where the width of each bar is 1, implement a function that finds the amount of water that can be trapped in the landscape.
+========+
Please answer to this message with your solution 🙂
>>Click here to continue<<