<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
  <url>
    <loc>https://dsaisfun.dev/</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>1.0</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/about</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/privacy</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.4</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/terms</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.4</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/contact</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.4</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/notes</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.5</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/login</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.3</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/paths/arrays-and-searching</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/paths/recursion-and-trees</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/paths/graphs-and-shortest-paths</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/paths/sorting-foundations</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/paths/data-structure-patterns</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/paths/interview-patterns-mastery</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/concepts/backtracking-foundations</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/concepts/binary-search-foundations</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/concepts/dynamic-programming-foundations</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/concepts/graph-traversal-foundations</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/concepts/recursion-foundations</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/concepts/sliding-window-foundations</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/concepts/two-pointers-foundations</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/bfs-traversal</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/binary-search</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/binary-tree-inorder-traversal</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/coin-change</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/dfs-traversal</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/dijkstra-shortest-path</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/insertion-sort</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/kadanes-algorithm</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/longest-common-subsequence</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/longest-increasing-subsequence</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/lru-cache</loc>
    <lastmod>2026-07-12</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/merge-sort</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/min-heap-operations</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/n-queens</loc>
    <lastmod>2026-07-12</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/quick-sort</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/reverse-linked-list</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/selection-sort</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/sliding-window-maximum</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/subset-generation</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/topological-sort</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/trie-insert-search</loc>
    <lastmod>2026-07-12</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/two-sum</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/union-find</loc>
    <lastmod>2026-07-12</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/valid-parentheses</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/problem/zero-one-knapsack</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/bfs-traversal</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/binary-search</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/binary-tree-inorder-traversal</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/coin-change</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/dfs-traversal</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/dijkstra-shortest-path</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/insertion-sort</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/kadanes-algorithm</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/longest-common-subsequence</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/longest-increasing-subsequence</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/lru-cache</loc>
    <lastmod>2026-07-12</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/merge-sort</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/min-heap-operations</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/n-queens</loc>
    <lastmod>2026-07-12</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/quick-sort</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/reverse-linked-list</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/selection-sort</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/sliding-window-maximum</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/subset-generation</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/topological-sort</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/trie-insert-search</loc>
    <lastmod>2026-07-12</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/two-sum</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/union-find</loc>
    <lastmod>2026-07-12</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/valid-parentheses</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
  <url>
    <loc>https://dsaisfun.dev/learn/zero-one-knapsack</loc>
    <lastmod>2026-07-11</lastmod>
    <priority>0.7</priority>
  </url>
</urlset>
