Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Create 1637. Widest Vertical Area Between Two Points Containing #370

Merged
merged 1 commit into from
Dec 21, 2023
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
20 changes: 20 additions & 0 deletions 1637. Widest Vertical Area Between Two Points Containing
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
class Solution {
public:
int maxWidthOfVerticalArea(vector<vector<int>>& points) {

int n = points.size();

//sort the array on the first value in ascending order.
sort(points.begin(), points.end());

//Calculating Area between each points and maintining that in maxArea
int maxArea = 0;
for(int i=1;i<n;i++) {
int currArea = points[i][0]-points[i-1][0];
maxArea = max(maxArea, currArea);
}

return maxArea;

}
};
Loading