Trapping Rain Water at Amazon

Hard66.8% acceptance

This problem has 87.5% frequency at Amazon.

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 American Express Apple Arcesium Bitgo Bloomberg Buyhatke ByteDance C3 AI Capgemini Cisco Citadel Coveo Credit Karma CrowdStrike DE Shaw Epam Systems Expedia+57 more

View Full Problem

More Amazon Questions

Two SumEasy Best Time to Buy and Sell StockEasy Number of IslandsMedium Median of Two Sorted ArraysHard Longest Palindromic SubstringMedium

View all Amazon questions