Given an array `heights` where `heights[i]` is the height of a vertical line at index `i`, find two lines that together with the x-axis form a container that holds the most water. Return the maximum water volume. Volume = min(heights[i], heights[j]) × (j − i).
Run your code to see results.