Coding Interview Preparation: Dynamic Programming Mastery Part 3
Course Description
In the final part of this coding interview prep course, you’ll dive into dynamic programming. Learn how to identify overlapping subproblems, solve the longest increasing subsequence, and use memoization to optimize your algorithms. This module is your key to mastering high-level coding interview challenges.
Course Curriculum
- 001. Lesson 3.1 Introduction to Dynamic Programming
- 002. Lesson 3.2 Identifying Overlapping Subproblems
- 003. Lesson 3.3 Longest Increasing Subsequence Using Bottom-Up Tabulation
- 004. Lesson 3.4 Longest Increasing Subsequence Using Memoization with Recursion
- 005. Lesson 3.5 Solve Another DP Problem
- 006. Lesson 3.6 Course Conclusion