# Unique paths

MediumGiven a matrix of size

`m`

by `n`

, find *the number of unique paths*to get from the*top left*to the*bottom right*of the matrix.Note that you can only move to the

**right**or**down**in the matrix.For example, given the following inputs:

m = 2n = 3

Your function should return

`something`

.## Try it first

## Solution

## 8 Essential Recursion & Dynamic Programming Coding Interview Problems

Master Recursion & Dynamic Programming by trying the coding challenges below.

- 1.FibonacciEasy
- 2.Unique pathsMedium
- 3.KnapsackMedium
- 4.Subset sumMedium
- 5.Power setMedium
- 6.Coin changeMedium
- 7.Word breakHard
- 8.Longest common subsequenceHard