<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://www.awelgorithms.com</loc>
<priority>1</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/check</loc>
<priority>0.9</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn</loc>
<priority>0.9</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/cohort</loc>
<priority>0.8</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/features</loc>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/pricing</loc>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/roadmap</loc>
<priority>0.5</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/roadmap/data-structures-and-algorithms</loc>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.8</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/create-a-hash-map</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/understand-key-versus-value</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/handle-an-empty-hash-map</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/distinguish-a-map-from-a-set</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/count-entries-in-a-hash-map</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/build-a-hash-map-from-pairs</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/put-a-key-value-pair</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/put-into-an-empty-map</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/overwrite-the-value-for-a-key</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/put-several-pairs</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/why-map-put-is-expected-o-1</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/get-the-value-for-a-key</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/miss-a-map-key</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/get-is-not-a-search-by-value</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/supply-a-default-for-a-missing-key</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/distinguish-a-missing-key-from-value-zero</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/check-whether-a-map-contains-a-key</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/contains-key-versus-contains-value</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/keys-are-unique-values-need-not-be</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/test-has-key-before-get</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/remove-a-key-from-a-map</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/remove-a-missing-map-key</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/remove-the-last-map-entry</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/why-map-delete-is-expected-o-1</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/build-a-frequency-map</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/increment-the-count-for-a-key</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/decrement-a-count-and-maybe-remove</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/find-the-most-frequent-key</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/compare-two-frequency-maps</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/group-values-by-a-key</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/group-indices-per-value</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/append-to-a-list-under-a-key</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/overwrite-is-the-grouping-bug</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/map-a-value-to-its-first-index</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/map-a-value-to-its-last-index</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/two-sum-with-a-value-to-index-map</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/pick-an-index-map-when-position-matters</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/update-a-map-value-in-place</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/put-if-the-key-is-absent</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/merge-two-maps</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/compute-a-value-from-the-previous</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/iterate-the-keys-of-a-map</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/iterate-the-values-of-a-map</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/iterate-key-value-pairs</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/do-not-assume-map-iteration-order</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/hash-a-map-key-to-a-bucket</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/collision-chains-store-pairs</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/map-keys-must-be-immutable</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/expected-o-1-map-get-versus-worst-o-n</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/membership-only-is-a-set</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/tiny-alphabet-is-an-array</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/pick-a-tree-map-when-keys-must-stay-sorted</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/values-without-keys-is-a-list</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/store-a-map-of-maps</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/pair-keys-need-a-composite</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/serialize-a-pair-as-a-key</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/nested-get-with-a-missing-inner-map</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/copy-a-hash-map</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/compare-two-hash-maps</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/map-equality-is-key-and-value</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/prove-a-map-copy-does-not-share-storage</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/recognize-expected-o-1-map-get</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/extra-space-of-a-hash-map</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/build-a-map-in-linear-time</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/nested-scan-versus-a-map</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/recognize-a-key-value-query</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/recognize-a-frequency-query</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/decide-map-versus-set</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/decide-map-versus-array-table</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/hash-maps/draw-the-map-after-each-operation</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.8</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/place-opposite-end-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/place-same-direction-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/place-a-slow-pointer-and-a-fast-pointer</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/initialize-left-at-the-start</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/initialize-right-at-the-last-index</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/start-both-pointers-on-the-same-cell</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/give-each-sequence-its-own-pointer</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/close-the-gap-from-both-ends</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/advance-only-the-left-end</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/advance-only-the-right-end</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/decide-which-end-to-advance</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/stop-when-the-pointers-meet</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/stop-when-the-pointers-cross</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/leave-a-one-cell-gap-between-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/advance-the-lead-pointer-first</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/catch-up-with-the-trail-pointer</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/keep-a-fixed-gap-between-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/grow-the-gap-between-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/shrink-the-gap-between-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/never-let-the-trail-pass-the-lead</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/read-the-pair-at-both-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/accept-a-pair-and-record-it</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/reject-a-pair-and-move-on</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/count-valid-pairs-without-listing-them</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/deduplicate-pairs-at-both-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/target-sum-with-opposite-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/closest-sum-with-opposite-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/require-sorted-order-before-facing-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/move-left-when-the-pair-sum-is-too-small</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/move-right-when-the-pair-sum-is-too-large</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/exploit-monotonic-pair-sums</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/fix-one-index-then-face-the-rest</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/skip-equal-neighbors-after-a-hit</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/keep-a-write-pointer-behind-the-read</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/write-a-kept-value-then-advance-write</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/skip-a-dropped-value-without-writing</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/compact-in-one-forward-pass</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/the-write-pointer-is-the-logical-length</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/overwrite-is-legal-because-write-lags-read</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/meet-in-the-middle-to-partition</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/scan-from-left-for-a-misplace</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/scan-from-right-for-a-misplace</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/swap-the-two-misplaced-values</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/dutch-flag-with-three-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/the-pivot-is-a-third-pointer</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/one-pointer-per-sorted-sequence</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/advance-the-sequence-with-the-smaller-head</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/drain-the-leftover-sequence</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/merge-two-sequences-with-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/intersect-two-sequences-with-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/difference-of-two-sequences-with-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/walk-two-list-pointers-in-lockstep</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/give-one-list-pointer-a-head-start</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/fast-and-slow-on-a-cycle</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/fast-and-slow-to-the-middle</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/meet-then-restart-from-the-head</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/draw-both-indices-after-each-move</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/prove-the-discarded-side-is-useless</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/prove-no-valid-pair-was-skipped</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/count-remaining-cells-between-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/recognize-an-o-n-two-pointer-scan</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/nested-two-pointer-is-still-quadratic</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/extra-space-of-two-indices</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/sorting-then-two-pointers-versus-a-hash</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/each-element-is-touched-a-constant-times</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/recognize-an-opposite-end-search</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/recognize-a-same-direction-trail</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/decide-two-pointers-versus-a-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/decide-two-pointers-versus-a-hash-set</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/two-pointers/draw-the-pointers-before-coding</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.8</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/a-window-is-a-contiguous-range</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/name-the-left-edge-of-a-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/name-the-right-edge-of-a-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/window-length-is-right-minus-left-plus-one</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/empty-window-versus-one-cell-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/window-over-an-empty-sequence</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/grow-the-window-by-moving-right</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/include-the-new-rightmost-cell</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/update-window-state-on-include</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/expand-until-a-constraint-is-met</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/expand-across-the-whole-array</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/expand-is-the-only-way-the-right-edge-moves</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/shrink-the-window-by-moving-left</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/exclude-the-old-leftmost-cell</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/update-window-state-on-exclude</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/shrink-while-the-window-is-invalid</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/shrink-to-the-smallest-valid-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/left-never-passes-right-in-a-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/fix-the-window-length-in-advance</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/seed-the-first-k-cells</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/slide-by-dropping-left-and-adding-right</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/fixed-length-pairs-include-with-exclude</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/the-last-window-ends-at-the-last-index</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/length-is-discovered-not-given</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/expand-first-then-shrink</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/the-valid-window-is-a-candidate</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/track-the-best-valid-length</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/track-the-best-valid-bounds</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/restart-is-not-the-same-as-shrink</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/maintain-the-sum-of-the-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/maintain-counts-inside-the-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/maintain-distinct-count-in-the-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/maintain-min-or-max-of-the-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/recompute-versus-incremental-window-update</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/invalid-window-still-has-a-defined-state</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/at-most-k-distinct-in-the-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/at-most-k-replacements-in-the-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/at-most-k-zeros-in-the-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/cover-every-required-character</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/all-unique-characters-in-the-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/window-product-stays-under-a-limit</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/longest-valid-window-expands-greedily</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/shortest-valid-window-shrinks-greedily</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/record-the-answer-when-the-window-is-valid</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/do-not-record-an-invalid-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/equal-length-ties-pick-first-or-last</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/window-on-characters-not-words</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/anagram-window-has-a-fixed-length</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/covering-window-has-a-requirement-map</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/unique-character-window-shrinks-on-a-repeat</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/alphabet-size-bounds-the-window-counts</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/draw-left-and-right-after-each-window-move</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/print-the-window-contents-at-a-candidate</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/prove-a-discarded-prefix-cannot-return</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/count-how-many-times-each-index-is-a-window-edge</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/each-index-enters-the-window-once</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/each-index-leaves-the-window-once</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/recognize-an-amortized-linear-window-scan</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/extra-space-of-the-window-state</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/deque-extrema-are-still-one-pass</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/translate-contiguous-into-a-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/decide-fixed-versus-variable-window-length</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/decide-longest-versus-shortest-window</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/decide-window-versus-prefix-sums</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/sliding-window/decide-window-versus-two-pointers</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.8</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/create-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/understand-lifo</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/identify-the-top</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/handle-an-empty-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/distinguish-top-from-the-rest</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/count-items-on-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/build-a-stack-from-values</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/push-one-value</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/push-onto-an-empty-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/push-onto-a-nonempty-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/push-several-values-in-order</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/keep-the-new-top-after-push</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/why-stack-push-is-o-1</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/pop-the-top</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/pop-from-a-one-item-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/reject-pop-from-empty</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/pop-several-values-in-order</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/return-the-popped-value</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/why-stack-pop-is-o-1</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/peek-the-top</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/peek-does-not-remove</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/check-whether-a-stack-is-empty</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/read-the-stack-size</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/reject-peek-on-empty</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/store-a-stack-in-an-array</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/keep-a-top-index</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/push-by-writing-then-incrementing</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/pop-by-decrementing-then-reading</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/grow-the-backing-array</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/handle-stack-overflow</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/store-a-stack-as-a-linked-list</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/push-as-insert-at-head</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/pop-as-delete-the-head</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/treat-head-as-the-top</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/empty-list-is-empty-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/trace-a-sequence-of-pushes-and-pops</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/reconstruct-remaining-stack-items</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/decide-if-a-pop-sequence-is-valid</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/simulate-interleaved-stack-operations</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/read-the-stack-from-bottom-to-top</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/reverse-an-array-with-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/reverse-a-string-with-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/reverse-a-list-with-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/why-a-stack-reverses-order</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/restore-by-reversing-twice</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/push-an-opening-bracket</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/pop-on-a-matching-closer</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/reject-a-mismatched-closer</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/reject-leftover-openings</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/handle-multiple-bracket-types</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/treat-an-empty-string-as-balanced</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/track-nesting-depth-with-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/match-the-nearest-opener</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/parse-nested-pairs</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/stop-at-the-matching-closer</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/distinguish-nested-from-adjacent-pairs</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/pop-while-the-top-fails-a-condition</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/leave-the-first-valid-top</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/empty-the-stack-with-pop-while</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/pop-while-for-next-greater</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/pop-while-for-next-smaller</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/push-operands</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/apply-an-operator-to-two-pops</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/evaluate-postfix-with-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/convert-infix-to-postfix</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/handle-operator-precedence-with-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/store-pairs-on-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/track-the-running-minimum</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/push-a-value-and-a-min</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/pop-and-restore-the-previous-min</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/track-extra-state-alongside-values</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/treat-pop-as-undo-of-push</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/replay-a-log-of-stack-operations</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/undo-the-last-mutation</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/simulate-a-process-with-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/checkpoint-and-rollback-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/use-two-stacks-together</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/transfer-from-one-stack-to-another</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/implement-a-queue-with-two-stacks</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/compare-two-stack-tops</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/split-work-between-two-stacks</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/see-recursion-as-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/push-a-frame-on-a-call</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/pop-a-frame-on-return</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/read-the-current-frame</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/convert-recursion-to-an-explicit-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/find-the-next-greater-with-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/find-the-next-smaller-with-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/scan-left-to-right-pushing-indices</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/write-answers-when-popping</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/handle-no-greater-as-a-sentinel</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/decode-a-nested-repeat-string</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/push-counts-and-fragments</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/expand-when-a-closer-arrives</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/build-output-from-popped-pieces</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/resolve-opposing-items-with-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/pop-while-the-top-loses</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/push-survivors</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/leave-equal-strength-annihilation</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/copy-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/compare-two-stacks</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/copy-without-reversing</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/prove-a-stack-copy-does-not-share-storage</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/recognize-o-1-push-and-pop</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/recognize-amortized-o-n-pop-while</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/count-extra-space-of-a-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/avoid-scanning-under-the-top</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/compare-array-vs-list-stack-costs</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/recognize-a-lifo-dependency</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/decide-what-to-store-on-the-stack</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/decide-values-vs-indices-vs-pairs</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/identify-matching-opener-problems</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/identify-next-greater-problems</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/learn/stacks/draw-the-stack-after-each-operation</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.6</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/hash-maps</loc>
<lastmod>2026-10-15T00:00:00.000Z</lastmod>
<priority>0.8</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/hash-sets</loc>
<lastmod>2026-10-15T00:00:00.000Z</lastmod>
<priority>0.8</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/arrays</loc>
<lastmod>2026-10-15T00:00:00.000Z</lastmod>
<priority>0.8</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/two-pointers</loc>
<lastmod>2026-10-15T00:00:00.000Z</lastmod>
<priority>0.8</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/sliding-window</loc>
<lastmod>2026-10-15T00:00:00.000Z</lastmod>
<priority>0.8</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/hash-maps/two-sum</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/hash-maps/valid-anagram</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/hash-maps/group-anagrams</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/hash-sets/contains-duplicate</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/hash-sets/intersection-of-two-arrays</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/hash-sets/happy-number</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/arrays/best-time-to-buy-and-sell-stock</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/arrays/rotate-array</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/arrays/merge-sorted-array</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/arrays/move-zeroes</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/arrays/product-of-array-except-self</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/two-pointers/valid-palindrome</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/two-pointers/two-sum-ii-input-array-is-sorted</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/two-pointers/3sum</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/two-pointers/container-with-most-water</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/sliding-window/maximum-average-subarray-i</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/sliding-window/longest-substring-without-repeating-characters</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/sliding-window/minimum-size-subarray-sum</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
<url>
<loc>https://www.awelgorithms.com/problems/sliding-window/max-consecutive-ones-iii</loc>
<lastmod>2026-10-07T00:00:00.000Z</lastmod>
<priority>0.7</priority>
</url>
</urlset>
