<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://impol.dev/</loc>
<changefreq>weekly</changefreq>
<priority>1</priority>
</url>
<url>
<loc>https://impol.dev/problems</loc>
<changefreq>daily</changefreq>
<priority>0.95</priority>
</url>
<url>
<loc>https://impol.dev/problems/lists/warm-up</loc>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://impol.dev/problems/lists/interview-core</loc>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://impol.dev/problems/lists/advanced</loc>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://impol.dev/problems/lists/premium</loc>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://impol.dev/course</loc>
<changefreq>weekly</changefreq>
<priority>0.9</priority>
</url>
<url>
<loc>https://impol.dev/premium</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/privacy</loc>
<changefreq>yearly</changefreq>
<priority>0.3</priority>
</url>
<url>
<loc>https://impol.dev/terms</loc>
<changefreq>yearly</changefreq>
<priority>0.3</priority>
</url>
<url>
<loc>https://impol.dev/course/foundations/complexity</loc>
<changefreq>monthly</changefreq>
<priority>0.85</priority>
</url>
<url>
<loc>https://impol.dev/course/arrays-hashing/arrays-basics</loc>
<changefreq>monthly</changefreq>
<priority>0.85</priority>
</url>
<url>
<loc>https://impol.dev/course/arrays-hashing/hashing</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/course/linear-patterns/two-pointers</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/course/linear-patterns/sliding-window</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/course/linear-patterns/stacks-queues</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/course/nodes-trees/linked-lists</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/course/nodes-trees/binary-trees</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/course/search-graphs/binary-search-heaps</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/course/search-graphs/graphs</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/course/search-graphs/backtracking</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/course/dynamic-programming/one-d-dp</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/course/dynamic-programming/two-d-dp</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/course/greedy-optimization/greedy-choices</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/course/greedy-optimization/optimization-with-constraints</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/course/math-bits/number-theory-lite</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/course/math-bits/bit-manipulation</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/course/design/stateful-classes</loc>
<changefreq>monthly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-domino-rotations-for-equal-row/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-domino-rotations-for-equal-row/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/complement-of-base-10-integer/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/complement-of-base-10-integer/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/smallest-integer-divisible-by-k/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/smallest-integer-divisible-by-k/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/binary-prefix-divisible-by-5/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/binary-prefix-divisible-by-5/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/sum-of-root-to-leaf-binary-numbers/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/sum-of-root-to-leaf-binary-numbers/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-score-triangulation-of-polygon/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-score-triangulation-of-polygon/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/lexicographically-smallest-equivalent-string/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/lexicographically-smallest-equivalent-string/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/container-with-most-water/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/container-with-most-water/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/balanced-binary-tree/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/balanced-binary-tree/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/lowest-common-ancestor-of-deepest-leaves/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/lowest-common-ancestor-of-deepest-leaves/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-equivalent-domino-pairs/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-equivalent-domino-pairs/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-level-sum-of-a-binary-tree/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-level-sum-of-a-binary-tree/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/pascals-triangle/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/pascals-triangle/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/triangle/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/triangle/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-absolute-difference/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-absolute-difference/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/remove-sub-folders-from-the-filesystem/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/remove-sub-folders-from-the-filesystem/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/greatest-sum-divisible-by-three/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/greatest-sum-divisible-by-three/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-time-visiting-all-points/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-time-visiting-all-points/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-square-submatrices-with-all-ones/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-square-submatrices-with-all-ones/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/convert-binary-number-in-a-linked-list-to-integer/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/convert-binary-number-in-a-linked-list-to-integer/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-numbers-with-even-number-of-digits/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-numbers-with-even-number-of-digits/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-candies-you-can-get-from-boxes/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-candies-you-can-get-from-boxes/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-n-unique-integers-sum-up-to-zero/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-n-unique-integers-sum-up-to-zero/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/convert-integer-to-the-sum-of-two-no-zero-integers/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/convert-integer-to-the-sum-of-two-no-zero-integers/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-distance-to-type-a-word-using-two-fingers/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-distance-to-type-a-word-using-two-fingers/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-69-number/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-69-number/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-product-of-splitted-binary-tree/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-product-of-splitted-binary-tree/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/candy/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/candy/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-negative-numbers-in-a-sorted-matrix/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-negative-numbers-in-a-sorted-matrix/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-number-of-events-that-can-be-attended/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-number-of-events-that-can-be-attended/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/sort-integers-by-the-number-of-1-bits/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/sort-integers-by-the-number-of-1-bits/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/balance-a-binary-search-tree/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/balance-a-binary-search-tree/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/four-divisors/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/four-divisors/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/check-if-there-is-a-valid-path-in-a-grid/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/check-if-there-is-a-valid-path-in-a-grid/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-lucky-integer-in-an-array/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-lucky-integer-in-an-array/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-largest-group/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-largest-group/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-ways-to-paint-n-3-grid/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-ways-to-paint-n-3-grid/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/max-difference-you-can-get-from-changing-an-integer/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/max-difference-you-can-get-from-changing-an-integer/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/check-if-all-1s-are-at-least-length-k-places-away/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/check-if-all-1s-are-at-least-length-k-places-away/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/max-dot-product-of-two-subsequences/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/max-dot-product-of-two-subsequences/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/check-if-a-string-contains-all-binary-codes-of-size-k/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/check-if-a-string-contains-all-binary-codes-of-size-k/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/avoid-flood-in-the-city/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/avoid-flood-in-the-city/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-subarray-of-1s-after-deleting-one-element/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-subarray-of-1s-after-deleting-one-element/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-submatrices-with-all-ones/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-submatrices-with-all-ones/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-substrings-with-only-1s/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-substrings-with-only-1s/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/water-bottles/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/water-bottles/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-odd-numbers-in-an-interval-range/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-odd-numbers-in-an-interval-range/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-good-triplets/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-good-triplets/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-swaps-to-arrange-a-binary-grid/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-swaps-to-arrange-a-binary-grid/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/three-consecutive-odds/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/three-consecutive-odds/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/detect-cycles-in-2d-grid/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/detect-cycles-in-2d-grid/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-time-to-make-rope-colorful/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-time-to-make-rope-colorful/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/special-positions-in-a-binary-matrix/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/special-positions-in-a-binary-matrix/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/make-sum-divisible-by-p/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/make-sum-divisible-by-p/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-non-negative-product-in-a-matrix/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-non-negative-product-in-a-matrix/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-one-bit-operations-to-make-integers-zero/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-one-bit-operations-to-make-integers-zero/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/fancy-sequence/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/fancy-sequence/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/lexicographically-smallest-string-after-applying-operations/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/lexicographically-smallest-string-after-applying-operations/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/compare-version-numbers/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/compare-version-numbers/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-deletions-to-make-string-balanced/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-deletions-to-make-string-balanced/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/fraction-to-recurring-decimal/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/fraction-to-recurring-decimal/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/concatenation-of-consecutive-binary-numbers/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/concatenation-of-consecutive-binary-numbers/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/partitioning-into-minimum-number-of-deci-binary-numbers/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/partitioning-into-minimum-number-of-deci-binary-numbers/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-erasure-value/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-erasure-value/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/calculate-money-in-impoldev-bank/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/calculate-money-in-impoldev-bank/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-score-from-removing-substrings/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-score-from-removing-substrings/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimize-hamming-distance-after-swap-operations/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimize-hamming-distance-after-swap-operations/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/largest-submatrix-with-rearrangements/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/largest-submatrix-with-rearrangements/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-number-of-people-to-teach/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-number-of-people-to-teach/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-number-of-events-that-can-be-attended-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-number-of-events-that-can-be-attended-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-changes-to-make-alternating-binary-string/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-changes-to-make-alternating-binary-string/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/check-if-binary-string-has-at-most-one-segment-of-ones/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/check-if-binary-string-has-at-most-one-segment-of-ones/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-average-pass-ratio/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-average-pass-ratio/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-distance-to-the-target-element/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-distance-to-the-target-element/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-distance-between-a-pair-of-values/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-distance-between-a-pair-of-values/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/largest-color-value-in-a-directed-graph/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/largest-color-value-in-a-directed-graph/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/sum-of-all-subset-xor-totals/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/sum-of-all-subset-xor-totals/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/finding-pairs-with-a-certain-sum/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/finding-pairs-with-a-certain-sum/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimize-maximum-pair-sum-in-array/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimize-maximum-pair-sum-in-array/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/get-biggest-three-rhombus-sums-in-a-grid/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/get-biggest-three-rhombus-sums-in-a-grid/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/determine-whether-matrix-can-be-obtained-by-rotation/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/determine-whether-matrix-can-be-obtained-by-rotation/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-number-of-flips-to-make-the-binary-string-alternating/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-number-of-flips-to-make-the-binary-string-alternating/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/largest-magic-square/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/largest-magic-square/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/reverse-bits/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/reverse-bits/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/the-earliest-and-latest-rounds-where-players-compete/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/the-earliest-and-latest-rounds-where-players-compete/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/design-movie-rental-system/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/design-movie-rental-system/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/build-array-from-permutation/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/build-array-from-permutation/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-good-numbers/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-good-numbers/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-square-sum-triples/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-square-sum-triples/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/unique-length-3-palindromic-subsequences/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/unique-length-3-palindromic-subsequences/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/painting-a-grid-with-three-different-colors/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/painting-a-grid-with-three-different-colors/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-number-of-words-you-can-type/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-number-of-words-you-can-type/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/delete-duplicate-folders-in-system/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/delete-duplicate-folders-in-system/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/delete-characters-to-make-fancy-string/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/delete-characters-to-make-fancy-string/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/last-day-where-you-can-still-cross/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/last-day-where-you-can-still-cross/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-matrix-sum/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-matrix-sum/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-unique-binary-string/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-unique-binary-string/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-difference-between-highest-and-lowest-of-k-scores/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-difference-between-highest-and-lowest-of-k-scores/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/final-value-of-variable-after-performing-operations/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/final-value-of-variable-after-performing-operations/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-subsequence-repeated-k-times/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-subsequence-repeated-k-times/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-difference-between-increasing-elements/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-difference-between-increasing-elements/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-operations-to-make-a-uni-value-grid/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-operations-to-make-a-uni-value-grid/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/kth-smallest-product-of-two-sorted-arrays/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/kth-smallest-product-of-two-sorted-arrays/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/simple-bank-system/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/simple-bank-system/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-number-of-maximum-bitwise-or-subsets/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-number-of-maximum-bitwise-or-subsets/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/next-greater-numerically-balanced-number/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/next-greater-numerically-balanced-number/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/two-best-non-overlapping-events/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/two-best-non-overlapping-events/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/walking-robot-simulation-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/walking-robot-simulation-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-number-of-tasks-you-can-assign/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-number-of-tasks-you-can-assign/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/decode-the-slanted-ciphertext/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/decode-the-slanted-ciphertext/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/two-furthest-houses-with-different-colors/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/two-furthest-houses-with-different-colors/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/sum-of-k-mirror-numbers/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/sum-of-k-mirror-numbers/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-all-people-with-secret/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-all-people-with-secret/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/finding-3-digit-even-numbers/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/finding-3-digit-even-numbers/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-subsequence-of-length-k-with-the-largest-sum/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-subsequence-of-length-k-with-the-largest-sum/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-fruits-harvested-after-at-most-k-steps/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-fruits-harvested-after-at-most-k-steps/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-smooth-descent-periods-of-a-stock/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-smooth-descent-periods-of-a-stock/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-laser-beams-in-a-bank/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-laser-beams-in-a-bank/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-palindrome-by-concatenating-two-letter-words/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-palindrome-by-concatenating-two-letter-words/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/divide-a-string-into-groups-of-size-k/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/divide-a-string-into-groups-of-size-k/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/solving-questions-with-brainpower/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/solving-questions-with-brainpower/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-running-time-of-n-computers/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-running-time-of-n-computers/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-the-hidden-sequences/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-the-hidden-sequences/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-ways-to-divide-a-long-corridor/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-ways-to-divide-a-long-corridor/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/keep-multiplying-found-values-by-two/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/keep-multiplying-found-values-by-two/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-difference-in-sums-after-removal-of-elements/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-difference-in-sums-after-removal-of-elements/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-operations-to-obtain-zero/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-operations-to-obtain-zero/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-equal-and-divisible-pairs-in-an-array/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-equal-and-divisible-pairs-in-an-array/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/replace-non-coprime-numbers-in-array/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/replace-non-coprime-numbers-in-array/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-all-k-distant-indices-in-an-array/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-all-k-distant-indices-in-an-array/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-hills-and-valleys-in-an-array/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-hills-and-valleys-in-an-array/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-collisions-on-a-road/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-collisions-on-a-road/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-triangular-sum-of-an-array/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-triangular-sum-of-an-array/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-unguarded-cells-in-the-grid/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-unguarded-cells-in-the-grid/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/largest-3-same-digit-number-in-string/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/largest-3-same-digit-number-in-string/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-resultant-array-after-removing-anagrams/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-resultant-array-after-removing-anagrams/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/partition-array-such-that-maximum-difference-is-k/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/partition-array-such-that-maximum-difference-is-k/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/successful-pairs-of-spells-and-potions/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/successful-pairs-of-spells-and-potions/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-subarrays-with-score-less-than-k/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-subarrays-with-score-less-than-k/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/power-of-two/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/power-of-two/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-binary-subsequence-less-than-or-equal-to-k/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-binary-subsequence-less-than-or-equal-to-k/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-score-after-removals-on-a-tree/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-score-after-removals-on-a-tree/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-people-aware-of-a-secret/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-people-aware-of-a-secret/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-zero-filled-subarrays/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/number-of-zero-filled-subarrays/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/design-a-food-rating-system/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/design-a-food-rating-system/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-closest-node-to-given-two-nodes/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-closest-node-to-given-two-nodes/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/meeting-rooms-iii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/meeting-rooms-iii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-matching-of-players-with-trainers/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-matching-of-players-with-trainers/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/smallest-subarrays-with-maximum-bitwise-or/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/smallest-subarrays-with-maximum-bitwise-or/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-subarray-with-maximum-bitwise-and/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-subarray-with-maximum-bitwise-and/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/using-a-robot-to-print-the-lexicographically-smallest-string/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/using-a-robot-to-print-the-lexicographically-smallest-string/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/paths-in-matrix-whose-sum-is-divisible-by-k/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/paths-in-matrix-whose-sum-is-divisible-by-k/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/range-product-queries-of-powers/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/range-product-queries-of-powers/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-subarrays-with-fixed-bounds/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-subarrays-with-fixed-bounds/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/words-within-two-edits-of-dictionary/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/words-within-two-edits-of-dictionary/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-total-distance-traveled/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-total-distance-traveled/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-penalty-for-a-shop/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-penalty-for-a-shop/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/shortest-distance-to-target-string-in-a-circular-array/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/shortest-distance-to-target-string-in-a-circular-array/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-the-minimum-powered-city/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-the-minimum-powered-city/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/increment-submatrices-by-one/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/increment-submatrices-by-one/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-the-number-of-good-subarrays/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-the-number-of-good-subarrays/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/rearranging-fruits/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/rearranging-fruits/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-the-number-of-fair-pairs/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-the-number-of-fair-pairs/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-difference-by-remapping-a-digit/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-difference-by-remapping-a-digit/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-string-with-lcp/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-string-with-lcp/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/smallest-missing-non-negative-integer-after-operations/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/smallest-missing-non-negative-integer-after-operations/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/sum-of-distances/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/sum-of-distances/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimize-the-maximum-difference-of-pairs/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimize-the-maximum-difference-of-pairs/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-number-of-operations-to-make-all-array-elements-equal-to-1/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-number-of-operations-to-make-all-array-elements-equal-to-1/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-operations-to-make-the-integer-zero/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-operations-to-make-the-integer-zero/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/robot-collisions/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/robot-collisions/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/sort-vowels-in-a-string/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/sort-vowels-in-a-string/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/ways-to-express-an-integer-as-sum-of-powers/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/ways-to-express-an-integer-as-sum-of-powers/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-complete-subarrays-in-an-array/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-complete-subarrays-in-an-array/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/furthest-point-from-origin/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/furthest-point-from-origin/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/check-if-strings-can-be-made-equal-with-operations-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/check-if-strings-can-be-made-equal-with-operations-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/check-if-strings-can-be-made-equal-with-operations-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/check-if-strings-can-be-made-equal-with-operations-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-symmetric-integers/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-symmetric-integers/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-of-interesting-subarrays/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-of-interesting-subarrays/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-number-of-k-divisible-components/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-number-of-k-divisible-components/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-value-of-an-ordered-triplet-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-value-of-an-ordered-triplet-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-value-of-an-ordered-triplet-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-value-of-an-ordered-triplet-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/divisible-and-non-divisible-sums-difference/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/divisible-and-non-divisible-sums-difference/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-unequal-adjacent-groups-subsequence-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-unequal-adjacent-groups-subsequence-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-unequal-adjacent-groups-subsequence-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-unequal-adjacent-groups-subsequence-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/construct-product-matrix/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/construct-product-matrix/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/distribute-candies-among-children-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/distribute-candies-among-children-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-words-containing-character/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-words-containing-character/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-area-of-square-hole-in-grid/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-area-of-square-hole-in-grid/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/matrix-similarity-after-cyclic-shifts/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/matrix-similarity-after-cyclic-shifts/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-subarrays-where-max-element-appears-at-least-k-times/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-subarrays-where-max-element-appears-at-least-k-times/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/divide-array-into-arrays-with-max-difference/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/divide-array-into-arrays-with-max-difference/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-square-area-by-removing-fences-from-a-field/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-square-area-by-removing-fences-from-a-field/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-cost-to-convert-string-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-cost-to-convert-string-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-cost-to-convert-string-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-cost-to-convert-string-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-area-of-longest-diagonal-rectangle/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-area-of-longest-diagonal-rectangle/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-the-number-of-partitions-after-operations/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-the-number-of-partitions-after-operations/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-elements-with-maximum-frequency/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-elements-with-maximum-frequency/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/divide-an-array-into-subarrays-with-minimum-cost-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/divide-an-array-into-subarrays-with-minimum-cost-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/divide-an-array-into-subarrays-with-minimum-cost-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/divide-an-array-into-subarrays-with-minimum-cost-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/alice-and-bob-playing-flower-game/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/alice-and-bob-playing-flower-game/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/type-of-triangle/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/type-of-triangle/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-number-of-ways-to-place-people-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-number-of-ways-to-place-people-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-number-of-ways-to-place-people-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-number-of-ways-to-place-people-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-largest-area-of-square-inside-two-rectangles/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-largest-area-of-square-inside-two-rectangles/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-maximum-sum-of-node-values/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-maximum-sum-of-node-values/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-submatrices-with-top-left-element-and-sum-less-than-k/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-submatrices-with-top-left-element-and-sum-less-than-k/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/apple-redistribution-into-boxes/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/apple-redistribution-into-boxes/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-happiness-of-selected-children/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-happiness-of-selected-children/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-deletions-to-make-string-k-special/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-deletions-to-make-string-k-special/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/water-bottles-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/water-bottles-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-all-possible-stable-binary-arrays-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-all-possible-stable-binary-arrays-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-all-possible-stable-binary-arrays-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-all-possible-stable-binary-arrays-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/valid-word/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/valid-word/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/taking-maximum-energy-from-the-mystic-dungeon/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/taking-maximum-energy-from-the-mystic-dungeon/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/lexicographically-minimum-string-after-removing-stars/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/lexicographically-minimum-string-after-removing-stars/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-total-damage-with-spell-casting/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-total-damage-with-spell-casting/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-minimum-area-to-cover-all-ones-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-minimum-area-to-cover-all-ones-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-minimum-area-to-cover-all-ones-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-minimum-area-to-cover-all-ones-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-maximum-length-of-valid-subsequence-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-maximum-length-of-valid-subsequence-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-maximum-length-of-valid-subsequence-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-maximum-length-of-valid-subsequence-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-submatrices-with-equal-frequency-of-x-and-y/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-submatrices-with-equal-frequency-of-x-and-y/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/delete-nodes-from-linked-list-present-in-array/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/delete-nodes-from-linked-list-present-in-array/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/vowels-game-in-a-string/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/vowels-game-in-a-string/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-number-of-operations-to-move-ones-to-the-end/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-number-of-operations-to-move-ones-to-the-end/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-the-number-of-substrings-with-dominant-ones/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-the-number-of-substrings-with-dominant-ones/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/power-of-three/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/power-of-three/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/the-two-sneaky-numbers-of-digitville/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/the-two-sneaky-numbers-of-digitville/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-number-of-seconds-to-make-mountain-height-zero/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-number-of-seconds-to-make-mountain-height-zero/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-k-th-character-in-string-game-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-k-th-character-in-string-game-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-k-th-character-in-string-game-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-k-th-character-in-string-game-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/construct-the-minimum-bitwise-array-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/construct-the-minimum-bitwise-array-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/construct-the-minimum-bitwise-array-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/construct-the-minimum-bitwise-array-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-x-sum-of-all-k-long-subarrays-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-x-sum-of-all-k-long-subarrays-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-x-sum-of-all-k-long-subarrays-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-x-sum-of-all-k-long-subarrays-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-original-typed-string-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-original-typed-string-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-original-typed-string-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-original-typed-string-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/total-characters-in-string-after-transformations-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/total-characters-in-string-after-transformations-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/total-characters-in-string-after-transformations-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/total-characters-in-string-after-transformations-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-minimum-time-to-reach-last-room-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-minimum-time-to-reach-last-room-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-minimum-time-to-reach-last-room-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-minimum-time-to-reach-last-room-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-number-of-balanced-permutations/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-number-of-balanced-permutations/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-frequency-of-an-element-after-performing-operations-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-frequency-of-an-element-after-performing-operations-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-frequency-of-an-element-after-performing-operations-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-frequency-of-an-element-after-performing-operations-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/adjacent-increasing-subarrays-detection-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/adjacent-increasing-subarrays-detection-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/adjacent-increasing-subarrays-detection-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/adjacent-increasing-subarrays-detection-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/make-array-elements-equal-to-zero/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/make-array-elements-equal-to-zero/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/zero-array-transformation-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/zero-array-transformation-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/zero-array-transformation-iii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/zero-array-transformation-iii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-maximum-number-of-fruits-collected/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-maximum-number-of-fruits-collected/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/smallest-number-with-all-set-bits/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/smallest-number-with-all-set-bits/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-the-number-of-target-nodes-after-connecting-trees-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-the-number-of-target-nodes-after-connecting-trees-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-the-number-of-target-nodes-after-connecting-trees-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-the-number-of-target-nodes-after-connecting-trees-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-operations-to-make-array-values-equal-to-k/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-operations-to-make-array-values-equal-to-k/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/transformed-array/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/transformed-array/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-subarray-sum-with-length-divisible-by-k/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-subarray-sum-with-length-divisible-by-k/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-subarrays-of-length-three-with-a-condition/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-subarrays-of-length-three-with-a-condition/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-number-of-distinct-elements-after-operations/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-number-of-distinct-elements-after-operations/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-lexicographically-largest-string-from-the-box-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-lexicographically-largest-string-from-the-box-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-the-number-of-arrays-with-k-matching-adjacent-elements/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-the-number-of-arrays-with-k-matching-adjacent-elements/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/design-task-manager/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/design-task-manager/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-amount-of-money-robot-can-earn/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-amount-of-money-robot-can-earn/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/power-of-four/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/power-of-four/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-difference-between-adjacent-elements-in-a-circular-array/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-difference-between-adjacent-elements-in-a-circular-array/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-partitions-with-even-sum-difference/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-partitions-with-even-sum-difference/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-mentions-per-user/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-mentions-per-user/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/reschedule-meetings-for-maximum-free-time-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/reschedule-meetings-for-maximum-free-time-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/reschedule-meetings-for-maximum-free-time-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/reschedule-meetings-for-maximum-free-time-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-difference-between-even-and-odd-frequency-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-difference-between-even-and-odd-frequency-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-manhattan-distance-after-k-changes/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-manhattan-distance-after-k-changes/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-difference-between-even-and-odd-frequency-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-difference-between-even-and-odd-frequency-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/sort-matrix-by-diagonals/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/sort-matrix-by-diagonals/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/separate-squares-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/separate-squares-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/separate-squares-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/separate-squares-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/length-of-longest-v-shaped-diagonal-segment/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/length-of-longest-v-shaped-diagonal-segment/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/check-if-digits-are-equal-in-string-after-operations-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/check-if-digits-are-equal-in-string-after-operations-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-the-distance-between-points-on-a-square/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-the-distance-between-points-on-a-square/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/lexicographically-smallest-generated-string/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/lexicographically-smallest-generated-string/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/fruits-into-baskets-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/fruits-into-baskets-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/fruits-into-baskets-iii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/fruits-into-baskets-iii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-subarrays-after-removing-one-conflicting-pair/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-subarrays-after-removing-one-conflicting-pair/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/design-spreadsheet/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/design-spreadsheet/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-unique-subarray-sum-after-deletion/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-unique-subarray-sum-after-deletion/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/closest-equal-element-queries/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/closest-equal-element-queries/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-minimum-amount-of-time-to-brew-potions/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-the-minimum-amount-of-time-to-brew-potions/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-operations-to-make-array-elements-zero/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-operations-to-make-array-elements-zero/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-pair-removal-to-sort-array-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-pair-removal-to-sort-array-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/implement-router/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/implement-router/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-pair-removal-to-sort-array-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-pair-removal-to-sort-array-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-operations-to-make-array-sum-divisible-by-k/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-operations-to-make-array-sum-divisible-by-k/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-closest-person/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-closest-person/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-covered-buildings/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-covered-buildings/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-sum-of-array-product-of-magical-sequences/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-sum-of-array-product-of-magical-sequences/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-most-frequent-vowel-and-consonant/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-most-frequent-vowel-and-consonant/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-operations-to-convert-all-elements-to-zero/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-operations-to-convert-all-elements-to-zero/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/equal-sum-grid-partition-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/equal-sum-grid-partition-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/equal-sum-grid-partition-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/equal-sum-grid-partition-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-profit-from-trading-stocks-with-discounts/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-profit-from-trading-stocks-with-discounts/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-absolute-difference-in-sliding-submatrix/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-absolute-difference-in-sliding-submatrix/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/best-time-to-buy-and-sell-stock-v/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/best-time-to-buy-and-sell-stock-v/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-the-number-of-computer-unlocking-permutations/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-the-number-of-computer-unlocking-permutations/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-partitions-with-max-min-difference-at-most-k/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-partitions-with-max-min-difference-at-most-k/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-special-triplets/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-special-triplets/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/valid-sudoku/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/valid-sudoku/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-spanning-tree-stability-with-upgrades/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximize-spanning-tree-stability-with-upgrades/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/coupon-code-validator/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/coupon-code-validator/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/power-grid-maintenance/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/power-grid-maintenance/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-number-of-trapezoids-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-number-of-trapezoids-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-number-of-trapezoids-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-number-of-trapezoids-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-removals-to-balance-array/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-removals-to-balance-array/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/trionic-array-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/trionic-array-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/trionic-array-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/trionic-array-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/flip-square-submatrix-vertically/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/flip-square-submatrix-vertically/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-cost-path-with-edge-reversals/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-cost-path-with-edge-reversals/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-cost-path-with-teleportations/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-cost-path-with-teleportations/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/best-time-to-buy-and-sell-stock-using-strategy/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/best-time-to-buy-and-sell-stock-using-strategy/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/xor-after-range-multiplication-queries-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/xor-after-range-multiplication-queries-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/xor-after-range-multiplication-queries-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/xor-after-range-multiplication-queries-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-walls-destroyed-by-robots/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximum-walls-destroyed-by-robots/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-operations-to-equalize-binary-string/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-operations-to-equalize-binary-string/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/largest-divisible-subset/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/largest-divisible-subset/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-balanced-substring-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-balanced-substring-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-balanced-substring-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-balanced-substring-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-balanced-subarray-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-balanced-subarray-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-balanced-subarray-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-balanced-subarray-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-distance-between-three-equal-elements-i/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-distance-between-three-equal-elements-i/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-distance-between-three-equal-elements-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-distance-between-three-equal-elements-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-absolute-distance-between-mirror-pairs/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-absolute-distance-between-mirror-pairs/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/mirror-distance-of-an-integer/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/mirror-distance-of-an-integer/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-and-say/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-and-say/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/lexicographical-numbers/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/lexicographical-numbers/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/binary-watch/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/binary-watch/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/trapping-rain-water-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/trapping-rain-water-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/partition-equal-subset-sum/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/partition-equal-subset-sum/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/pacific-atlantic-water-flow/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/pacific-atlantic-water-flow/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/k-th-smallest-in-lexicographical-order/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/k-th-smallest-in-lexicographical-order/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/ones-and-zeroes/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/ones-and-zeroes/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/diagonal-traverse/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/diagonal-traverse/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-harmonious-subsequence/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/longest-harmonious-subsequence/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/valid-triangle-number/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/valid-triangle-number/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/robot-return-to-origin/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/robot-return-to-origin/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/plus-one/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/plus-one/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/add-binary/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/add-binary/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/24-game/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/24-game/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/binary-number-with-alternating-bits/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/binary-number-with-alternating-bits/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-binary-substrings/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/count-binary-substrings/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-ascii-delete-sum-for-two-strings/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/minimum-ascii-delete-sum-for-two-strings/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/1-bit-and-2-bit-characters/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/1-bit-and-2-bit-characters/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-smallest-letter-greater-than-target/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/find-smallest-letter-greater-than-target/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/pyramid-transition-matrix/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/pyramid-transition-matrix/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/set-intersection-size-at-least-two/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/set-intersection-size-at-least-two/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/special-binary-string/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/special-binary-string/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/prime-number-of-set-bits-in-binary-representation/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/prime-number-of-set-bits-in-binary-representation/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/swim-in-rising-water/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/swim-in-rising-water/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/rabbits-in-forest/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/rabbits-in-forest/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/domino-and-tromino-tiling/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/domino-and-tromino-tiling/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/champagne-tower/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/champagne-tower/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/soup-servings/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/soup-servings/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/largest-triangle-area/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/largest-triangle-area/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/new-21-game/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/new-21-game/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/push-dominoes/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/push-dominoes/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/magic-squares-in-grid/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/magic-squares-in-grid/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximal-rectangle/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/maximal-rectangle/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/smallest-subtree-with-all-the-deepest-nodes/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/smallest-subtree-with-all-the-deepest-nodes/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/binary-gap/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/binary-gap/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/reordered-power-of-2/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/reordered-power-of-2/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/walking-robot-simulation/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/walking-robot-simulation/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/bitwise-ors-of-subarrays/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/bitwise-ors-of-subarrays/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/fruit-into-baskets/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/fruit-into-baskets/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/snakes-and-ladders/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/snakes-and-ladders/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/delete-columns-to-make-sorted/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/delete-columns-to-make-sorted/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/delete-columns-to-make-sorted-ii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/delete-columns-to-make-sorted-ii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/delete-columns-to-make-sorted-iii/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/delete-columns-to-make-sorted-iii/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/n-repeated-element-in-size-2n-array/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/n-repeated-element-in-size-2n-array/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/vowel-spellchecker/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/vowel-spellchecker/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/largest-perimeter-triangle/description</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
<url>
<loc>https://impol.dev/problems/largest-perimeter-triangle/solution</loc>
<changefreq>monthly</changefreq>
<priority>0.65</priority>
</url>
</urlset>
