Given a sequence of non-negative integers representing the heights of bars in an elevation map, the goal is to determine the amount of rainwater that can be trapped between the bars after rain.

Constraints:

• $n ==$ heights.length

• $0 \leq$ heights[i] $\leq 10^5$

• $1 \leq n \leq 10^3$