Number of Enclaves - Leetcode 1020 - Python

🚀 neetcode.io/ - A better way to prepare for Coding Interviews
Solving leetcode 1020 - Number of Enclaves, today's daily leetcode problem on April 6th.
🥷 Discord: / discord
🐦 Twitter: / neetcode1
🐮 Support the channel: / neetcode
⭐ BLIND-75 PLAYLIST: • Two Sum - Leetcode 1 -...
💡 DYNAMIC PROGRAMMING PLAYLIST: • House Robber - Leetco...
Problem Link: leetcode.com/problems/number-...
0:00 - Read the problem
0:30 - Drawing Explanation
5:05 - Coding Explanation
leetcode 1020
#neetcode #leetcode #python

[@lessw2020]

Great video as usual. One comment, your code font size is tiny in this one vs usual ones.

[@zagenX]

Thanks! help to see how own solution can be improved :)

[@krateskim4169]

Thank you so much

[@moonlight-td8ed]

did my own, by watching your video on surrounded region(dfs) thank you

[@vishnuvardhan2687]

He is a king 👑👑👑 of coding

[@nikhilgoyal007]

line #12 -> res = 1 : would this not set res = 1 again for each dfs call (instead of adding to the initial 1)

[@isma5627]

what a beutiful solution!

[@arkhopravosarkar494]

Thankyou❤

[@mrmcpherson2722]

The notification I wanted to see

[@roach5429]

I dont get how this approach work for example 2. we have 4 lands ans 2 lands are on border so shouldn't this code return 2 instead of 0?

[@adityarawat3670]

In case 2 we have 4 total land and 4 border land so land-borderland will give zero

[@raginibhayana8305]

i am trying to solve this question using yesterdays technique in which i am calculating the number of land not touching the water. can you please help me with that?

[@arjunsharma9676]

Here is my solution - class Solution { public int numEnclaves(int[][] grid) { int count=0; int m= grid.length; int n=grid[0].length; for(int i=0;i

[@mohammedajmal4264]

we can use yesterday's technique but in yesterday's problem we were counting the no.of areas containing and today we have to count the cells in that particular area

[@acceleratorlevel645]

we surely can use yesterday's approach to solve this as well, just need to make a few changes in the dfs

[@raginibhayana8305]

Yup, I have solved it. I attached my solution link but I think links are blocked on comments.

[@mohammedajmal4264]

@@raginibhayana8305 nice 👌

[@akshadabhandari]

I am failing test cases like even if grid[r][c] == 1: its going in the if condition and returning 0

[@DeathSugar]

lol, every time I upload my solution in rust and see something over 1ms feels sus. And than I see python solutions run at almost 1s

[@shubhampathak7926]

Can you put the difficulty level of problems on thumbnail?

[@cc-to2jn]

Heres a solution following his usual pattern: count=0 visited=set() def bfs(i,j): nonlocal count if (i

[@vishnuvardhan2687]

Aliens 👽👽 attendance taken here

[@harshitpant07]

import sys sys.setrecursionlimit(1000000000) from typing import List class Solution: def numberOfEnclaves(self, grid: List[List[int]]) -> int: # code here def dfs(i, j): grid[i][j] = 0 for x, y in (i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1): if 0

[@VladiqLot]

Python are beautiful!