Contains Most Water Java Problem added

[aryansingla]

Description

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.

Solution

Java

[Pranshu321]

@aryansingla please add the driver code for this problem.

[kartik-raj7]

Please add the driver code along with proper comments and variable names with proper explanation and create a new pull request for the same closing this one