All Problems
Practice previous year questions from all companies and topics.
| Status | Problem Title | Difficulty | Company | Topic | Action |
|---|---|---|---|---|---|
Practice previous year questions from all companies and topics.
| Status | Problem Title | Difficulty | Company | Topic | Action |
|---|---|---|---|---|---|

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.
We're building something amazing
⚡ Expected launch: Q1 2026
💡 For now, practice solving on your local IDE and we'll notify you when the editor is ready!
Ready to start
Try to solve within 30-45 minutes. Good interview practice!