Trapping Rain Water at Sprinklr

Hard66.8% acceptance

This problem has 50.0% frequency at Sprinklr.

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 Sprinklr Questions

Create Components With Same ValueHard Minimum Edge Weight Equilibrium Queries in a TreeHard Number of Great PartitionsHard Apply Operations on Array to Maximize Sum of SquaresHard Count the Number of Powerful IntegersHard

View all Sprinklr questions