<?xml version="1.0" encoding="utf-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
    
        <url>
            <loc>https://notes.tanmaypathak.com/404/</loc>
            <lastmod>2026-02-03T03:02:35.652Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/building-for-ai/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/garden/dev-notes/git/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/garden/digital-garden/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/garden/home-lab/the-arr-stack/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/articles/20-patterns-to-master-dynamic-programming/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/articles/how-to-make-progress-while-studying-for-coding-interviews/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/articles/leet-code-was-hard-until-i-learned-these-15-patterns/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/cheatsheets/big-o-algorithm-complexity-cheat-sheet/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/cheatsheets/during-interview/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/cheatsheets/general-dsa-flowchart/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/cheatsheets/input-sizes-vs-time-complexity/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/cheatsheets/python-cheat-sheet-for-leetcode/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/cheatsheets/python-cheatsheet/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/cheatsheets/tech-interview-cheat-sheet/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/3-sum-closest/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/3-sum-smaller/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/best-time-to-buy-and-sell-stock-ii/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/binary-search/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/binary-tree-inorder-traversal/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/binary-tree-level-order-traversal/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/binary-tree-paths/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/binary-tree-postorder-traversal/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/binary-tree-preorder-traversal/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/binary-tree-right-side-view/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/binary-tree-zigzag-level-order-traversal/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/check-if-the-sentence-is-pangram/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/climbing-stairs/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/container-with-most-water/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/contains-duplicate-ii/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/contains-duplicate/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/convert-sorted-array-to-binary-search-tree/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/count-complete-tree-nodes/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/count-good-nodes-in-binary-tree/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/daily-temperatures/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/design-add-and-search-words-data-structure/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/diameter-of-a-binary-tree/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/encode-and-decode-strings/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/encode-and-decode-tiny-url/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/evaluate-reverse-polish-notation/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/find-first-and-last-position-of-element-in-sorted-array/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/find-minimum-in-a-rotated-sorted-array/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/find-peak-element/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/fruit-into-baskets/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/interview/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/templates/leetcode-problem/</loc>
            <lastmod>2026-02-03T03:02:35.653Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/patterns/code-templates/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/patterns/coding-interview-patterns/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/patterns/grokking-interview-topics/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/furthest-building-you-can-reach/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/group-anagrams/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/happy-number/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/implement-trie-prefix-tree/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/insert-interval/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/intersection-of-two-linked-lists/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/invert-binary-tree/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/is-subsequence/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/isomorphic-strings/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/k-closest-points-to-origin/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/kth-largest-element-in-a-stream/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/linked-list-cycle-ii/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/linked-list-cycle/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/longest-common-prefix/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/longest-consecutive-sequence/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/longest-substring-with-at-most-k-distinct-characters/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/longest-word-in-dictionary/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/majority-element/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/maximum-average-subarray-i/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/maximum-depth-of-binary-tree/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/maximum-number-of-balloons/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/maximum-subarray/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/maximum-width-of-binary-tree/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/merge-intervals/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/merge-sorted-array/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/merge-two-sorted-lists/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/middle-of-the-linked-list/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/min-stack/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/minimum-absolute-difference-in-bst/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/minimum-distance-between-bst-nodes/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/move-zeros/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/next-greater-element-i/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/number-of-good-pairs/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/number-of-islands/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/number-of-recent-calls/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/palindrome-linked-list/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/product-of-array-except-self/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/random-pick-with-weight/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/range-sum-query-immutable/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/ransom-note/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/rearrange-characters-to-make-target-string/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/remove-duplicates-from-sorted-array/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/reverse-linked-list-ii/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/reverse-linked-list/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/reverse-vowels/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/rotate-array/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/rotting-oranges/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/same-tree/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/search-insert-position/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/search-suggestions-system/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/search-a-2-d-matrix/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/search-in-rotated-sorted-array/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/shortest-word-distance/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/sqrt-x/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/squares-of-a-sorted-array/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/symmetric-tree/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/time-needed-to-buy-tickets/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/top-k-frequent-elements/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/two-sum-ii-array-is-sorted/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/two-sum/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/valid-anagram/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/valid-palindrome/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/questions/valid-sudoku/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/topics/array/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/topics/binary-search/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/topics/boyer-moore-voting/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/topics/depth-first-search/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/topics/depth-first-traversal/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/topics/dynamic-programming/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/topics/graphs/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/topics/kadane-s-algorithm/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/topics/monotonic-stack/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/topics/prefix-sum/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/topics/sorting-algorithms/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/topics/trie/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
        <url>
            <loc>https://notes.tanmaypathak.com/technical-interview/topics/two-pointers/</loc>
            <lastmod>2026-02-03T03:02:35.654Z</lastmod>
        </url>
    
</urlset>