Firstly, I introduced two projects on my resume. There were no very detailed questions about the projects.

Then, I was asked about one coding problem with two follow-ups.

For the coding problems, the idea is more important than the code. For the last follow-up, I only partially finished the code.

Given an undirected graph, and a start node and end node, print all paths from the start node. This includes paths that do not end at the specified end node.

If cycles exist in the graph, note which paths from the start node contain these cycles.

Design an algorithm to delete paths that do not end at the specified end node or paths that contain cycles.