Word Ladder | leetcode 127 | Hindi

[@mruduladdipalli5417]

I understood your solution in just 5 mins, from other videos it took me 2 days but was still stuck on understanding entire solution, thankyou for the video

[@atharvatripathi5496]

So the working complexity is O(Length of word * Number Of Words *26)?

[@samaysingh9978]

your explanation is awesome just one request please just make sure you run the code at the end

[@vaarigupta6332]

Bht hi bdiya pdaya sir apne. clear ho gya mujhe bs edge create krne m hi problem ari thi n mene code b likha tha bt mere code sare test case pass ni hue bt apki explanation se clarity a gyi thank you

[@codebix1096]

bdia bdia please share these videos with your friends :)

[@vaarigupta6332]

@@codebix1096 Sure I will

[@vaarigupta6332]

Sir also, plz tell me what is the time and space complexity of your solution.

[@pmsb_999]

Is the time and space complexity: O(M^2×N), where M is the length of each word and N is the total number of words in the input word list??

[@ChandraShekhar-by3cd]

Sir please upload more vidoes on leetcode, we were learning a lot form you. Please sir!!

[@shantanukumar4081]

Great Explanation !!!😊😊😊

[@yatri6329]

I think this is the best,super best explanation. Thankyou 👌👌👌👋

[@kratikasharma9824]

Thank You so much for helping out sir.

[@taneyasoni]

instead of converting east character from a-z. why don't we check in the original array if we have any string that differs by just one word?

[@dibyanshuratandwivedinitkk4322]

BEST EXPLAINATION

[@chetannain4867]

Super explanation. Thank you very much, sir. Please keep posting videos. Thumbs up!

[@codestorywithMIK]

Such a clear explanation

[@lofireverbz-wy7go]

bhaiya jii app yha!!! mujhe word ladder aapke graph playlist mai nhi mila isliye yha se smjh rha hu❣❣

[@anchalyadav6312]

Very clear explanation

[@samarthsoni6103]

hot se lot bhi to ban skta hai?

[@tilakrajrao2753]

great Explanation bhaiya! tysm for your efforts ! bhaiya it would be much better if you give time complexity along with the explanation.

[@Lifeofap]

O(n*n*24)

[@rosonerri-faithful]

Sir explanation top class tha but mera ek doubt hei..hum toh sirf 0 h return krrhe..ek id endword nahi h aur ekbar search krte tym word nahi hei...return length toh h nhi raha hei..sirf incrementation ho rahi h

[@AmanKumar-kz1rn]

kudos to your explanation

[@codebix1096]

Thank you. Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@ChandraShekhar-by3cd]

Which tool is he using for drawing????????????

[@Iamnoone56]

Thank u sir for such a wonderful explaination

[@mayanknautiyal4869]

I think this is a difficult question. This goes way over my head.

[@codebix1096]

yes Mayak it is little different question

[@lofireverbz-wy7go]

nicely explained

[@ChandraShekhar-by3cd]

Sir please upload more videos too.

[@30cr]

hot to lot then to log then cog, it will take only 4 steps

[@vasugaur1283]

sir time complexity and space complexity kya hogi iski????????/plz reply

[@gssnhimabindu8831]

plz post a video on bidirectional BFS approach also..

[@codebix1096]

Okay will add it in todo list :)

[@samarthsoni6103]

best channel bro... thank you

[@codebix1096]

Most welcome Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@BhaktiGyan-t1v]

thanks codebix

[@mansisharma4136]

please tell me the software name you used to explain problems?

[@sharuk3545]

such a wonderfull explanationn thnk u

[@codebix1096]

Appreciate it. Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@ash_engineering]

Please keep up this good work. please make more such videos on medium and hard problems

[@devangmukherjee]

in this when beginWord is "hit" and wordList is ["hot","dot","dog","lot","log","cog"], when we input 'hit' into the queue we also say Vmap('hit')=true; but 'hit' is not present in Vmap so then how does it work?

[@aakashgoswami2356]

class Solution { public: int ladderLength(string beginWord, string endWord, vector& wordList) { unordered_mapump; for(int i=0;i

[@amansamal8233]

ek dummm dhasuuuu

[@kamlendratripathi8963]

sir time complexity and space complexity ky hhhhhh bata do please

[@pushkardureja6863]

Awesome explanation👍👍👍

[@codebix1096]

Keep watching Thank you. Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@kaafivikrant]

algo toh bann jata h bass code mai hi errors h,, Thanks vrooo

[@codebix1096]

bhai essi baat pr share krna to bnta h

[@nightmare_9]

Impressive Explanation !!

[@cartube6219]

Code nhi chal raha leetcode pe sare testcase k liye plz check

[@himanshuchhikara4918]

Sir ur videos are helpful upload more videos on leetcode questions

[@codebix1096]

Facebook group join kra?

[@himanshuchhikara4918]

Link?

[@codestorywithMIK]

@@himanshuchhikara4918 it's in the video description

[@codebix1096]

join this facebook group to get updates of upcoming videos and discussions facebook.com/groups/258049468776636/about

[@aamirjamal6833]

Time complexity?

[@adityatyagi6436]

dot se lot pe q n gye ?

[@baaznotapro5479]

kb tak khatam ho jayega playllist??? because placement session 15 july se start ho jayega i guess

[@codebix1096]

Okay m 15 July sae phele try karunga sb imp topic cover krne ke

[@gautamsuthar4143]

Bhai job lagi?

[@babbarutkarsh7770]

🔥🔥🔥🔥🔥

[@codebix1096]

Thank you. Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@DK-ox7ze]

Mast bhai! But it would have been great if you had also explained the time complexity of the algorithm.

[@manishpundir5542]

Superb

[@codebix1096]

Thanks 🤗 Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@nknidhi321]

Awesome ❤️

[@simranarora2817]

Amazingggg

[@codebix1096]

Thanksssss

[@tarunstv796]

What's time complexity?⏲