<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd" xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://hoavu-cs.github.io/jekyll/update/2026/01/23/welcome-to-jekyll/</loc>
<lastmod>2026-01-23T03:01:51+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/bfs/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/about/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/bellman-ford/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/dijkstra/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/divide-and-conquer-1/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/divide-and-conquer-2/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/divide-and-conquer-3/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/dynamic-programming-1/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/dynamic-programming-2/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/floyd-warshall/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/graphs-dfs/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/greedy-1/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/heaps/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/np-hardness-part-1/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/np-hardness-part-2/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/np-hardness-part-3/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/prefix-sum-difference-array/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/running-time/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/strongly-connected-components/</loc>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/divide-and-conquer-1/divide-and-conquer-1.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/divide-and-conquer-2/divide-and-conquer-2.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/divide-and-conquer-3/divide-and-conquer-3.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/dynamic-programming-1/dynamic-programming-1.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/dynamic-programming-2/dynamic-programming-2.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/exam-1-review/exam-1-review.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/floyd-warshall/floyd-warshall.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/graphs-dfs/graphs-dfs.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/greedy-1/greedy-1.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/induction-contradiction/induction-contradiction.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/minimum-spanning-tree/minimum-spanning-tree.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/np-hardness-part-1/np-hardness-part-1.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/np-hardness-part-2/np-hardness-part-2.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/np-hardness-part-3/np-hardness-part-3.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/running-time/running-time.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/shortest-paths/shortest-paths.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/strongly-connected-components/strongly-connected-components.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
<url>
<loc>https://hoavu-cs.github.io/dsa/slides/union-find/union-find.pdf</loc>
<lastmod>2026-11-18T01:44:43+00:00</lastmod>
</url>
</urlset>
