Search⌘ K
AI Features

Paths in Maze That Lead to Same Room

Explore how to determine the confusion score of a maze by identifying all unique cycles of length three among connected rooms. This lesson teaches you to apply graph theory and traversal techniques to solve problems involving cycle detection in undirected graphs with practical constraints.

Statement

A maze consists of nn rooms numbered from 1n1 - n, and some rooms are connected by corridors. You are given a 2D integer array, corridors, where corridors[i]=[room1,room2]corridors[i] = [room1, room2] indicates that there is a corridor connecting room1room1 and room2room2 ...