aditya109/git-osp-for-beginners

Container With Most Water [C solution required]

Open

#398 opened on Oct 2, 2021

View on GitHub
 (9 comments) (0 reactions) (1 assignee)Java (252 forks)auto 404
C/C++Hacktoberfestgood first issue

Repository metrics

Stars
 (108 stars)
PR merge metrics
 (No merged PRs in 30d)

Description

Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.

Notice that you may not slant the container.

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. Example 2:

Input: height = [1,1] Output: 1 Example 3:

Input: height = [4,3,2,1,4] Output: 16 Example 4:

Input: height = [1,2,1] Output: 2

Contributor guide

Research direction
Implement the two pointer approach to find the maximum area. Start with pointers at both ends of the array, compute area, and move the pointer with smaller height inward. Write the solution in C and ensure it compiles and passes the given examples.
Tech stack
c
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-3 hours
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
Git
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
70