Please make a graph and Trees playlist. There is no one shop learning whatsoever for this topic anywhere in internet. I am struggling learn the techniques!! Hatsoff to you teaching abilities both! Thanks a ton for making our lives better!
@gauravbanerjee28982 ай бұрын
you can refer to codestorywithMIK's channel for graphs and trees and belive me you won't regret.
@akhilahegde4241Ай бұрын
I really liked the explanation here. Sir, I want to follow you for more videos/topic discussions. Please share your teachings.
@SOUVIK-po9jt2 ай бұрын
Requesting for tree and graph playlists whenever possible in the near future after backtracking is over. All your playlists are gold❤❤
@SOUVIK-po9jt2 ай бұрын
@@nikhil_squats Yeah I am watching from him and they are also great. I might just go through Aditya Sir's playlist for any pattern matching, if ur comes up with it
@gauravbanerjee28982 ай бұрын
you can refer to codestorywithMIK's channel for graphs and trees and belive me you won't regret.
@ksaravanan72972 ай бұрын
Just yesterday I was struggling with this problem and I see this has been uploaded. Thank you so much!
@nakul23272 ай бұрын
@TheAdityaVerma Pls pls make a playlist on trees....we are struggling to solve tree problems....the way you teach concepts is very unique and easy to understand. I request u to pls make a playlist on trees asap recorded by you only...
@aniket97542 ай бұрын
Bro , I don't know whether I will get a job or not in future but you video helped , love you bro❤
@ashutoshranjan46442 ай бұрын
Explaination clear thi. Thanks
@shubhamzanzad62182 ай бұрын
Complete your dynamic programming series
@diyashabose5319Ай бұрын
@AdityaVerma Missing your way of explanation and building concept. Look forward to seeing you back soon.
@vipulkoti47482 ай бұрын
We can do below DP and then Traceback to form a string. def wordBreak(self, s: str, wordDict: List[str]) -> bool: dp = [True] + [False] * len(s) for i in range(1, len(s) + 1): for w in wordDict: if s[i - len(w) : i] == w and dp[i - len(w)]: dp[i] = True break return dp[-1]
@priya112 ай бұрын
Hi, Could you please also make a playlist on trees?
@Truptimishra-v9u2 ай бұрын
Plz make playlist of string and linked list
@ammar71092 ай бұрын
Sir Dp ki playlist Puri kr do
@theprince8522 ай бұрын
Bhai trees aur graph krrwado....DP aur recursion nai hota tha almost coding chor di thi but u made it easier for me... Ab bs Graph aur treesss🥲
@ClipsArena042 ай бұрын
sir please start graph
@sachinbelle11522 ай бұрын
After Era 😂😂😂
@atulkumarjain69112 ай бұрын
Koi First , second comment nei likhega
@hritikapal6832 ай бұрын
Aditya bhaiya?
@karanraoexperiment2 ай бұрын
Anmol naam hai bhai ka, I think wo Aditya bhaiya ke friend hai.
@ParulShrama-j8s2 ай бұрын
Not good. The explanation is not up to the mark. @Aditya verma , bhaiya please take out some time. We want you back