Rat in a Maze Problem - I | Recursion | GFG POTD | C++ | Java | Code Kar Lo

Consider a rat placed at (0, 0) in a square matrix mat of order n* n. It has to reach the destination at (n - 1, n - 1). Find all possible paths that the rat can take to reach from source to destination. The directions in which the rat can move are 'U'(up), 'D'(down), 'L' (left), 'R' (right). Value 0 at a cell in the matrix represents that it is blocked and rat cannot move to it while value 1 at a cell in the matrix represents that rat can be travel through it.
Note: In a path, no cell can be visited more than one time. If the source cell is 0, the rat cannot move to any other cell. In case of no path, return an empty list. The driver will output "-1" automatically.

0:00 Introduction
0:11 Problem Statement
1:41 Explanation
9:15 C++ Code
12:42 Java Code

My DSA Journey:- https://youtu.be/quZBBv12mCQ

How to Earn By GFG Articles:- https://youtu.be/XjvEgkd49Gk

Infosys Coding Questions:- https://youtube.com/playlist?list=PLq3GlRZI14HuZlfpLmVY915bolizB8O2-

Pattern Playlist: https://youtube.com/playlist?list=PLq3GlRZI14HsyjTmtjkBMlZCq8bZUUaP3&si=IHO0d35RRoAR0RYq

Problem Link:-https://www.geeksforgeeks.org/problems/rat-in-a-maze-problem/1

Code Link:-https://github.com/ShubhamKashyap138/Data-Structure/blob/main/Rat%20in%20a%20Maze%20Problem%20-%20I

Playlist Link:-https://youtube.com/playlist?list=PLq3GlRZI14Hui2ILGsfF1Uf2RnbNu9wT3&si=UGRWpHbM8Q2w4TTQ

Linkedin:- https://www.linkedin.com/in/shubham-kashyap-65a29a218/

Instagram:- https://instagram.com/im_shubham_kashyap?igshid=YmMyMTA2M2Y=

My GFG Profile:- https://auth.geeksforgeeks.org/user/shubhamrajput6156/practice

gfg potd
gfg potd today
gfg problem of the day
potd gfg
potd
potd today
gfg
#dsa #datastructures #algorithm #gfg #potd #coding #array #strings #tree #binarysearchtree #codekarlo #dynamicprogramming

Видео Rat in a Maze Problem - I | Recursion | GFG POTD | C++ | Java | Code Kar Lo канала CODE KAR LO