<?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://purushyb.github.io/posts/DSAbinarysearch/</loc>
<lastmod>2025-12-31T12:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/dsa-binarysearch/</loc>
<lastmod>2026-01-02T18:34:46+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/dsa-mergesort/</loc>
<lastmod>2026-01-02T18:34:46+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/dsa-quicksort/</loc>
<lastmod>2026-01-02T18:34:46+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/dsa-sliding-window-pattern/</loc>
<lastmod>2026-01-02T00:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/dsa-two-pointer-techniques/</loc>
<lastmod>2026-01-02T00:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/dsa-linked-list/</loc>
<lastmod>2026-01-03T00:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/dsa-binarytrees-traversal/</loc>
<lastmod>2026-01-05T00:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/binary-search-tree-kotlin/</loc>
<lastmod>2026-01-05T00:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/dsa-heaps/</loc>
<lastmod>2026-01-07T00:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/dsa-graph-algorithms/</loc>
<lastmod>2026-01-11T11:47:44+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/dsa-tries/</loc>
<lastmod>2026-01-11T11:47:44+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/dsa-union-find-disjointsets/</loc>
<lastmod>2026-01-14T19:35:39+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/general-algo-recursion/</loc>
<lastmod>2026-01-12T00:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/general-algo-dynamic-programming/</loc>
<lastmod>2026-01-16T22:39:44+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/general-algo-greedy-algorithms/</loc>
<lastmod>2026-01-16T22:39:44+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/general-algo-backtracking/</loc>
<lastmod>2026-01-16T22:34:28+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/leetcode-two-sum/</loc>
<lastmod>2026-01-17T21:15:36+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/leetcode-longest-common-substring/</loc>
<lastmod>2026-01-17T00:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/leetcode-longest-palindrome/</loc>
<lastmod>2026-01-18T00:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/leetcode-clone-graph/</loc>
<lastmod>2026-01-31T22:06:10+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/leetcode-container-with-most-water/</loc>
<lastmod>2026-01-20T00:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/leetcode-ransom-note/</loc>
<lastmod>2026-01-20T00:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/leetcode-string-to-integer-atoi/</loc>
<lastmod>2026-01-20T00:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/leetcode-linked-list-cycle-detection/</loc>
<lastmod>2026-01-31T22:16:40+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/leetcode-middle-node-linked-list/</loc>
<lastmod>2026-01-21T00:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/leetcode-word-break/</loc>
<lastmod>2026-01-21T00:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/leetcode-letter-combinations-of-phone-number/</loc>
<lastmod>2026-02-14T18:23:44+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/leetcode-linked-list-cycle/</loc>
<lastmod>2026-02-14T00:00:00+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/leetcode-middle-of-linked-list/</loc>
<lastmod>2026-02-14T18:23:44+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/posts/leetcode-rotten-oranges/</loc>
<lastmod>2026-02-14T18:23:44+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/categories/</loc>
<lastmod>2026-02-14T18:24:04+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/tags/</loc>
<lastmod>2026-02-14T18:24:04+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/archives/</loc>
<lastmod>2026-02-14T18:24:04+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/about/</loc>
<lastmod>2026-02-14T18:24:04+11:00</lastmod>
</url>
<url>
<loc>https://purushyb.github.io/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/dsa/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/binary-search/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/algorithms/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/tutorial/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/kotlin/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/sorting/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/mergesort/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/quicksort/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/sliding-window/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/arrays/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/optimization/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/two-pointers/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/interview-prep/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/linked-list/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/pointers/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/binary-tree/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/recursion/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/bfs/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/dfs/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/bst/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/binary-search-tree/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/heap/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/priority-queue/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/top-k/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/graphs/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/dijkstra/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/cycle-detection/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/trie/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/prefix-tree/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/autocomplete/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/dsu/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/union-find/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/graph/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/knapsack/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/lcs/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/dynamic-programming/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/dp/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/memoization/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/mst/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/kruskal/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/greedy-algorithms/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/backtracking/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/n-queens/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/sudoku/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/leetcode/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/hashmap/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/easy/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/strings/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/medium/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/palindrome/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/greedy/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/math/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/algorithm/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/middle-node/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/string-manipulation/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/oranges/</loc>
</url>
<url>
<loc>https://purushyb.github.io/tags/rotting/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/algorithms/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/kotlin/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/binary-search/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/merge-sort/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/quick-sort/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/sliding-window/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/two-pointer-manipulation/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/linked-list/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/binary-tree-traversals/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/binary-search-trees/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/heaps/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/graphs/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/tries/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/disjoint-set-union/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/general-algorithms/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/recursion/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/dynamic-programming/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/greedy-algorithms/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/backtracking/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/leetcode/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/two-sum/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/longest-common-substring/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/longest-palindromic-substring/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/clone-graphs/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/container-with-most-water/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/ransome-note/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/atoi/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/linked-list-cycle-detection/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/middle-of-linked-lists/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/word-break/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/string-manipulation/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/graph-algorithms/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/linked-lists/</loc>
</url>
<url>
<loc>https://purushyb.github.io/categories/breadth-first-search/</loc>
</url>
<url>
<loc>https://purushyb.github.io/page2/</loc>
</url>
<url>
<loc>https://purushyb.github.io/page3/</loc>
</url>
<url>
<loc>https://purushyb.github.io/page4/</loc>
</url>
</urlset>
