Graph-1-Done

[candida17]

No description provided.

[super30admin]

• Problem1.java: The solution is excellent. One minor optimization could be to use a single array for both indegree and outdegree, as the reference solution does, to save a bit of space.
• Problem2.java: The solution is well-implemented. Consider adding a brief explanation of why the BFS approach was chosen over DFS, as it might help in understanding the trade-offs. Also, ensure that the maze is not modified in place if it needs to be reused elsewhere, though this is likely fine for the problem constraints.

Overall, both solutions are well-written and efficient. The student demonstrates a good understanding of the problems and provides clear, working code.