Open k-sai-deekshith opened 1 year ago
Since the cpp code is already present I have written in python.
Please review and approve the PR https://github.com/iamdestinychild/30-Days-DSA-Challenge/pull/229
this repo has been excluded from hacktoberfest so every contribution is your way of supporting this project
Description
Hi I want to work on this problem of Leetcode in cpp. Can you please accept this issue and assign it to me.
DSA Problem
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.
Notice that you may not slant the container.