<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
  <url>
    <loc>https://code.marc.tt</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>1.0</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/001-two-sum</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/002-add-two-numbers</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/003-longest-substring-without-repeating-characters</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/004-median-of-two-sorted-arrays</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/005-longest-palindromic-substring</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/007-reverse-integer</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/008-string-to-integer-(atoi)</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/010-regular-expression-matching</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/011-container-with-most-water</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/015-3sum</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/017-letter-combinations-of-a-phone-number</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/019-remove-nth-node-from-end-of-list</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/020-valid-parentheses</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/021-merge-two-sorted-lists</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/022-generate-parentheses</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/023-merge-k-sorted-lists</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/025-reverse-nodes-in-k-group</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/033-search-in-rotated-sorted-array</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/036-valid-sudoku</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/039-combination-sum</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/040-combination-sum-ii</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/042-trapping-rain-water</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/043-multiply-strings</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/045-jump-game-ii</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/046-permutations</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/048-rotate-image</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/049-group-anagrams</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/050-pow(x,-n)</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/051-n-queens</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/053-maximum-subarray</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/054-spiral-matrix</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/055-jump-game</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/056-merge-intervals</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/057-insert-interval</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/062-unique-paths</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/066-plus-one</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/067-add-binary</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/070-climbing-stairs</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/072-edit-distance</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/073-set-matrix-zeroes</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/074-search-a-2d-matrix</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/075-sort-colors</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/076-minimum-window-substring</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/078-subsets</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/079-word-search</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/084-largest-rectangle-in-histogram</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/090-subsets-ii</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/091-decode-ways</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/097-interleaving-string</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/098-validate-binary-search-tree</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/100-same-tree</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/102-binary-tree-level-order-traversal</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/104-maximum-depth-of-binary-tree</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/105-construct-binary-tree-from-preorder-and-inorder-traversal</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/110-balanced-binary-tree</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/112-path-sum</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/115-distinct-subsequences</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/121-best-time-to-buy-and-sell-stock</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/124-binary-tree-maximum-path-sum</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/125-valid-palindrome</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/127-word-ladder</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/128-longest-consecutive-sequence</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/130-surrounded-regions</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/131-palindrome-partitioning</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/133-clone-graph</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/134-gas-station</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/136-single-number</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/138-copy-list-with-random-pointer</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/139-word-break</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/141-linked-list-cycle</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/143-reorder-list</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/146-lru-cache</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/150-evaluate-reverse-polish-notation</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/152-maximum-product-subarray</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/153-find-minimum-in-rotated-sorted-array</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/155-min-stack</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/167-two-sum-ii---input-array-is-sorted</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/169-majority-element</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/190-reverse-bits</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/191-number-of-1-bits</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/198-house-robber</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/199-binary-tree-right-side-view</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/200-number-of-islands</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/202-happy-number</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/206-reverse-linked-list</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/207-course-schedule</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/208-implement-trie-(prefix-tree)</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/210-course-schedule-ii</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/211-design-add-and-search-words-data-structure</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/212-word-search-ii</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/213-house-robber-ii</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/215-kth-largest-element-in-an-array</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/217-contains-duplicate</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/224-basic-calculator</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/226-invert-binary-tree</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/230-kth-smallest-element-in-a-bst</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/232-implement-queue-using-stacks</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/235-lowest-common-ancestor-of-a-binary-search-tree</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/236-lowest-common-ancestor-of-a-binary-tree</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/238-product-of-array-except-self</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/239-sliding-window-maximum</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/242-valid-anagram</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/252-meeting-rooms</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/253-meeting-rooms-ii</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/261-graph-valid-tree</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/268-missing-number</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/269-alien-dictionary</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/271-encode-and-decode-strings</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/278-first-bad-version</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/286-walls-and-gates</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/287-find-the-duplicate-number</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/295-find-median-from-data-stream</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/297-serialize-and-deserialize-binary-tree</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/300-longest-increasing-subsequence</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/309-best-time-to-buy-and-sell-stock-with-cooldown</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/310-minimum-height-trees</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/312-burst-balloons</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/322-coin-change</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/323-number-of-connected-components-in-an-undirected-graph</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/329-longest-increasing-path-in-a-matrix</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/332-reconstruct-itinerary</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/338-counting-bits</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/347-top-k-frequent-elements</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/355-design-twitter</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/371-sum-of-two-integers</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/383-ransom-note</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/409-longest-palindrome</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/416-partition-equal-subset-sum</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/417-pacific-atlantic-water-flow</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/424-longest-repeating-character-replacement</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/435-non-overlapping-intervals</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/438-find-all-anagrams-in-a-string</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/460-lfu-cache</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/494-target-sum</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/518-coin-change-ii</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/542-01-matrix</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/543-diameter-of-binary-tree</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/560-subarray-sum-equals-k</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/567-permutation-in-string</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/572-subtree-of-another-tree</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/621-task-scheduler</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/647-palindromic-substrings</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/678-valid-parenthesis-string</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/684-redundant-connection</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/695-max-area-of-island</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/703-kth-largest-element-in-a-stream</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/704-binary-search</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/721-accounts-merge</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/733-flood-fill</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/739-daily-temperatures</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/743-network-delay-time</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/746-min-cost-climbing-stairs</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/763-partition-labels</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/778-swim-in-rising-water</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/787-cheapest-flights-within-k-stops</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/846-hand-of-straights</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/853-car-fleet</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/875-koko-eating-bananas</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/876-middle-of-the-linked-list</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/973-k-closest-points-to-origin</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/981-time-based-key-value-store</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/994-rotting-oranges</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/1046-last-stone-weight</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/1143-longest-common-subsequence</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/1235-maximum-profit-in-job-scheduling</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/1448-count-good-nodes-in-binary-tree</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/1584-min-cost-to-connect-all-points</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/1851-minimum-interval-to-include-each-query</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/1899-merge-triplets-to-form-target-triplet</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://code.marc.tt/problem/2013-detect-squares</loc>
    <lastmod>2025-10-07T12:10:13.645Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
</urlset>