diff --git a/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html b/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
index 346145a4..ecbdf199 100644
--- a/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
+++ b/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
@@ -338,18 +338,20 @@ LeetCode Algorithm</h2>
 <tr class="markdownTableRowEven">
 <td class="markdownTableBodyNone">2024   </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximize-the-confusion-of-an-exam/" target="_blank">Maximize the Confusion of an Exam</a>   </td><td class="markdownTableBodyNone"><a href="../.././src/2024.c" target="_blank">C</a>   </td><td class="markdownTableBodyNone">Medium    </td></tr>
 <tr class="markdownTableRowOdd">
+<td class="markdownTableBodyNone">2095   </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/" target="_blank">Delete the Middle Node of a Linked List</a>   </td><td class="markdownTableBodyNone"><a href="../.././src/2095.c" target="_blank">C</a>   </td><td class="markdownTableBodyNone">Medium    </td></tr>
+<tr class="markdownTableRowEven">
 <td class="markdownTableBodyNone">2125   </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-laser-beams-in-a-bank/description/" target="_blank">Number of Laser Beams in a Bank</a>   </td><td class="markdownTableBodyNone"><a href="../.././src/2125.c" target="_blank">C</a>   </td><td class="markdownTableBodyNone">Medium    </td></tr>
-<tr class="markdownTableRowEven">
+<tr class="markdownTableRowOdd">
 <td class="markdownTableBodyNone">2130   </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/" target="_blank">Maximum Twin Sum of a Linked List</a>   </td><td class="markdownTableBodyNone"><a href="../.././src/2130.c" target="_blank">C</a>   </td><td class="markdownTableBodyNone">Medium    </td></tr>
-<tr class="markdownTableRowOdd">
+<tr class="markdownTableRowEven">
 <td class="markdownTableBodyNone">2222   </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-ways-to-select-buildings/" target="_blank">Number of Ways to Select Buildings</a>   </td><td class="markdownTableBodyNone"><a href="../.././src/2222.c" target="_blank">C</a>   </td><td class="markdownTableBodyNone">Medium    </td></tr>
-<tr class="markdownTableRowEven">
+<tr class="markdownTableRowOdd">
 <td class="markdownTableBodyNone">2256   </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/minimum-average-difference/" target="_blank">Minimum Average Difference</a>   </td><td class="markdownTableBodyNone"><a href="../.././src/2256.c" target="_blank">C</a>   </td><td class="markdownTableBodyNone">Medium    </td></tr>
-<tr class="markdownTableRowOdd">
-<td class="markdownTableBodyNone">2270   </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-ways-to-split-array/" target="_blank">Number of Ways to Split Array</a>   </td><td class="markdownTableBodyNone"><a href="../.././src/2270.c" target="_blank">C</a>   </td><td class="markdownTableBodyNone">Medium    </td></tr>
 <tr class="markdownTableRowEven">
-<td class="markdownTableBodyNone">2304   </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/minimum-path-cost-in-a-grid/" target="_blank">Minimum Path Cost in a Grid</a>   </td><td class="markdownTableBodyNone"><a href="../.././src/2304.c" target="_blank">C</a>   </td><td class="markdownTableBodyNone">Medium    </td></tr>
+<td class="markdownTableBodyNone">2270   </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-ways-to-split-array/" target="_blank">Number of Ways to Split Array</a>   </td><td class="markdownTableBodyNone"><a href="../.././src/2270.c" target="_blank">C</a>   </td><td class="markdownTableBodyNone">Medium    </td></tr>
 <tr class="markdownTableRowOdd">
+<td class="markdownTableBodyNone">2304   </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/minimum-path-cost-in-a-grid/" target="_blank">Minimum Path Cost in a Grid</a>   </td><td class="markdownTableBodyNone"><a href="../.././src/2304.c" target="_blank">C</a>   </td><td class="markdownTableBodyNone">Medium    </td></tr>
+<tr class="markdownTableRowEven">
 <td class="markdownTableBodyNone">2501   </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/longest-square-streak-in-an-array/description/" target="_blank">Longest Square Streak in an Array</a>   </td><td class="markdownTableBodyNone"><a href="../.././src/2501.c" target="_blank">C</a>   </td><td class="markdownTableBodyNone">Medium   </td></tr>
 </table>
 </div></div><!-- contents -->