Grokking Dynamic Programming Patterns for Coding Interviews
Ask Author
Back to course home

0% completed

Vote For New Content
How do we calculate runtime/spactime complexity for recusive problems?

Flash

Feb 9, 2022

How do we calculate runtime/spactime complexity for recusive problems?

0

0

Comments
Comments
Design Gurus
Design Gurus4 years ago

We have not discussed the time/space complexities in the introduction. See the first problem '0/1 Knapsack' for a detailed discussion on this.

On this page

Characteristics of Dynamic Programming

Overlapping Subproblems

Optimal Substructure Property

Top-down with Memoization

Bottom-up with Tabulation