4. DFS on Adjacency Matrix | Leetcode No 1971 - Find if Path Exists in Graph-C++,JAVA Code Explained 

In this video a little thing, in java by default the values of the Boolean/integer array are false/zero respectively , so we don't need to do it externally.

Very good explanation. I would recommend others to watch this playlist.

Need a playlist for DP the toughest in DSA

Understood. Very good explanation ma'am. Thank You

Great work

Thanks for in depth explanation

mam you are doing a beautiful job , i am currently at third video all the best.

Today's class was a little challenging than the previous ones but understood well keerti mam. Kudos to your effort mam. Thank you.👍🏻😀

Solid content

Hi Keerti Tqsm for ur good job one suggestion is could u pls show the recursive tree for few inpurs for good understanding

Thnx for putting so much effort . Can we have similar course on dp and other algos on either youtube or some cost efficient course . day 4 : check

Please put solution videos of all thr 160 graph questions on Leetcode

Mam aise hi Tree ka bhi playlist leke aaiyega

mst ha mam yr

Try to solve 2 problems minimum daily akka

Mam... the explanation is bit fast... feels like i am waching it in 1.5x ..please explain slowly...

your 98% people is now Hindi