Find all critical connections in a network

by galaxy_alchemy208
GitHub
senior
coding
hard
pending
6
211

I began by clarifying the problem statement regarding critical connections in a network, ensuring I understood the inputs and expected outputs. The interviewer was pleased with my approach to break down the problem into a graph representation.

I outlined my intent to use Depth-First Search (DFS) to identify bridges in the graph, effectively explaining the algorithm and its time complexity. However, I struggled with the implementation details and lost track of some edge cases.

The interviewer provided guiding questions to help refocus, but I ultimately finished without fully solving the problem. Despite my failure to complete it, I communicated my thought process clearly, which seemed to resonate positively with the interviewer.


Markdown supported