Grokking Algorithm Complexity and Big-O
Ask Author
Back to course home

0% completed

Vote For New Content
Dynamic Programming Algorithms
On this page

In this lesson, we will explore three different approaches to solving dynamic programming problems with more complex examples:

  • Memoization (Top-down approach)
  • Top-down DP with Explicit Recursion
  • Bottom-up DP (Tabulation)

1. Solving a Problem with Memoization

Problem: Calculate the number of unique paths from the top-left corner to the bottom-right corner of an m x n grid. You can only move right or down.

Time Complexity for Unique Paths Using Memoization

  1. Recursive Calls:
    • The function `findPaths

.....

.....

.....

Like the course? Get enrolled and start learning!

On this page