Your condition also says that 1 is an articulation point because L(4) >= d(1). Here 1 is parent of 4. But this should not be. Am I to be guided?
@uddalokbasak25013 сағат бұрын
god
@chaitalidas61616 сағат бұрын
Thanku very much sir. Sir your video very much helpful.sir do u conduct offline class.
@malikk3717 сағат бұрын
You are the best
@garyyourdad33797 сағат бұрын
Αλγόριθμοι, Πληροφορική ΟΠΑ, Speedrun
@ibaststestpreparation875610 сағат бұрын
Sir dijkstra's algorithm is example of greedy approach or dynamic?? Because in dynamics we visit all options and in greedy we follow optimal at each node.. We don't check all nodes?? Kindly clear my confusion
@Murugan.B11 сағат бұрын
I have semester exam Tommarow. Thank u sir
@WHABKONAKALLASAISHRIYA11 сағат бұрын
best part is that theres no ads !!
@uvi0niedrig12 сағат бұрын
bu adam bir harika dostum
@sreeja041019 сағат бұрын
Sir you are a god. My exam is tmrw and thanks to you I am very confident that I will ace it! Thank you soo much sir!!🙏🙏
@pixldesigns558920 сағат бұрын
Great teacher ❤
@Sheriff_K21 сағат бұрын
I understood most of what he was saying, just not the specifics of the things he was referencing; so, in a way, my understanding itself was.. *nondeterministic.* 🤣
@shadmanuddinКүн бұрын
pie votte
@AliKhan78762Күн бұрын
I really appreciate your explanation sir ❤
@iamparvin07Күн бұрын
god
@prakharsinha7Күн бұрын
6:40 Sir it is 1.67 12:44 It's 55.33
@agnikmondal5485Күн бұрын
Makaut students this is coming tomorrow
@arpitgupta890Күн бұрын
Is it not possible to solve this problem using Djikstra's algorithm for finding the shortest path between 2 nodes.
@nidhirohaniКүн бұрын
Apke video ko samjhne ke liy phle hmko koi or video dekh ke ana hota h
@cmikhail7289Күн бұрын
thank you sir
@tusharbairagi9552Күн бұрын
Very well explained thankyou so much ❤
@qamarhussain4004Күн бұрын
@isurajmahtoКүн бұрын
Makaut attendence
@navneetsingh7209Күн бұрын
Tu Kha thik padhata hai
@tuneermukherjee5495Күн бұрын
Wrong calculation
@sibonilemthunzi62972 күн бұрын
wow you are just so good. this is the best video about hashing I have watched.
@prathameshjadhav29422 күн бұрын
These 30 my minutes are mind blowing you will never regret after watching it all
@redtree7322 күн бұрын
Amazing video
@alekyajaini37492 күн бұрын
The very best way of explaining the concepts sir.. Thankyou! Please do more such videos
@Atlal-hk3rq2 күн бұрын
Great Explanation thank you! Please some more videos on reducibility
@minecraftplayer89922 күн бұрын
just like messi, made it look easy!
@KiyoGam12 күн бұрын
5/3 = 1.66..... rest is top tier sir.
@Reyna-yj6vo2 күн бұрын
God level explanation
@ProgrammingKT2 күн бұрын
00:31 tree != graph
@darshanyadav77272 күн бұрын
after struggling through lot of documents, this video gave me complete and satisfying answer.😊
@saisurya17232 күн бұрын
Me, who Today having DAA exam😂
@shambhavirani872 күн бұрын
Same dude 😂
@joonwantsdat2 күн бұрын
this guy is legend... i now understand how KMP works. Thank you so much.
@ananthraj93863 күн бұрын
Epic
@GoodMorning-bv6rf3 күн бұрын
Can anyone explain from 27:45 How he created the tree
@Atlal-hk3rq3 күн бұрын
Great explanation!!!! Thank you a lot
@kubasliwinski27713 күн бұрын
pivot, or /ˈpɪvət/, pi·vuht
@117bpiyushsonisoni93 күн бұрын
Does the dsa is for c++ or other lang?
@artizanal603 күн бұрын
7:42 starts here
@haniakrami11363 күн бұрын
Amazing🎉
@shivanshplays92183 күн бұрын
watching this for me endsem in 2024...evergreen leher sir <3
@haniakrami11363 күн бұрын
You are perfectt❤❤
@BlenBete3 күн бұрын
woo this is sooooooooooooooo godddddddddddddddddddddd