<?xml version="1.0" encoding="utf-8" standalone="yes"?><urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:xhtml="http://www.w3.org/1999/xhtml"><url><loc>https://uiuc-cs491cap.netlify.app/docs/getting-started/</loc><lastmod>2021-07-20T16:41:36-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/ad-hoc/</loc><lastmod>2021-08-25T11:23:26-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/arrays-and-vectors/</loc><lastmod>2022-01-26T12:46:49-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/basic-graphs/</loc><lastmod>2022-02-28T14:52:15-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/basic-graphs/</loc><lastmod>2021-09-30T10:19:19-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/basic-combinatorics/</loc><lastmod>2021-09-20T13:16:46-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/complete-search/</loc><lastmod>2022-02-14T14:40:08-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/complete-search/</loc><lastmod>2021-09-07T17:00:52-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/divide-and-conquer/</loc><lastmod>2022-02-16T14:37:37-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/divide-and-conquer/</loc><lastmod>2021-09-13T10:46:04-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/dynamic-programming/</loc><lastmod>2022-02-20T18:13:39-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/dynamic-programming/</loc><lastmod>2021-10-27T15:27:24-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/edmonds-karp/</loc><lastmod>2021-10-07T17:48:21-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/euclids-algorithm/</loc><lastmod>2021-09-20T13:16:46-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/fenwick-trees/</loc><lastmod>2021-11-02T12:11:38-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/games/</loc><lastmod>2021-11-18T12:12:35-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/graph-traversal-properties/</loc><lastmod>2021-10-07T16:57:47-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/greedy-algorithms/</loc><lastmod>2022-02-20T18:02:25-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/template/</loc><lastmod>2022-02-20T18:13:39-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/greedy-algorithms/</loc><lastmod>2021-09-13T10:46:04-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/io/</loc><lastmod>2021-08-25T11:23:26-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/kruscals-algorithm/</loc><lastmod>2021-10-04T13:28:47-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/bsts-and-heaps/</loc><lastmod>2022-02-09T12:19:29-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/minimum-spanning-trees/</loc><lastmod>2021-10-04T13:28:47-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/points-lines-vectors/</loc><lastmod>2021-11-09T10:15:15-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/prime-numbers/</loc><lastmod>2022-02-07T14:08:42-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/segment-trees/</loc><lastmod>2021-11-02T12:11:38-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/bsts-and-heaps/</loc><lastmod>2021-09-27T16:59:58-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/stacks-and-queues/</loc><lastmod>2021-08-31T16:28:17-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/sieve-of-eratosthenes/</loc><lastmod>2021-09-03T15:23:59-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/traversals/</loc><lastmod>2022-02-28T13:47:45-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/stacks-and-queues/</loc><lastmod>2022-01-31T14:26:55-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/</loc><lastmod>2022-04-25T13:58:52-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/</loc><lastmod>2022-04-25T13:58:52-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/</loc><lastmod>2022-03-30T06:22:01-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/docs/getting-started/syllabus/</loc><lastmod>2022-01-19T12:54:16-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/docs/getting-started/why/</loc><lastmod>2021-08-23T17:22:25-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/apsp/</loc><lastmod>2022-03-07T13:18:47-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/authors/</loc></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/bellman-ford-and-spfa/</loc><lastmod>2022-03-07T13:18:47-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/bellman-ford-and-spfa/</loc><lastmod>2022-03-30T06:22:01-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/bfs-shortest-path/</loc><lastmod>2022-03-07T13:18:47-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/categories/</loc></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/combinatorics/</loc><lastmod>2022-04-18T13:48:12-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/convex-hull/</loc><lastmod>2022-04-20T14:31:35-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/docs/</loc><lastmod>2021-07-20T16:52:53-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/course-introduction/</loc><lastmod>2022-03-21T13:35:27-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/dijkstra-shortest-path/</loc><lastmod>2022-03-07T13:18:47-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/videos/floyd-warshall/</loc><lastmod>2022-03-07T13:18:47-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/gcd/</loc><lastmod>2022-04-13T14:07:21-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/graph-traversal-properties/</loc><lastmod>2022-03-21T13:46:14-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/io/</loc><lastmod>2022-03-21T13:35:27-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/minimum-spanning-trees/</loc><lastmod>2022-04-04T09:41:03-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/points-lines-vectors/</loc><lastmod>2022-04-04T09:36:29-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/problems/</loc><lastmod>2022-01-19T12:54:16-06:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/segment-trees/</loc><lastmod>2022-03-30T06:22:01-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/shapes/</loc><lastmod>2022-04-11T14:40:41-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/sssp/</loc><lastmod>2022-03-21T13:35:27-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/string-dp/</loc><lastmod>2022-04-25T13:58:52-05:00</lastmod></url><url><loc>https://uiuc-cs491cap.netlify.app/tags/</loc></url><url><loc>https://uiuc-cs491cap.netlify.app/lectures/union-find/</loc><lastmod>2022-03-21T13:39:09-05:00</lastmod></url></urlset>