Trapping Rain Water at Yandex

Hard66.8% acceptance

This problem has 62.5% frequency at Yandex.

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

Longest Subarray of 1's After Deleting One ElementMedium Summary RangesEasy String CompressionMedium Find K Closest ElementsMedium Maximize Distance to Closest PersonMedium

View all Yandex questions