Trapping Rain Water at Bloomberg

Hard66.8% acceptance

This problem has 75.0% frequency at Bloomberg.

Problem Description

Given `n` non-negative integers representing an elevation map where the width of each bar is `1`, compute how much water it can trap after raining.

Read full problem and hints

Topics

Array Two Pointers Dynamic Programming Stack Monotonic Stack

Also asked at 77 companies

Accenture Adobe Airbnb Amazon American Express Apple Arcesium Bitgo Buyhatke ByteDance C3 AI Capgemini Cisco Citadel Coveo Credit Karma CrowdStrike DE Shaw Epam Systems Expedia+57 more

View Full Problem

More Bloomberg Questions

Two SumEasy Valid ParenthesesEasy Merge IntervalsMedium Best Time to Buy and Sell StockEasy Number of IslandsMedium

View all Bloomberg questions