Trapping Rain Water at ServiceNow

Hard66.8% acceptance

This problem has 87.5% frequency at ServiceNow.

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

Valid ParenthesesEasy Number of Distinct Roll SequencesHard Container With Most WaterMedium Generate ParenthesesMedium First Missing PositiveHard

View all ServiceNow questions