Stack Bash - Master data structures and algorithms

Unique paths

Given 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 = 2
n = 3
Your function should return something.

Try it first


8 Essential Recursion & Dynamic Programming Coding Interview Problems

Master Recursion & Dynamic Programming by trying the coding challenges below.
  1. 1.FibonacciEasy
  2. 2.Unique pathsMedium
  3. 3.KnapsackMedium
  4. 4.Subset sumMedium
  5. 5.Power setMedium
  6. 6.Coin changeMedium
  7. 7.Word breakHard
  8. 8.Longest common subsequenceHard

Want to confidently pass your next coding interview?

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.