- This is an interesting maze to solve. You have to traverse from top-left to bottom-right. For simplicity sake I am using same number of rows and columns and moving in right, left and bottom direction only (need to implement upward). 1's meaning path is open 0's meaning path is blocked
Example: 4*4 array
Input: [[1, 0, 1, 0],
[1, 1, 1, 0],
[0, 1, 0, 1],
[0, 1, 1, 1]]
Output: true
Todo:
- I will be implementing logic to move upward (Y+1) in Y-axis.
- This maze can be of any number of rows and columns
- Dockerize this app so that it can be run independently without worrying about any dependencies
- install node JS
- clone the repo or download the code
- download dependencies via yarn or npm package manager (it is using jest for unit testing) CLI - yarn install
- CLI command to run unit tests : yarn run jest
- Covered positive scenarios
- Covered negative scenarios (try to break it in several ways :) by entering different number of rows and columns, cause infinite loop, randowm arrays, excercise all 4 paths)
- Todo implementation scenarios should not crash the program. It should handle the exceptions gracefully for outofboundexceptuons and stack overflow exceptions
