6702
6702
< ul class ="metadata page-metadata " data-bi-name ="page info " lang ="en-us " dir ="ltr ">
6703
6703
6704
6704
Last update:
6705
- < span class ="git-revision-date-localized-plugin git-revision-date-localized-plugin-date " title ="January 9 , 2025 19:52:23 " > January 9 , 2025</ span >  
6705
+ < span class ="git-revision-date-localized-plugin git-revision-date-localized-plugin-date " title ="April 24 , 2025 08:24:54 " > April 24 , 2025</ span >  
6706
6706
6707
6707
<!-- Tags -->
6708
6708
@@ -6815,15 +6815,15 @@ <h2 id="classic-dynamic-programming-problems">Classic Dynamic Programming Proble
6815
6815
</ thead >
6816
6816
< tbody >
6817
6817
< tr >
6818
- < td > 0-1 Knapsack</ td >
6818
+ < td > < a href =" knapsack.html " > 0-1 Knapsack</ a > </ td >
6819
6819
< td > Given < span class ="arithmatex "> $W$</ span > , < span class ="arithmatex "> $N$</ span > , and < span class ="arithmatex "> $N$</ span > items with weights < span class ="arithmatex "> $w_i$</ span > and values < span class ="arithmatex "> $v_i$</ span > , what is the maximum < span class ="arithmatex "> $\sum_{i=1}^{k} v_i$</ span > for each subset of items of size < span class ="arithmatex "> $k$</ span > (< span class ="arithmatex "> $1 \le k \le N$</ span > ) while ensuring < span class ="arithmatex "> $\sum_{i=1}^{k} w_i \le W$</ span > ?</ td >
6820
6820
</ tr >
6821
6821
< tr >
6822
6822
< td > Subset Sum</ td >
6823
6823
< td > Given < span class ="arithmatex "> $N$</ span > integers and < span class ="arithmatex "> $T$</ span > , determine whether there exists a subset of the given set whose elements sum up to the < span class ="arithmatex "> $T$</ span > .</ td >
6824
6824
</ tr >
6825
6825
< tr >
6826
- < td > Longest Increasing Subsequence (LIS)</ td >
6826
+ < td > < a href =" longest_increasing_subsequence.html " > Longest Increasing Subsequence (LIS)</ a > </ td >
6827
6827
< td > You are given an array containing < span class ="arithmatex "> $N$</ span > integers. Your task is to determine the LIS in the array, i.e., a subsequence where every element is larger than the previous one.</ td >
6828
6828
</ tr >
6829
6829
< tr >
@@ -6854,7 +6854,7 @@ <h2 id="classic-dynamic-programming-problems">Classic Dynamic Programming Proble
6854
6854
</ table >
6855
6855
< h2 id ="related-topics "> Related Topics< a class ="headerlink " href ="#related-topics " title ="Permanent link "> ¶</ a > </ h2 >
6856
6856
< ul >
6857
- < li > Bitmask Dynamic Programming</ li >
6857
+ < li > < a href =" profile-dynamics.html " > Bitmask Dynamic Programming</ a > </ li >
6858
6858
< li > Digit Dynamic Programming</ li >
6859
6859
< li > Dynamic Programming on Trees</ li >
6860
6860
</ ul >
@@ -6878,7 +6878,7 @@ <h2 id="dp-contests">DP Contests<a class="headerlink" href="#dp-contests" title=
6878
6878
6879
6879
< ul class ="metadata page-metadata " data-bi-name ="page info " lang ="en-us " dir ="ltr ">
6880
6880
< span class ="contributors-text "> Contributors:</ span >
6881
- < ul class ="contributors " data-bi-name ="contributors "> < li > < a href ="https://github.com/mhayter " title ="mhayter " data-bi-name ="contributorprofile " target ="_blank "> mhayter</ a > (78.18%)</ li > < li > < a href ="https://github.com/Zyad-Ayad " title ="Zyad-Ayad " data-bi-name ="contributorprofile " target ="_blank "> Zyad-Ayad</ a > (9.7%)</ li > < li > < a href ="https://github.com/clumsy " title ="clumsy " data-bi-name ="contributorprofile " target ="_blank "> clumsy</ a > (4.85%)</ li > < li > < a href ="https://github.com/konstantinosalatzas " title ="konstantinosalatzas " data-bi-name ="contributorprofile " target ="_blank "> konstantinosalatzas</ a > (1.82%)</ li > < li > < a href ="https://github.com/ShubhamPhapale " title ="ShubhamPhapale " data-bi-name ="contributorprofile " target ="_blank "> ShubhamPhapale</ a > (1.82%)</ li > < li > < a href ="https://github.com/Ahmed-Elshitehi " title ="Ahmed-Elshitehi " data-bi-name ="contributorprofile " target ="_blank "> Ahmed-Elshitehi</ a > (1.21%)</ li > < li > < a href ="https://github.com/jakobkogler " title ="jakobkogler " data-bi-name ="contributorprofile " target ="_blank "> jakobkogler</ a > (1.21%)</ li > < li > < a href ="https://github.com/tj91 " title ="tj91 " data-bi-name ="contributorprofile " target ="_blank "> tj91</ a > (0.61%)</ li > < li > < a href ="https://github.com/adamant-pwn " title ="adamant-pwn " data-bi-name ="contributorprofile " target ="_blank "> adamant-pwn</ a > (0.61%)</ li > </ ul >
6881
+ < ul class ="contributors " data-bi-name ="contributors "> < li > < a href ="https://github.com/mhayter " title ="mhayter " data-bi-name ="contributorprofile " target ="_blank "> mhayter</ a > (80.0%)</ li > < li > < a href ="https://github.com/Zyad-Ayad " title ="Zyad-Ayad " data-bi-name ="contributorprofile " target ="_blank "> Zyad-Ayad</ a > (9.09%)</ li > < li > < a href ="https://github.com/clumsy " title ="clumsy " data-bi-name ="contributorprofile " target ="_blank "> clumsy</ a > (3.64%)</ li > < li > < a href ="https://github.com/konstantinosalatzas " title ="konstantinosalatzas " data-bi-name ="contributorprofile " target ="_blank "> konstantinosalatzas</ a > (1.82%)</ li > < li > < a href ="https://github.com/ShubhamPhapale " title ="ShubhamPhapale " data-bi-name ="contributorprofile " target ="_blank "> ShubhamPhapale</ a > (1.82%)</ li > < li > < a href ="https://github.com/Ahmed-Elshitehi " title ="Ahmed-Elshitehi " data-bi-name ="contributorprofile " target ="_blank "> Ahmed-Elshitehi</ a > (1.21%)</ li > < li > < a href ="https://github.com/jakobkogler " title ="jakobkogler " data-bi-name ="contributorprofile " target ="_blank "> jakobkogler</ a > (1.21%)</ li > < li > < a href ="https://github.com/tj91 " title ="tj91 " data-bi-name ="contributorprofile " target ="_blank "> tj91</ a > (0.61%)</ li > < li > < a href ="https://github.com/adamant-pwn " title ="adamant-pwn " data-bi-name ="contributorprofile " target ="_blank "> adamant-pwn</ a > (0.61%)</ li > </ ul >
6882
6882
</ ul >
6883
6883
6884
6884
</ article >
0 commit comments