Skip to main content

Number of paths Recursion Basic Problem

Number of paths Recursion Basic Problem-

Problem Statement-

The problem is to count all the possible paths from top left to bottom right of a MxN matrix with the constraints that from each cell you can either move to right or down.

Input:
The first line of input contains an integer T, denoting the number of test cases. The first line of each test case is M and N, M is number of rows and N is number of columns.

Output:
For each test case, print the number of paths.

Constraints:
1 ≤ T ≤ 30
1 ≤ M,N ≤ 10

Example:
Input
2
3 3
2 8

Output
6
8

Explanation:
Testcase 1:
 Let the given input 3*3 matrix is filled as such:
A B C
D E F
G H I

The possible paths which exists to reach 'I' from 'A' following above conditions are as follows:
ABCFI, ABEHI, ADGHI, ADEFI, ADEHI, ABEFI.


This is Strongly recommended that You should try This question to your own before jumping to direct solution

Try this question Yourself Practice here-gfg


Number of paths Rat in a maze Recursion Basic Problem
Rat in A mace



Now My Solution-


We can solve this question  recusively 

There can be 2 type of problems here one we have to print path(needed 2d array) and one we have to tell number of total path.


In this question I will focus only number of total path If you want print the Number of paths also 

i will write solution for that too comment below this post for that printing path .


now Lets jump to Solution 



My Approach -

let's think about base condition 

if we have only one element then we have only one path (return 1) and if we go out of m,n then we don't have any solution so we will return 0 in that case.

 if(i>=m||j>=n){

        return 0;

    }

    if(i==m-1&&j==n-1){

        return 1;

    }

See recustion is  a topic where you have to think about sub problem what i am thinking now  if i am standing at a generic position lets say at index i,j  i have 2 choices form my poison either i can go to right j+1th poison where j  denoting column index or i can go down at i+1th row.

So here i got my induction step -

return solution(i+1,j,m,n)+solution(i,j+1,m,n);


according to these concept i can write my code . Here is my solution -












Comments

Popular posts from this blog

codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

 Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

 Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi

Playlist CSES Problems set solution | searching ans sorting with code and explanation

 Playlist CSES Problems set solution- Playlist problem statement- Time limit:  1.00 s   Memory limit:  512 MB You are given a playlist of a radio station since its establishment. The playlist has a total of  n n  songs. What is the longest sequence of successive songs where each song is unique? Input The first input line contains an integer  n n : the number of songs. The next line has  n n  integers  k 1 , k 2 , … , k n k 1 , k 2 , … , k n : the id number of each song. Output Print the length of the longest sequence of unique songs. Constraints 1 ≤ n ≤ 2 ⋅ 10 5 1 ≤ n ≤ 2 ⋅ 10 5 1 ≤ k i ≤ 10 9 1 ≤ k i ≤ 10 9 Example Input: 8 1 2 1 3 2 7 4 2 Output:5 Playlist CSE S Problems set solution- Step -1 store value in hashmap so that we can check that song played before or not. step -2 make two-pointer i and j if v[i] has occurred earlier remove all element till v[i] and update ans.new length will be (i-j). Step 3- if v[i]  not occurred simply update ans by one.