Google tps round(L3)

i have my round 1 for swe2(L3) on 11th march. the interviewer is very nice. he gave me the graph question which can be solved using multi source
bfs algorithm in o(n).

so . i have given the approch for solving it in o(n^2) as i don't remember the multi source bfs. he seems satisfied with the o(n^2) approch but he told me to optimize it. he gives some hint to me. and i finally figure out that multi source bfs will work here.

I can't complete the code as it take 40 min to come to the most optimal approch and in figuring out the code and only 5 min left to solve the question... though i feel very bad at the time of interview that i couldn't complete it. but interviewer at the end told me it's feel great to interview you.

Can anyone tell will i get H or LH or NH? I don't think i get the SH because i don't complete it.

waiting for the result now...