Making A Large Island || Google Question || Code + Explanation

You are given an n x n binary matrix grid. You are allowed to change at most one 0 to be 1.
Return the size of the largest island in grid after applying this operation.
An island is a 4-directionally connected group of 1s.
Link to challenge : leetcode.com/explore/challeng...

[@theautumnleaves343]

nice approach. Thanks!!!

[@ritikgangwar-vb4sn]

Great explanation mam 😊

[@maharajak6578]

this is great graph question and clean explanation..

[@adityakeshari2295]

Absolute clear explanation

[@manikantasai6118]

Very nice explanation, Thank You.☺

[@navneetkushwaha1830]

thanks ma'am for great explanation
😍

[@anupamgoyal4601]

Awesome Explained Di, Thankyou so much

[@r.k.j4546]

can we do't do it by simply calling dfs on every zero occurence by changing it to 1 and for every call we store the no of ones and at finally return answer.

[@lakshay6043]

great explanation

[@ShivamKhantwal94]

Wow ❤️

[@reshmamaam1451]

👍👍💯

[@MilindGupta]

Waah consistency ek din main 3 videos 😂🤦🏼‍♂️

[@navneetkushwaha1830]

I spent one and half hours understanding and writing code :
class Solution:

def dfs(self,i,j,grid):
if 0