Open the Lock | Leetcode 752 | Live coding session | BFS

[@ananyaashrivastava2783]

Great explanation ! Can someone please explain the time complexity here?Thankyou.

[@CodeWithSunchitDudeja]

I have mentioned it in one of the comments below

[@dianayao1677]

Love this explanation ! can you please also explain the time complexity and space complexity? Appreciate it！

[@Sailgodgreenearth]

what a beautiful explanation. Loved it

[@amazinglife5400]

Can't it be done by DFS approach also effectively? As I tried it like this in every traversal taking 2 different variations for individual digit of a lock and then passing on to next traversal making 8 new recursive possibilities for a single lock. Would it blew off time complexity?

[@LegitGamer2345]

its overkill to use dfs here

[@pr4nshul]

hey i had a doubt in line 20 , why are we checking whether the front of the queue is visited , as we are only pushing those states which are not visited in line 24 , video time 10:17

[@Versole]

Nice explanation

[@dhananjayseetha4251]

You have messed up the example(which is also the first test case in challenge) where our target is 0202, what you are achieving is 2202 but we have to achieve 0202.See the video around 8:30

[@CodeWithSunchitDudeja]

Thanks man for telling, I was simultaneously doing something my bad

[@dhananjayseetha4251]

​@@CodeWithSunchitDudeja Love you brother ,No problem you know amazing thing is viewers enhance the quality of instructor by poking out these things so that mistakes are not repeated.I hope you will pay attention next time 😁.Except this issue everything is perfect , keep up the good work bro 💥💥.

[@mayanktiwari3103]

finally undertood this problem

[@kaushikkampli6911]

Is there a DFS or recursive counterpart to this solution? Great video though!

[@LegitGamer2345]

bro in questions like these its overkill to use dfs the code gets really complicated

[@sanchitmehra1079]

awesome explanation :)

[@CodeWithSunchitDudeja]

Glad you liked it!

[@vinny4161]

great bro thanks!!

[@algorithmo134]

Why does your code doesnt have modulus? I have seen many code that contain % operation in leetcode solution.

[@CodeWithSunchitDudeja]

Why do you need it?

[@algorithmo134]

@@CodeWithSunchitDudeja reduces time complexity

[@heyrmi]

Thank you.

[@CodeWithSunchitDudeja]

Thnx

[@tathagatnegi5923]

Thanks

[@CodeWithSunchitDudeja]

Thnx

[@LegitGamer2345]

clean code gg

[@CodeWithSunchitDudeja]

Thnx

[@rogerop6721]

what will be the time complexity ?

[@CodeWithSunchitDudeja]

🧐, my hunch is somewhere around O(10^4)/2, as we are going from 0000 upto 9999. Dividing it by 2 since we always have 2 directions to go in. So Max you need to go up till O(5000).

[@parikabajaj7756]

✌️, simple

[@CodeWithSunchitDudeja]

thnx