Want to discuss the approach of the solution

#1

the complexity of the answer i am thinking is (N*M)^2
By putting 1 on every 0 in the array and then checking that how many neighbours are near it ( means checking the size og the pond after that 1 is marked)
Am i thinking correct or there is some efficiency ??

#2

@divyansh0003
The solution is based on finding connected components and works in o(n*m)
Think again

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.