All Problems
Practice previous year questions from all companies and topics.
| Status | Problem Title | Difficulty | Company | Topic | Action |
|---|---|---|---|---|---|
Back to Google Problems
hardArrays
Trapping Rain Water
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.
Example:
Input: height = [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6
Explanation: The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water are being trapped.
Constraints
- n == height.length
- 1 <= n <= 2 * 10^4
- 0 <= height[i] <= 10^5
Code Editor Coming Soon!In Progress
We're building something amazing
Multi-language support (C++, Python, Java, JavaScript)
Real-time code execution with test cases
Syntax highlighting & auto-completion
Save your solutions automatically
Compare with optimal solutions
Development Progress65%
⚡ Expected launch: Q1 2026
💡 For now, practice solving on your local IDE and we'll notify you when the editor is ready!
Timer
0:00
Ready to start
Try to solve within 30-45 minutes. Good interview practice!
Problem Stats
Acceptance Rate68.4%
Total Solved1,245
Average Time25 mins
Your StatusNot Attempted