30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 42. Trapping Rain Water

Given an array of non-negative heights representing elevation bars of width 1, compute the total units of water that can be trapped between them after raining. The core challenge is determining, for each position, the bounding left and right maxima to accumulate trapped volume efficiently (ideally in linear time).

Asked at:

Amazon

Microsoft

goldman sachs

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late September, 2025

goldman sachs

Mid-level

Early September, 2025

Microsoft

Mid-level

https://leetcode.com/problems/trapping-rain-water/description/

Early June, 2025

Amazon

Mid-level

Get Premium to View All 7 Reports

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 42. Trapping Rain Water

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact