<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://takeuforward.org/</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>1</priority>
</url>
<url>
<loc>https://takeuforward.org/home</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/about</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/contact</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/privacy-policy</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/terms-and-conditions</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/cancellation-policy</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/troubleshooting</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/hall-of-fame</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/get-started</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/dsa/strivers-a2z-sheet-learn-dsa-a-to-z</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/dsa/strivers-sde-sheet-top-coding-interview-problems</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/dsa/strivers-79-last-moment-dsa-sheet-ace-interviews</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/dsa/blind-75-leetcode-problems-detailed-video-solutions</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/competitive-programming/strivers-cp-sheet</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/system-design/complete-system-design-roadmap-with-videos-for-sdes</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/interview</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/interview/all</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/interview/popular-companies</loc>
<lastmod>2026-04-08T01:27:13.809Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/arrays</loc>
<lastmod>2026-04-08T01:27:14.049Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/convert-an-array-to-a-linked-list</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/convert-an-array-to-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/search-in-a-row-and-column-wise-sorted-matrix</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-the-row-with-maximum-number-of-1s</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/kth-missing-positive-number</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/minimise-maximum-distance-between-gas-stations</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/capacity-to-ship-packages-within-d-days</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/painters-partition-problem</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/split-array-largest-sum</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/koko-eating-bananas</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-the-smallest-divisor-given-a-threshold</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/minimum-days-to-make-m-bouquets</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-out-how-many-times-the-array-has-been-rotated</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/first-and-last-occurrences-in-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/search-element-in-rotated-sorted-array-ii</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/floor-and-ceil-in-sorted-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/search-insert-position</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/implement-upper-bound</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/longest-subarray-with-sum-k-postives-and-negatives</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/count-subarray-sum-equals-k</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/rearrange-array-elements-by-sign</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-the-number-that-appears-once-and-the-other-numbers-twice</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/recursive-bubble-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/right-rotate-an-array-by-d-places</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/recursive-insertion-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-the-missing-number-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/left-rotate-an-array-by-d-places</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/linear-search-algorithm</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-the-highest-lowest-frequency-element</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/palindrome-partitioning-ii-front-partition-dp-53</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/count-square-submatrices-with-all-1s-dp-on-rectangles-dp-56</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/maximum-rectangle-area-with-all-1s-dp-on-rectangles-dp-55</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/partition-array-for-maximum-sum-front-partition-dp-54</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/minimum-cost-to-cut-the-stick-dp-50</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/detect-cycle-in-a-directed-graph-using-dfs-g-19</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/number-of-distinct-islands</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/matrix-chain-multiplication-tabulation-method-dp-49</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/matrix-chain-multiplication-dp-48</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/number-of-longest-increasing-subsequences-dp-47</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/detect-cycle-in-an-undirected-graph-using-dfs</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/longest-bitonic-subsequence-dp-46</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/detect-cycle-in-an-undirected-graph-using-bfs</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/product-of-array-except-itself</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/passing-2d-arrays-as-arguments-in-cpp</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/counting-bits</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/overlapping-intervals</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/insert-new-interval</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/longest-increasing-subsequence-binary-search-dp-43</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/longest-divisible-subset-dp-44</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/printing-longest-increasing-subsequence-dp-42</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/minimum-in-rotated-sorted-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/longest-increasing-subsequence-dp-41</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/container-with-most-water</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/contains-duplicate-check-if-a-value-appears-atleast-twice</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/word-search-leetcode</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/merge-k-sorted-arrays</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/implement-k-stacks-in-a-single-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/heap-sort</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/buy-and-sell-stocks-with-cooldown-dp-39</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/lexicographic-rank-of-a-string</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/buy-and-sell-stocks-with-transaction-fees-dp-40</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/buy-and-sell-stock-iv-dp-38</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/buy-and-sell-stock-iii-dp-37</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/two-stacks-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/buy-and-sell-stock-ii-dp-36</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/stock-buy-and-sell-dp-35</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/matrix-addition-in-c</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/transpose-of-a-matrix-in-c</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/string-concatenation-in-c</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/strcpy-in-c</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/linear-search-in-c</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/pointer-in-c</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/spiral-traversal-of-matrix</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/reverse-string-in-c</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/prefix-sum-technique</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/evaluation-of-postfix-expression</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/bucket-sort-detailed-explanation</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/intersection-of-two-sorted-arrays</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/wildcard-matching-dp-34</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/count-1s-in-sorted-binary-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/sliding-window-technique</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/edit-distance-dp-33</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/last-occurrence-in-a-sorted-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/1st-occurrence-in-a-sorted-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/for-loop-in-c</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/check-if-an-array-is-sorted</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/while-loop-in-c</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/shortest-common-supersequence-dp-31</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/anagram-substring-search</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/kth-largest-smallest-element-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/maximum-difference-problem-with-order</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/leftmost-non-repeating-element</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/naive-pattern-searching</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/radix-sort-explained</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/passing-2d-arrays-as-arguments-in-java</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/longest-common-span-with-same-sum-in-binary-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/matrix-boundary-traversal</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/count-distinct-elements-in-every-window</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/minimum-insertions-deletions-to-convert-string-dp-30</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/minimum-insertions-to-make-string-palindrome-dp-29</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/longest-common-substring-dp-27</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/longest-palindromic-subsequence-dp-28</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/sort-an-array-of-0s-and-1s</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/print-longest-common-subsequence-dp-26</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/count-sort-explained-with-examples</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/longest-subarray-with-an-equal-0s-and-1s</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/search-in-an-infinite-sorted-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/two-odd-occurring</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/one-odd-occurring</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/union-of-two-sorted-arrays</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/insertion-sort-in-c</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/selection-sort-in-c</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/more-than-n-k-occurences-of-element-in-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/bubble-sort-in-c</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/peak-element-in-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/longest-common-subsequence-dp-25</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/time-complexity-of-binary-search-using-recursion-tree</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/matrix-in-snake-pattern</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/longest-subarray-with-given-sum-k</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/minimum-difference-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/rotate-matrix-anti-clockwise-by-90-degree</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/sieve-of-eratosthenes-find-all-prime-numbers</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/subarray-with-given-sum</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/count-occurrences-in-sorted-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/transpose-a-matrix-program-01-space</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/unbounded-knapsack-dp-23</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/check-if-a-string-is-a-subsequence-of-other</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/rod-cutting-problem-dp-24</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/longest-even-odd-subarray</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/leaders-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/josephus-problem</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/what-is-two-pointer-approach</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/minimum-coins-dp-20</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/target-sum-dp-21</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/coin-change-2-dp-22</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/count-partitions-with-given-difference-dp-18</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/0-1-knapsack-dp-19</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-word-with-highest-number-of-repeated-letters-in-string</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/queue-in-data-structure</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/operations-on-arrays</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/reverse-array-in-c</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/count-subsets-with-sum-k-dp-17</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/binary-search-analysis</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/what-is-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/left-rotate-the-array-by-one</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/partition-set-into-2-subsets-with-min-absolute-sum-diff-dp-16</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/array-implementation-of-deque</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/partition-equal-subset-sum-dp-15</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/subset-sum-equal-to-target-dp-14</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/3-d-dp-ninja-and-his-friends-dp-13</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/tower-of-hanoi</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/binary-search-explained</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/minimum-maximum-falling-path-sum-dp-12</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/minimum-path-sum-in-triangular-grid-dp-11</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/minimum-path-sum-in-a-grid-dp-10</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/median-of-row-wise-sorted-matrix</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/move-all-zeros-to-the-end-of-the-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/grid-unique-paths-dp-on-grids-dp8</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/grid-unique-paths-2-dp-9</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-all-symmetric-pairs-in-the-array-of-pairs</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/remove-duplicates-from-an-unsorted-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/finding-equilibrium-index-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/dynamic-programming-ninjas-training-dp-7</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/replace-elements-by-its-rank-in-the-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/remove-all-duplicates-from-a-string</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/maximum-occurring-character-in-a-string</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/check-if-array-is-subset-of-another-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/rotate-array-by-k-elements</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/sort-elements-of-an-array-by-frequency</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/dynamic-programming-frog-jump-with-k-distances-dp-4</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/maximum-sum-of-non-adjacent-elements-dp-5</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/combination-sum-ii-find-all-unique-combinations</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/dynamic-programming-frog-jump-dp-3</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/rotate-array-by-k-elements-block-swap-algorithm</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/check-if-two-strings-are-anagrams-of-each-other</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/calculate-frequency-of-characters-in-a-string</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/rearrange-array-in-increasing-decreasing-order</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/dynamic-programming-introduction</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/search-an-element-in-an-array-program-cpp-java</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/reverse-a-given-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/concatenate-one-string-to-another</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/insertion-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/merge-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-median-of-the-given-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-the-smallest-element-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-the-largest-element-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/count-frequency-of-each-element-in-the-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-all-the-non-repeating-elements-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-second-smallest-and-second-largest-element-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/selection-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/maximum-product-subarray-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/quick-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/bubble-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-all-repeating-elements-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/calculate-sum-of-the-elements-of-the-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/adding-element-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/average-of-all-the-elements-in-the-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/maximum-xor-of-two-numbers-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/fractional-knapsack-problem-greedy-approach</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/set-matrix-zero</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-minimum-number-of-coins</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/n-meetings-in-one-room</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/subset-ii-print-all-the-unique-subsets</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/rat-in-a-maze</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/n-queen-problem-return-all-distinct-solutions-to-the-n-queens-puzzle</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/print-all-permutations-of-a-string-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/longest-consecutive-sequence-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/kadanes-algorithm-maximum-subarray-sum-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/merge-overlapping-sub-intervals</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/implement-queue-using-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/merge-two-sorted-arrays-without-extra-space</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/palindrome-partitioning</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/combination-sum-1</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/subset-sum-sum-of-all-subsets</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-the-duplicate-in-an-array-of-n1-integers</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/trapping-rainwater</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/rotate-image-by-90-degree</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/area-of-largest-rectangle-in-histogram</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-k-th-permutation-sequence</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/stock-buy-and-sell</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/count-maximum-consecutive-ones-in-the-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/binary-search-with-cpp-stl</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/remove-duplicates-in-place-from-sorted-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/length-of-longest-substring-without-any-repeating-character</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/count-reverse-pairs</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/aggressive-cows-detailed-solution</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/sliding-window-maximum</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/3-sum-find-triplets-that-add-up-to-a-zero</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/rotten-oranges-min-time-to-rot-all-oranges-bfs</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/allocate-minimum-number-of-pages</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/median-of-two-sorted-arrays-of-different-sizes</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/minimum-number-of-platforms-required-for-a-railway</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/implement-stack-using-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/search-element-in-a-rotated-sorted-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/k-th-element-of-two-sorted-arrays</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/search-single-element-in-a-sorted-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/count-inversions-in-an-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/4-sum-find-quads-that-add-up-to-a-target-value</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/grid-unique-paths-count-paths-from-left-top-to-the-right-bottom-of-a-matrix</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/count-the-number-of-subarrays-with-given-xor-k</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/majority-elementsn-3-times-find-the-elements-that-appears-more-than-n-3-times-in-the-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/length-of-the-longest-subarray-with-zero-sum</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-the-repeating-and-missing-numbers</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/search-in-a-sorted-2d-matrix</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/next_permutation-find-next-lexicographically-greater-permutation</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/find-the-majority-element-that-occurs-more-than-n-2-times</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/two-sum-check-if-a-pair-with-given-sum-exists-in-array</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/sort-an-array-of-0s-1s-and-2s</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/arrays/help-us-grow-takeuforward</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/basics</loc>
<lastmod>2026-04-08T01:27:14.049Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/basics/understanding-strings</loc>
<lastmod>2026-04-08T01:27:14.272Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/basics/understanding-do-while-loops</loc>
<lastmod>2026-04-08T01:27:14.272Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/basics/switch-case-statements</loc>
<lastmod>2026-04-08T01:27:14.272Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/basics/understanding-for-loop</loc>
<lastmod>2026-04-08T01:27:14.272Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/basics/while-loops-in-programming</loc>
<lastmod>2026-04-08T01:27:14.272Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/basics/functions-in-c-pass-by-reference-and-value</loc>
<lastmod>2026-04-08T01:27:14.272Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/binary-search</loc>
<lastmod>2026-04-08T01:27:14.049Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/find-peak-element-ii</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/search-in-a-row-and-column-wise-sorted-matrix</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/find-the-row-with-maximum-number-of-1s</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/painters-partition-problem</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/kth-missing-positive-number</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/capacity-to-ship-packages-within-d-days</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/minimise-maximum-distance-between-gas-stations</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/split-array-largest-sum</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/find-out-how-many-times-the-array-has-been-rotated</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/minimum-days-to-make-m-bouquets</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/finding-sqrt-of-a-number-using-binary-search</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/koko-eating-bananas</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/search-element-in-rotated-sorted-array-ii</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/first-and-last-occurrences-in-array</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/floor-and-ceil-in-sorted-array</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/search-insert-position</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/implement-upper-bound</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/implement-lower-bound-bs-2</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/minimum-in-rotated-sorted-array</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/count-1s-in-sorted-binary-array</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/1st-occurrence-in-a-sorted-array</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/search-in-an-infinite-sorted-array</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/time-complexity-of-binary-search-using-recursion-tree</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/count-occurrences-in-sorted-array</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/operations-on-arrays</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/binary-search-analysis</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/binary-search-explained</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/median-of-row-wise-sorted-matrix</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/binary-search-with-cpp-stl</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/aggressive-cows-detailed-solution</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/allocate-minimum-number-of-pages</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/median-of-two-sorted-arrays-of-different-sizes</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/nth-root-of-a-number-using-binary-search</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/search-element-in-a-rotated-sorted-array</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/search-single-element-in-a-sorted-array</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search/search-in-a-sorted-2d-matrix</loc>
<lastmod>2026-04-08T01:27:14.968Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/binary-search-tree</loc>
<lastmod>2026-04-08T01:27:14.049Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/largest-bst-in-binary-tree</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/recover-bst-correct-bst-with-two-nodes-swapped</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/two-sum-in-bst-check-if-there-exists-a-pair-with-sum-k</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/inorder-successor-predecessor-in-bst</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/construct-a-bst-from-preorder-traversal</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/lca-in-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/check-if-a-tree-is-a-binary-search-tree-or-binary-tree</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/insert-a-given-node-in-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/delete-a-node-in-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/floor-in-a-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/ceil-in-a-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/introduction-to-binary-search-trees</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/check-if-binary-tree-is-bst</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/search-in-a-binary-search-tree-2</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/binary-search-tree-bst-introduction</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/search-in-a-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-search-tree/kth-largest-smallest-element-in-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:14.858Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/binary-tree</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/largest-bst-in-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/binary-search-tree-iterator</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/requirements-needed-to-construct-a-unique-binary-tree-theory</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/iterative-postorder-traversal-of-binary-tree-using-1-stack</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/iterative-inorder-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/iterative-preorder-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/iterative-postorder-traversal-of-binary-tree-using-2-stack</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/print-nodes-at-distance-k-in-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/binary-tree-representation-in-java</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/binary-tree-representation-in-c</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/subtree-of-another-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/check-if-binary-tree-is-bst</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/count-number-of-nodes-in-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/binary-tree-traversal-inorder-preorder-postorder</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/application-of-tree-data-structure</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/construct-binary-tree-from-inorder-and-postorder-traversal</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/construct-a-binary-tree-from-inorder-and-preorder-traversal</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/strivers-tree-series-tree-data-structure</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/how-to-construct-a-binary-tree-using-different-traversals</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/flatten-binary-tree-to-linked-list</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/maximum-width-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/print-root-to-node-path-in-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/post-order-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/preorder-inorder-postorder-traversals-in-one-traversal</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/vertical-order-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/boundary-traversal-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/morris-preorder-traversal-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/lowest-common-ancestor-for-two-given-nodes</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/level-order-traversal-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/inorder-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/maximum-sum-path-in-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/zig-zag-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/serialize-and-deserialize-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/preorder-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/check-if-two-trees-are-identical</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/search-in-a-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/kth-largest-smallest-element-in-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/right-left-view-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/bottom-view-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/top-view-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/check-for-symmetrical-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/check-if-the-binary-tree-is-balanced-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/calculate-the-diameter-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/maximum-depth-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/binary-tree/morris-inorder-traversal-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:16.793Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/bit-manipulation</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/bitwise-operators</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/remove-the-rightmost-set-bit</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/power-set-bit-manipulation</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/swap-two-numbers</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/count-total-set-bits-in-an-integer</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/toggle-the-ith-bit</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/introduction-to-bit-manipulation-1-s-and-2-s-complement</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/divide-two-integers-without-using-multiplication-and-division-operators</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/xor-of-numbers-in-a-range-l-to-r</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/xor-of-numbers-in-a-given-range</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/single-number-iii</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/single-number-ii</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/single-number-i</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/minimum-bit-flips-to-convert-number</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/clear-the-ith-bit</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/set-the-ith-bit</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/how-int-data-type-is-stored-in-memory</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/counting-bits</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/reverse-bits</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/check-if-kth-bit-is-set-or-not</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/bitwise-operators-in-java</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/check-whether-a-given-number-is-even-or-odd</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/bit-manipulation/count-total-set-bits-in-numbers-from-0-to-n</loc>
<lastmod>2026-04-08T01:27:16.308Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/c</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/c/min-element-in-c-stl</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/sort-in-c-stl</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/max-element-in-c-stl</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/builtin-popcount-in-stl-cpp-count-set-bits</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/priority-queue-in-c-stl</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/deque-in-c-stl</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/next-permutation-in-c-stl</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/list-in-c-stl</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/multimap-in-c-stl</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/stack-in-c-stl</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/classes-and-structures-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/how-to-set-up-visual-studio-code-for-c-cp-and-dsa</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/binary-tree-representation-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/a-guide-on-online-c-compiler</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/passing-2d-arrays-as-arguments-in-cpp</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/graph-representation-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/function-overloading-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-memory-management</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-function-and-structure</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-tutorials-learn-cpp-for-free-best-resource</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-pointers-and-arrays</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-user-defined-function-types</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-storage-class</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-stl-tutorial-most-frequent-used-stl-containers</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-enumeration</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-variables-literals-and-constants</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/operator-overloading-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-classes-and-objects</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/templates-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/map-in-c-stl</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-programs-list-of-most-popular-programs-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/pointer-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/structure-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/lcm-of-two-numbers-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-operators</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/data-types-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/for-loop-in-c-2</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-public-protected-and-private-inheritance</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-inheritance</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-functions</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-call-by-reference-using-pointers</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/type-conversion-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-polymorphism</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/virtual-functions-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/inheritance-in-c-multiple-multilevel-hierarchical</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-pointer</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/structures-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/function-overriding-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/multidimensional-arrays-in-cpp</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-basic-input-output</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/encapsulation-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/friend-function-and-friend-classes-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/constructor-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/set-in-c-stl</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/unordered-set-in-c-stl</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/switch-case-statement-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/vector-in-c-stl</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/while-loop-and-do-while-loop-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/if-else-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-goto-statement</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-continue-statement</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-break-statement</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/for-loop-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/comments-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/string-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/bitwise-operators-in-c</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/c/c-vs-java-spot-the-difference</loc>
<lastmod>2026-04-08T01:27:16.704Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/core</loc>
<lastmod>2026-04-08T01:27:15.874Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/core/presentation-layer</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/domain-name-system</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/world-wide-web</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/hypertext-transfer-protocol</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/file-transfer-protocol</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/simple-mail-transfer-protocol</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/dynamic-host-configuration-protocol</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/network-security</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/cryptography</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/types-of-encryption</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/hash-functions</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/digital-signatures</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/network-security-protocols</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/vpn</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/network-attacks</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/ping-commands</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/delay-and-its-types</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/batch-os</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/process-synchronisation-and-its-tools</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/critical-section-problem</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/deadlock-in-concurrent-systems</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/security-threats-vulnerabilities</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/raid-and-its-types</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/spooling</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/syncronous-asyncronous</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/blocking-non-blocking</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/fragmentation</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/file-allocation-deallocation</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/types-of-file-system</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/file-system</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/direct-associative-mapping</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/cache</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/disk-scheduling-algorithms</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/disk-scheduling</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/thrashing</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/belady-anomaly</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/page-replacement-algorithm</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/page-fault</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/dynamic-binding</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/contiguous-allocation-paging-segmentation</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/virtual-memory</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/memory-management-techniques</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/bankers-algorithm</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/semaphore-and-its-types</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/producer-consumer</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/starving-aging</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/scheduling-algorithms</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/process-scheduling-preemptive-and-non-preemptive</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/normal-function-call-system-call-in-os</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/process-and-its-states</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/kernel-user-models</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/multiprogramming-multitasking-in-os</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/types-of-OS</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/progress-program-and-thread</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/os-and-main-functions</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/types-of-databases</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/data-models</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/denormalisation</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/operators-aggregations-in-sql</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/joins-in-sql</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/database-views</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/sql-subqueries</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/serializability-concurrency-control</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/database-recovery-management</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/data-masking-techniques</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/encryption</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/role-based-access-control</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/sharding</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/vertical-horizontal-scaling</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/b-bplus-trees</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/indexing-and-its-types</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/techniques-for-optimising-sql-queries</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/locking-protocols</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/isolation-levels-and-its-types</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/scheduling</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/acid-properties</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/sql-unions</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/sql-clauses</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/sql-command-and-their types</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/insert-update-delete-from-referencing-table</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/super-key</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/integrity-constraints</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/referential-integrity</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/keys</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/insert-update-delete-from-referenced-table</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/functional-dependency</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/normalisation-and-its-types</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/intension-extenstion</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/essential-components-of-a-table</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/rdbms</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/convert-er-model-to-relational-model</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/relational-model-to-er</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/relational-model-in-DBMS</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/er-model-instagram</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/steps-to-draw-er-diagram</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/generalisation-in-dbms</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/extended-ER-features</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/specialisation</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/aggregation</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/1-1-relationships</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/participation-constraints</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/many-many-relationships</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/many-1-relationships</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/1-many-relationships</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/er-model-in-dbms</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/relationship-and-degree-in-er-model</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/attributes-and-its-types</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/entity-and-its-types</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/3-tier-architecture</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/data-architecture</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/dbms-abstraction</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/adv-disadv-dbms</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/dbms-and-its-applications</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/data-database-file-system</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/data-database-and-file-system</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/complete-system-design-roadmap-with-videos-for-sdes</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/most-asked-computer-networks-interview-questions</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-are-firewalls</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/server-side-load-balancer</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-happens-when-you-enter-google-com</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/vpn-advantages-and-disadvantages-of-it</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-are-http-and-https-protocols</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-is-the-smtp-protocol</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/difference-between-tcp-and-udp</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/difference-between-hub-vs-switch</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/define-gateway-the-difference-between-gateway-and-router</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/difference-between-ipv4-and-ipv6</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/3-way-handshaking</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/rsa-algorithm</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/difference-between-intension-and-extension-in-a-database</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/difference-between-share-lock-and-exclusive-lock</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/significance-of-data-link-layer</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/ccpconcurrency-control-protocols</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/an-entity-entity-type-entity-set-weak-entity-set</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/sql-commands</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/2-tier-and-3-tier-architecture-in-dbms</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/difference-between-truncate-and-delete-command</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/different-types-of-delays</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-is-lan-local-area-network</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-is-ddl-data-definition-language</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-is-a-functional-dependency</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/explain-tcp-model</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/osi-model</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-is-ip-address-private-ip-address-public-ip-address</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/define-network</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-do-you-mean-by-network-topology-explain-types</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/define-bandwidth-node-and-link</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-is-spooling</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-are-semaphore-and-mutex-define-binary-semaphore</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/beladys-anomaly-explained</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/starving-and-ageing-in-operating-system-explained</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/why-does-thrashing-occur</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/difference-between-process-program-and-thread-different-types</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/define-virtual-memory-thrashing-and-threads</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-is-raid-different-types-of-raid</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-is-a-deadlock-necessary-conditions-for-deadlock</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-is-fragmentation-types-of-fragmentation</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/difference-between-direct-mapping-and-associative-mapping</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/difference-between-multitasking-and-multiprocessing</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/most-asked-operating-system-interview-questions</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-is-main-purpose-of-operating-system-discuss-different-types</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-are-a-socket-kernel-and-monolithic-kernel</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/priority-scheduling</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/round-robin-scheduling-explained</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/producer-consumer-problem</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/bankers-algorithm-explained</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-is-cache</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/dynamic-binding-explained</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/fcfs-scheduling-explained</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/sjf-scheduling-explained</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/srtf-scheduling-explained</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/lrtf-scheduling-explained</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-is-paging-and-why-do-we-need-it</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/demand-paging-and-segmentation</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/different-types-of-operating-systems-and-real-time-os</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/difference-between-main-memory-and-secondary-memory</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/what-is-network-and-network-topology</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/layers-of-osi-model</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/core/must-do-questions-for-dbms-cn-os-interviews-sde-core-sheet</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/lemonade-change</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/merge-k-sorted-linked-lists</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-peak-element-ii</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/remove-the-rightmost-set-bit</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/toggle-the-ith-bit</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/design-a-browser-history</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/sort-a-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/bit-prerequisites-for-trie-problems</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-string-with-all-prefixes</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/largest-bst-in-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/binary-search-tree-iterator</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/requirements-needed-to-construct-a-unique-binary-tree-theory</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/recover-bst-correct-bst-with-two-nodes-swapped</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/two-sum-in-bst-check-if-there-exists-a-pair-with-sum-k</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/inorder-successor-predecessor-in-bst</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/construct-a-bst-from-preorder-traversal</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/iterative-postorder-traversal-of-binary-tree-using-1-stack</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/iterative-inorder-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/iterative-preorder-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/iterative-postorder-traversal-of-binary-tree-using-2-stack</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/lca-in-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-a-tree-is-a-binary-search-tree-or-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/print-nodes-at-distance-k-in-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/insert-a-given-node-in-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/delete-a-node-in-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/top-linkedlist-interview-questions-structured-path-with-video-solutions</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/length-of-loop-in-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/delete-the-middle-node-of-the-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/delete-the-node-with-value-x-of-a-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/delete-the-kth-element-of-a-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/insert-at-the-head-of-a-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/insert-before-the-kth-element-of-the-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-the-length-of-a-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/convert-an-array-to-a-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/search-an-element-in-a-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/delete-the-given-node-from-the-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/delete-the-kth-node-of-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/insert-before-the-tail-of-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/insertion-at-the-head-of-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/convert-an-array-to-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/introduction-to-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/if-else-statements</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/search-in-a-row-and-column-wise-sorted-matrix</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-the-row-with-maximum-number-of-1s</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/ceil-in-a-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/introduction-to-binary-search-trees</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/painters-partition-problem</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/kth-missing-positive-number</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/split-array-largest-sum</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimise-maximum-distance-between-gas-stations</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-out-how-many-times-the-array-has-been-rotated</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-the-smallest-divisor-given-a-threshold</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/koko-eating-bananas</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-days-to-make-m-bouquets</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/finding-sqrt-of-a-number-using-binary-search</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/floor-and-ceil-in-sorted-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/implement-upper-bound</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/search-element-in-rotated-sorted-array-ii</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/first-and-last-occurrences-in-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-subarray-with-sum-k-postives-and-negatives</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/count-subarray-sum-equals-k</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/implement-lower-bound-bs-2</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-the-number-that-appears-once-and-the-other-numbers-twice</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/rearrange-array-elements-by-sign</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/introduction-to-trees</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-the-missing-number-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-13-increasing-number-triangle-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-8-inverted-star-pyramid</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-12-number-crown-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-11-binary-number-triangle-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-10-half-diamond-star-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-9-diamond-star-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-5-inverted-right-pyramid</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-7-star-pyramid</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-4-right-angled-number-pyramid-ii</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-6-inverted-numbered-right-pyramid</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/print-name-n-times-using-recursion</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-3-right-angled-number-pyramid</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/introduction-to-recursion-understand-recursion-by-printing-something-n-times</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-2-right-angled-triangle-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/print-n-to-1-using-recursion</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/print-1-to-n-using-recursion</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/hashing-maps-time-complexity-collisions-division-rule-of-hashing-strivers-a2z-dsa-course</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-1-rectangular-star-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-22-the-number-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/time-and-space-complexity-strivers-a2z-dsa-course</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-17-alpha-hill-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-21-hollow-rectangle-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-20-symmetric-butterfly-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-19-symmetric-void-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-18-alpha-triangle-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-15-reverse-letter-triangle-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-16-alpha-ramp-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pattern-14-increasing-letter-triangle-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/palindrome-partitioning-ii-front-partition-dp-53</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/partition-array-for-maximum-sum-front-partition-dp-54</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/maximum-rectangle-area-with-all-1s-dp-on-rectangles-dp-55</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/burst-balloons-partition-dp-dp-51</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/g-38-cheapest-flights-within-k-stops</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/g-39-minimum-multiplications-to-reach-end</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/g-40-number-of-ways-to-arrive-at-destination</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/evaluate-boolean-expression-to-true-partition-dp-dp-52</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/bridges-in-graph-using-tarjans-algorithm-of-time-in-and-low-time-g-55</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/articulation-point-in-graph-g-56</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/g-37-path-with-minimum-effort</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/making-a-large-island-dsu-g-52</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/strongly-connected-components-kosarajus-algorithm-g-54</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/most-stones-removed-with-same-row-or-column-dsu-g-53</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/number-of-islands-ii-online-queries-dsu-g-51</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/g-34-dijkstras-algorithm-intuition-and-time-complexity-derivation</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/g-35-print-shortest-path-dijkstras-algorithm</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/number-of-provinces-disjoint-set-g-48</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/accounts-merge-dsu-g-50</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/number-of-operations-to-make-network-connected-dsu-g-49</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/prims-algorithm-minimum-spanning-tree-c-and-java-g-45</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/kruskals-algorithm-minimum-spanning-tree-g-47</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/disjoint-set-union-by-rank-union-by-size-path-compression-g-46</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-spanning-tree-theory-g-44</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/floyd-warshall-algorithm-g-42</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-the-city-with-the-smallest-number-of-neighbours-at-a-threshold-distance-g-43</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/dijkstras-algorithm-using-set-g-33</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/bellman-ford-algorithm-g-41</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/dijkstras-algorithm-using-priority-queue-g-32</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/word-ladder-ii-optimised-approach-g-31</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-eventual-safe-states-bfs-topological-sort-g-25</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/alien-dictionary-topological-sort-g-26</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/topological-sort-algorithm-dfs-g-21</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-cost-to-cut-the-stick-dp-50</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/word-ladder-i-g-29</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/course-schedule-i-and-ii-pre-requisite-tasks-topological-sort-g-24</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/shortest-path-in-undirected-graph-with-unit-distance-g-28</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/detect-a-cycle-in-directed-graph-topological-sort-kahns-algorithm-g-23</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/detect-cycle-in-a-directed-graph-using-dfs-g-19</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-eventual-safe-states-dfs-g-20</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/shortest-path-in-directed-acyclic-graph-topological-sort-g-27</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/kahns-algorithm-topological-sort-algorithm-bfs-g-22</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/matrix-chain-multiplication-tabulation-method-dp-49</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/number-of-distinct-islands</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/bipartite-graph-dfs-implementation</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/surrounded-regions-replace-os-with-xs</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/number-of-enclaves</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/bipartite-graph-bfs-implementation</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/matrix-chain-multiplication-dp-48</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/detect-cycle-in-an-undirected-graph-using-dfs</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-bitonic-subsequence-dp-46</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/number-of-longest-increasing-subsequences-dp-47</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/distance-of-nearest-cell-having-1</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/word-search-ii</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/product-of-array-except-itself</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/rotten-oranges</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/detect-cycle-in-an-undirected-graph-using-bfs</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/palindromic-substrings</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-window-substring</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/depth-first-search-dfs</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/number-of-provinces</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/number-of-islands</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/passing-2d-arrays-as-arguments-in-cpp</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/connected-components-in-graphs</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/breadth-first-search-bfs-level-order-traversal</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/subtree-of-another-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/multiply-two-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/introduction-to-graph</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/counting-bits</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/overlapping-intervals</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/insert-new-interval</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-increasing-subsequence-binary-search-dp-43</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-divisible-subset-dp-44</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-string-chain-dp-45</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/printing-longest-increasing-subsequence-dp-42</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-in-rotated-sorted-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-increasing-subsequence-dp-41</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/contains-duplicate-check-if-a-value-appears-atleast-twice</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/container-with-most-water</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/word-search-leetcode</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/merge-k-sorted-arrays</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/reorder-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-binary-tree-is-bst</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/implement-k-stacks-in-a-single-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/heap-sort</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/buy-and-sell-stocks-with-cooldown-dp-39</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/lexicographic-rank-of-a-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/buy-and-sell-stocks-with-transaction-fees-dp-40</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/buy-and-sell-stock-iv-dp-38</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/buy-and-sell-stock-iii-dp-37</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/two-stacks-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/buy-and-sell-stock-ii-dp-36</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/stock-buy-and-sell-dp-35</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/matrix-addition-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/string-concatenation-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/transpose-of-a-matrix-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/strcpy-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/linear-search-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/spiral-traversal-of-matrix</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/reverse-string-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/evaluation-of-postfix-expression</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/count-digits-in-a-number</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/prefix-sum-technique</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/kmp-algorithm</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/rabin-karp-algorithm-pattern-searching</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/bucket-sort-detailed-explanation</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/introduction-to-pattern-searching-strings</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/intersection-of-two-sorted-arrays</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/delete-kth-node-of-circular-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/wildcard-matching-dp-34</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/count-1s-in-sorted-binary-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/sliding-window-technique</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/edit-distance-dp-33</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/last-occurrence-in-a-sorted-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/1st-occurrence-in-a-sorted-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-an-array-is-sorted</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/implement-stack-using-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/shortest-common-supersequence-dp-31</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/distinct-subsequences-dp-32</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/maximum-difference-problem-with-order</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/anagram-substring-search</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/kth-largest-smallest-element-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/segregate-even-and-odd-nodes-in-linkedlist</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/string-in-java</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/leftmost-repeating-character-in-a-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/radix-sort-explained</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/naive-pattern-searching</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-substring-containing-distinct-elements</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/string-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/matrix-boundary-traversal</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-common-span-with-same-sum-in-binary-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/detect-and-remove-loop-in-a-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-insertions-deletions-to-convert-string-dp-30</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-palindromic-subsequence-dp-28</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-common-substring-dp-27</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/count-distinct-elements-in-every-window</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-insertions-to-make-string-palindrome-dp-29</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/implement-queue-using-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/print-longest-common-subsequence-dp-26</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/sort-an-array-of-0s-and-1s</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/evaluation-of-prefix-expression</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/insertion-at-end-of-circular-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/insertion-at-begin-of-circular-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/delete-head-of-circular-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/search-in-an-infinite-sorted-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-subarray-with-an-equal-0s-and-1s</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/one-odd-occurring</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pairwise-swap-nodes-of-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/union-of-two-sorted-arrays</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-number-of-k-consecutive-bit-flips</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/bitwise-operators-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/reversing-a-queue</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/infix-to-prefix</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/infix-to-postfix</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/insert-node-at-end-of-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/insert-node-at-beginning-of-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/delete-last-node-of-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/delete-head-node-of-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/insert-at-given-position-in-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/power-of-two</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/more-than-n-k-occurences-of-element-in-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/insertion-sort-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/selection-sort-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/linked-list-in-c-implementation</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/doubly-linked-list-in-java</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/bubble-sort-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/doubly-circular-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-common-subsequence-dp-25</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/peak-element-in-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-subarray-with-given-sum-k</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/matrix-in-snake-pattern</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-difference-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/rotate-matrix-anti-clockwise-by-90-degree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/sieve-of-eratosthenes-find-all-prime-numbers</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/subarray-with-given-sum</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/count-occurrences-in-sorted-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/transpose-a-matrix-program-01-space</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/unbounded-knapsack-dp-23</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-a-string-is-a-subsequence-of-other</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/rod-cutting-problem-dp-24</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/reverse-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-even-odd-subarray</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/leaders-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/josephus-problem</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/what-is-two-pointer-approach</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/applications-of-stack</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/circular-linked-list-in-java</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-coins-dp-20</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/target-sum-dp-21</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/coin-change-2-dp-22</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/count-partitions-with-given-difference-dp-18</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/0-1-knapsack-dp-19</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-word-with-highest-number-of-repeated-letters-in-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/stack-in-data-structure</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/queue-in-data-structure</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/operations-on-arrays</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/binary-to-decimal-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/length-of-string-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/reverse-array-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/count-subsets-with-sum-k-dp-17</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/linkedlist-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/circular-linked-list-traversal</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/binary-search-analysis</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/linked-list-traversal</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/striver-dp-series-dynamic-programming-problems</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/circular-linked-list-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/what-is-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/what-is-recursion</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/left-rotate-the-array-by-one</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/doubly-linked-list-in-c</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/insert-at-front-of-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/insert-at-end-of-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/delete-head-of-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/square-in-c-calculate-square-of-a-number</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/search-in-a-binary-search-tree-2</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/partition-set-into-2-subsets-with-min-absolute-sum-diff-dp-16</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/array-implementation-of-deque</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/delete-last-node-of-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/pow-function-in-c-power-of-a-number</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/partition-equal-subset-sum-dp-15</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/linkedlist-in-java</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/linked-list-introduction</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/subset-sum-equal-to-target-dp-14</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/3-d-dp-ninja-and-his-friends-dp-13</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/application-of-tree-data-structure</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/binary-search-tree-bst-introduction</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/binary-search-explained</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-maximum-falling-path-sum-dp-12</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/maximum-xor-queries-trie</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/singly-linked-list-vs-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/tail-recursion-explained</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/java-vs-python-spot-the-difference</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-path-sum-in-triangular-grid-dp-11</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/clone-linked-list-with-random-and-next-pointer</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/construct-binary-tree-from-inorder-and-postorder-traversal</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-path-sum-in-a-grid-dp-10</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/median-of-row-wise-sorted-matrix</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/move-all-zeros-to-the-end-of-the-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/print-n-to-1-and-1-to-n-using-recursion</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-the-position-of-a-substring-within-a-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/remove-brackets-from-an-algebraic-expression</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/grid-unique-paths-dp-on-grids-dp8</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/grid-unique-paths-2-dp-9</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-all-symmetric-pairs-in-the-array-of-pairs</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/detect-a-cycle-in-a-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/construct-a-binary-tree-from-inorder-and-preorder-traversal</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/rotate-a-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/remove-duplicates-from-an-unsorted-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/express-given-number-as-sum-of-two-prime-numbers</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/finding-equilibrium-index-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/print-all-the-duplicates-in-the-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/dynamic-programming-ninjas-training-dp-7</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/replace-elements-by-its-rank-in-the-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/flattening-a-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/remove-all-duplicates-from-a-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-the-largest-word-in-a-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-given-linked-list-is-plaindrome</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/maximum-occurring-character-in-a-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-array-is-subset-of-another-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/dynamic-programming-house-robber-dp-6</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/rotate-array-by-k-elements</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/sort-elements-of-an-array-by-frequency</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/dynamic-programming-frog-jump-with-k-distances-dp-4</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/maximum-sum-of-non-adjacent-elements-dp-5</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/starting-point-of-loop-in-a-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/calculate-the-power-of-a-number-binary-exponentiation</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/strivers-tree-series-tree-data-structure</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/combination-sum-ii-find-all-unique-combinations</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/sudoku-solver</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/dynamic-programming-frog-jump-dp-3</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/write-a-program-to-sort-characters-in-a-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/reverse-linked-list-in-groups-of-size-k</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/rotate-array-by-k-elements-block-swap-algorithm</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-whether-a-number-is-perfect-number-or-not</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/replace-all-the-0s-with-1-in-a-given-integer</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-non-repeating-characters-of-a-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/remove-characters-from-first-string-present-in-the-second-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-two-strings-are-anagrams-of-each-other</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/calculate-frequency-of-characters-in-a-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/program-to-find-sum-of-gp-series</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/dynamic-programming-climbing-stairs</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/remove-spaces-from-a-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/rearrange-array-in-increasing-decreasing-order</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/sum-of-the-numbers-in-a-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/dynamic-programming-introduction</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/change-every-letter-with-next-lexicographic-alphabet</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/change-case-of-each-character-in-a-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/remove-characters-from-a-string-except-alphabets</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/remove-all-vowels-from-the-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/prime-numbers-in-a-given-range</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/convert-digits-numbers-to-words</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/search-an-element-in-an-array-program-cpp-java</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/permutations-in-which-n-people-can-occupy-r-seats</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/factors-of-a-given-number</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/capitalize-first-and-last-character-of-each-word-of-a-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/count-number-of-vowels-consonants-spaces-in-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-a-number-is-a-strong-number-or-not</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/program-to-find-roots-of-a-quadratic-equation</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-a-number-is-prime-or-not</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-the-given-string-is-palindrome-or-not</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/factorial-of-a-number-iterative-and-recursive</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-the-number-is-an-abundant-number-or-not</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-the-sum-of-numbers-in-the-given-range</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-a-number-is-palindrome-or-not</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/program-to-add-two-fractions</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/reverse-a-given-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-a-number-is-automorphic-number</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-all-palindrome-numbers-in-a-given-range</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/count-the-number-of-words-in-a-given-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/concatenate-one-string-to-another</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-gcd-of-two-numbers</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-lcm-of-two-numbers</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-the-given-number-is-harshador-niven-number</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/number-of-distinct-substrings-in-a-string-using-trie</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/convert-octal-to-binary</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/convert-octal-to-decimal</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/convert-binary-to-octal</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/insertion-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/merge-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-median-of-the-given-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/convert-decimal-to-octal</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/implement-trie-ii</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/implement-trie-1</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/calculate-the-area-of-the-circle</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-the-ascii-value-of-a-character</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/reverse-digits-of-a-number</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/maximum-and-minimum-digit-in-a-number</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-the-smallest-element-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-the-largest-element-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/count-frequency-of-each-element-in-the-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-all-the-non-repeating-elements-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-second-smallest-and-second-largest-element-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/sum-of-digits-of-a-number</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/reverse-words-in-a-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/reverse-a-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/convert-binary-to-decimal</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/maximum-product-subarray-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/quick-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-sum-of-ap-series</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/print-all-prime-factors-of-the-given-number</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/bubble-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-all-repeating-elements-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-given-year-is-a-leap-year-or-not</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/adding-element-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-intersection-of-two-linked-lists</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/topological-sort-using-dfs</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-whether-a-number-is-positive-or-negative</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/sum-of-first-n-natural-numbers</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/flatten-binary-tree-to-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/how-to-construct-a-binary-tree-using-different-traversals</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-for-children-sum-property-in-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/average-of-all-the-elements-in-the-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/delete-given-node-in-a-linked-list-o1-approach</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/power-set-print-all-the-possible-subsequences-of-the-string</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/dijkstras-algorithm-shortest-distance</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/bellman-ford-algorithm-shortest-distance-with-negative-edge</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-spanning-tree-mst-using-prims-algo</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-spanning-tree-mst-using-kruskals-algo</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/kosarajus-algorithm-for-strongly-connected-componentsscc</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/topological-sort-bfs</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/maximum-xor-of-two-numbers-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/job-sequencing-problem</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/bipartite-check-using-dfs-if-graph-is-bipartite</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/maximum-width-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/fractional-knapsack-problem-greedy-approach</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/detect-a-cycle-in-undirected-graph-breadth-first-search</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/depth-first-search-dfs-traversal-graph</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/detect-a-cycle-in-directed-graph-using-dfs</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/cycle-detection-in-undirected-graph-using-dfs</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/breadth-first-searchbfs-level-order-traversal</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/set-matrix-zero</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-minimum-number-of-coins</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/n-meetings-in-one-room</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/subset-ii-print-all-the-unique-subsets</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/rat-in-a-maze</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/n-queen-problem-return-all-distinct-solutions-to-the-n-queens-puzzle</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/print-all-permutations-of-a-string-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/m-coloring-problem</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/post-order-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/print-root-to-node-path-in-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/longest-consecutive-sequence-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/kadanes-algorithm-maximum-subarray-sum-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/merge-overlapping-sub-intervals</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/implement-queue-using-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/merge-two-sorted-arrays-without-extra-space</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/vertical-order-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/preorder-inorder-postorder-traversals-in-one-traversal</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/palindrome-partitioning</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/combination-sum-1</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/subset-sum-sum-of-all-subsets</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/implement-lru-cache</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/boundary-traversal-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-the-duplicate-in-an-array-of-n1-integers</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/trapping-rainwater</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/rotate-image-by-90-degree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/implement-queue-using-stack</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/area-of-largest-rectangle-in-histogram</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-k-th-permutation-sequence</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/stock-buy-and-sell</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/count-maximum-consecutive-ones-in-the-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/binary-search-with-cpp-stl</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/lowest-common-ancestor-for-two-given-nodes</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/morris-preorder-traversal-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/implement-powxn-x-raised-to-the-power-n</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/remove-duplicates-in-place-from-sorted-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/maximum-sum-path-in-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/inorder-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/level-order-traversal-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/length-of-longest-substring-without-any-repeating-character</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/count-reverse-pairs</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/implement-min-stack-o2n-and-on-space-complexity</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/zig-zag-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/next-greater-element-using-stack</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/aggressive-cows-detailed-solution</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/sliding-window-maximum</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/implement-stack-using-single-queue</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/3-sum-find-triplets-that-add-up-to-a-zero</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/rotten-oranges-min-time-to-rot-all-oranges-bfs</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/allocate-minimum-number-of-pages</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/preorder-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-two-trees-are-identical</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/median-of-two-sorted-arrays-of-different-sizes</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/serialize-and-deserialize-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/minimum-number-of-platforms-required-for-a-railway</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/nth-root-of-a-number-using-binary-search</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/implement-stack-using-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/right-left-view-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/search-element-in-a-rotated-sorted-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/k-th-element-of-two-sorted-arrays</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/kth-largest-smallest-element-in-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-for-symmetrical-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/top-view-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/bottom-view-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-for-balanced-parentheses</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/search-single-element-in-a-sorted-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/count-inversions-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/4-sum-find-quads-that-add-up-to-a-target-value</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/grid-unique-paths-count-paths-from-left-top-to-the-right-bottom-of-a-matrix</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/count-the-number-of-subarrays-with-given-xor-k</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/majority-elementsn-3-times-find-the-elements-that-appears-more-than-n-3-times-in-the-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/calculate-the-diameter-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/check-if-the-binary-tree-is-balanced-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/count-total-set-bits-in-numbers-from-0-to-n</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/merge-two-sorted-linked-lists</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/length-of-the-longest-subarray-with-zero-sum</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-the-repeating-and-missing-numbers</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/maximum-depth-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/search-in-a-sorted-2d-matrix</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/remove-n-th-node-from-the-end-of-a-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/next_permutation-find-next-lexicographically-greater-permutation</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-the-majority-element-that-occurs-more-than-n-2-times</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/reverse-a-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/add-two-numbers-represented-as-linked-lists</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/program-to-generate-pascals-triangle</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/two-sum-check-if-a-pair-with-given-sum-exists-in-array</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/find-middle-element-in-a-linked-list</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/data-structure/morris-inorder-traversal-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/dynamic-programming</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/maximum-rectangle-area-with-all-1s-dp-on-rectangles-dp-55</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/partition-array-for-maximum-sum-front-partition-dp-54</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/count-square-submatrices-with-all-1s-dp-on-rectangles-dp-56</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/palindrome-partitioning-ii-front-partition-dp-53</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/burst-balloons-partition-dp-dp-51</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/evaluate-boolean-expression-to-true-partition-dp-dp-52</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/minimum-cost-to-cut-the-stick-dp-50</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/matrix-chain-multiplication-tabulation-method-dp-49</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/matrix-chain-multiplication-dp-48</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/number-of-longest-increasing-subsequences-dp-47</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/palindromic-substrings</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/longest-divisible-subset-dp-44</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/longest-increasing-subsequence-binary-search-dp-43</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/longest-string-chain-dp-45</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/longest-increasing-subsequence-dp-41</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/printing-longest-increasing-subsequence-dp-42</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/buy-and-sell-stocks-with-transaction-fees-dp-40</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/buy-and-sell-stocks-with-cooldown-dp-39</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/buy-and-sell-stock-iii-dp-37</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/buy-and-sell-stock-ii-dp-36</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/stock-buy-and-sell-dp-35</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/wildcard-matching-dp-34</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/edit-distance-dp-33</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/distinct-subsequences-dp-32</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/shortest-common-supersequence-dp-31</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/longest-common-substring-dp-27</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/minimum-insertions-to-make-string-palindrome-dp-29</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/minimum-insertions-deletions-to-convert-string-dp-30</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/longest-palindromic-subsequence-dp-28</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/print-longest-common-subsequence-dp-26</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/longest-common-subsequence-dp-25</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/rod-cutting-problem-dp-24</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/check-if-a-string-is-a-subsequence-of-other</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/unbounded-knapsack-dp-23</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/coin-change-2-dp-22</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/target-sum-dp-21</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/minimum-coins-dp-20</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/0-1-knapsack-dp-19</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/count-partitions-with-given-difference-dp-18</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/count-subsets-with-sum-k-dp-17</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/striver-dp-series-dynamic-programming-problems</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/partition-set-into-2-subsets-with-min-absolute-sum-diff-dp-16</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/partition-equal-subset-sum-dp-15</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/count-number-of-nodes-in-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/subset-sum-equal-to-target-dp-14</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/3-d-dp-ninja-and-his-friends-dp-13</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/minimum-maximum-falling-path-sum-dp-12</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/minimum-path-sum-in-triangular-grid-dp-11</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/minimum-path-sum-in-a-grid-dp-10</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/grid-unique-paths-2-dp-9</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/grid-unique-paths-dp-on-grids-dp8</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/dynamic-programming-ninjas-training-dp-7</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/dynamic-programming-house-robber-dp-6</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/maximum-sum-of-non-adjacent-elements-dp-5</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/dynamic-programming-frog-jump-with-k-distances-dp-4</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/dynamic-programming-frog-jump-dp-3</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/dynamic-programming-climbing-stairs</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/dynamic-programming-introduction</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/grid-unique-paths-count-paths-from-left-top-to-the-right-bottom-of-a-matrix</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/dynamic-programming/count-total-set-bits-in-numbers-from-0-to-n</loc>
<lastmod>2026-04-08T01:27:17.715Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/graph</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/g-39-minimum-multiplications-to-reach-end</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/g-38-cheapest-flights-within-k-stops</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/g-40-number-of-ways-to-arrive-at-destination</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/g-36-shortest-distance-in-a-binary-maze</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/bridges-in-graph-using-tarjans-algorithm-of-time-in-and-low-time-g-55</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/articulation-point-in-graph-g-56</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/g-37-path-with-minimum-effort</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/strongly-connected-components-kosarajus-algorithm-g-54</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/most-stones-removed-with-same-row-or-column-dsu-g-53</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/number-of-islands-ii-online-queries-dsu-g-51</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/g-34-dijkstras-algorithm-intuition-and-time-complexity-derivation</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/g-35-print-shortest-path-dijkstras-algorithm</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/accounts-merge-dsu-g-50</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/number-of-provinces-disjoint-set-g-48</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/number-of-operations-to-make-network-connected-dsu-g-49</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/minimum-spanning-tree-theory-g-44</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/prims-algorithm-minimum-spanning-tree-c-and-java-g-45</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/kruskals-algorithm-minimum-spanning-tree-g-47</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/disjoint-set-union-by-rank-union-by-size-path-compression-g-46</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/find-the-city-with-the-smallest-number-of-neighbours-at-a-threshold-distance-g-43</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/floyd-warshall-algorithm-g-42</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/striver-graph-series-top-graph-interview-questions</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/dijkstras-algorithm-using-set-g-33</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/bellman-ford-algorithm-g-41</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/word-ladder-ii-optimised-approach-g-31</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/g-30-word-ladder-ii</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/dijkstras-algorithm-using-priority-queue-g-32</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/find-eventual-safe-states-bfs-topological-sort-g-25</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/alien-dictionary-topological-sort-g-26</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/topological-sort-algorithm-dfs-g-21</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/course-schedule-i-and-ii-pre-requisite-tasks-topological-sort-g-24</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/word-ladder-i-g-29</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/detect-a-cycle-in-directed-graph-topological-sort-kahns-algorithm-g-23</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/shortest-path-in-undirected-graph-with-unit-distance-g-28</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/kahns-algorithm-topological-sort-algorithm-bfs-g-22</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/shortest-path-in-directed-acyclic-graph-topological-sort-g-27</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/find-eventual-safe-states-dfs-g-20</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/detect-cycle-in-a-directed-graph-using-dfs-g-19</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/number-of-distinct-islands</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/bipartite-graph-dfs-implementation</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/bipartite-graph-bfs-implementation</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/number-of-enclaves</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/surrounded-regions-replace-os-with-xs</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/distance-of-nearest-cell-having-1</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/detect-cycle-in-an-undirected-graph-using-dfs</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/detect-cycle-in-an-undirected-graph-using-bfs</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/rotten-oranges</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/flood-fill-algorithm-graphs</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/depth-first-search-dfs</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/number-of-provinces</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/number-of-islands</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/breadth-first-search-bfs-level-order-traversal</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/connected-components-in-graphs</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/graph-representation-in-c</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/introduction-to-graph</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/topological-sort-using-dfs</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/bellman-ford-algorithm-shortest-distance-with-negative-edge</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/dijkstras-algorithm-shortest-distance</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/topological-sort-bfs</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/minimum-spanning-tree-mst-using-prims-algo</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/minimum-spanning-tree-mst-using-kruskals-algo</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/kosarajus-algorithm-for-strongly-connected-componentsscc</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/bipartite-check-using-dfs-if-graph-is-bipartite</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/cycle-detection-in-undirected-graph-using-dfs</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/detect-a-cycle-in-directed-graph-using-dfs</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/depth-first-search-dfs-traversal-graph</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/detect-a-cycle-in-undirected-graph-breadth-first-search</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/breadth-first-searchbfs-level-order-traversal</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/graph/m-coloring-problem</loc>
<lastmod>2026-04-08T01:27:18.273Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/greedy</loc>
<lastmod>2026-04-08T01:27:17.257Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/greedy/jump-game-i</loc>
<lastmod>2026-04-08T01:27:18.069Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/greedy/shortest-job-first-or-sjf-cpu-scheduling</loc>
<lastmod>2026-04-08T01:27:18.069Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/greedy/lemonade-change</loc>
<lastmod>2026-04-08T01:27:18.069Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/greedy/assign-cookies</loc>
<lastmod>2026-04-08T01:27:18.069Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/greedy/job-sequencing-problem</loc>
<lastmod>2026-04-08T01:27:18.069Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/greedy/fractional-knapsack-problem-greedy-approach</loc>
<lastmod>2026-04-08T01:27:18.069Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/greedy/find-minimum-number-of-coins</loc>
<lastmod>2026-04-08T01:27:18.069Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/greedy/n-meetings-in-one-room</loc>
<lastmod>2026-04-08T01:27:18.069Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/greedy/minimum-number-of-platforms-required-for-a-railway</loc>
<lastmod>2026-04-08T01:27:18.069Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/greedy/4-sum-find-quads-that-add-up-to-a-target-value</loc>
<lastmod>2026-04-08T01:27:18.069Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/greedy/sort-an-array-of-0s-1s-and-2s</loc>
<lastmod>2026-04-08T01:27:18.069Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/hashing</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/unordered_map-in-c-stl</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/longest-subarray-with-sum-k-postives-and-negatives</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/count-subarray-sum-equals-k</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/find-the-number-that-appears-once-and-the-other-numbers-twice</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/find-the-highest-lowest-frequency-element</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/map-in-c-stl</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/count-1s-in-sorted-binary-array</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/longest-common-span-with-same-sum-in-binary-array</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/count-distinct-elements-in-every-window</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/union-of-two-sorted-arrays</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/more-than-n-k-occurences-of-element-in-array</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/count-occurrences-in-sorted-array</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/what-is-hashing</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/hashing-applications</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/direct-address-table</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/print-all-the-duplicates-in-the-string</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/remove-duplicates-from-an-unsorted-array</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/replace-elements-by-its-rank-in-the-array</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/sort-elements-of-an-array-by-frequency</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/find-non-repeating-characters-of-a-string</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/find-all-the-non-repeating-elements-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/count-frequency-of-each-element-in-the-array</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/find-intersection-of-two-linked-lists</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/longest-consecutive-sequence-in-an-array</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/find-the-duplicate-in-an-array-of-n1-integers</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/length-of-longest-substring-without-any-repeating-character</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/3-sum-find-triplets-that-add-up-to-a-zero</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/majority-elementsn-3-times-find-the-elements-that-appears-more-than-n-3-times-in-the-array</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/find-the-repeating-and-missing-numbers</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/hashing/find-the-majority-element-that-occurs-more-than-n-2-times</loc>
<lastmod>2026-04-08T01:27:20.948Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/heap</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/heap/heap-sort</loc>
<lastmod>2026-04-08T01:27:20.540Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/heap/buildheap-decreasekey-and-delete-in-binary-heap</loc>
<lastmod>2026-04-08T01:27:20.540Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/heap/binary-heap-implementation</loc>
<lastmod>2026-04-08T01:27:20.540Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/heap/insert-in-binary-heap</loc>
<lastmod>2026-04-08T01:27:20.540Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/heap/binary-heap-heapify-and-extract-min</loc>
<lastmod>2026-04-08T01:27:20.540Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/interview-experience</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/pinelabs-interview-experience-sde-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/turvo-interview-experience-sde-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-52</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-48</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-51</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-intern-set-50</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-49</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-47</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-intern-set-45</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-46</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-44</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-intern-set-42</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-sde-interview-experience-set-43</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-41</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-40</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-39</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-38</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experiences-with-detailed-solutions</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-37</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-intern-set-34</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-33</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-36</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-30</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-29</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-31</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-32</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-intern-set-26</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-25</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-28</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-24</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-23</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-22</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-21</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-sde-interview-experience-set-18</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-intern-set-19</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-20</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-sde-interview-experience-set-17</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/tata-consultancy-servicestcs-interview-experience-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/sde-off-campus-placement-calendar-freshers</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/nutanix-interview-experience-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/most-trusted-90-days-roadmap-to-placement-guaranteed</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-intern-set-16</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-15</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-14</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-13</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-12</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-set-11</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/strivers-cp-sheet</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/tcs-nqt-coding-sheet-tcs-coding-questions</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-intern-set-10</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-intern-set-9</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/samsung-interview-experience-set-2</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/sprinklr-interview-experience-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/wissen-technologies-interview-experience-analyst-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-1-set-8</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/tcs-codevita-syllabus-and-contest-pattern-2021-updated-season-10</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/tcs-nqt-syllabus-and-exam-pattern-updated-dec-2021</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-intern-set-7</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/hackerearth-problem-setter-intern-interview-experience-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/infosysinfytq-interview-experience-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/google-india-interview-experienceswe-intern-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/samsung-rd-interview-experience-sde-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-intern-set-6</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/arcesium-interview-experience-sde-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/swiggy-interview-experience-sde-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/accolite-digital-interview-experience-software-engineer-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/de-shaw-interview-experience-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/bank-of-america-interview-experience-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-interview-experience-sde-intern-set-5</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/juspay-sde-interview-experience-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/morgan-stanley-technology-analyst-interview-experience</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/paid-work-from-home-internship-at-takeuforward</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-sde-1-intern-interview-experience-set-4</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-sde-1-intern-interview-experience-set-3</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/barclays-graduate-analyst-interview-experience-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/newfold-digital-dba-interview-experience-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-sde-1-interview-experience-set-2</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/kreeti-technologies-software-engineer-interview-experience-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/vmware-member-of-technical-staff-mts-interview-experience-set-1</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/amazon-sde-1-interview-experience</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/oracle-associate-software-engineer-interview-experience</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/commvault-systems-sde-interview-experience</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/help-us-grow-takeuforward</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/interview-experience/the-ultimate-resume-building-guide-for-coding-interviews</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/java</loc>
<lastmod>2026-04-08T01:27:20.315Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/java/functions-in-java-pass-by-reference-and-value</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/how-to-set-up-visual-studio-code-for-java-programming-cp-and-dsa</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/binary-tree-representation-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-annotations</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-tutorials-learn-java-for-free-best-resource</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-logging</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-assertions</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-expressions-statements-and-blocks</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-nested-static-class</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-enum-constructor</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-try-catch-statement</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-variables-and-literals</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-nested-and-inner-class</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-throw-and-throws</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-enums-class</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-abstract-class-and-abstract-methods</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-exception-handling</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-exception</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-enum-strings</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-super-keyword</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-inheritance</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-jdk-jre-and-jvm</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-encapsulation</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-singleton-class</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-methods-or-functions</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-operators</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/method-overriding-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/while-loop-and-do-while-loop-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/switch-case-statement-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-this-keyword</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/if-else-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-anonymous-class</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/method-overloading-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/constructors-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-classes-and-objects</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-polymorphism</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/multidimensional-array-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/for-loop-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-break-statement</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-instanceof-operator</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-for-each-loop</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-continue-statement</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/access-modifiers-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-data-types</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/final-keyword-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/basic-input-and-output-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/comments-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/string-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/passing-2d-arrays-as-arguments-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/bitwise-operators-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/10-best-online-java-compilers-in-2022</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/linkedlist-in-java</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/java-vs-python-spot-the-difference</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/java/c-vs-java-spot-the-difference</loc>
<lastmod>2026-04-08T01:27:21.148Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/js</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/js/how-to-set-up-visual-studio-code-for-javascript-programming</loc>
<lastmod>2026-04-08T01:27:21.420Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/linked-list</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/merge-k-sorted-linked-lists</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/design-a-browser-history</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/sort-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/length-of-loop-in-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/delete-the-middle-node-of-the-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/top-linkedlist-interview-questions-structured-path-with-video-solutions</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/delete-the-kth-element-of-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/insert-before-the-kth-element-of-the-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/insert-before-the-node-with-value-x-of-the-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/insert-at-the-head-of-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/convert-an-array-to-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/insert-before-a-given-node-of-a-dll</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/find-the-length-of-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/search-an-element-in-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/delete-the-kth-node-of-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/insertion-at-the-head-of-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/insert-before-the-tail-of-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/insert-before-the-kth-node-of-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/delete-the-given-node-from-the-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/convert-an-array-to-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/introduction-to-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/multiply-two-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/merge-k-sorted-arrays</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/reorder-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/delete-kth-node-of-circular-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/implement-stack-using-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/segregate-even-and-odd-nodes-in-linkedlist</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/detect-and-remove-loop-in-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/implement-queue-using-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/insertion-at-end-of-circular-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/delete-head-of-circular-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/insertion-at-begin-of-circular-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/pairwise-swap-nodes-of-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/delete-last-node-of-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/insert-at-given-position-in-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/delete-head-node-of-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/insert-node-at-end-of-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/insert-node-at-beginning-of-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/doubly-circular-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/linked-list-in-c-implementation</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/doubly-linked-list-in-java</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/circular-linked-list-advantages-disadvantages</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/reverse-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/circular-linked-list-in-java</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/circular-linked-list-traversal</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/linkedlist-in-c</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/circular-linked-list-in-c</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/linked-list-traversal</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/insert-at-end-of-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/insert-at-front-of-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/doubly-linked-list-in-c</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/delete-head-of-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/delete-last-node-of-a-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/linkedlist-in-java</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/linked-list-introduction</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/singly-linked-list-vs-doubly-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/clone-linked-list-with-random-and-next-pointer</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/rotate-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/detect-a-cycle-in-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/flattening-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/check-if-given-linked-list-is-plaindrome</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/starting-point-of-loop-in-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/reverse-linked-list-in-groups-of-size-k</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/find-intersection-of-two-linked-lists</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/delete-given-node-in-a-linked-list-o1-approach</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/implement-lru-cache</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/merge-two-sorted-linked-lists</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/remove-n-th-node-from-the-end-of-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/add-two-numbers-represented-as-linked-lists</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/reverse-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/linked-list/find-middle-element-in-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/maths</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/count-prime-in-a-range-l-r</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/reverse-digits-of-a-number</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/extract-digits-from-a-given-number</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/count-digits-in-a-number</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/power-of-two</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/sieve-of-eratosthenes-find-all-prime-numbers</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/print-all-divisors-of-a-given-number</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/reverse-a-number-in-c</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/binary-to-decimal-in-c</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/gcd-of-two-numbers-in-c</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/square-in-c-calculate-square-of-a-number</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/prime-number-program-in-c</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/armstrong-number-in-c</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/pow-function-in-c-power-of-a-number</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/factorial-program-in-c</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/palindrome-program-in-c</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/leap-year-program-in-c</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/fibonacci-series-in-c</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/convert-decimal-to-binary-number</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/express-given-number-as-sum-of-two-prime-numbers</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/calculate-the-power-of-a-number-binary-exponentiation</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/check-whether-a-number-is-perfect-number-or-not</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/replace-all-the-0s-with-1-in-a-given-integer</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/program-to-find-sum-of-gp-series</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/convert-digits-numbers-to-words</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/prime-numbers-in-a-given-range</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/permutations-in-which-n-people-can-occupy-r-seats</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/factors-of-a-given-number</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/check-if-a-number-is-a-strong-number-or-not</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/factorial-of-a-number-iterative-and-recursive</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/program-to-find-roots-of-a-quadratic-equation</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/program-to-add-two-fractions</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/check-if-a-number-is-palindrome-or-not</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/find-the-sum-of-numbers-in-the-given-range</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/check-if-the-number-is-an-abundant-number-or-not</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/find-all-palindrome-numbers-in-a-given-range</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/check-if-a-number-is-automorphic-number</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/check-if-the-given-number-is-harshador-niven-number</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/find-lcm-of-two-numbers</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/find-gcd-of-two-numbers</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/convert-binary-to-octal</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/convert-octal-to-decimal</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/convert-octal-to-binary</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/convert-decimal-to-octal</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/maximum-and-minimum-digit-in-a-number</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/calculate-the-area-of-the-circle</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/sum-of-digits-of-a-number</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/convert-binary-to-decimal</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/print-fibonacci-series-up-to-nth-term</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/print-all-prime-factors-of-the-given-number</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/find-sum-of-ap-series</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/check-if-a-number-is-armstrong-number-or-not</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/check-if-given-year-is-a-leap-year-or-not</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/sum-of-first-n-natural-numbers</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/check-whether-a-number-is-positive-or-negative</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/greatest-of-three-numbers</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/greatest-of-two-numbers</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/check-whether-a-given-number-is-even-or-odd</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/implement-powxn-x-raised-to-the-power-n</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/maths/find-the-repeating-and-missing-numbers</loc>
<lastmod>2026-04-08T01:27:21.886Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/python</loc>
<lastmod>2026-04-08T01:27:21.196Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/python/how-to-set-up-visual-studio-code-for-python-programming-cp-or-dsa</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-decorators</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-datetime</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-tutorials-learn-python-for-free-best-resource</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-regex</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-strftime</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-errors-and-built-in-exceptions</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-closure</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-exception-handling</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-multiple-inheritance</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/generators-in-python</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-inheritance</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-numbers-type-conversion-and-mathematics</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-classes-and-objects</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-package</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-global-local-and-nonlocal-variables</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-iterators</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-namespace-and-scope</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-directory-and-file-management</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-variables-constants-and-literals</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-statement-indentation-and-comments</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-object-oriented-programming</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-function-arguments</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-file-i-o</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/anonymous-lambda-functions-in-python</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-strings</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-modules</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/strptime-in-python</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-global-keyword</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-dictionary</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/recursion-in-python</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-sets</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-tuples</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-functions</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/lists-in-python</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/if-else-in-python</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-keywords-and-identifiers</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-operators</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/input-output-and-import-in-python</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/type-conversion-in-python</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/python-data-types</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/for-loop-in-python</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/while-loop-in-python</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/break-and-continue-in-python</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/10-best-online-python-compilers-in-2022</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/python/java-vs-python-spot-the-difference</loc>
<lastmod>2026-04-08T01:27:22.091Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/queue</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/queue/queue-in-c-stl</loc>
<lastmod>2026-04-08T01:27:22.722Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/queue/priority-queue-in-c-stl</loc>
<lastmod>2026-04-08T01:27:22.722Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/queue/kth-largest-smallest-element-in-an-array</loc>
<lastmod>2026-04-08T01:27:22.722Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/queue/implement-queue-using-linked-list</loc>
<lastmod>2026-04-08T01:27:22.722Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/queue/reversing-a-queue</loc>
<lastmod>2026-04-08T01:27:22.722Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/queue/deque-data-structure</loc>
<lastmod>2026-04-08T01:27:22.722Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/queue/queue-in-data-structure</loc>
<lastmod>2026-04-08T01:27:22.722Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/queue/array-implementation-of-deque</loc>
<lastmod>2026-04-08T01:27:22.722Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/queue/implement-queue-using-array</loc>
<lastmod>2026-04-08T01:27:22.722Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/queue/implement-queue-using-stack</loc>
<lastmod>2026-04-08T01:27:22.722Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/queue/sliding-window-maximum</loc>
<lastmod>2026-04-08T01:27:22.722Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/queue/implement-stack-using-single-queue</loc>
<lastmod>2026-04-08T01:27:22.722Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/queue/rotten-oranges-min-time-to-rot-all-oranges-bfs</loc>
<lastmod>2026-04-08T01:27:22.722Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/queue/right-left-view-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.722Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/recursion</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/insert-a-given-node-in-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/floor-in-a-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/ceil-in-a-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/print-name-n-times-using-recursion</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/introduction-to-recursion-understand-recursion-by-printing-something-n-times</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/print-n-to-1-using-recursion</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/print-1-to-n-using-recursion</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/palindrome-partitioning-ii-front-partition-dp-53</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/partition-array-for-maximum-sum-front-partition-dp-54</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/count-square-submatrices-with-all-1s-dp-on-rectangles-dp-56</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/minimum-cost-to-cut-the-stick-dp-50</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/matrix-chain-multiplication-dp-48</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/number-of-longest-increasing-subsequences-dp-47</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/longest-string-chain-dp-45</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/longest-divisible-subset-dp-44</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/longest-increasing-subsequence-binary-search-dp-43</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/printing-longest-increasing-subsequence-dp-42</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/longest-increasing-subsequence-dp-41</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/buy-and-sell-stocks-with-cooldown-dp-39</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/buy-and-sell-stocks-with-transaction-fees-dp-40</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/buy-and-sell-stock-iv-dp-38</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/buy-and-sell-stock-iii-dp-37</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/wildcard-matching-dp-34</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/edit-distance-dp-33</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/recursion-tree-method-for-solving-recurrence</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/shortest-common-supersequence-dp-31</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/distinct-subsequences-dp-32</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/minimum-insertions-deletions-to-convert-string-dp-30</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/longest-palindromic-subsequence-dp-28</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/longest-common-substring-dp-27</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/print-longest-common-subsequence-dp-26</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/time-complexity-of-binary-search-using-recursion-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/longest-common-subsequence-dp-25</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/rod-cutting-problem-dp-24</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/unbounded-knapsack-dp-23</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/check-if-a-string-is-a-subsequence-of-other</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/base-cases-in-recursion</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/josephus-problem</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/coin-change-2-dp-22</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/minimum-coins-dp-20</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/target-sum-dp-21</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/0-1-knapsack-dp-19</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/count-partitions-with-given-difference-dp-18</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/count-subsets-with-sum-k-dp-17</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/what-is-recursion</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/partition-set-into-2-subsets-with-min-absolute-sum-diff-dp-16</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/search-in-a-binary-search-tree-2</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/count-number-of-nodes-in-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/subset-sum-equal-to-target-dp-14</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/3-d-dp-ninja-and-his-friends-dp-13</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/application-of-recursion</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/binary-tree-traversal-inorder-preorder-postorder</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/tower-of-hanoi</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/binary-search-explained</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/minimum-maximum-falling-path-sum-dp-12</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/tail-recursion-explained</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/minimum-path-sum-in-triangular-grid-dp-11</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/construct-binary-tree-from-inorder-and-postorder-traversal</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/minimum-path-sum-in-a-grid-dp-10</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/print-n-to-1-and-1-to-n-using-recursion</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/grid-unique-paths-dp-on-grids-dp8</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/grid-unique-paths-2-dp-9</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/construct-a-binary-tree-from-inorder-and-preorder-traversal</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/dynamic-programming-ninjas-training-dp-7</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/dynamic-programming-frog-jump-with-k-distances-dp-4</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/maximum-sum-of-non-adjacent-elements-dp-5</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/combination-sum-ii-find-all-unique-combinations</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/sudoku-solver</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/dynamic-programming-frog-jump-dp-3</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/reverse-linked-list-in-groups-of-size-k</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/dynamic-programming-climbing-stairs</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/check-if-the-given-string-is-palindrome-or-not</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/factorial-of-a-number-iterative-and-recursive</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/check-for-children-sum-property-in-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/power-set-print-all-the-possible-subsequences-of-the-string</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/maximum-width-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/rat-in-a-maze</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/n-queen-problem-return-all-distinct-solutions-to-the-n-queens-puzzle</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/print-all-permutations-of-a-string-array</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/m-coloring-problem</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/post-order-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/print-root-to-node-path-in-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/vertical-order-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/preorder-inorder-postorder-traversals-in-one-traversal</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/palindrome-partitioning</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/combination-sum-1</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/subset-sum-sum-of-all-subsets</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/boundary-traversal-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/lowest-common-ancestor-for-two-given-nodes</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/morris-preorder-traversal-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/maximum-sum-path-in-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/inorder-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/level-order-traversal-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/count-reverse-pairs</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/zig-zag-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/preorder-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/check-if-two-trees-are-identical</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/search-in-a-binary-search-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/right-left-view-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/check-for-symmetrical-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/top-view-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/bottom-view-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/count-inversions-in-an-array</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/grid-unique-paths-count-paths-from-left-top-to-the-right-bottom-of-a-matrix</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/calculate-the-diameter-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/check-if-the-binary-tree-is-balanced-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/maximum-depth-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/reverse-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/recursion/morris-inorder-traversal-of-a-binary-tree</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/sliding-window</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/sliding-window/longest-substring-without-repeating-characters-sliding-window</loc>
<lastmod>2026-04-08T01:27:22.321Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sliding-window/maximum-points-you-can-obtain-from-cards</loc>
<lastmod>2026-04-08T01:27:22.321Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sliding-window/minimum-subarray-whose-sum-is-greater-or-equal-to-k</loc>
<lastmod>2026-04-08T01:27:22.321Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sliding-window/constant-window</loc>
<lastmod>2026-04-08T01:27:22.321Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/sorting</loc>
<lastmod>2026-04-08T01:27:22.117Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/sort-a-linked-list</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/recursive-bubble-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/recursive-insertion-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/contains-duplicate-check-if-a-value-appears-atleast-twice</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/heap-sort</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/bucket-sort-detailed-explanation</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/kth-largest-smallest-element-in-an-array</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/radix-sort-explained</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/count-sort-explained-with-examples</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/sort-an-array-of-0s-and-1s</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/insertion-sort-in-c</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/selection-sort-in-c</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/bubble-sort-in-c</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/operations-on-arrays</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/sort-elements-of-an-array-by-frequency</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/write-a-program-to-sort-characters-in-a-string</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/merge-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/insertion-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/find-all-the-non-repeating-elements-in-an-array</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/quick-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/selection-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/bubble-sort-algorithm</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/longest-consecutive-sequence-in-an-array</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/remove-duplicates-in-place-from-sorted-array</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/count-reverse-pairs</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/3-sum-find-triplets-that-add-up-to-a-zero</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/minimum-number-of-platforms-required-for-a-railway</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/k-th-element-of-two-sorted-arrays</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/4-sum-find-quads-that-add-up-to-a-target-value</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/count-inversions-in-an-array</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/merge-two-sorted-linked-lists</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/two-sum-check-if-a-pair-with-given-sum-exists-in-array</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/sorting/sort-an-array-of-0s-1s-and-2s</loc>
<lastmod>2026-04-08T01:27:22.779Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/stack</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/stack-in-c-stl</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/implement-k-stacks-in-a-single-array</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/two-stacks-in-an-array</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/evaluation-of-postfix-expression</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/implement-stack-using-linked-list</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/evaluation-of-prefix-expression</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/infix-prefix-and-postfix-introduction</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/infix-to-prefix</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/infix-to-postfix</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/applications-of-stack</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/stack-in-data-structure</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/post-order-traversal-of-binary-tree</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/trapping-rainwater</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/area-of-largest-rectangle-in-histogram</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/implement-queue-using-stack</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/next-greater-element-using-stack</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/implement-min-stack-o2n-and-on-space-complexity</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/implement-stack-using-single-queue</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/implement-stack-using-array</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/stack/check-for-balanced-parentheses</loc>
<lastmod>2026-04-08T01:27:23.454Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/string</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/string/understanding-strings</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/palindromic-substrings</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/minimum-window-substring</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/longest-string-chain-dp-45</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/word-search-leetcode</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/lexicographic-rank-of-a-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/strcpy-in-c</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/string-concatenation-in-c</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/reverse-string-in-c</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/rabin-karp-algorithm-pattern-searching</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/introduction-to-pattern-searching-strings</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/wildcard-matching-dp-34</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/edit-distance-dp-33</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/anagram-substring-search</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/string-in-java</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/naive-pattern-searching</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/leftmost-repeating-character-in-a-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/longest-substring-containing-distinct-elements</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/string-in-c</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/minimum-number-of-k-consecutive-bit-flips</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/check-if-a-string-is-a-subsequence-of-other</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/find-word-with-highest-number-of-repeated-letters-in-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/length-of-string-in-c</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/remove-brackets-from-an-algebraic-expression</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/find-the-position-of-a-substring-within-a-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/print-all-the-duplicates-in-the-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/find-the-largest-word-in-a-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/remove-all-duplicates-from-a-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/maximum-occurring-character-in-a-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/write-a-program-to-sort-characters-in-a-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/remove-characters-from-first-string-present-in-the-second-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/find-non-repeating-characters-of-a-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/calculate-frequency-of-characters-in-a-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/check-if-two-strings-are-anagrams-of-each-other</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/sum-of-the-numbers-in-a-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/remove-spaces-from-a-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/remove-characters-from-a-string-except-alphabets</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/change-case-of-each-character-in-a-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/change-every-letter-with-next-lexicographic-alphabet</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/remove-all-vowels-from-the-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/convert-digits-numbers-to-words</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/count-number-of-vowels-consonants-spaces-in-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/capitalize-first-and-last-character-of-each-word-of-a-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/check-if-the-given-string-is-palindrome-or-not</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/concatenate-one-string-to-another</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/count-the-number-of-words-in-a-given-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/number-of-distinct-substrings-in-a-string-using-trie</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/implement-trie-ii</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/find-the-ascii-value-of-a-character</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/reverse-a-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/reverse-words-in-a-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/convert-binary-to-decimal</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/power-set-print-all-the-possible-subsequences-of-the-string</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/print-all-permutations-of-a-string-array</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/string/length-of-longest-substring-without-any-repeating-character</loc>
<lastmod>2026-04-08T01:27:23.453Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/trie</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/trie/bit-prerequisites-for-trie-problems</loc>
<lastmod>2026-04-08T01:27:23.213Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/trie/longest-string-with-all-prefixes</loc>
<lastmod>2026-04-08T01:27:23.213Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/trie/word-search-ii</loc>
<lastmod>2026-04-08T01:27:23.213Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/trie/maximum-xor-queries-trie</loc>
<lastmod>2026-04-08T01:27:23.213Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/trie/number-of-distinct-substrings-in-a-string-using-trie</loc>
<lastmod>2026-04-08T01:27:23.213Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/trie/implement-trie-ii</loc>
<lastmod>2026-04-08T01:27:23.213Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/trie/implement-trie-1</loc>
<lastmod>2026-04-08T01:27:23.213Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/trie/maximum-xor-of-two-numbers-in-an-array</loc>
<lastmod>2026-04-08T01:27:23.213Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/two-pointers</loc>
<lastmod>2026-04-08T01:27:22.991Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://takeuforward.org/two-pointers/longest-substring-without-repeating-characters-sliding-window</loc>
<lastmod>2026-04-08T01:27:23.223Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/two-pointers/intersection-of-two-sorted-arrays</loc>
<lastmod>2026-04-08T01:27:23.223Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/two-pointers/sort-an-array-of-0s-and-1s</loc>
<lastmod>2026-04-08T01:27:23.223Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/two-pointers/what-is-two-pointer-approach</loc>
<lastmod>2026-04-08T01:27:23.223Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/two-pointers/move-all-zeros-to-the-end-of-the-array</loc>
<lastmod>2026-04-08T01:27:23.223Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/two-pointers/remove-duplicates-in-place-from-sorted-array</loc>
<lastmod>2026-04-08T01:27:23.223Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/two-pointers/4-sum-find-quads-that-add-up-to-a-target-value</loc>
<lastmod>2026-04-08T01:27:23.223Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/two-pointers/remove-n-th-node-from-the-end-of-a-linked-list</loc>
<lastmod>2026-04-08T01:27:23.223Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/two-pointers/two-sum-check-if-a-pair-with-given-sum-exists-in-array</loc>
<lastmod>2026-04-08T01:27:23.223Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
</urlset>
