This repository was archived by the owner on Oct 5, 2025. It is now read-only.

Description
Create a program that finds a path from the top-left corner to the bottom-right corner of a matrix.
Requirements:
✅ The matrix can contain 0s and 1s, where 0 = open path and 1 = blocked cell.
✅ User can input a custom matrix or use a predefined one.
✅ Program should find any valid path from (0,0) to (n-1,m-1) (if possible).
✅ Display the path (e.g., coordinates or visual path).