Get Maze Path With Jumps |

Published: 01 January 1970
on channel: Coding chora

I have solved & explained - Get Maze Paths with Jumps using recursion in #java .

----------------------------------------------------------------------------------------------------
----------------------------------------------------------------------------------------------------
Question
1. You are given a number n and a number m representing number of rows and columns in a maze.
2. You are standing in the top-left corner and have to reach the bottom-right corner.
3. In a single move you are allowed to jump 1 or more steps horizontally (as h1, h2, .. ), or 1 or more steps vertically (as v1, v2, ..) or 1 or more steps diagonally (as d1, d2, ..).

Input
2 ,2

Output
[h1v1, v1h1, d1]

*this number 1 in h1v1 represents the step you have taken, i.e - x of the for loop

----------------------------------------------------------------------------------------------------
----------------------------------------------------------------------------------------------------

#codingchora #java

Github
https://github.com/dasr4341/problemSo...

Ayh yehh bathee kartehh hain :
/ codingchora

Timecodes
0:00 - Question
7:46 - Question
7:47 - Solution

On this page of the site you can watch the video online Get Maze Path With Jumps | with a duration of hours minute second in good quality, which was uploaded by the user Coding chora 01 January 1970, share the link with friends and acquaintances, this video has already been watched 39 times on youtube and it was liked by 0 viewers. Enjoy your viewing!