
<?xml version="1.0" encoding="UTF-8"?>

    <?xml-stylesheet href="https://dev.thejat.in/vendor/core/packages/sitemap/styles/xml.xsl" type="text/xsl"?>

<urlset
    xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"
    xmlns:xhtml="http://www.w3.org/1999/xhtml"
    xmlns:image="http://www.google.com/schemas/sitemap-image/1.1"
    xmlns:video="http://www.google.com/schemas/sitemap-video/1.1"
>
            <url>
            <loc>https://dev.thejat.in/code/encode-and-decode-strings</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2026-07-07T17:04:42+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/string-compression</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-09-05T10:08:30+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/contiguous-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-08-22T08:55:53+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/consecutive-characters</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-08-20T17:25:28+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/number-of-zero-filled-subarrays</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-09-27T09:05:49+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/design-a-hit-counter</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-09-03T09:32:19+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/system-design</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-30T11:17:42+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-number-of-maximum-bitwise-or-subsets</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-29T18:17:22+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/invert-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-21T07:06:20+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/data-structure-design</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/finding-pairs-with-a-certain-sum</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-lucky-integer-in-an-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-k-th-character-in-string-game-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-original-typed-string-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/reduce-a-number-to-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/swap-all-even-and-odd-bits</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/swap-the-ith-and-jth-bits</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/print-the-binary-representation-of-a-decimal-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/xor-of-the-xors-of-all-possible-subsets-of-the-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/calculate-xor-from-1-to-n</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/invert-alphabets-case</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/convert-lowercase-to-uppercase</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/convert-uppercase-to-lowercase</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-if-a-number-is-a-power-of-16</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-if-a-number-is-a-power-of-8</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-if-a-number-is-a-power-of-4</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sum-of-k-mirror-numbers</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/divide-a-string-into-groups-of-size-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-difference-between-adjacent-elements-in-a-circular-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-difference-between-even-and-odd-frequency-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/is-subsequence</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/squares-of-a-sorted-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/remove-duplicates-from-sorted-array-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximize-the-number-of-target-nodes-after-connecting-trees-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/partition-array-into-three-parts-with-equal-sum</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-pivot-index-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/subarray-sums-divisible-by-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/range-sum-query-2d-immutable</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/range-sum-query-immutable</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/range-sum-query-mutable</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-segment-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/segment-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/number-of-laser-beams-in-a-bank</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/game-of-life</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/zero-array-transformation-4</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/zero-array-transformation-3</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/zero-array-transformation-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/car-pooling</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/corporate-flight-bookings</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/range-addition</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-arrays</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/zero-array-transformation-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/number-of-digit-one</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/shortest-path-visiting-all-nodes</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/traveling-salesman-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/minimum-deletions-to-make-string-palindrome-valid-palindrome-4</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/valid-palindrome-3</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/valid-palindrome-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/valid-palindrome</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/total-characters-in-string-after-transformations-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/restore-ip-addresses</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/finding-3-digit-even-numbers</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/n-queens-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/unique-paths-3</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sudoko-solver</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/m-coloring-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/combination-sum-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/combinations</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/differentiate-subset-subsequence-and-substring</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/permutations</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/permutations-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/replace-elements-with-greatest-element-on-right-side</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/build-array-from-permutation</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/jump-game-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/jump-game-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/palindrome-partitioning-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/burst-balloons</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/length-of-shortest-common-super-sequence</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/print-longest-common-subsequence-lcs</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/painting-the-walls</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/russian-doll-envelopes</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/number-of-longest-increasing-subsequences</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-bitonic-subsequence</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-string-chain</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/largest-divisible-subset</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/print-longest-increasing-subsequence</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/summary-ranges</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-increasing-subsequence</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/remove-duplicated-from-sorted-dll</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/delete-all-occurrences-of-a-key-in-dll</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/insertion-of-node-of-doubly-linked-list-at-different-position</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/merge-two-sorted-arrays-without-using-extra-space</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-product-subarray-in-an-array-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-of-smaller-numbers-after-self-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/how-many-numbers-are-smaller-than-the-current-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/contains-duplicate-3</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/contains-duplicate</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/largest-bst-in-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/correct-bst-with-two-nodes-swapped</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/two-sum-in-bst</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/bst-iterator</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/inorder-successor-and-predecessor-in-bst</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/construct-a-bst-from-a-preorder-traversal</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/lca-in-bst</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-if-a-tree-is-a-bst-or-not</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/kth-smallest-element-in-bst</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/delete-a-node-in-bst</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/insert-a-given-node-in-bst</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/lfu-cache</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/lru-cache</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/celebrity-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/stock-span-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-rectangles</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/largest-rectangle-in-a-histogram</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/trapping-rainwater</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sliding-window-maximum</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/implement-min-stack</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/remove-k-digits</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sum-of-subarray-ranges</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sum-of-subarray-minimums</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sum-of-highest-and-lowest-frequency</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/second-highest-occurring-element</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/c-stl</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/kth-largest-element-in-a-stream-of-running-integers</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/k-th-largest-element-in-an-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/heap-sort</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/convert-min-heap-to-max-heap</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-if-an-array-represents-a-min-heap</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/implement-max-heap</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/implement-min-heap</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/build-heap-from-a-given-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/heapify-algorithm</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-xor-with-an-element-from-an-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-xor-of-two-numbers-in-an-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/number-of-distinct-substrings-in-a-string</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-word-with-all-prefixes</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/articulation-point-in-graph</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/bridges-in-graph</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/kosarajus-algorithm</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/most-stones-removed-with-same-row-or-column</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/making-a-large-island</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/number-of-islands-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/accounts-merge</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/number-of-operations-to-make-network-connected</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-mst-weight</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/disjoint-set</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/prims-algorithm</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-city-with-the-smallest-number-of-neighbors</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/floyd-warshall-algorithm</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/word-ladder-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/word-ladder-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/why-bfs-is-used-for-finding-shortest-distances-in-graphs-instead-of-dfs</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/shortest-path-in-undirected-graph-with-unit-weights</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/shortest-path-in-dag</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/alien-dictionary</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/course-schedule-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/course-schedule-1-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/print-all-primes-till-n</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-27T16:50:06+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/bellman-ford-algorithm</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/number-of-ways-to-arrive-at-destination</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/minimum-multiplications-to-reach-end</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cheapest-flight-within-k-stops</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/path-with-minimum-effort</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/shortest-distance-in-a-binary-maze</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/print-shortest-path</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/dijkstras-algorithm</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-heap-data-structure</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/heap</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/matrix-median</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-fenwick-tree-binary-indexed-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/extra-data-structure</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-of-range-sum</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/minimum-size-subarray-sum</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/split-the-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/largest-subarray-with-sum-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-eventual-safe-states</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/topological-sort-or-kahns-algorithm</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/bipartite-graph</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/reverse-every-word-in-a-string</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/string-to-integer-atoi</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-strings</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/minimum-cost-to-cut-the-stick</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/matrix-chain-multiplication</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/wildcard-matching</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/edit-distance</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/distinct-subsequences</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/shortest-common-super-sequence</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/minimum-insertions-or-deletions-to-convert-string-a-to-b</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/minimum-insertions-to-make-string-palindrome</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/trie-implementation-and-advanced-operations</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-palindromic-subsequence</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/trie-implementation-and-operations</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-tries</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-common-substring</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/rod-cutting-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/coin-change-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/target-sum</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-partitions-with-given-difference</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-subsets-with-sum-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/partition-a-set-into-two-subsets-with-minimum-absolute-sum-difference</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/partition-equal-subset-sum</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/subset-sum-equals-to-target</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/best-time-to-buy-and-sell-stock-with-a-transaction-fees</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/best-time-to-buy-and-sell-stock-4</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/best-time-to-buy-and-sell-stock-3</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/best-time-to-buy-and-sell-stock-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cherry-pick-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cherry-pickup</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/triangle</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/minimum-path-in-grid</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/unique-paths-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/grid-unique-paths</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/ninjas-training</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/house-robber</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-sum-of-non-adjacent-elements</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/frog-jump-with-k-distances</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/floor-and-ceil-in-a-binary-search-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/search-in-binary-search-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/morris-preorder-traversal</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/morris-inorder-traversal</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/serialize-and-de-serialize-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/construct-a-binary-tree-from-postorder-and-inorder</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/construct-a-binary-tree-from-preorder-and-inorder</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/requirements-needed-to-construct-a-unique-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-total-nodes-in-a-complete-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/minimum-time-taken-to-burn-the-binary-tree-from-a-given-node</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/print-all-nodes-at-a-distance-of-k-in-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-width-of-a-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/print-root-to-node-path-in-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/left-view-of-a-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/right-view-of-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/bottom-view-of-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/top-view-of-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/vertical-order-traversal</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/boundary-traversal</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/zig-zag-or-spiral-traversal</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-for-symmetrical-binary-trees</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-path-sum</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/diameter-of-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/pre-post-in-order-in-one-traversal</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-21T08:14:04+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/asteroid-collision</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/next-greater-element-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/next-greater-element</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/number-of-substrings-containing-all-three-characters</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/minimum-window-substring</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-repeating-character-replacement</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-substring-with-at-most-k-distinct-characters-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/fruits-into-baskets</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-substring-without-repeating-characters-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-points-you-can-obtain-from-cards</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/xor-of-numbers-in-a-given-range</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/generate-all-possible-subsets-of-the-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/divide-two-numbers-without-multiplication-and-division</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/single-number-3</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/dividing-or-multiplying-any-number-by-two-using-bit-operations</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/printing-the-binary-representation-of-a-decimal-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/convert-binary-number-in-a-linked-list-to-integer</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/merging-k-sorted-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/traverse-the-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/clone-a-linked-list-with-random-and-next-pointer</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sort-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/flattening-of-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/add-one-to-a-number-represented-by-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-minimum-and-maximum-element-in-the-array-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sort-an-array-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/kth-missing-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/divide-chocolate</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/capacity-to-ship-packages-within-d-days</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-target-indices-after-sorting-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/first-bad-version</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/median-of-sorted-matrix</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/peak-element-in-a-2d-matrix</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/search-in-2d-matrix-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/search-in-a-2d-matrix</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-row-with-maximum-1s</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/painter-partition-or-split-array-largest-sum</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/kth-element-of-2-sorted-arrays</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/median-of-2-sorted-arrays</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/peak-element</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/book-allocation</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/aggressive-cows</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/minimum-days-to-make-m-bouquets</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/koko-eating-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-smallest-divisor</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-nth-root-of-a-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-count-of-positive-integer-and-negative-integer</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-subarrays-with-given-xor-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-subarrays-with-given-sum</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-consecutive-sequence-in-an-array-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-common-characters</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understand-hashing</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/k-sum-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/rat-in-a-maze</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/n-queen</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/word-search</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/palindrome-partitioning</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/combination-sum-3</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-backtracking</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/permutation-of-a-string</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/letter-combinations-of-a-phone-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/power-set</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/game-of-death-josephus-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/print-n-bit-binary-numbers-having-more-1s-than-0s-for-any-prefix</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/permutation-with-case-change</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/permutation-with-spaces</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/tower-of-hanoi</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/k-th-symbol-in-grammar</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/reverse-stack-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/delete-middle-element-of-a-stack-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sort-an-stack-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/height-of-recursion-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sort-an-array-using-recursive-insertion-approach</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/subarray-sum-equals-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/remove-covered-interval</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/interval-list-intersection</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-sum-circular-subarray</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/non-overlapping-interval</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/merge-intervals</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/insert-interval</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/minimum-number-of-arrows-to-burst-balloons</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-subsequence-with-limited-sum</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/minimum-average-difference</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/valid-sudoku</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/where-will-be-the-ball</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/toeplitz-matrix</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/image-overlap</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/continuous-subarray-sum-multiple-of-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/contains-duplicate-2</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/largest-perimeter-triangle</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/increasing-triplet-subsequence</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sum-of-even-numbers-after-queries</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-original-array-from-doubled-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/diagonal-traverse-matrix</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/plus-one-to-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/remove-element-from-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sort-an-array-in-a-waveform</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sort-the-matrix-diagonally</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/print-the-matrix-in-spiral-manner</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-product-subarray-in-an-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/reverse-pairs</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-inversions</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-repeating-and-missing-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-majority-of-element-that-occurs-more-than-n3-times</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/four-sum-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cycle-detection-in-an-undirected-graph</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/number-of-enclaves</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/number-of-distinct-islands</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/surrounded-regions</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/distance-of-nearest-cell-having-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/rotten-oranges</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/flood-fill-using-graph</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/number-of-islands</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/number-of-provinces</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/graph-traversal-techniques</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-of-connected-components</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/flood-fill-algorithm</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/coin-change-count-ways-to-make-sum</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sum-of-all-subsets-of-the-array-nums</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/combination-sum</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-all-subsequences-with-sum-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-if-there-exists-a-subsequence-with-sum-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/generate-parentheses</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/print-all-subsequences-of-a-string</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/reverse-an-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sum-of-first-n-numbers</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/print-linearly-from-n-to-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/frog-jump-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-dynamic-programming</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-graphs</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-binary-search-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/level-order-traversal</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-21T07:16:29+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-trees</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/tries</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/binary-search-trees</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-sliding-window-technique</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sliding-window-two-pointer-approach</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/job-sequencing-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/shortest-job-first</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/knapsack-problem-by-greedy-algorithm</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/lemonade-change</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/assign-cookies</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-greedy-algorithms</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/greedy-algorithms</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-element-that-appears-once-in-an-array-where-every-other-element-appears-thrice</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-single-number-in-an-array-where-all-others-appear-twice</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/removing-the-last-set-bit</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-bit-manipulation</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/powx-n</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-square-root-of-a-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/single-element-in-sorted-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-out-how-many-times-the-array-is-rotated</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-minimum-in-rotated-sorted-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/search-in-rotated-sorted-array-with-duplicate-values</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/search-in-rotated-sorted-array-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/first-and-last-occurrence-of-a-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/floor-and-ceil-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/search-insert-position</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/upper-bound</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/lower-bound</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/search-x-in-sorted-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-binary-search</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/binary-search-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/pascals-triangle</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/rearrange-array-elements-by-sign</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/intersection-of-two-sorted-arrays</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/left-rotate-array-by-k-places</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-consecutive-ones</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-08-20T14:11:22+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/linear-search</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-lcm-of-two-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/greatest-common-divisor-gcd-highest-common-factor-hcf-of-two-numbers</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-of-prime-numbers-till-n</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-for-prime-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-for-a-perfect-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-if-the-number-is-armstrong</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/factorial-of-a-given-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/return-the-largest-digit-in-a-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/palindrome-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/reverse-a-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-number-of-odd-digits-in-a-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-all-digits-of-a-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maths</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/highest-occurring-element-in-an-array-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/hashing</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-solving-array-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/deletion-of-node-of-doubly-linked-list-from-different-position</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/implement-stack-using-queue-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-queue</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-solving-doubly-linked-list-problems</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/linked-list-doubly-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/remove-characters-from-the-first-string-which-are-present-in-the-second-string</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/reverse-string-using-a-stack</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/balanced-brackets-in-an-expression</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-stack</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/odd-and-even-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/split-a-linked-list-into-k-parts</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/delete-the-entire-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/finding-the-intersection-point-in-y-shaped-linked-lists</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/remove-duplicates-from-a-sorted-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-nth-node-from-the-end</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-solving-linked-list-problems</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sort-characters-by-frequency</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/valid-anagram</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/rotate-string</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/isomorphic-string</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-common-prefix-1</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-word-containing-character</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/jewels-and-stones</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/permutation-difference-between-two-strings</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/final-value-of-variable-after-performing-operations</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/defanging-an-ip-address</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/score-of-a-string</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/largest-odd-number-in-a-string</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-if-a-string-is-palindrome</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/reverse-a-string</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-if-the-array-is-sorted-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-if-a-number-is-prime-or-not-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sum-of-digits-of-a-number-and-the-result-should-have-only-one-digit</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/highest-occurring-element-in-an-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/understanding-pattern-printing</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/angle-between-hands-of-a-clock</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/additonal</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/minimum-number-of-coins-to-make-a-target</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/counting-bits-in-dp</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/climbing-stairs</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/finding-nth-catalan-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/fibonacci-series-with-dp</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-set-bits-of-number-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/finding-minimum-maximum-element-from-an-array-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sum-of-array-elements-using-tail-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sum-of-digit-of-a-number-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-length-of-the-string-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/print-reverse-of-a-string-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sum-of-array-elements-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/decimal-to-binary-conversion-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/decimal-to-binary-conversion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/conversion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/mean-of-array-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/calculate-the-factorial-of-a-given-number-n</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/finding-unique-element</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-substring-with-at-most-k-distinct-characters</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-subarray-with-sum-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximizing-the-number-of-toys-with-given-budget</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sum-of-all-subarrays-of-size-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/first-negative-integer-in-every-window-of-size-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-of-distinct-elements-in-every-window-of-size-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-subarray-sum-of-size-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-sum-of-distinct-subarrays-with-length-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/max-consecutive-ones-with-flips</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-substring-without-repeating-characters</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-length-substring-with-two-occurrences</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/diffuse-the-bomb-a-circular-array-decryption-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/substrings-of-size-three-with-distinct-characters</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/string</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-strong-pair-xor</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-center-of-start-graph</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/graph</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/balanced-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/convert-sorted-array-to-binary-search-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-depth-of-a-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/symmetric-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/same-tree-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sorting-0s-1s-and-2s-in-a-linked-list-by-changing-links</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/delete-the-middle-node-of-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/segregate-oddeven-nodes-in-a-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-length-of-loop-in-a-linked-if-any</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-intersection-of-two-linked-lists</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/remove-n-th-node-from-the-end-of-a-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-if-the-given-linked-list-is-palindrome</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/starting-point-of-loop-in-a-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-middle-element-in-a-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/search-an-element-in-a-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-length-of-a-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/delete-last-node-of-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/insert-node-at-beginning-of-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/quick-sort</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/merge-sort</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/insertion-sort</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/selection-sort</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/bubble-sort</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sorting</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/rotate-array-by-90-degree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/set-matrix-zero</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-consecutive-sequence-in-an-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/leaders-in-an-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-next-lexicographically-greater-permutation</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/rearrange-array-elements-by-sign-without-altering-order</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/stock-buy-and-sell</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/maximum-subarray-sum-in-a-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-majority-of-element-that-occurs-more-than-n2-times</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/sort-an-array-of-0s-1s-and-2s</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/two-sum-check-if-a-pair-with-given-sum-exists-in-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-subarray-with-given-sum-k-positives</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-a-number-that-appears-only-once-while-other-appears-multiple-times</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/move-zeroes-to-the-end-of-the-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/rotate-array-by-k-elements</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/left-rotate-the-array-by-one</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/remove-duplicates-from-sorted-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-if-an-array-is-sorted</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-second-smallest-and-second-largest-element-in-an-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-largest-element-in-an-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/queue</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/implement-queue-using-two-stacks</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/stack</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/next-permutation</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/knapsack-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/fibonacci-sequence-in-dp</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/longest-common-subsequence</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/dynamic-programming</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/fibonacci-series</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/remove-duplicates</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/count-the-number-of-occurrence-of-specific-element-in-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/if-string-is-palindrome-or-not</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/binary-search</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-minimum-and-maximum-element-of-an-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/print-linearly-from-1-to-n</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/print-name-n-times-using-recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/recursion</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/chocolate-distribution-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/three-sum-zero-problem</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/container-with-most-water</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/counting-set-bit-in-an-integer</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-total-number-of-bits-needed-to-be-flipped</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/finding-the-absolute-value-of-an-integer-without-branching</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/computing-parity-of-a-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/detecting-if-two-integers-have-opposite-signs-or-not</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/find-the-position-of-the-rightmost-set-bit</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-if-a-positive-integer-is-a-power-of-2-without-using-any-branching-or-loop</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/toggling-the-kth-bit</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/checking-if-the-kth-bit-is-set-in-a-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/turn-on-kth-bit-in-a-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/turn-off-kth-bit-in-a-number</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/swap-two-numbers-without-using-any-third-variable</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/add-1-to-an-integer</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-if-an-integer-is-even-or-odd</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/bit-manipulation</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/lowest-common-ancestor-lca-of-two-nodes-in-a-binary-tree</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/check-if-two-binary-tress-are-identical</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/post-order-tree-traversal</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-20T18:15:36+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/pre-order-tree-traversal</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/trees-in-order-tree-traversal</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/trees</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-reverse-a-linked-list-in-groups-of-size-k</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-add-two-numbers-represented-by-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-rotate-a-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-merge-two-sorted-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-detect-a-cycle-in-a-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-reverse-a-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-linked-list</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-4-sum-problem-in-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-stock-buy-and-sell-problem-finding-the-maximum-profit</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-maximum-subarray-sum</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-reversing-an-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-array-rotation</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-count-odd-even-in-an-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-least-frequent-element-in-an-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/finding-majority-element-in-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-finding-the-min-max-element</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-find-the-missing-number-in-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-counting-frequencies-of-array-elements</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-remove-duplicate-values-from-array</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:39+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-merge-two-sorted-arrays</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-arrays</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-right-half-diamond-pattern</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-diamond-pattern-printing</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/floyds-triangle-pattern</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-half-diamond-pattern</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-full-pyramid-star-pattern-printing</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-right-triangle-pattern-printing</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-left-triangle-pattern-printing</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-hollow-square-pattern-printing</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-square-star-pattern-printing</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
            <url>
            <loc>https://dev.thejat.in/code/cp-pattern-printing</loc>
            
            
                            <priority>0.8</priority>
            
                            <lastmod>2025-07-18T10:15:38+00:00</lastmod>
            
                            <changefreq>daily</changefreq>
            
            
                    </url>
    </urlset>
