โ† KLA questions

Pathfinding with wall breaking

Filed under KLA

The question

Given a 2D matrix with walls, find if a path exists from start to destination. You can break a wall if you visit it twice, turning it into a path.

No write-up yet. Related questions below have one.

Related KLA questions

Collected from public candidate posts and coding forums. Updated Nov 2026.