15. Surrounded Regions | LeetCode Question 130 | Intuition with Easy C++, JAVA Code | MUST DO Algos!

[@manishasingh-de8hi]

Your graph series is crystal clear.I am able to do questions by myself.

[@kushalbhargava8212]

Great

[@KeertiPurswani]

Hey, not free but can give you discount coupon code on all courses after you enroll for anyone !

[@srichetaruj2195]

Hi. This code does not work. You should also add board[r][c] !== 'X' in line 13

[@adityashankar5061]

mam graph video web series ia very good

[@dayashankarlakhotia4943]

class Solution { private void dfs(int r,int c,int m,int n,char[][]board){ board[r][c]='#'; int[][]dir={{-1,0},{1,0},{0,-1},{0,1}}; for(int k=0;k=0&&nr=0&&nc