Trapping Rain Water at Goldman Sachs

Hard66.8% acceptance

This problem has 100.0% frequency at Goldman Sachs.

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

View Full Problem

More Goldman Sachs Questions

Median of Two Sorted ArraysHard Container With Most WaterMedium Search in Rotated Sorted ArrayMedium Minimum Path SumMedium Decode WaysMedium

View all Goldman Sachs questions