Container With Most Water - Leetcode 11 - 2 Pointers (Python)

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@JoeTan-nq4fq]

Being OCD, to reduce the computational time, we can do the height check and compute the area in the same conditional (instead of adding min(height[l], height[r] which add n runtime). if height[left] < height[right]: area = height[left] * (right - left) left += 1 else: area = height[right] * (right - left) right -= 1 maxx = max(maxx, area)

[@anna-plink]

No way this was more difficult than 3Sum 🤔

[@user-jm6gp2qc8x]

he sets you up for a harder problem just right after this one, its a trap XD

[@rodneyshen7397]

I was legit thinking the exact same thing haha.

[@ruixue6955]

1:39 2:22 how to move cursor 2:46 which bar to keep

[@sreekanthpogula2714]

Great greg 👍, I just solved this yesterday

[@GregHogg]

That's great!

[@coopernik]

very well explained

[@dibyendusaha1295]

golang solution: import ( "math" ) func maxArea(height []int) int { left := 0 right := len(height)-1 maxArea:=0 for left

[@pauldaly1yt]

How long would one typically get to prepare a solution to a problem like this in an interview?

[@brianwkinyua]

I hear around 45 minutes.

[@rijulranjan8514]

Nowadays not 45 mins. This is on the easier side interviewers would probably expect like 15-20 mins

[@christianjt7018]

Awesome

[@thequang9234]

nice