Trapping Rain Water at Tekion

Hard66.8% acceptance

This problem has 87.5% frequency at Tekion.

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

Count the Number of Infection SequencesHard Product of Array Except SelfMedium Best Time to Buy and Sell Stock IIIHard Split Array Largest SumHard Two SumEasy

View all Tekion questions