<?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://pritsheth.com/notes/lru-cache/</loc>
<lastmod>2026-05-08T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/monotonic-stack-pattern/</loc>
<lastmod>2026-05-12T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/random-pick-weight/</loc>
<lastmod>2026-05-15T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/subsets-backtracking/</loc>
<lastmod>2026-05-15T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/trie-prefix-tree/</loc>
<lastmod>2026-05-15T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/two-heaps/</loc>
<lastmod>2026-05-15T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/backtracking/</loc>
<lastmod>2026-05-16T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/binary-search/</loc>
<lastmod>2026-05-16T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/complexity-reference/</loc>
<lastmod>2026-05-16T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/graph-algorithms/</loc>
<lastmod>2026-05-16T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/python-best-practices/</loc>
<lastmod>2026-05-16T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/sliding-window/</loc>
<lastmod>2026-05-16T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/tree-algorithms/</loc>
<lastmod>2026-05-16T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/trie/</loc>
<lastmod>2026-05-16T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/union-find/</loc>
<lastmod>2026-05-16T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/bit-manipulation/</loc>
<lastmod>2026-05-17T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/design-patterns/</loc>
<lastmod>2026-05-17T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/dynamic-programming/</loc>
<lastmod>2026-05-17T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/fenwick-tree/</loc>
<lastmod>2026-05-17T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/greedy-intervals/</loc>
<lastmod>2026-05-17T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/heap-patterns/</loc>
<lastmod>2026-05-17T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/monotonic-stack/</loc>
<lastmod>2026-05-17T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/string-algorithms/</loc>
<lastmod>2026-05-17T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/notes/two-pointers/</loc>
<lastmod>2026-05-17T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/blog/llm-ads-debug-agent/</loc>
<lastmod>2026-05-10T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/blog/welcome/</loc>
<lastmod>2026-05-14T00:00:00+00:00</lastmod>
</url>
<url>
<loc>https://pritsheth.com/case-study/ads-frequency-capping/</loc>
</url>
<url>
<loc>https://pritsheth.com/blog/</loc>
</url>
<url>
<loc>https://pritsheth.com/</loc>
</url>
<url>
<loc>https://pritsheth.com/notes/</loc>
</url>
<url>
<loc>https://pritsheth.com/assets/prit-sheth-cv.pdf</loc>
<lastmod>2026-05-18T06:39:02+00:00</lastmod>
</url>
</urlset>
