https://github.com/alvp01/mob-programmig-city-swim

Microverse mob-programming session
https://github.com/alvp01/mob-programmig-city-swim

Last synced: about 1 hour ago
JSON representation

Microverse mob-programming session

• Host: GitHub
• URL: https://github.com/alvp01/mob-programmig-city-swim
• Owner: alvp01
• Created: 2022-01-06T14:09:45.000Z (about 3 years ago)
• Default Branch: main
• Last Pushed: 2022-01-06T14:18:26.000Z (about 3 years ago)
• Last Synced: 2025-01-13T14:51:48.347Z (4 days ago)
• Size: 0 Bytes
• Stars: 3
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
Given an array representing the height of towers on a 2d plane, with each tower being of width 1, Whats's the maximum amount of units of water that can be captured between the towers when it rains?

Each tower is immediately next to the tower next to it in the array, except in instances where a height of 0 is shown, then no tower would be present.

A single unit can be thought of as a 2d square with a width 1.

```

          [5,2,10] should return 3

  [1,0,5,2,6,3,10] should return 7

[15,0,6,10,11,2,5] should return 20

           [1,5,1] should return 0

             [6,5] should return 0

                [] should return 0

```