00:02 Problem requires step-by-step approach 02:20 Finding the shortest path to collect all keys 04:43 Path to obtaining keys to unlock cells. 07:03 Using binary representation to store key configurations efficiently 09:15 Using numbers to represent key configurations simplifies identification 11:37 Algorithm for finding shortest path to get all keys. 13:49 Finding the shortest path to get all keys with specific conditions. 16:03 Traversal and key management in pathfinding algorithm. 18:00 Iterating over elements in the queue and updating steps
was desperately searching for a good explanation, my search ends here!! thank you
Glad it was helpful!
Thanks a lot for the detailed explanation.
You are welcome!
00:02 Problem requires step-by-step approach
02:20 Finding the shortest path to collect all keys
04:43 Path to obtaining keys to unlock cells.
07:03 Using binary representation to store key configurations efficiently
09:15 Using numbers to represent key configurations simplifies identification
11:37 Algorithm for finding shortest path to get all keys.
13:49 Finding the shortest path to get all keys with specific conditions.
16:03 Traversal and key management in pathfinding algorithm.
18:00 Iterating over elements in the queue and updating steps
Your explanation is good bro 😊
Thank you ❤️.
can we use dfs in this ?
Yes dfs with backtracking can be used to solve this.
Can you share your linkedin profile bro?
www.linkedin.com/in/jeevan-kumar-4568a1163/
Bro are you from Karnataka?
Yes 😊
Nice in which clg u did ur engineering bro?
I am also from Bangalore Rnsit clg 3rd year student bro
you are the best
Thank you!
Why your date is 9 jan
Haha. Good Observation. I am a time traveller.