Add Solution for "Container with most Water" Problem #157

[dhruvjain23]

This issue aims to add a coding problem titled "Container with most Water" along with its solution to the repository.

Problem Statement:

You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).

Find two lines that together with the x-axis form a container, such that the container contains the most water.

Return the maximum amount of water a container can store.

Example 1:

• Input: height = [1,8,6,2,5,4,8,3,7]

• Output: 49

• Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

I sole this problem in O(N) complexity.

I would like to contribute to this repo under hacktoberfest, kindly assign me this issue. @Kushal997-das

[github-actions[bot]]

@dhruvjain23

Welcome to the Project!

Thank you for opening this Issue 🙌! We’re thrilled to have you join us for Hacktoberfest 💖. We’ll review your submission and get back to you shortly.

In the meantime, please remember to give this repo a star! ⭐ We appreciate your contribution!