Skip to content

relocated lis to dp section/add redirect + add relevant links to intro-to_dp #1457

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 11 commits into
base: main
Choose a base branch
from
Open

relocated lis to dp section/add redirect + add relevant links to intro-to_dp #1457

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
11 commits
Select commit Hold shift + click to select a range
d2a7a2e
relocated lis to dp section/add redirect
mhayter Apr 24, 2025
daf455a
Update navigation.md
mhayter Apr 24, 2025
763e0cc
Update longest_increasing_subsequence.md
mhayter Apr 24, 2025
c117189
Update longest_increasing_subsequence.md
mhayter Apr 24, 2025
617c84f
Update longest_increasing_subsequence.md
mhayter Apr 24, 2025
e56c625
Update longest_increasing_subsequence.md
mhayter Apr 24, 2025
2f8c4de
add relevant links to intro_to_dp
mhayter Apr 24, 2025
ae2355e
remove dynamic_programming directory in links
mhayter Apr 24, 2025
c0906ac
added slash for relative link
mhayter Apr 24, 2025
a0884ce
last chance else absolute normal link...
mhayter Apr 24, 2025
e857b31
Absolute link because I don't understand relative/markdown notation
mhayter Apr 24, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions src/dynamic_programming/intro-to-dp.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -132,9 +132,9 @@ One of the tricks to getting better at dynamic programming is to study some of t
## Classic Dynamic Programming Problems
| Name | Description/Example |
| ---------------------------------------------- | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| 0-1 Knapsack | Given $W$, $N$, and $N$ items with weights $w_i$ and values $v_i$, what is the maximum $\sum_{i=1}^{k} v_i$ for each subset of items of size $k$ ($1 \le k \le N$) while ensuring $\sum_{i=1}^{k} w_i \le W$? |
| [0-1 Knapsack](https://cp-algorithms.com/dynamic_programming/knapsack.html) | Given $W$, $N$, and $N$ items with weights $w_i$ and values $v_i$, what is the maximum $\sum_{i=1}^{k} v_i$ for each subset of items of size $k$ ($1 \le k \le N$) while ensuring $\sum_{i=1}^{k} w_i \le W$? |
| Subset Sum | Given $N$ integers and $T$, determine whether there exists a subset of the given set whose elements sum up to the $T$. |
| Longest Increasing Subsequence (LIS) | You are given an array containing $N$ integers. Your task is to determine the LIS in the array, i.e., a subsequence where every element is larger than the previous one. |
| [Longest Increasing Subsequence (LIS)](https://cp-algorithms.com/dynamic_programming/longest_increasing_subsequence.html) | You are given an array containing $N$ integers. Your task is to determine the LIS in the array, i.e., a subsequence where every element is larger than the previous one. |
| Counting Paths in a 2D Array | Given $N$ and $M$, count all possible distinct paths from $(1,1)$ to $(N, M)$, where each step is either from $(i,j)$ to $(i+1,j)$ or $(i,j+1)$. |
| Longest Common Subsequence | You are given strings $s$ and $t$. Find the length of the longest string that is a subsequence of both $s$ and $t$. |
| Longest Path in a Directed Acyclic Graph (DAG) | Finding the longest path in Directed Acyclic Graph (DAG). |
Expand All @@ -143,7 +143,7 @@ One of the tricks to getting better at dynamic programming is to study some of t
| Edit Distance | The edit distance between two strings is the minimum number of operations required to transform one string into the other. Operations are ["Add", "Remove", "Replace"] |

## Related Topics
* Bitmask Dynamic Programming
* [Bitmask Dynamic Programming](https://cp-algorithms.com/dynamic_programming/profile-dynamics.html)
* Digit Dynamic Programming
* Dynamic Programming on Trees

Expand Down
Loading