Skip to content

Simply DSA

11. Dynamic Programming

Initializing search

Simply DSA

Simply DSA
01. Basics
01. Basics
- First Missing Positive
02. Arrays
02. Arrays
- MaximumAbsoluteDifference
- Trapping Rain Water
03. Sorting
03. Sorting
- Median of Two Sorted Arrays
04. Bit Manipulation
04. Bit Manipulation
- MaximumXOROfTwoNumbers (Bit Manipulation)
- Single Number II
05. Maths
05. Maths
- MaxPointsOnALine
- Sieve of Eratosthenes
06. Hashing & Strings
06. Hashing & Strings
- Longest Substring Without Repeating Characters
- MinimumWindowSubstring
07. Recursion
07. Recursion
- NQueens (Recursion)
- Permutations
08. Linked Lists & Stacks
08. Linked Lists & Stacks
- LargestRectangleInHistogram (Linear DS)
- Reverse Linked List
09. Trees
09. Trees
- BinaryTreeMaximumPathSum (Graph/Tree)
- Diameter of Binary Tree
10. Heaps
10. Heaps
- Kth Largest Element
- MergeKSortedLists (Greedy/Heap)
11. Dynamic Programming
11. Dynamic Programming
12. Graphs
12. Graphs
- Number of Islands
- WordLadder (Graph/Tree)
Javascripts
Javascripts

Table of contents

📚 Problem List

11. Dynamic Programming

📚 Problem List

Climbing Stairs
Edit Distance
Fibonacci Number
Max Sum Without Adjacent Elements
Stairs

Made with Material for MkDocs