Solution: Paths in Maze That Lead to Same Room

Understand how to identify and count all cycles of length three in a maze modeled as a graph. Explore both naive DFS traversal and optimized adjacency list-based approaches to determine the maze's confusion score. Learn to implement efficient graph algorithms considering time and space complexity constraints.