752. Open the Lock | BFS | Graph | Time Complexity | Why not DP?

[@shivchauhan795]

Hey don't get demotivated. You really explain all the questions in very good way. From last 2 month i'm daily watching your videos whenever I get doubt while solving daily leetcode question. Your dedication of how you record the videos early morning with such a great explanation is unbelievable. Keep up the good work. You will surely get reach with this consistency. Looking forward to meet you some day, it will be nice.

[@sarthakrana5658]

"Lavel sbke niklenge" .... Good use of meme 😂

[@codingkart245]

BROO!!! YOU JUST KILLED IT!!!! Keep making videos like this!!

[@Jazzimus]

bhaiya aap goated ho never forget

[@tusharsinghal1333]

You are putting so much effort in these videos. keep up the good work bro.

[@bhavaygoel]

ive not seen any channel put that much effort everyday. keep up the work bro!

[@tusharsinghal1333]

The internal while loop for each level seemed a little confusing to me, so i did it a little differently by making a queue of pair which keeps a pair of {currentString, level} and that did the job in a single while loop, similar to traditional BFS.

[@kiranjeetkaur4955]

Awesome.. idk why you get very less likes.. you deserve a lot more

[@shreejeshjballal767]

Great Explanation ✨.Thank you!

[@yashyenurkar9383]

great solution and explanation🙌

[@wilhelmrudolphfittig3577]

good keep it up !

[@niteshkhanna690]

Your code is very clean and clear

[@vanshikaahuja766]

ngl, You are my inspiration.

[@sameera2426]

great explanation

[@ShubhamMIshra-hv5nz]

I love your videos Aryan, i watch it on a daily basis.

[@shubham_paliwal]

Thanks a ton for making us understand in the best possible way! 💯...It takes a lot of efforts, guts, and a very deep understanding to do so 🔥.

[@akasakasad]

keep up the good work my man

[@harshal8781]

❣💞❣

[@vickyroy3595]

100k soon!!!!❤

[@rahulsihara8946]

Amazing explanation as always

[@asthajain2511]

great content 😌

[@Noob_Coder1234]

TIME AND SPACE COMPLEXITY PART WAS LIT!!

[@k.satish3663]

Nice explanation.

[@Vishal-qb3wz]

Great Content. Keep Doing!!!!

[@mathy642]

nice explanation!!

[@nagasrisaichaitanyakolluri8173]

Thanks bro

[@HaiAnhDuong-ew2fl]

nice bro

[@bharatmehta30]

Level sabke niklenge.

[@kuldeepsaini460]

Great Explanation please open a Hindi Channel also

[@TON-108]

Lyaval sabke nikalenge 😌😌😌

[@shreeshdivyamsinha126]

Yrr aap itna mehnat kar rahe ho. App j curve ke starting pe ho bas kuch din aur, aap dekhna 100k bahut jald hojayga. 🙂

[@ujjwalrockriser]

Sorry, bas BFS dekha aur video nahi dekha, thank you for the hint.

[@jiganeshpatil1472]

Leavaaal sabke niklenge

[@nerdInsaan]

Java code for reference : class Solution { public char turnRight(char c){ return c == '9' ? '0' : (char) ( c + 1); } public char turnLeft(char c){ return c == '0' ? '9' :(char) ( c - 1); } public List nextOptions(String s){ List options = new ArrayList(); for(int i = 0 ; i < 4 ; i++ ){ char [] copy = s.toCharArray(); copy[i] = turnRight(s.charAt(i)); options.add(new String(copy)); copy[i] = turnLeft(s.charAt(i)); options.add(new String(copy)); } return options; } public int openLock(String[] deadends, String target) { Deque q = new LinkedList(); Set visited = new HashSet(); q.offer("0000"); visited.add("0000"); Set deadend = new HashSet(Arrays.asList(deadends)); int level = 0; while(!q.isEmpty()){ int size = q.size(); while(size-- > 0){ String curr = q.poll(); if(curr.equals(target)) return level; if(deadend.contains(curr)) continue; for(String option : nextOptions(curr)){ if(!visited.contains(option) && !deadend.contains(curr) ){ q.offer(option); visited.add(option); } } } level++; } return -1; } }

[@wellsonny7987]

CFBR

[@shashanksahu9230]

At first I thought It was a recursion problem, but I was getting wrong answer with it. I still don't understand how you come up with graph instead of recursion

[@Helop538]

Again