Help me out in this problem

#1
#2

Hey @shivammishra20121999 what issue you are getting in this?

#3

@mr.encoder i am getting runtime error ??

#4

Use unordered map instead of map

#5

@mr.encoder still the same error??

#6

In line 15 add return
What is your search function doing if it’s returning nothing?
Are you using BFS or DFS in this problem?

#7

@mr.encoder there is no need of search because target node is there
i am using bfs plus visited set to keep track of nodes n which are already visited

#8

@mr.encoder in line 90 it is giving error kindly check on your system then better you can understand it??

#9

I just wanted to know that what your search function is doing,
Moreover are you trying to build a graph and then running a bfs on it?

#10

@mr.encoder i used hashedmap to store parent of each node and run bfs to find node at required level as per given question??

#11

Lemme debug it and send you the correct code. Be patient till then.

#12

@mr.encoder okay bro

#13

Share your updated code of unordered map with me asap.

#14

@mr.encoder HO GAYA BRO ONE SIMPLE ERROR THANKS

#15

What was the error in your code?

#16

@mr.encoder when i was pushing the parent of current node then i didnot consider the case it may be null?

#17

Ohkayyy, I got it. Tum bhot mast kaam krta hai @shivammishra20121999 bhai.

#18

@mr.encoder ha :grinning: :grinning: :grinning: :grinning:

#19

Please don’t forget to mark your doubt as resolved.

#20

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.