79. Word Search | Recursion & Backtracking | 489. Robot Room Cleaner | 2 Approaches

In this video, I'll talk about how to solve Leetcode 79. Word Search | Recursion & Backtracking | 489. Robot Room Cleaner
A quick thing, i said wrong was, the matrix will not come to its correct state if the answer returns true. i.e. the line which matches word will entirely turn to '*' and thus using vis would be a good practice. [Vis outside loop will easily work because on every un-successful dfs call before returning false, i'll make vis as entirely false, thus on last successful run vis will be true]
Let's Connect:
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / ez.pz.dsa
📱Telegram : t.me/aryan_mit...
🤖 Github: github.com/ary...
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Timelines✨
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

[@ARYANMITTAL]

A quick thing, i said wrong was, the matrix will not come to its correct state if the answer returns true. i.e. the line which matches word will entirely turn to '*' and thus using vis would be a good practice. [Vis outside loop will easily work because on every un-successful dfs call before returning false, i'll make vis as entirely false, thus on last successful run vis will be true] * * * E S F * S A D * E Latest Video - kzbin.info/www/bejne/qGKQl2yQfpt7sJI

[@kgjr.6224]

bro I am watching your videos for a year now and I love the way you teach. are you even reading your comments section. ??

[@gouravshaw6939]

nice Explanation thanks!!

[@jatinsangwan4342]

How did you decide whether DFS will be used or BFS

[@Nerddog12344]

Can you share the link of questions asked in oracle once again .The link you provided is not accessible

[@vypw3p634]

can this be done using bfs

[@VarunSharma-xd8xd]

undrerrated channel