Uh oh!
There was an error while loading.Please reload this page.
- Notifications
You must be signed in to change notification settings - Fork1.8k
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.
By clicking “Sign up for GitHub”, you agree to ourterms of service andprivacy statement. We’ll occasionally send you account related emails.
Already on GitHub?Sign in to your account
Open
mhayter wants to merge11 commits intocp-algorithms:mainChoose a base branch
base:main
Could not load branches
Branch not found:{{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline, and old review comments may become outdated.
Uh oh!
There was an error while loading.Please reload this page.
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.Learn more about bidirectional Unicode characters
forgot to save lol
should this link be relative or absolute?
don't know how markdown works
I don't get markdown links...
This technically works but probably the links should be edited to be relative as it won't work exactly correctly with absolute links, but I'm dumb and can't figure it out. |
adamant-pwn requested changesMay 24, 2025
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others.Learn more.
Thanks! Let's cleanup the links a bit.
| @@ -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$? | | |||
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others.Learn more.
Suggested change
| |[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$?| | |
| |[0-1 Knapsack](../dynamic_programming/knapsack.md)| 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. | |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others.Learn more.
Suggested change
| |[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.| | |
| |[Longest Increasing Subsequence (LIS)](../dynamic_programming/longest_increasing_subsequence.md)| 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.| |
| @@ -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) | |||
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others.Learn more.
Suggested change
| *[Bitmask Dynamic Programming](https://cp-algorithms.com/dynamic_programming/profile-dynamics.html) | |
| *[Bitmask Dynamic Programming](../dynamic_programming/profile-dynamics.md) |
| @@ -63,6 +63,7 @@ search: | |||
| - Dynamic Programming | |||
| - [Introduction to Dynamic Programming](dynamic_programming/intro-to-dp.md) | |||
| - [Knapsack Problem](dynamic_programming/knapsack.md) | |||
| - [Longest increasing subsequence](dynamic_programming/longest_increasing_subsequence.md) | |||
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others.Learn more.
Unless we very deliberately want it to occur in two sections, we should also remove it from Miscellaneous/Sequences.
| e_maxx_link: longest_increasing_subseq_log | ||
| --- | ||
| <meta http-equiv="refresh" content="0; url=/dynamic_programming/longest_increasing_subsequence.html"> |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others.Learn more.
Suggested change
| <metahttp-equiv="refresh"content="0; url=/dynamic_programming/longest_increasing_subsequence.html"> | |
| <metahttp-equiv="refresh"content="0; url=../dynamic_programming/longest_increasing_subsequence.html"> |
Sign up for freeto join this conversation on GitHub. Already have an account?Sign in to comment
Labels
None yet
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Did I do this right?