Pacific Atlantic Water Flow - Leetcode 417 - Graphs (Python)

  Рет қаралды 4,824

Greg Hogg

Greg Hogg

Күн бұрын

Пікірлер: 18
@GregHogg
@GregHogg 4 ай бұрын
Master Data Structures & Algorithms For FREE at AlgoMap.io!
@anuradhasuresh3451
@anuradhasuresh3451 15 күн бұрын
Hi Greg, graph problems scared me at first, but after watching your videos and how wonderfully you break everything down into simple code, I'm getting more confident with them! Thanks a lot.
@vivek2319
@vivek2319 Ай бұрын
I compared this solution to other channels' solution and I feel yours is the most easiest to read and understand. Thanks 😇
@vikramkhurana1331
@vikramkhurana1331 Ай бұрын
Broke down a complex problem beautifully
@codinggigs8367
@codinggigs8367 Ай бұрын
Here is my solution that I come up with after hearing your thought process. It might be simple to understand : from collections import deque class Solution: def pacificAtlantic(self, heights: List[List[int]]) -> List[List[int]]: rows , cols = len(heights), len(heights[0]) visited_p = [[0 for _ in range(cols)] for _ in range(rows)] visited_a = [[0 for _ in range(cols)] for _ in range(rows)] row_col_list = [(1,0),(-1,0),(0,1),(0, -1)] set_p = set() set_a = set() que_p = deque() que_a = deque() for r in range(rows): for c in range(cols): if r == 0 or c == 0: set_p.add((r,c)) que_p.append((r, c, heights[r][c])) visited_p[r][c] = -1 if r == rows - 1 or c == cols -1: set_a.add((r,c)) que_a.append((r, c, heights[r][c])) visited_a[r][c] = -1 while que_p: rqp, cqp, htqp = que_p.popleft() for rl, cl in row_col_list: rn = rqp + rl cn = cqp + cl if 0
@_PulpoPaul
@_PulpoPaul 2 ай бұрын
This make me feel like a stupid
@hariharasudharsan3170
@hariharasudharsan3170 6 ай бұрын
Great work.... Can you make videos for DSA concepts too!
@GregHogg
@GregHogg 6 ай бұрын
Thanks! Yeah after this leetcode playlist is done I'll be doing a playlist on the generic theory
@hariharasudharsan3170
@hariharasudharsan3170 6 ай бұрын
@@GregHogg fast as you can....🤝🏻
@bigk9000
@bigk9000 Ай бұрын
I still struggle on how you were able to come up with the solutions to most of these! @_@
@dishandshah660
@dishandshah660 5 ай бұрын
thanks
@user-jm6gp2qc8x
@user-jm6gp2qc8x 2 ай бұрын
lol this seems to be the hardest solution in your series (and i have finished even the dp ones in yours)
@vuanhkhoa9715
@vuanhkhoa9715 6 ай бұрын
Hi Greg ! Can I ask for your discord community server ? I saw it somewhere but now Im unable to find it
@GregHogg
@GregHogg 6 ай бұрын
Right here! discord.com/invite/g4ZnYzTB
@yygysgtyfugunvt
@yygysgtyfugunvt 3 ай бұрын
Your discord server link is invalid
@GarouNguyen
@GarouNguyen 4 ай бұрын
Bro what is r, c = i+i_o, j+j_o, can you explain bro i don't understand 😢
@vikramkhurana1331
@vikramkhurana1331 Ай бұрын
i_o and j_o are offsets.. so for [0,1], r ,c = i+0,j+1, so j is incremented, so it is square right to i,j. We go through the list of all 4 neighboring squares to check if water can flow from them to us
Clone Graph - Leetcode 133 - Graphs (Python)
13:38
Greg Hogg
Рет қаралды 3,8 М.
Pacific Atlantic Water Flow - Leetcode 417 - Python
16:28
NeetCode
Рет қаралды 191 М.
Муж внезапно вернулся домой @Oscar_elteacher
00:43
История одного вокалиста
Рет қаралды 6 МЛН
Миллионер | 3 - серия
36:09
Million Show
Рет қаралды 2 МЛН
Rotting Oranges - Leetcode 994 - Graphs (Python)
16:09
Greg Hogg
Рет қаралды 3,4 М.
Pacific Atlantic Water Flow | Live Coding with Explanation | Leetcode - 417
13:32
The Truth About Learning Python in 2024
9:38
Internet Made Coder
Рет қаралды 215 М.
#Leetcode #417. Pacific Atlantic Water Flow
33:26
Code with Alisha
Рет қаралды 11 М.
Coin Change - Leetcode 322 - Dynamic Programming (Python)
15:27
Koko Eating Bananas - Leetcode 875 - Binary Search (Python)
13:34
Муж внезапно вернулся домой @Oscar_elteacher
00:43
История одного вокалиста
Рет қаралды 6 МЛН