The interviewer called me over the phone, they have done away with the Google meet link for this interview, I don't know why.

The interviewer asked me about a project I was proud of and asked me what kind of challenges I faced while implementing it, that took about 10 minutes.

Then we moved on to the coding questions:
The question was a variation of https://leetcode.com/problems/minimum-cost-to-reach-city-with-discounts/
First question was we have a graph and we have 2 nodes A and B and a Set of string which represents if a particular city is a toll city. The first question asked return true or false if we can go from A to B without traversing a toll city.

I solved it using BFS and checked for loop with a visited set and if we had a loop we ignore putting it's children on the queue.

The interviewer was convinced with this solution.

The second part of the question was if going to a toll city was allowed, find the minimum number of toll cities we need to traverse to get to B.

I was stuck and he hinted at using a heap. I quickly latched on to the idea of a min heap and we keep adding the children to the min heap and processing it like the previous question and we were almost at time. I think I screwed up the loop part where I said I'd only subtract 1 from the result if I saw a loop because only 1 edge will be causing the loop, he wasn't very convinced.

I'm guessing it will be a reject. Will update the status when I hear from the recruiter.

Update : I have cleared my phone screen and will be moving on to the virtual onsite!!