Python Coding challenge - Day 521| What is the output of the following Python Code?

 

Code Explanation:

Function Definition

def count_paths(r, c):

Defines a function named count_paths that takes two parameters:

r: number of rows

c: number of columns

Base Case

if r == 1 or c == 1:

    return 1

If there's only 1 row or 1 column, there's only one path — either all the way right or all the way down.

This stops the recursion.

Recursive Case

return count_paths(r - 1, c) + count_paths(r, c - 1)

You try both:

Moving down (reducing row by 1)

Moving right (reducing column by 1)

The total number of paths is the sum of the two possibilities.

Function Call

print(count_paths(4, 3))

Calls the function with a grid of size 4 x 3.

You are asked: "How many ways can you go from the top-left to the bottom-right corner using only right and down moves?"

Mathematical Equivalent

This problem is equivalent to:

Number of paths=( (r−1)(r+c−2) )=( 35)=10

Final Output

10