Skip to content

Commit c128044

Browse files
1 parent be5367e commit c128044

File tree

4 files changed

+8
-8
lines changed

4 files changed

+8
-8
lines changed

1457/dynamic_programming/intro-to-dp.html

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -6702,7 +6702,7 @@
67026702
<ul class="metadata page-metadata" data-bi-name="page info" lang="en-us" dir="ltr">
67036703

67046704
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>&emsp;
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>&emsp;
67066706

67076707
<!-- Tags -->
67086708

@@ -6815,15 +6815,15 @@ <h2 id="classic-dynamic-programming-problems">Classic Dynamic Programming Proble
68156815
</thead>
68166816
<tbody>
68176817
<tr>
6818-
<td>0-1 Knapsack</td>
6818+
<td><a href="knapsack.html">0-1 Knapsack</a></td>
68196819
<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>
68206820
</tr>
68216821
<tr>
68226822
<td>Subset Sum</td>
68236823
<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>
68246824
</tr>
68256825
<tr>
6826-
<td>Longest Increasing Subsequence (LIS)</td>
6826+
<td><a href="longest_increasing_subsequence.html">Longest Increasing Subsequence (LIS)</a></td>
68276827
<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>
68286828
</tr>
68296829
<tr>
@@ -6854,7 +6854,7 @@ <h2 id="classic-dynamic-programming-problems">Classic Dynamic Programming Proble
68546854
</table>
68556855
<h2 id="related-topics">Related Topics<a class="headerlink" href="#related-topics" title="Permanent link">&para;</a></h2>
68566856
<ul>
6857-
<li>Bitmask Dynamic Programming</li>
6857+
<li><a href="profile-dynamics.html">Bitmask Dynamic Programming</a></li>
68586858
<li>Digit Dynamic Programming</li>
68596859
<li>Dynamic Programming on Trees</li>
68606860
</ul>
@@ -6878,7 +6878,7 @@ <h2 id="dp-contests">DP Contests<a class="headerlink" href="#dp-contests" title=
68786878

68796879
<ul class="metadata page-metadata" data-bi-name="page info" lang="en-us" dir="ltr">
68806880
<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>
68826882
</ul>
68836883

68846884
</article>

0 commit comments

Comments
 (0)