Introduction to Data Structures & Algorithms with Leetcode
Strings
Trees
- Untitled
Recursion
- Introduction
- Backtracking
  - Permutations
Dynamic Programming
Binary Search
- Introduction
- Advanced
Graphs
Practice
Linked Lists
Bitshifting
- Introduction
Not Done Yet

Powered by GitBook

On this page

Was this helpful?

Introduction

PreviousPermutations NextMinimum (Maximum) Path to Reach a Target

Last updated 4 years ago

Note: I have written extensively about Dynamic Programming, and even a book on it! This section will feature that, and more.

This section is based off of the famous Leetcode post, Dynamic Programming Patterns.

DP for Beginners [Problems | Patterns | Sample Solutions] by @wh0ami
- [LIST]
DP Patterns by @aatalyk
How to solve DP - String? Template and 4 Steps to be followed by @igooglethings
Dynamic Programming Questions thread by @karansingh1559
DP Classification helpful notes by @adityakrverma
How to approach DP problems by @heroes3001
Iterative DP for subset sum problems by @yuxiangmusic
DP problems summary (problem categorization) by @richenyunqi

Algorithm_Design.pdf

Loading...LeetCode