Search⌘ K
AI Features

Paths in Maze That Lead to Same Room

Explore how to identify and count cycles of length three in a maze modeled as a graph. Understand the problem constraints and apply graph traversal techniques to compute the confusion score of the maze. This lesson helps you develop skills to solve similar graph cycle detection problems efficiently using C++.

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 ...