In the **Leetcode Container With Most Water problem solution in C programming,** 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.

**Leetcode Container With Most Water problem solution in C programming**

```
int maxArea(int* height, int heightSize){
int l=0, r=heightSize-1;
int max = 0;
while(l < r)
{
int area = (r-l)*(height[l] < height[r]? height[l++] : height[r--]);
max = max > area? max : area;
}
return max;
}
```

**Also read,**

- Leetcode Container With Most Water problem solution in C++
- Leetcode Container With Most Water problem solution in Java
- Leetcode Container With Most Water problem solution in Python
- Leetcode Container With Most Water problem solution in C#