Rain Water Trapping

Medium Algorithmic Challenges
Solve in Playground →

Problem Statement

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.

Input Format

First line contains N. Second line contains N elevation heights.

Output Format

Print the total trapped water units.

Constraints

1 <= N <= 1000

Sample Input

12
0 1 0 2 1 0 1 3 2 1 2 1

Sample Output

6

Explanation

Elevation map traps 6 units of water.

Starter Code

#include <stdio.h>

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        int arr[n];
        for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
        // Write your code here
    }
    return 0;
}

Limits

  • Time Limit: 1s
  • Memory Limit: 256MB

Embedded C Programming

Updated: March 15, 2026
Intermediate

Embedded systems rely on efficient low-level programming to interact directly with hardware. In this course, you will learn how to write practical Embedded C programs used in real microcontroller-based systems. Rather than focusing only on theory, this course follows a practice-driven approach. Each lesson includes hands-on coding exercises that simulate real firmware development tasks used