cp-algorithms
diff --git a/‎1457/dynamic_programming/intro-to-dp.html
Lines changed: 4 additions & 4 deletions b/‎1457/dynamic_programming/intro-to-dp.html
Lines changed: 4 additions & 4 deletions
@@ -6702,7 +6702,7 @@
 <ul class="metadata page-metadata" data-bi-name="page info" lang="en-us" dir="ltr">
 
   Last update:
-  <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;
+  <span class="git-revision-date-localized-plugin git-revision-date-localized-plugin-date" title="April 24, 2025 08:34:22">April 24, 2025</span>&emsp;
 
 <!-- Tags -->
 
@@ -6815,15 +6815,15 @@ <h2 id="classic-dynamic-programming-problems">Classic Dynamic Programming Proble
 </thead>
 <tbody>
 <tr>
-<td><a href="knapsack.html">0-1 Knapsack</a></td>
+<td><a href="/knapsack.md">0-1 Knapsack</a></td>
 <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>
 </tr>
 <tr>
 <td>Subset Sum</td>
 <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>
 </tr>
 <tr>
-<td><a href="longest_increasing_subsequence.html">Longest Increasing Subsequence (LIS)</a></td>
+<td><a href="/longest_increasing_subsequence.md">Longest Increasing Subsequence (LIS)</a></td>
 <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>
 </tr>
 <tr>
@@ -6854,7 +6854,7 @@ <h2 id="classic-dynamic-programming-problems">Classic Dynamic Programming Proble
 </table>
 <h2 id="related-topics">Related Topics<a class="headerlink" href="#related-topics" title="Permanent link">&para;</a></h2>
 <ul>
-<li><a href="profile-dynamics.html">Bitmask Dynamic Programming</a></li>
+<li><a href="/profile-dynamics.md">Bitmask Dynamic Programming</a></li>
 <li>Digit Dynamic Programming</li>
 <li>Dynamic Programming on Trees</li>
 </ul>