<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:news="http://www.google.com/schemas/sitemap-news/0.9" xmlns:xhtml="http://www.w3.org/1999/xhtml" xmlns:mobile="http://www.google.com/schemas/sitemap-mobile/1.0" xmlns:image="http://www.google.com/schemas/sitemap-image/1.1" xmlns:video="http://www.google.com/schemas/sitemap-video/1.1">
<url><loc>https://www.designgurus.io/problemset</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.8</priority></url>
<url><loc>https://www.designgurus.io/problemset/company/google</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.6</priority></url>
<url><loc>https://www.designgurus.io/problemset/company/meta</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.6</priority></url>
<url><loc>https://www.designgurus.io/problemset/company/amazon</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.6</priority></url>
<url><loc>https://www.designgurus.io/problemset/company/microsoft</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.6</priority></url>
<url><loc>https://www.designgurus.io/problemset/company/linkedin</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.6</priority></url>
<url><loc>https://www.designgurus.io/problemset/company/oracle</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.6</priority></url>
<url><loc>https://www.designgurus.io/problem/coding/sum-of-subarray-minimums-medium-1</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/coding/subarray-sum-equals-k-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/length-of-last-word-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/search-insert-position-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/repeated-substring-pattern-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/monotonic-array-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/count-nodes-equal-to-average-of-subtree-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/find-the-difference-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/how-many-numbers-are-smaller-than-the-current-number-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/binary-tree-paths-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/find-the-difference-of-two-arrays-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/merge-strings-alternately-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/01-matrix-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/maximum-points-you-can-obtain-from-cards-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/strobogrammatic-number-ii-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/maximum-length-of-semidecreasing-subarrays-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/minimum-area-rectangle-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/count-unreachable-pairs-of-nodes-in-an-undirected-graph-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/single-number-ii-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/4sum-ii-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/furthest-building-you-can-reach-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/minimizing-array-after-replacing-pairs-with-their-product-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/fair-distribution-of-cookies-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/rotate-image-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/arithmetic-slices-ii-subsequence-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/burst-balloons-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/sum-of-distances-in-tree-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/google/maximum-score-of-a-good-subarray-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/moving-average-from-data-stream-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/move-zeroes-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/missing-ranges-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/palindrome-permutation-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/rank-transform-of-an-array-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/basic-calculator-ii-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/nested-list-weight-sum-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/dot-product-of-two-sparse-vectors-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/max-consecutive-ones-iii-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/subarray-sum-equals-k-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/next-permutation-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/missing-element-in-sorted-array-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/number-of-substrings-containing-all-three-characters-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/capacity-to-ship-packages-within-d-days-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/count-and-say-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/contiguous-array-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/maximum-sum-of-3-nonoverlapping-subarrays-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/making-a-large-island-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/basic-calculator-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/serialize-and-deserialize-binary-tree-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/longest-increasing-path-in-a-matrix-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/meta/valid-palindrome-iii-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/path-crossing-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/special-array-with-x-elements-greater-than-or-equal-x-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/relative-sort-array-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/transpose-matrix-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/find-common-characters-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/fizz-buzz-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/increasing-order-search-tree-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/largest-odd-number-in-string-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/make-sum-divisible-by-p-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/rotting-oranges-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/minimum-deletions-to-make-character-frequencies-unique-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/minimum-adjacent-swaps-to-make-a-valid-array-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/reverse-integer-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/maximize-distance-to-closest-person-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/split-linked-list-in-parts-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/maximum-difference-between-node-and-ancestor-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/deepest-leaves-sum-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/the-kth-factor-of-n-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/coin-change-ii-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/sum-of-subarray-minimums-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/next-permutation-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/minimum-replacements-to-sort-the-array-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/count-all-valid-pickup-and-delivery-options-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/length-of-the-longest-valid-substring-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/count-array-pairs-divisible-by-k-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/amazon/word-ladder-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/buy-two-chocolates-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/root-equals-sum-of-children-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/excel-sheet-column-title-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/merge-strings-alternately-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/min-cost-climbing-stairs-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/plus-one-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/intersection-of-two-arrays-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/find-the-index-of-the-first-occurrence-in-a-string-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/score-of-parentheses-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/maximum-length-of-a-concatenated-string-with-unique-characters-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/inorder-successor-in-bst-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/distribute-coins-in-binary-tree-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/spiral-matrix-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/delete-node-in-a-bst-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/sum-of-subarray-minimums-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/rotate-image-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/combinations-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/maximum-level-sum-of-a-binary-tree-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/multiply-strings-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/best-time-to-buy-and-sell-stock-ii-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/next-permutation-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/count-unique-characters-of-all-substrings-of-a-given-string-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/word-ladder-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/word-ladder-ii-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/number-of-flowers-in-full-bloom-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/microsoft/median-of-two-sorted-arrays-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/linkedin/intersection-of-two-arrays-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/linkedin/remove-all-ones-with-row-and-column-flips-ii-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/linkedin/reverse-integer-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/linkedin/next-permutation-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/linkedin/word-ladder-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/linkedin/median-of-two-sorted-arrays-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/linkedin/serialize-and-deserialize-binary-tree-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/oracle/move-zeroes-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/oracle/excel-sheet-column-title-easy</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/oracle/rotting-oranges-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/oracle/delete-node-in-a-bst-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/oracle/spiral-matrix-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/oracle/next-permutation-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/oracle/basic-calculator-ii-medium</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/oracle/sudoku-solver-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
<url><loc>https://www.designgurus.io/problem/oracle/median-of-two-sorted-arrays-hard</loc><lastmod>2026-11-06T02:00:47.491Z</lastmod><priority>0.7</priority></url>
</urlset>