3552. Grid Teleportation Traversal

LeetCodeArrayHash TableBreadth-First SearchMatrixOpen on judge ↗

You are given a 2D character grid matrix of size m x n, represented as an array of strings, where matrix[i][j] represents the cell at the intersection of the ith row and jth column. Each cell is one of the following: - '.' representing an empty cell. - '#' representing an obstacle. - An uppercase letter ('A'-'Z') representing a teleportation portal. You start at the top-left cell (0, 0), and y

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI