<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://adityaverma.com</loc>
<lastmod>2026-07-26T00:00:00+05:30</lastmod>
<changefreq>monthly</changefreq>
<priority>1</priority>
</url>
<url>
<loc>https://adityaverma.com/blog</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://adityaverma.com/blog/ai-evals-101</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.75</priority>
</url>
<url>
<loc>https://adityaverma.com/blog/publisher-content-ingestion</loc>
<lastmod>2026-07-16</lastmod>
<changefreq>yearly</changefreq>
<priority>0.75</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming</loc>
<lastmod>2026-07-26</lastmod>
<changefreq>monthly</changefreq>
<priority>0.9</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/climbing-stairs</loc>
<lastmod>2026-07-26</lastmod>
<changefreq>yearly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/coin-change</loc>
<lastmod>2026-07-26</lastmod>
<changefreq>yearly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/house-robber</loc>
<lastmod>2026-07-26</lastmod>
<changefreq>yearly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/longest-common-subsequence</loc>
<lastmod>2026-07-26</lastmod>
<changefreq>yearly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://adityaverma.com/project/publisher-content-ingestion</loc>
<lastmod>2026-07-26</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://adityaverma.com/project/assessments-flashcard-editor</loc>
<lastmod>2026-07-26</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://adityaverma.com/project/common-assessment-platform</loc>
<lastmod>2026-07-26</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://adityaverma.com/project/activity-details-page</loc>
<lastmod>2026-07-26</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/fibonacci-numbers</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/tribonacci-numbers</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/lucas-numbers</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/climbing-stairs</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/climbing-stairs-three-moves</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/weighted-climbing-stairs</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/maximum-segments</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/nth-catalan-number</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/count-unique-bsts</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/count-valid-parenthesis</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/ways-to-triangulate-a-polygon</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/min-sum-in-a-triangle</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/minimum-perfect-squares</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/ways-to-partition-a-set</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/binomial-coefficient</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/pascals-triangle</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/nth-row-of-pascals-triangle</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/house-robber</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/min-cost-path</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/decode-ways</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/subset-sum</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/coin-change-count-ways</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/coin-change-minimum-coins</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/painting-fence</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/cutting-a-rod</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/jump-game</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/longest-common-substring</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/count-all-paths-in-a-grid</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/paths-in-a-grid-with-obstacles</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/permutations-with-k-inversions</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/maximum-as-special-keyboard</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/water-overflow</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/longest-common-subsequence</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/longest-increasing-subsequence</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/edit-distance</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/largest-divisible-subset</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/weighted-job-scheduling</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/zero-one-knapsack</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/printing-items-in-zero-one-knapsack</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/unbounded-knapsack</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/word-break</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/tile-stacking</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/box-stacking</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/partition-problem</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/longest-palindromic-subsequence</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/longest-common-increasing-subsequence</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/all-distinct-subset-sums</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/count-derangements</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/minimum-insertions-for-palindrome</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/wildcard-pattern-matching</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/regular-expression-matching</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/arrange-balls-adjacent-different-types</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/longest-subsequence-with-adjacent-difference-one</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/maximum-square-submatrix-of-ones</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/bellman-ford</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/floyd-warshall</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/maximum-tip-calculator</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/largest-x-bordered-square</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/egg-dropping</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/palindrome-partitioning</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/palindromic-substring-count</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/word-wrap</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/optimal-strategy-for-a-game</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/painters-partition</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/bridge-and-torch</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/matrix-chain-multiplication</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/printing-matrix-chain-multiplication</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/maximum-sum-rectangle</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/stock-buy-and-sell-at-most-k-times</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/stock-buy-and-sell-at-most-two-times</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/min-cost-to-sort-strings-using-reversals</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/count-of-ap-subsequences</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/max-height-of-tree-any-node-root</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/longest-repeating-non-overlapping-substring</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/bitmasking-and-dp</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/traveling-salesman-problem</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/digit-dp</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://adityaverma.com/courses/dynamic-programming/problems/sum-over-subsets</loc>
<lastmod>2026-08-04</lastmod>
<changefreq>yearly</changefreq>
<priority>0.6</priority>
</url>
</urlset>
