Container With Maximum Volume Solution

Problem Statement

Given a list of non-negative integers `heights` representing the heights of a set of bars with unit width, find the maximum area of water that can be trapped between any two bars. The area of water between two bars `i` and `j` is calculated as the product of the minimum height between `heights[i]` and `heights[j]` and the distance `j - i`.

Constraints

• The input will be a string where each substring contains the height and width of a building in the format "width:height".