<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:image="http://www.google.com/schemas/sitemap-image/1.1">
<url>
<loc>https://campus.devert.in</loc>
<image:image>
<image:loc>https://campus.devert.in/logo.png</image:loc>
</image:image>
<image:image>
<image:loc>https://campus.devert.in/og-image.png</image:loc>
</image:image>
<image:image>
<image:loc>https://campus.devert.in/screenshots/campus-home.jpg</image:loc>
</image:image>
<image:image>
<image:loc>https://campus.devert.in/screenshots/campus-learning.jpg</image:loc>
</image:image>
<image:image>
<image:loc>https://campus.devert.in/screenshots/campus-practice.jpg</image:loc>
</image:image>
<image:image>
<image:loc>https://campus.devert.in/screenshots/campus-gate.jpg</image:loc>
</image:image>
<image:image>
<image:loc>https://campus.devert.in/screenshots/campus-roadmaps.jpg</image:loc>
</image:image>
<image:image>
<image:loc>https://campus.devert.in/screenshots/campus-for-colleges.jpg</image:loc>
</image:image>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/contests</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/learning</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/practice</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/campuses</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://campus.devert.in/institutions</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://campus.devert.in/pricing</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://campus.devert.in/daily-learning</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://campus.devert.in/assessments</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://campus.devert.in/roadmaps</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.9</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/cs-2026-session-1</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/cs-2026-session-2</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/da-2026</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/cs-2025-session-1</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/cs-2025-session-2</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/da-2025</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/cs-2024-session-1</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/cs-2024-session-2</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/da-2024</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/cs-2023</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/cs-2022</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/cs-2018</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/cs-2016-set-1</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/cs-2016-set-2</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/cs-2014-set-1</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/cs-2014-set-3</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/subject/general-aptitude</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/subject/engineering-mathematics</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/subject/digital-logic</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/subject/computer-organization-and-architecture</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/subject/programming-and-data-structures</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/subject/algorithms</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/subject/theory-of-computation</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/subject/compiler-design</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/subject/operating-system</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/subject/databases</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/gate-pyq/subject/computer-networks</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa</loc>
<lastmod>2026-10-20T19:33:08.903Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.9</priority>
</url>
<url>
<loc>https://campus.devert.in/mrcet</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/mrcet/daily-learning</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>https://campus.devert.in/mrcet/dsa</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>https://campus.devert.in/mrcet/company-vault</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>https://campus.devert.in/mrcet/assessments</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>https://campus.devert.in/mrcet/contests</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>https://campus.devert.in/mrcet/leaderboard</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>https://campus.devert.in/roadmaps/ml-engineer</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/roadmaps/ai-engineer</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/roadmaps/cybersecurity-engineer</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/roadmaps/vlsi-engineer</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/1-two-sum</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/2-reverse-the-array</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/3-find-the-maximum-and-minimum-element-in-an-array</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/4-kth-max-and-min-element-of-an-array</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/5-sort-an-array-of-0s-1s-and-2s</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/6-move-all-negative-elements-to-one-side</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/7-union-and-intersection-of-two-sorted-arrays</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/8-cyclically-rotate-an-array-by-one</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/9-largest-sum-contiguous-subarray-kadane-s-algorithm</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/10-minimise-the-maximum-difference-between-heights</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/11-minimum-number-of-jumps-to-reach-end-of-array</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/12-find-duplicate-in-an-array-of-n-plus1-integers</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/13-merge-two-sorted-arrays-combined-sorted-output</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/14-merge-intervals</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/15-next-permutation</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/16-count-inversions-in-an-array</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/17-best-time-to-buy-and-sell-stock</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/18-find-all-pairs-with-a-given-sum</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/19-find-common-elements-in-3-sorted-arrays</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/20-rearrange-array-in-alternating-positive-and-negative-items</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/21-find-if-there-is-a-subarray-with-sum-equal-to-0</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/22-find-factorial-of-a-large-number</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/23-find-maximum-product-subarray</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/24-find-longest-consecutive-subsequence</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/25-elements-appearing-more-than-n-k-times</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/26-maximum-profit-by-buying-and-selling-a-share-at-most-twice</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/27-check-if-an-array-is-a-subset-of-another-array</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/28-find-the-triplet-that-sums-to-a-given-value</loc>
<lastmod>2026-10-20T19:33:19.022Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/29-trapping-rain-water</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/30-chocolate-distribution-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/31-smallest-subarray-with-sum-greater-than-a-given-value</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/32-three-way-partitioning-of-an-array-around-a-given-value</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/33-minimum-swaps-to-bring-elements-less-than-or-equal-to-k-together</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/34-minimum-operations-to-make-an-array-palindrome</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/35-median-of-two-sorted-arrays</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/36-spiral-traversal-of-a-matrix</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/37-search-an-element-in-a-row-wise-and-column-wise-sorted-matrix</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/38-find-median-in-a-row-wise-sorted-matrix</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/39-find-the-row-with-maximum-number-of-1s</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/40-print-elements-in-sorted-order-using-a-row-and-column-wise-sorted-matrix</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/41-maximum-size-rectangle-of-1s-in-a-binary-matrix</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/42-find-a-specific-pair-in-a-matrix</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/43-rotate-a-matrix-by-90-degrees</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/44-kth-smallest-element-in-a-row-wise-and-column-wise-sorted-matrix</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/45-common-elements-in-all-rows-of-a-matrix</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/46-reverse-a-string</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/47-check-whether-a-string-is-a-palindrome</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/48-find-duplicate-characters-in-a-string</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/49-check-if-a-string-is-a-rotation-of-another-string</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/50-check-if-a-string-is-a-valid-shuffle-of-two-other-strings</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/51-count-and-say-sequence</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/52-longest-palindromic-substring</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/53-longest-repeating-subsequence</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/54-print-all-distinct-subsequences-of-a-string</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/55-print-all-permutations-of-a-string</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/56-split-a-binary-string-into-maximum-number-of-balanced-substrings</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/57-word-wrap-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/58-edit-distance</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/59-next-greater-number-with-the-same-set-of-digits</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/60-balanced-parenthesis-checker</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/61-word-break-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/62-rabin-karp-pattern-search</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/63-kmp-pattern-search</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/64-minimum-bracket-reversals-to-balance-an-expression</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/65-count-palindromic-subsequences-in-a-string</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/66-longest-common-prefix</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/67-minimum-swaps-for-bracket-balancing</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/68-longest-common-subsequence</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/69-roman-numeral-to-integer</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/70-recursively-remove-adjacent-duplicate-characters</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/71-group-anagrams-together</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/72-minimum-characters-to-add-at-the-front-to-make-a-string-palindrome</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/73-find-first-and-last-position-of-an-element-in-a-sorted-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/74-search-in-a-rotated-sorted-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/75-integer-square-root</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/76-find-the-repeating-and-the-missing-number</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/77-find-the-majority-element</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/78-find-a-pair-with-a-given-difference</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/79-find-four-elements-that-sum-to-a-given-value</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/80-maximum-sum-such-that-no-two-elements-are-adjacent</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/81-count-triplets-such-that-one-element-is-the-sum-of-the-other-two</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/82-count-subarrays-with-sum-zero</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/83-merge-sort</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/84-quick-sort</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/85-find-a-peak-element-in-an-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/86-book-allocation-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/87-painter-s-partition-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/88-aggressive-cows-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/89-reverse-a-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/90-reverse-a-linked-list-in-groups-of-size-k</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/91-detect-a-loop-in-a-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/92-find-the-length-of-the-loop-in-a-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/93-find-the-middle-of-a-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/94-merge-two-sorted-linked-lists</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/95-find-the-nth-node-from-the-end-of-a-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/96-check-if-a-linked-list-is-a-palindrome</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/97-rotate-a-linked-list-by-n-nodes</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/98-segregate-0s-1s-and-2s-in-a-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/99-segregate-even-and-odd-nodes-in-a-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/100-delete-nodes-which-have-a-greater-value-on-the-right-side</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/101-merge-k-sorted-linked-lists</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/102-add-two-numbers-represented-by-linked-lists</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/103-remove-duplicates-from-a-sorted-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/104-height-of-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/105-level-order-traversal-of-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/106-diameter-of-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/107-mirror-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/108-inorder-traversal-of-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/109-preorder-traversal-of-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/110-postorder-traversal-of-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/111-check-if-two-binary-trees-are-identical</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/112-left-view-of-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/113-right-view-of-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/114-top-view-of-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/115-bottom-view-of-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/116-zig-zag-level-order-traversal</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/117-check-if-a-binary-tree-is-height-balanced</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/118-lowest-common-ancestor-in-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/119-maximum-root-to-leaf-path-sum</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/120-construct-a-binary-tree-from-inorder-and-preorder-traversals-print-its-postorder</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/121-check-if-a-binary-tree-is-symmetric</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/122-maximum-width-of-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/123-count-leaf-nodes-in-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/124-insert-a-node-into-a-binary-search-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/125-delete-a-node-from-a-binary-search-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/126-find-the-minimum-and-maximum-value-in-a-bst</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/127-find-the-inorder-successor-of-a-node-in-a-bst</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/128-check-if-a-binary-tree-is-a-valid-bst</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/129-find-the-lowest-common-ancestor-of-two-nodes-in-a-bst</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/130-construct-a-bst-from-a-preorder-traversal</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/131-convert-a-sorted-array-into-a-height-balanced-bst</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/132-merge-two-bsts-into-one</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/133-find-the-kth-smallest-element-in-a-bst</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/134-find-the-closest-value-to-a-target-in-a-bst</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/135-find-a-pair-with-a-given-sum-in-a-bst</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/136-activity-selection-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/137-job-sequencing-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/138-fractional-knapsack-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/139-minimum-number-of-platforms-required-for-a-railway-station</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/140-minimum-and-maximum-amount-to-buy-all-n-candies</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/141-maximum-product-subset-of-an-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/142-maximize-array-sum-after-k-negations</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/143-maximize-sum-of-arr-i-i-after-rearranging</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/144-minimum-sum-of-absolute-differences-of-pairs-of-two-arrays</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/145-shortest-job-first-sjf-cpu-scheduling-average-waiting-time</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/146-lru-page-replacement-count-page-faults</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/147-smallest-number-with-given-number-of-digits-and-digit-sum</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/148-n-queens-count-solutions</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/149-rat-in-a-maze-count-distinct-paths</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/150-solve-a-sudoku-puzzle</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/151-m-coloring-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/152-subset-sum-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/153-combination-sum-count-combinations</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/154-maximum-number-possible-with-at-most-k-swaps</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/155-count-palindromic-partitions-of-a-string</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/156-generate-all-valid-parentheses-combinations</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/157-word-break-count-all-ways</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/158-simulate-a-stack</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/159-min-stack-support-getmin-in-o-1</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/160-next-greater-element-for-every-array-element</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/161-sort-a-stack-using-recursion</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/162-largest-rectangular-area-in-a-histogram</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/163-longest-valid-parentheses-substring</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/164-check-for-redundant-brackets-in-an-expression</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/165-stock-span-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/166-the-celebrity-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/167-iterative-tower-of-hanoi-minimum-number-of-moves</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/168-reverse-the-first-k-elements-of-a-queue</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/169-interleave-the-first-half-of-a-queue-with-the-second-half</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/170-find-the-middle-element-of-a-stack</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/171-kth-largest-element-in-an-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/172-kth-smallest-element-in-an-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/173-sort-a-nearly-sorted-k-sorted-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/174-merge-k-sorted-arrays</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/175-find-the-running-median-of-a-stream-of-integers</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/176-check-if-a-binary-tree-is-a-valid-heap</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/177-minimum-cost-to-connect-n-ropes</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/178-find-the-k-largest-elements-in-an-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/179-k-closest-points-to-the-origin</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/180-top-k-frequent-elements</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/181-bfs-traversal-of-a-graph</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/182-dfs-traversal-of-a-graph</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/183-detect-a-cycle-in-an-undirected-graph</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/184-detect-a-cycle-in-a-directed-graph</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/185-topological-sort-of-a-directed-acyclic-graph</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/186-count-connected-components-in-an-undirected-graph</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/187-number-of-islands-in-a-2d-grid</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/188-check-if-a-graph-is-bipartite</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/189-dijkstra-s-shortest-path-from-a-source</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/190-bellman-ford-detect-a-negative-weight-cycle</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/191-minimum-spanning-tree-weight</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/192-count-strongly-connected-components</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/193-minimum-steps-for-a-knight-to-reach-a-target-square</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/194-flood-fill-algorithm</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/195-rotten-oranges-minimum-time-for-all-to-rot</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/196-implement-a-trie-insert-and-search-words</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/197-find-the-shortest-unique-prefix-for-every-word</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/198-phone-directory-autocomplete-by-prefix</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/199-print-unique-rows-in-a-boolean-matrix</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/200-maximum-xor-of-two-numbers-in-an-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/201-count-distinct-substrings-of-a-string</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/202-count-words-with-a-given-prefix</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/203-0-1-knapsack-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/204-coin-change-minimum-number-of-coins</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/205-coin-change-count-number-of-ways</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/206-longest-increasing-subsequence</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/207-longest-common-substring</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/208-matrix-chain-multiplication-minimum-cost</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/209-minimum-cost-path-in-a-grid</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/210-egg-dropping-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/211-partition-a-set-into-two-subsets-with-minimum-difference-of-sums</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/212-rod-cutting-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/213-maximum-size-square-sub-matrix-with-all-1s</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/214-climbing-stairs-count-ways</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/215-longest-bitonic-subsequence</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/216-shortest-common-supersequence-length</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/217-wildcard-pattern-matching</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/218-count-set-bits-in-an-integer</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/219-find-the-two-non-repeating-elements-in-an-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/220-count-bits-to-flip-to-convert-a-to-b</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/221-count-total-set-bits-from-1-to-n</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/222-check-if-a-number-is-a-power-of-2</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/223-find-the-position-of-the-only-set-bit</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/224-divide-two-integers-without-using-or</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/225-calculate-the-square-of-a-number-without-using-or-pow</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/226-find-xor-of-all-numbers-from-l-to-r</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/227-find-the-element-that-appears-once-all-others-appear-exactly-three-times</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/228-word-break-print-all-sentences-trie</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/229-copy-set-bits-in-a-range</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/230-rearrange-a-string-so-that-no-two-adjacent-characters-are-the-same</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/231-generate-all-valid-ip-addresses-from-a-string-of-digits</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/232-smallest-window-containing-all-distinct-characters-of-a-string</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/233-smallest-window-in-a-string-containing-all-characters-of-another-string</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/234-number-of-flips-to-make-a-binary-string-alternating</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/235-find-the-first-repeated-word-in-a-string</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/236-search-a-word-in-a-2d-grid-of-characters</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/237-count-occurrences-of-a-given-string-in-a-2d-character-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/238-convert-a-sentence-to-its-mobile-numeric-keypad-sequence</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/239-number-of-customers-who-could-not-get-a-computer</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/240-transform-one-string-to-another-using-minimum-number-of-given-operation</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/241-check-if-two-strings-are-isomorphic</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/242-print-all-sentences-from-a-list-of-word-lists</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/243-delete-loop-in-a-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/244-find-the-starting-point-of-the-loop-in-a-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/245-remove-duplicates-from-an-unsorted-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/246-move-the-last-element-to-the-front-of-a-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/247-add-1-to-a-number-represented-as-a-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/248-intersection-of-two-sorted-linked-lists</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/249-merge-sort-on-a-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/250-quicksort-on-a-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/251-check-if-a-linked-list-is-circular</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/252-split-a-circular-linked-list-into-two-halves</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/253-deletion-from-a-circular-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/254-reverse-a-doubly-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/255-find-pairs-with-a-given-sum-in-a-doubly-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/256-count-triplets-in-a-sorted-doubly-linked-list-with-a-given-sum</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/257-simulate-a-queue</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/258-sort-a-k-sorted-doubly-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/259-rotate-a-doubly-linked-list-by-n-nodes</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/260-implement-two-stacks-in-one-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/261-rotate-a-doubly-linked-list-in-groups-of-given-size</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/262-flatten-a-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/263-implement-n-stacks-in-a-single-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/264-multiply-two-numbers-represented-by-linked-lists</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/265-sort-an-array-using-heap-sort</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/266-arithmetic-expression-evaluation</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/267-find-the-first-non-repeating-character-from-a-stream-of-characters</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/268-evaluation-of-a-postfix-expression</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/269-maximum-of-all-subarrays-of-size-k</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/270-insert-an-element-at-the-bottom-of-a-stack</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/271-merge-two-binary-max-heaps</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/272-reverse-a-stack-using-recursion</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/273-kth-largest-sum-among-all-contiguous-subarrays</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/274-check-if-an-array-is-a-stack-permutation-of-another</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/275-reorganize-a-string-so-no-two-adjacent-characters-repeat</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/276-implement-n-queues-in-a-single-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/277-smallest-range-covering-elements-from-k-lists</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/278-implement-a-circular-queue</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/279-convert-a-bst-to-a-min-heap</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/280-lru-cache-implementation</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/281-convert-a-min-heap-to-a-max-heap</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/282-reverse-a-queue-using-recursion</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/283-minimum-sum-of-two-numbers-formed-from-digits-of-an-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/284-find-the-first-circular-tour-that-visits-all-petrol-pumps</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/285-first-negative-integer-in-every-window-of-size-k</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/286-distance-of-nearest-cell-having-1-in-a-binary-matrix</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/287-sum-of-minimum-and-maximum-elements-of-all-subarrays-of-size-k</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/288-minimum-sum-of-squares-of-character-counts-after-removing-k-characters</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/289-first-non-repeating-character-in-a-stream</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/290-next-smaller-element-for-every-array-element</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/291-check-if-all-levels-of-two-binary-trees-are-anagrams</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/292-print-all-n-queens-solutions</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/293-remove-invalid-parentheses</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/294-print-all-palindromic-partitions-of-a-string</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/295-tug-of-war</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/296-find-shortest-safe-route-in-a-path-with-landmines</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/297-path-of-more-than-k-length-from-a-source</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/298-longest-possible-route-in-a-matrix-with-hurdles</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/299-print-all-possible-paths-from-top-left-to-bottom-right-of-a-matrix</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/300-partition-of-a-set-into-k-subsets-with-equal-sum</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/301-find-the-k-th-permutation-sequence</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/302-binomial-coefficient-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/303-permutation-coefficient-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/304-program-for-nth-catalan-number</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/305-friends-pairing-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/306-gold-mine-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/307-assembly-line-scheduling-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/308-painting-the-fence-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/309-maximize-the-cut-segments</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/310-lcs-of-three-strings</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/311-maximum-sum-increasing-subsequence</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/312-count-all-subsequences-having-product-less-than-k</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/313-longest-subsequence-with-adjacent-elements-differing-by-one</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/314-maximum-subsequence-sum-with-no-three-consecutive-elements</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/315-maximum-length-chain-of-pairs</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/316-maximum-sum-of-pairs-with-specific-difference</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/317-maximum-difference-of-zeros-and-ones-in-a-binary-string</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/318-minimum-cost-to-fill-a-bag-with-given-weight</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/319-minimum-removals-from-array-to-make-max-minus-min-at-most-k</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/320-count-ways-to-reach-a-given-score-in-a-game</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/321-count-balanced-binary-trees-of-height-h</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/322-smallest-sum-contiguous-subarray</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/323-unbounded-knapsack-repetition-of-items-allowed</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/324-largest-independent-set-in-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/325-longest-palindromic-subsequence</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/326-longest-alternating-subsequence</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/327-weighted-job-scheduling</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/328-coin-game-winner-where-every-player-has-three-choices</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/329-count-derangements</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/330-optimal-strategy-for-a-game</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/331-optimal-binary-search-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/332-palindrome-partitioning-problem-minimum-cuts</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/333-mobile-numeric-keypad-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/334-boolean-parenthesization-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/335-largest-rectangular-sub-matrix-whose-sum-is-0</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/336-largest-area-rectangular-sub-matrix-with-equal-number-of-1s-and-0s</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/337-maximum-sum-rectangle-in-a-2d-matrix</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/338-maximum-profit-with-at-most-k-transactions</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/339-find-a-fixed-point-in-an-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/340-optimum-location-of-a-point-to-minimize-total-distance</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/341-searching-in-an-array-where-adjacent-differ-by-at-most-k</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/342-count-triplets-with-sum-smaller-than-a-given-value</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/343-product-array-puzzle</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/344-sort-an-array-according-to-count-of-set-bits</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/345-minimum-number-of-swaps-required-to-sort-an-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/346-find-the-pivot-element-in-a-sorted-rotated-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/347-k-th-element-of-two-sorted-arrays</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/348-missing-number-in-an-arithmetic-progression</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/349-smallest-number-with-at-least-n-trailing-zeroes-in-factorial</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/350-subset-sums</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/351-merge-sort-in-place-merge</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/352-eko-cutting-wood-to-get-at-least-m-metres</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/353-roti-prata-minimum-time-to-cook-p-pratas</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/354-the-double-helix-maximum-sum-path-between-two-sequences</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/355-bishu-and-soldiers</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/356-rasta-and-kheshtak-biggest-common-subsquare</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/357-kth-smallest-element-in-a-range</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/358-huffman-coding-total-encoded-length</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/359-water-connection-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/360-greedy-algorithm-to-find-minimum-number-of-coins</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/361-maximum-trains-for-which-stoppage-can-be-provided</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/362-buy-maximum-stocks-if-i-stocks-can-be-bought-on-the-i-th-day</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/363-minimize-cash-flow-among-friends</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/364-minimum-cost-to-cut-a-board-into-squares</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/365-check-if-it-is-possible-to-survive-on-the-island</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/366-find-maximum-meetings-in-one-room</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/367-maximum-sum-of-absolute-difference-of-an-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/368-maximize-sum-of-consecutive-differences-in-a-circular-array</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/369-smallest-subset-with-sum-greater-than-all-other-elements</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/370-defense-of-a-kingdom</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/371-wine-trading-in-gergovia</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/372-k-centers-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/373-minimum-cost-of-ropes</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/374-rearrange-characters-in-a-string-such-that-no-two-adjacent-are-same</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/375-maximum-sum-possible-with-equal-sum-of-three-stacks</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/376-arranging-amplifiers</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/377-create-a-graph-and-print-its-adjacency-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/378-search-in-a-maze</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/379-clone-a-graph</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/380-making-wired-connections</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/381-word-ladder-shortest-transformation-length</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/382-minimum-time-for-each-job-in-a-dag</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/383-course-schedule-possible-to-finish-all-tasks</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/384-alien-dictionary-order-of-characters</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/385-kruskal-s-algorithm-mst-edges</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/386-prim-s-algorithm-mst-edges</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/387-total-number-of-spanning-trees-in-a-graph</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/388-bellman-ford-shortest-paths-from-a-source</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/389-floyd-warshall-all-pairs-shortest-paths</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/390-travelling-salesman-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/391-graph-colouring-minimum-number-of-colours</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/392-m-colouring-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/393-snake-and-ladder-minimum-dice-throws</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/394-find-bridges-in-a-graph</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/395-longest-path-in-a-directed-acyclic-graph</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/396-journey-to-the-moon</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/397-cheapest-flights-within-k-stops</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/398-oliver-and-the-game</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/399-water-jug-problem-using-bfs</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/400-minimum-edges-to-reverse-for-a-source-to-destination-path</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/401-seven-bridges-eulerian-path-existence</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/402-vertex-cover-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/403-chinese-postman-route-inspection-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/404-number-of-triangles-in-a-directed-and-undirected-graph</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/405-two-clique-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/406-minimise-the-cash-flow-among-a-set-of-friends</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/407-reverse-level-order-traversal</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/408-diagonal-traversal-of-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/409-boundary-traversal-of-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/410-construct-a-binary-tree-from-a-bracket-representation-string</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/411-convert-a-binary-tree-into-a-doubly-linked-list</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/412-convert-a-binary-tree-into-a-sum-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/413-minimum-swaps-to-convert-a-binary-tree-into-a-bst</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/414-check-if-a-binary-tree-is-a-sum-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/415-check-if-all-leaf-nodes-are-at-the-same-level</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/416-check-for-duplicate-subtrees-of-size-2-or-more</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/417-check-if-two-binary-trees-are-mirrors-of-each-other</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/418-sum-of-nodes-on-the-longest-root-to-leaf-path</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/419-check-if-a-given-graph-is-a-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/420-find-the-largest-subtree-sum-in-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/421-maximum-sum-of-non-adjacent-nodes-in-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/422-print-all-k-sum-paths-in-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/423-distance-between-two-nodes-in-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/424-kth-ancestor-of-a-node-in-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/425-find-all-duplicate-subtrees-in-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/426-tree-isomorphism-problem</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/427-find-a-value-in-a-bst</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/428-find-the-inorder-predecessor-of-a-node-in-a-bst</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/429-populate-the-inorder-successor-of-every-node-in-a-bst</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/430-convert-a-binary-tree-into-a-bst</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/431-convert-a-bst-into-a-balanced-bst</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/432-find-the-kth-largest-element-in-a-bst</loc>
<lastmod>2026-10-20T19:33:19.023Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/433-count-pairs-from-two-bsts-whose-sum-equals-a-given-value</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/434-find-the-median-of-a-bst</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/435-count-bst-nodes-in-a-given-range</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/436-replace-every-element-with-the-least-greater-element-on-its-right</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/437-find-all-conflicting-appointments</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/438-check-if-a-given-sequence-could-be-a-valid-bst-preorder</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/439-check-whether-a-bst-contains-a-dead-end</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/440-find-the-largest-bst-subtree-in-a-binary-tree</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/441-flatten-a-bst-to-a-sorted-right-skewed-list</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/add-two-integers-without-using-plus-or</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/anagram-check</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/binomial-coefficient-modulo-a-prime</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/bitwise-and-of-all-numbers-in-a-range</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/check-if-a-queue-can-be-sorted-using-an-auxiliary-stack</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/check-if-a-string-is-a-palindrome-using-recursion</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/check-if-two-integers-differ-by-exactly-one-bit</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/chinese-remainder-theorem</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/clear-the-rightmost-set-bit</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/container-with-most-water</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/count-anagram-substrings</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/count-inversions-in-an-array</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/count-primes-in-range</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/count-subsets-with-a-given-xor-value</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/count-ways-to-climb-a-staircase</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/digital-root</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/efficient-search-using-exponential-search</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/elements-appearing-more-than-n-3-times</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/factorial-of-n</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/find-the-missing-number-in-a-sequence</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/first-and-last-occurrence-of-a-target</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/first-negative-integer-in-every-window-of-size-k</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/first-non-repeating-character</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/gcd-and-lcm-of-two-numbers</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/generate-all-permutations-of-a-string</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/generate-all-subsets-of-a-set-using-bitmasking</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/generate-binary-numbers-from-1-to-n-using-a-queue</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/generate-the-full-n-bit-gray-code-sequence</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/group-anagrams</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/height-checker</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/implement-a-queue-using-two-stacks</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/isomorphic-strings</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/josephus-problem-find-the-winner</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/jump-search-on-a-sorted-array</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/kth-smallest-element-in-a-row-wise-and-column-wise-sorted-matrix</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/largest-number-formed-from-array</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/longest-consecutive-sequence</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/longest-subarray-of-1s-after-flipping-at-most-k-zeros</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/longest-subarray-with-equal-number-of-0s-and-1s</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/longest-subarray-with-sum-k</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/longest-substring-with-at-most-k-distinct-characters</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/longest-substring-with-at-most-k-distinct-characters</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/longest-substring-without-repeating-characters</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/majority-element</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/majority-element-finder</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/maximum-average-subarray-of-size-k</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/maximum-number-of-vowels-in-a-substring-of-length-k</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/maximum-points-from-cards</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/maximum-sum-subarray-of-size-k</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/maximum-xor-of-two-numbers-in-an-array</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/median-of-a-row-wise-sorted-matrix</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/median-of-two-sorted-arrays</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/merge-overlapping-intervals</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/merge-two-sorted-arrays-in-place</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/minimum-eating-speed-to-finish-all-fruit-piles-in-time</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/minimum-number-of-platforms-required</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/minimum-ship-capacity-to-deliver-packages-within-d-days</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/minimum-time-to-rot-all-oranges-in-a-grid</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/minimum-window-substring</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/modular-exponentiation</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/modular-multiplicative-inverse</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/move-zeroes-to-the-end</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/n-queens-count</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/pair-with-target-sum-in-sorted-array</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/palindrome-number-check</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/peak-index-in-a-mountain-array-via-ternary-search</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/perfect-number-check</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/prime-factorization-with-exponents</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/prime-number-check</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/print-all-subsequences-of-a-string</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/quadruplets-summing-to-target</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/radix-sort-for-non-negative-integers</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/recursive-linear-search-in-an-array</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/relative-sort-array</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/remove-duplicates-from-sorted-array-in-place</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/reverse-a-string-using-recursion</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/search-in-a-row-and-column-sorted-2d-matrix</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/search-in-a-sorted-2d-matrix-staircase-search</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/search-insert-position-in-a-sorted-array</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/shortest-path-in-a-binary-maze</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/shortest-subarray-with-sum-at-least-k</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/single-element-in-a-sorted-duplicate-array</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/sliding-window-maximum</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/sliding-window-maximum-using-a-deque</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/smallest-divisor-with-a-given-sum-threshold</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/smallest-range-covering-elements-from-k-sorted-lists</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/smallest-subarray-with-sum-at-least-target</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/sort-a-nearly-sorted-k-sorted-array</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/sort-an-array-of-0s-1s-and-2s-dutch-national-flag</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/sort-an-array-of-three-colors</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/sort-characters-by-frequency</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/squares-of-a-sorted-array</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/sum-of-digits-of-a-number</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/sum-of-euler-s-totient-function</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/swap-two-bits-at-given-positions</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/task-scheduler-with-cooldown</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/three-sum-closest-to-target</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/total-hamming-distance-across-an-array</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/tower-of-hanoi-move-sequence</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/trapping-rain-water</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/triplets-summing-to-zero</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/two-sum-return-indices</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/valid-palindrome-ignoring-punctuation</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://campus.devert.in/dsa/word-break-count-ways-to-segment-a-string</loc>
<lastmod>2026-10-20T19:33:19.024Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
</urlset>
