Examples Example 1: height of a7=1 This tutorial is only for Educational and Learning purpose. Given n non-negative integers a1, a2, , an , where each represents a point at coordinate (i, ai). Manage Settings Today we are going to discuss problem number 11 on LeetCode. That means that we always have to check at each new possible stop to see if the new container area is better than the current best. Am I betraying my professors if I leave a research group because of change of interest? n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). } n vertical lines are drawn such that the two endpoints of line i is at (i, a i) and (i, 0). leet-code/Container With Most Water.java at master - GitHub Java Solution for Container With Most Water Problem - LeetCode I have developed an interest in design and Web Development and currently learning front-end web development. Help us improve. Java BreadthFirstSearch Therefore, in some cases both conditions are true. Can we do better ? Calculate the area between the two bars and compare it with the current maximum. Return the maximum amount of water a container can store. 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 problem, we have to find the container, which is made up of the vertical lines, which will hold most water or in short we have to find the two set of vertical lines which will contain the most surface area. Leetcode Problem: Container With Most Water. The only different between them is that I use if(height[l]>height[r]) rather than else, But with my code, while (left < right) { Hope that the solution is helpful and you guys have liked it. So, Area = minimum {4,3}*1 = 3*1 which is equal to 3 (calculated using the above area formula). Fledgling software developer; the struggle is a Rational Approximation. LeetCode - Container With Most Water (Java) - ProgramCreek.com Leetcode container with most water problem solution - Programmingoneonone Find Container with Most Water in Java - Blogger Output: 1, Time Complexity: Now, it's the line on the left end that's the limiting factor, so the next step will be to slide i to the right. Once unsuspended, seanpgallivan will be able to comment and publish posts again. n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). The most basic observation is that the area formed between the lines will always be limited by the height of the minimum. Introduction AfterAcademy Interview Kit Blogs Mentor Ali Mentor Amit Admin AfterAcademy . right--; Built on Forem the open source software that powers DEV and other inclusive communities. } LeetCode Container With Most Water - DEV Community Contribute your expertise and make a difference in the GeeksforGeeks portal. Find two lines, which together with x-axis forms a container, such that the container contains the most water. Container With Most Water. document.getElementById( "ak_js_1" ).setAttribute( "value", ( new Date() ).getTime() ); CodingBroz is an all-in-one learning platform designed to take beginner programmers from zero to hero. Find two lines, which together with x-axis forms a container, such that the container contains the most water. Mathematical explanation of Leetcode question: Container With Most Water In case someone is looking for video solution for this problem you can watch this: Above video and this article made understand this problem so easily! Copyright Kakao Corp. All rights reserved. Note : In Case of single verticle line it will not be able to hold water. Unflagging seanpgallivan will restore default visibility to their posts. rev2023.7.27.43548. How to draw vertical line in Swing Ask Question Asked 9 years, 5 months ago Modified 3 years, 10 months ago Viewed 16k times 0 I am able to draw a horizontal line but unable to draw a vertical line. https://leetcode.com/problems/container-with-most-water/. }); proof: if AmContainer With Most Water - AfterAcademy By using our site, you Consider these two bars and horizontal surface as the walls of the container. Find two lines, which, together with the x-axis forms a container, such that the container contains the most water. Find two lines, which, together with the x-axis forms a container, such that the container contains the most water. This is very easily observed with the use of visuals. LeetCode Container With Most Water Problem statement. Example: Input: [1,8,6,2,5,4,8,3,7] Output: 49 . n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). The first thing we should realize is that the amount of water contained is always going to be a rectangle whose area is defined as length * width. The original question is: 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]). Since we are scanning each element of an array only one, the time complexity will be O(n). Find two lines that together with the x-axis form a container, such that the container contains the most water. The naive approach is pretty intuitive. Lets see code, 11. n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water. Not the answer you're looking for? It will become hidden in your post, but will still be visible via the comment's permalink. In order to use an efficient solution to find the maximum water we can store in a container, we will start with two vertical lines, first and last, and check how much water can be stored. Container With Most Water Solution in C++, 11. project/LineContainer.java at master ynwynw/project GitHub Return the maximum amount of water a container can store. : operator. Why do we allow discontinuous conduction mode (DCM)? Similarily, if leftHeight > rightHeight, move left and find a value that is greater than rightHeight. 2. n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Your email address will not be published. public int maxArea(int[] height) { We're a place where coders share, stay up-to-date and grow their careers. Wow, I used your javascript solution and it beat 93.8% of other submissions, Thanks for explaining it clearly with those diagrams, Nice Explaination, But we can improve this logic further. Container With Most Water Solution in Python, Go Program to Check Whether a Number is Even or Odd. Time complexity: O(N)Array is traversed only onceSpace complexity: O(1)No extra space is used so the complexity is constant. Asking for help, clarification, or responding to other answers. acknowledge that you have read and understood our. Algebraically why must a single square root be done on all terms rather than individually? Water can be filled between two bars and the horizontal surface between them. Find two lines, which, together with the x-axis forms a container, such that the container contains the most water. Thanks for contributing an answer to Stack Overflow! If you like what you see, give me a thumbs up. Find two lines, which, together with the x-axis forms a container, such that the container contains the most water. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). java-leetcode-classroom/java_container_with_most_water Instead, we can observe that if we start with the lines on the opposite ends and move inward, the only possible time the area could be larger is when the height increases, since the width will continuously get smaller. n vertical lines are drawn such that the two endpoints of the line i is at (i, a i) and (i, 0). The total area is 49 units. Example: Given [1,3,2], the max area of the container is 2. For example if [4,3,2,6] is the given heights array, we start by comparing the 0th and 1st index elements, i.e. ExamplesArray : [ 2, 5, 4, 3, 1]Output : 6 unitsThe maximum water can be stored between (5,3) vertical Lines.Output= 6 =min(5,3)*(distance between both vertical lines (2)). https://www.code-recipe.com/post/container-with-most-water, https://leetcode.com/problems/container-with-most-water/discuss/883189/Simple-two-pointers-solution-or-C++-code-or-video-explanation, Same here. Output: 49 Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Everytime, we are moving our pointer i ahead if height of line at ith index is smaller or j pointer if height of line at jth index is smaller. For the first example, with 1, 5, 4, 3, some of your other options are: Taking 5 and 3 together (which are 2 apart; index 1 and index 3) is the desired result, because it results in the highest area (3 * 2 = 6). Once unpublished, this post will become invisible to the public and only accessible to seanpgallivan. For What Kinds Of Problems is Quantile Regression Useful? Thank you for your valuable feedback! var obj = {i:i,height:heights[i]}; Container With Most Water Solution in Java, 11. . Find two lines that together with the x-axis form a container, such that the container contains the most water. n vertical lines are drawn such that the two endpoints of line i is atand. Why is {ni} used instead of {wo} in ~{ni}[]{ataru}? Solution: Vertical Order Traversal of a Binary Tree, Solution: Count Ways to Make Array With Product, Solution: Smallest String With A Given Numeric Value, Solution: Concatenation of Consecutive Binary Numbers, Solution: Minimum Operations to Make a Subsequence, Solution: Find Kth Largest XOR Coordinate Value, Solution: Change Minimum Characters to Satisfy One of Three Conditions, Solution: Shortest Distance to a Character, Solution: Number of Steps to Reduce a Number to Zero, Solution: Maximum Score From Removing Substrings (ver. What is happening here when the else statement is not used? LeetCode 11. Container With Most Water | GoodTecher 1 Constraints: n == height.length 2 <= n <= 10 5 0 <= height [i] <= 10 4 ALGORITHM - IDEA - In order to find Container With Most Water. code of conduct because it is harassing, offensive or spammy. Eliminative materialism eliminates itself - a familiar idea? Your program should return an integer that corresponds to the maximum area of water that can be contained ( Yes, we know maximum area instead of maximum volume sounds weird.But this is a 2D plane we are working with for simplicity ). Find centralized, trusted content and collaborate around the technologies you use most. So, for the combinations of lines which we are neglecting, have been already taken care of. If you would like to change your settings or withdraw consent at any time, the link to do so is in our privacy policy accessible from our home page.. Is it unusual for a host country to inform a foreign politician about sensitive topics to be avoid in their speech? Run a nested loop i = 0 till i = N and j = i + 1 till N. Keep incrementing the pointer pointed at smaller height towards each other. Link: https://leetcode.com/problems/container-with-most-water/. //heights: int[] array. 2), Solution: Remove Palindromic Subsequences, Solution: Check If a String Contains All Binary Codes of Size K, Solution: Swapping Nodes in a Linked List, Solution: Best Time to Buy and Sell Stock with Transaction Fee, Solution: Generate Random Point in a Circle, Solution: Reconstruct Original Digits from English, Solution: Flip Binary Tree To Match Preorder Traversal, Solution: Minimum Operations to Make Array Equal, Solution: Determine if String Halves Are Alike, Solution: Letter Combinations of a Phone Number, Solution: Longest Increasing Path in a Matrix, Solution: Remove All Adjacent Duplicates in String II, Solution: Number of Submatrices That Sum to Target, Solution: Remove Nth Node From End of List, Solution: Critical Connections in a Network, Solution: Furthest Building You Can Reach, Solution: Find First and Last Position of Element in Sorted Array, Solution: Convert Sorted List to Binary Search Tree, Solution: Delete Operation for Two Strings, Solution: Construct Target Array With Multiple Sums, Solution: Maximum Points You Can Obtain from Cards, Solution: Flatten Binary Tree to Linked List, Solution: Minimum Moves to Equal Array Elements II, Solution: Binary Tree Level Order Traversal, Solution: Evaluate Reverse Polish Notation, Solution: Partitioning Into Minimum Number Of Deci-Binary Numbers, Solution: Maximum Product of Word Lengths, Solution: Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts, Solution: Construct Binary Tree from Preorder and Inorder Traversal, Solution: Minimum Number of Refueling Stops, Solution: Number of Subarrays with Bounded Maximum. They can still re-publish the post if they are not suspended. Notice that you may not slant the container. I can not understand how this solution solve the situation when, the width between two lines can be short but if the two lines are the higest,the Area will be grather than a continer with a larger width but with shorter lenght Lets take another example.Array : [3, 1, 2, 4, 5, 1]Output : 12 unitsMaximum water can be held between (3,5) vertical lines.Output= 12 =min(3,5)*( distance between both Vertical lines (4)). Thanks! For further actions, you may consider blocking this person and/or reporting abuse. 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]). But here we can see that it's definitely possible to have to move the same side twice in a row, as the j line is still the lower of the two: This is obviously the last possible container to check, and like the last few before it, it doesn't appear to be the best match. cases where it makes more sense Extras Javascript solution. Initially we can assume the result is 0. Container With Most Water problem of Leetcode. Container With Most Water - LeetCode Data Structure & Algorithm Classes (Live), Data Structure & Algorithm-Self Paced(C++/JAVA), Full Stack Development with React & Node JS(Live), Top 100 DSA Interview Questions Topic-wise, Top 20 Interview Questions on Greedy Algorithms, Top 20 Interview Questions on Dynamic Programming, Top 50 Problems on Dynamic Programming (DP), Commonly Asked Data Structure Interview Questions, Top 20 Puzzles Commonly Asked During SDE Interviews, Top 10 System Design Interview Questions and Answers, Indian Economic Development Complete Guide, Business Studies - Paper 2019 Code (66-2-1), GATE CS Original Papers and Official Keys, ISRO CS Original Papers and Official Keys, ISRO CS Syllabus for Scientist/Engineer Exam, Find the non decreasing order array from given array, Egg Dropping Puzzle with 2 Eggs and K Floors, Find N number of solutions with the given inequality equations, Represent a number as sum of minimum possible pseudobinary numbers, Number of solutions for the equation x + y + z <= n, Find if a molecule can be formed from 3 atoms using their valence numbers, Find smallest perfect square number A such that N + A is also a perfect square number, Find an integer in the given range that satisfies the given conditions, Maximum Squares possible parallel to both axes from N distinct points, Swapping four variables without temporary variable, Check if a number can be represented as the sum of numbers with at least one digit equal to K, Count the numbers which can convert N to 1 using given operation, Sum of all N-digit palindromic numbers which doesnt contains 0 and are divisible by 9, Find maximum unreachable height using two ladders, Find remainder of array multiplication divided by n, Create a nested loop, the outer loop traverses the array from 0 to end (index of this loop is, Find the water that can be contained in the container with height of boundaries as array[i] and array[j], i.e. Area=18. Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. Once unpublished, all posts by seanpgallivan will become hidden and only accessible to themselves. n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Once unsuspended, harshrajpal will be able to comment and publish posts again. So in the best case, the max distance between i=1 and i=3 is 2, and the minimum of 4 and 3 is 3, so total water is 2*3=6. // Maximum area will be stored in this variable, // If there is a longer vertical line present, # This variable will store the maximum area, # If there is a longer vertical line present, Inside loop, calculate the height of the shorter bar one bar is represented by. Unflagging harshrajpal will restore default visibility to their posts. Solution 1: Brute Force. Similarly, we can calculate the area of all the pairs and find out which one is maximum. Time complexity : O (N*N)The array is getting traversed by outer and inner loop.Space complexity: O(1)No extra space is used so the complexity is constant. Feel free to share your thoughts on this. We can draw vertical lines taking each integer from the array such that each line coordinates will be (i,0) and (i, ai). Thanks for keeping DEV Community safe. n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). In this Leetcode container with the most water problem solutions, we have Given n non-negative integers a1, a2, ., an, where each represents a point at coordinate (i, ai). Then we scan from both sides. I hope you enjoyed this post. Notice that you may not slant the container. So now our first and second index is pointing to the first and last vertical lines respectively. Find two lines that together with the x-axis form a container, such that the container contains the most water. its not same as largest histogram problem. Objective: 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]). Space Complexity: Container with most water algorithm issue - Stack Overflow You can add following code inside the outer while loop , If. I don't know why and what's the difference between them. The brute force solution to this problem is to check every possible combination of the given heights. An example of data being processed may be a unique identifier stored in a cookie. Once unpublished, this post will become invisible to the public and only accessible to Harsh Rajpal. Example 1: Required fields are marked *. Container With Most Water - 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]). Looks like this problems simplifies assumptions, not sure if its right, lo Now, lets see the code of 11. Notice that you may not slant the container. . Notice that you may not slant the container. max = Math.max(max, (right - left) * Math.min(height[left], height[right])); [LeetCode] 11. Container With Most Water (Java) - we need to find two lines, which together with the x-axis form a container, such . Very well written. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height [i]). If seanpgallivan is not suspended, they can still re-publish their posts from their dashboard. Time Complexity:O(N^2), where N is the size of the arraySpace Complexity:O(1) since no extra space is used. Given n non-negative integers a1, a2, ., an, where each represents a point at coordinate (i, ai). Find two lines, which together with x-axis forms a container, such that the container contains the most water. else 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 . If the value of the vertical line at which the first is pointing is lesser than the value of the second, then increment the first or decrement the second. O(1). Compare it and move the pointer i to 5. Tags Expand : Two Pointers Array */ /* Thoughts: This is pretty intuitive . Find two lines that together with the x-axis form a container, such that the container contains the most water. This will take two nested loops and the time complexity will be O(n2). Here is what you can do to flag seanpgallivan: seanpgallivan consistently posts content that violates DEV Community's Sharing my experience and tips as I go along. Return the maximum amount of water a container can store. Container With Most Water - LeetCode Got it Java || 2ms || Simple Solution arunarunarun7354 113 485 Feb 20, 2023 Java Code Example 1: If we want to get the maximum Area, why we should use the shorter line as length? Hence, for 8 to be in the answer, other line should be 10. Site design / logo 2023 Stack Exchange Inc; user contributions licensed under CC BY-SA. Browse other questions tagged, Where developers & technologists share private knowledge with coworkers, Reach developers & technologists worldwide, The future of collective knowledge sharing, New! Run a loop until first is less than the last. DEV Community A constructive and inclusive social network for software developers. I found the below article simple and easy to understand though. java - How to draw vertical line in Swing - Stack Overflow DEV Community 2016 - 2023. If leftHeight < rightHeight, move right and find a value that is greater than leftHeight. But if the walls are of different lengths then we can only fill water up to the height of the shorter bar. Done. here, if 8 has to be in the answer then other line that we choose should be 10 as it is the first line from the end that is at maximum distance apart from 8 and longer than 8. 594), Stack Overflow at WeAreDevelopers World Congress in Berlin, Temporary policy: Generative AI (e.g., ChatGPT) is banned, Preview of Search and Question-Asking Powered by GenAI, Why else case of if doesn't make any error when the if argument is already set as true in java, In which scenario would this kind of if statement be useful? Notice that if the first condition is valid, the variable l is increased before evaluating the second condition, which means your comparing different array items in both conditions. https://leetcode.com/problems/container-with-most-water/, At each iteration, calculate the area of water trapped between the vertical lines represented by, Move the pointers inward based on the height of the lines. Here is what you can do to flag harshrajpal: harshrajpal consistently posts content that violates DEV Community's LeetCode Container With Most Water (Java), LeetCode Longest Increasing Path in a Matrix (Java). Built on Forem the open source software that powers DEV and other inclusive communities. 'n' vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Solution Analysis Why this solution works? [1] 47048. such that the container contains the most water. Move the pointers if there exists a bar whose height is greater than the current one. `if (condition);`. Till next time Happy coding and Namaste ! class Solution { public int maxArea(int[] nums) { int max = Integer.MIN_VALUE; int n = nums.length; int i = 0; int j = n - 1; while(i < j) { // The aim is to maximize the area formed between the vertical lines. For further actions, you may consider blocking this person and/or reporting abuse. Notice that you may not slant the container. n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). For the other languages, it made more sense (and was ultimately more performant) to only have to do the basic comparisons once each. The consent submitted will only be used for data processing originating from this website. Running Java in a Container | D2iQ You are given an integer array height of length n. n 'height' .There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).i (i, 0) (i, height[i]) n .Find two lines that together with the x-axis form a container, such that the container contains the most water. x .Return the maximum amount of water a container can store. . n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). We will calculate areas for all pair of bars and return maximum value. n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Enhance the article with your expertise. There will exist no other combination of vertical lines in which water can be stored more than forty-nine units (7*7). Find two lines, which together with x-axis forms a container, such that the container contains the most water. Once the two pointers meet, we know that we must have exhausted all possible containers and we should return our answer (ans).

Hess Elementary School, Rolling Hills Local School District Staff Directory Meadowbrook, Is Telling Someone To Chill Rude, Articles V