Available question text
Given a maze where each cell deterministically leads to a next cell (or movement continues until blocked), determine which starting cells eventually end up in the same final room. This requires computing the terminal sink or strongly connected component reached from each start using graph traversal/condensation and grouping starts that share the same endpoint.
Related questions
Continue with questions that share topics or the same question type.
- All Paths from Source Lead to Destination
Coding
- Count Ordered Four-Shop Road Paths That Visit One Shop of Each Type
Coding · Graphs
- Count Paths That Can Form a Palindrome in a Tree
Coding · Bit Manipulation · Depth-First Search · Hash Table
- Find Nearest Point That Has the Same X or Y Coordinate
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2077. Paths in Maze That Lead to Same Room
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source