Problem
Implement breadth-first search (BFS) for a graph or tree.
Practicing as: Embedded Engineer interview at NuroHi, I'll play your Nuro interviewer for the Embedded Engineer role. Candidates describe these interviews as mixed and moderately difficult, so expect me to be professional and fair. Take your time with the question above and answer like we're in the room.
You are practicing as a guest. Sign up free to get your answer graded with AI feedback. Your draft stays right here.
