Container with Most Water

Understand how to identify two lines in an integer array that create the largest possible water container. Explore problem constraints and implement an efficient O(n) time, O(1) space solution using optimal strategies.