<?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-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>1</priority>
</url>
<url>
<loc>https://takeuforward.org/dashboard</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/prep-hub</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/practice/dsa</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/practice/sql</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/practice/quantitative</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/practice/logical</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/practice/verbal</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/community</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/ide</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/goodies</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/contact-us</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/pricing</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/terms-and-conditions</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/privacy-policy</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/cancellation-policy</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/troubleshoot</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/why-networks-exists</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/how-does-a-cdn-serve-an-image-or-video</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/what-happens-when-you-connect-to-public-wi-fi</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/what-happens-when-dns-fails</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/what-happens-when-you-type-googlecom</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/switching-faqs</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/common-interview-questions-on-subnetting</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/how-data-travels-up-the-osi-model</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/tls-handshake-and-forward-secrecy</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/public-key-infrastructure</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/certificate-pinning</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/certificate-authority-and-chain-of-trust</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/dnssec-explained</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/dns-security</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/dns-record-types</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/dns</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/nat-limitations</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/snat-dnat-and-port-forwarding</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/types-of-nat</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/nat-packet-flow</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/nat-and-why-do-we-need-it</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/http3-and-quic</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/http-versions</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/http-methods-and-status-codes</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/http-request-response-model</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/tcp-congestion-control-and-connection-closing</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/tcp-reliability-flow-control-sliding-window</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/tcp-i-connection-setup-and-numbering</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/why-do-we-need-stp</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/breaking-the-myth-dsa-is-language-independent</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/programming-languages-and-choosing-a-path</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/dry-runs-edge-cases-and-debugging</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/flowchart-problem-solving</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/flowcharts-and-pseudocode</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/how-to-think-like-a-programmer</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/programming-and-computers</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-distinct-elements</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/swap-nodes-in-pairs</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/search-element-in-matrix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/main-diagonal-print</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/row-wise-traversal</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/tls-and-ssl</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/introduction-to-string-advanced</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/sum-of-digits-of-a-number-using-recursion</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/convert-sorted-array-into-bst</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/construct-a-bst-from-preorder-traversal</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/morris-preorder-traversal</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/morris-inorder-traversal</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/requirements-needed-to-construct-a-unique-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/tree-construction-and-serialization-introduction</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/complete-binary-tree-optimization-introduction</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/largest-bst-in-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/tree-modification-introduction</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/parent-and-distance-introduction</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/left-and-right-views-of-a-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/binary-tree-level-order-traversal</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/introduction-to-dfs-traversals</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/binary-tree-data-structure</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/template-mental-model</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/serialize-and-deserialize-a-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/construct-a-binary-tree-from-preorder-and-inorder</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-nodes-in-a-complete-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/hashing-data-structures</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/subtree-of-another-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/flatten-binary-tree-to-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/invert-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-time-burn-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/nodes-distance-k-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/lowest-common-ancestor-in-a-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/binary-tree-paths</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/path-sum-ii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/path-sum</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/print-root-to-leaf-path-in-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/vertical-order-traversal-of-a-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/boundary-traversal-of-a-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/bottom-view-of-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/top-view-of-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/introduction-to-trie</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/introduction-to-heap</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/introduction-to-prefix-suffix-in-string</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/string-hashing-rolling-hash</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/fast-power-one-shot-binary-exponentiation-modular-exponentiation-and-powx-n</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/introduction-to-pattern-matching-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/super-pow</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/modular-multiplicative-inverse</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/extended-euclidean-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/introduction-to-stack</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/dynamic-programming-memoization-tabulation</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-good-numbers</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/compute-ncr</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/ncr-mod-prime</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/gcd-euclidean-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-paths-using-combinatorics</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/repeated-dna-sequences</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/repeated-string-match</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/repeated-substring-pattern</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/reverse-every-word-in-a-string</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-and-say</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-the-index-of-first-occurrence-in-a-string</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/z-function</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/longest-happy-prefix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/shortest-palindrome</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/binary-tree-cameras</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/house-robber-iii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-cost-to-merge-stones</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/articulation-points-in-graph</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/bridges-in-graph-tarjan-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/kosarajus-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-the-mst-weight</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/kruskals-algorithm-minimum-spanning-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/prims-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/making-a-large-island</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/most-stones-removed-same-row-column</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/redundant-connection</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/disjoint-set-union</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-city-smallest-number-neighbors-threshold-distance</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/bellman-ford-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-obstacle-removal-to-reach-corner</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-multiplications-to-reach-end</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/cheapest-flights-within-k-stops</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/number-of-ways-to-arrive-at-destination</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/path-with-minimum-effort</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/shortest-distance-binary-maze</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/network-delay-time</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/print-shortest-path</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/dijkstras-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/palindrome-partitioning-ii-minimum-cuts</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/pascals-triangle-i</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/set-matrix-zeroes</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/rotate-matrix-90-degrees-clockwise</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/spiral-traversal-of-a-matrix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/pascal-triangle-ii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/pascals-triangle-first-n-rows</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-reverse-pairs</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/next-permutation</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-inversions-in-an-array-using-merge-sort</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/merge-sorted-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/osi-model-layers-and-protocols</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/best-time-to-buy-and-sell-stock-with-cooldown</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/best-time-to-buy-and-sell-stock</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/sort-array-0s-1s-2s</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/longest-consecutive-sequence-in-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/spanning-tree-protocol-and-switching-loops</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/cdn-lifecycle-and-edge-caching</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/layer-4-vs-layer-7-load-balancers</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/load-balancing-algorithms-for-servers</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/load-balancing-for-scalable-servers</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/majority-element-ii-n-by-3</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/character-frequency-in-a-string</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/majority-element-n-by-2</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/concurrency-limiter-rate-limiting-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/leaky-bucket-rate-limiting-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/token-bucket-rate-limiting-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/sliding-window-counter-rate-limiting</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/sliding-window-log-rate-limiting</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/fixed-window-counter-rate-limiting</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/rate-limiting-for-apis-and-servers</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/qos-traffic-shaping-and-policing</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/network-congestion-and-bufferbloat-loops</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/latency-sources-and-ttfb-in-networks</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/bandwidth-delay-product-and-network-bottlenecks</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/network-performance-metrics-deep-dive</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/introduction-to-network-performance</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/website-packet-flow-over-wi-fi</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/wi-fi-security-and-wpa-standards</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/wi-fi-frame-types-and-uses</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/how-wi-fi-avoids-collisions</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/why-wi-fi-speed-drops-in-real-life</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/ieee-80211-and-wi-fi-generations</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/wpa-handshake-and-wi-fi-security</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/wi-fi-connection-flow-step-by-step</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/wireless-networking-basics-and-wi-fi-terms</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/introduction-to-wireless-networking-and-wi-fi-basics</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/digital-signatures-in-cryptography</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/mac-and-hmac-in-cryptography</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/cryptographic-hash-functions-and-integrity</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/hybrid-encryption-in-secure-communication</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/diffie-hellman-key-exchange</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/asymmetric-cryptography-public-and-private-keys</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/symmetric-encryption-and-secret-keys</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/basic-cryptography-terms-and-definitions</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/cryptography-security-goals-and-principles</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/cryptography-basics-for-network-security</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/zero-trust-architecture-security-model</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/vpn-and-secure-remote-access</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/idps-intrusion-detection-and-prevention-system</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/layer-3-vs-layer-4-vs-layer-7-firewalls</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/firewalls-and-its-types-in-network-security</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/common-network-security-threats</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/aaa-framework-in-network-security</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/common-elements-in-two-arrays</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/cia-triad-in-network-security</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/second-highest-occurring-element</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/why-network-security-is-needed</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/switching-techniques-comparison-in-networks</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/why-packet-switching-won-the-internet</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/meeting-rooms-ii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-cost-to-hire-k-workers</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/ipo</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-median-data-stream</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/single-threaded-cpu</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/reorganize-string</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/task-scheduler</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/last-stone-weight</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/smallest-range-covering-elements-from-k-lists</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-k-pairs-with-smallest-sums</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/merge-k-sorted-linked-lists</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/merge-k-sorted-arrays</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/closest-points-to-origin</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/top-k-frequent-words</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/top-k-frequent-elements</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/kth-largest-element-stream</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/k-th-smallest-element-in-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/k-th-largest-element-in-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/heap-sort</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/message-switching-basics-and-working</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/circuit-switching-vs-virtual-circuit-packet-switching</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/mpls-basics-and-label-switching</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/first-non-repeating-element</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/virtual-circuit-packet-switching-basics-and-working</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/datagram-packet-switching-basics-and-working</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/packet-switching-in-computer-networks</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/circuit-switching-basics-and-working</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/fundamental-switching-techniques-in-networks</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/network-switching-basics-and-need</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/first-repeating-element</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/dhcp-and-dora-process</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-pairs-with-xor-in-a-range</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-the-missing-and-repeating-numbers-in-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/highest-freq-element</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/missing-number-solutions</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/maximum-xor-queries-trie</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/maximum-xor-of-two-numbers-in-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/number-of-distinct-substrings-in-a-string</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/design-add-and-search-words-data-structure</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/word-search-ii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/search-suggestions-system</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/replace-words</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/cookies-sessions-and-tokens-for-authentication</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/https-ssl-and-tls-how-secure-web-communication-works</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/longest-word-with-all-prefixes</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/trie-ii-count-words-erase</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/trie-implementation</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/email-protocols-smtp-pop3-and-imap</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/ftp-file-transfer-protocol-basics</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/websockets-for-real-time-communication</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/rest-apis-basics-and-working</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/introduction-to-application-layer</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/tcp-vs-udp-and-use-cases</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/udp-user-datagram-protocol-basics-and-working</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/ports-and-sockets-in-networking</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/introduction-to-transport-layer</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/implement-a-queue-using-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/how-bgp-connects-the-internet</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/hybrid-routing-and-eigrp</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/link-state-routing-and-ospf</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/routing-loops-and-prevention-techniques</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/distance-vector-routing-and-rip-working</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/dynamic-routing-and-routing-protocols</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/static-routing-basics-and-use-cases</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/routing-table-basics-and-route-selection</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/routing-vs-forwarding-in-networks</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/why-ipv6-is-better-than-ipv4</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/ipv6-datagram-structure-and-header</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/introduction-to-ipv6-and-addressing-overview</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/classless-addressing-cidr-and-route-aggregation</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/subnetting-basics-and-how-it-works</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/classful-addressing-and-ipv4-classes</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/public-vs-private-ip-addresses</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/ip-addressing-modes-and-delivery</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/ipv4-datagram-structure-and-header</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/ipv4-addressing-and-packet-basics</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/introduction-to-network-layer</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/what-is-network-access-control</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/medium-access-control-and-csma</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/mac-address-and-ethernet-frame</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/physical-layer-basics-and-functions</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/switching-vs-routing-understanding-key-differences</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/what-is-virtual-lan</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/ethernet-switching-mac-learning-forwarding-and-flooding</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/logical-topology-data-flow-vlans-and-traffic-behavior</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/what-is-hybrid-topology</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/physical-topologies-and-its-types</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/introduction-to-network-topologies-and-vlans</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-pairs-with-given-sum-in-doubly-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/remove-duplicates-from-a-sorted-doubly-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/delete-all-occurrences-of-a-key-in-a-doubly-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/intersection-of-two-linked-lists</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/length-of-cycle-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-start-of-cycle-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/detect-cycle-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/check-if-a-linked-list-is-a-palindrome</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/remove-the-nth-node-from-the-end-of-a-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/delete-the-middle-node-of-a-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-middle-of-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/reorder-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/clone-linked-list-random-pointer</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/flatten-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/sort-a-linked-list-using-merge-sort</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/merge-two-sorted-linked-lists</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/reverse-linked-list-ii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/rotate-linked-list-right-k-places</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/reverse-linked-list-k-groups</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/reverse-a-singly-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/sort-linked-list-0s-1s-2s-changing-links</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/segregate-odd-and-even-nodes-in-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/largest-divisible-subset</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/print-longest-increasing-subsequence</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/add-one-to-number-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/add-two-numbers-linked-lists-reverse-order</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/shortest-path-in-a-directed-acyclic-graph-dag</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/maximum-sum-bst-in-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/word-ladder-ii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/word-ladder</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/recover-binary-search-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/shortest-path-in-an-unweighted-undirected-graph-using-bfs</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/parallel-courses-iii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/alien-dictionary</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-eventual-safe-states</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/course-schedule-ii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/course-schedule-i</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/insert-node-before-value-x-in-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/insert-node-at-kth-position-in-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/detect-a-cycle-in-a-directed-graph</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/insert-a-node-at-the-beginning-of-a-singly-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/check-if-a-binary-tree-is-height-balanced</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/symmetric-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/check-identical-binary-trees</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/rod-cutting-problem</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/unbounded-knapsack</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/coin-change-ii-combinations</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-partitions-with-a-given-difference</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-subsets-with-sum-k</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/subset-sum-equal-to-target</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/best-time-to-buy-and-sell-stock-with-transaction-fee</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/best-time-to-buy-and-sell-stock-iv</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-absolute-difference-in-bst</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/inorder-successor-and-predecessor-in-a-bst</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/kth-smallest-and-largest-elements-in-a-bst</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/two-sum-in-bst</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/binary-tree-maximum-path-sum</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/binary-search-tree-iterator</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/delete-node-in-a-bst</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/diameter-of-a-binary-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/insert-into-a-binary-search-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/range-sum-of-bst</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/best-time-to-buy-and-sell-stock-iii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/best-time-to-buy-and-sell-stock-ii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/dungeon-game</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-falling-path-sum</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/triangle-minimum-path-sum</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-path-sum</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/unique-paths-ii-obstacles</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/grid-unique-paths</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/ninjas-training</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/delete-and-earn</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/doubly-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/singly-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/lowest-common-ancestor-of-a-binary-search-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/validate-binary-search-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/house-robber-ii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/house-robber</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/floor-and-ceil-in-a-bst</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/maximum-sum-of-non-adjacent-elements</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/search-in-a-binary-search-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/frog-jump-with-k-distances</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/detect-a-cycle-in-an-undirected-graph</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/binary-search-tree</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/frog-jump-minimum-energy</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/shortest-path-in-binary-matrix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/min-cost-climbing-stairs</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/distance-of-the-nearest-cell-having-1-in-a-binary-matrix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/climbing-stairs</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/rotting-oranges</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/magnetic-force-between-two-balls</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/pacific-atlantic-water-flow</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/number-of-distinct-islands</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/surrounded-regions</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/number-of-enclaves</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/flood-fill-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimize-maximum-distance-between-gas-stations</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/number-of-provinces</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-all-anagrams-in-a-string</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/split-array-largest-sum</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/permutation-in-string</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/introduction-to-graph</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/subarrays-with-k-different-integers</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-nice-subarrays</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/book-allocation-problem</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/binary-subarrays-with-sum</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/largest-rectangle-in-histogram</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-substrings-containing-all-three-characters-a-b-and-c</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/sum-of-subarray-ranges</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/sum-of-subarray-minimums</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/aggressive-cows</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/maximum-running-time-of-n-computers</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-speed-to-arrive-on-time</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/remove-k-digits</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/daily-temperatures</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/stock-span-problem</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/next-greater-element-ii-circular-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/next-greater-element</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/design-circular-queue</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-window-substring</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-size-subarray-sum</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/longest-repeating-character-replacement</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/capacity-to-ship-packages-within-d-days</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-days-to-make-m-bouquets</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/non-overlapping-intervals</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/merge-overlapping-intervals</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/insert-interval</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/job-sequencing-problem</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/insert-delete-getrandom-o1</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/koko-eating-bananas</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/design-hashset</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/design-hashmap</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/longest-substring-with-at-most-k-distinct-characters</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-index-sum-of-two-lists</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/fruit-into-baskets</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/verifying-an-alien-dictionary</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-the-smallest-divisor-given-a-threshold</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/max-consecutive-ones-iii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/sort-characters-by-frequency</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/median-of-2-sorted-arrays</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/group-anagrams</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/longest-substring-without-repeating-characters</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/maximum-average-subarray-i</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/kth-element-of-two-sorted-arrays</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/kth-smallest-element-in-a-sorted-matrix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/median-of-a-row-wise-sorted-matrix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-peak-element-2d-matrix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/maximum-points-you-can-obtain-from-cards</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/decode-string</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/evaluate-reverse-polish-notation</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/check-balanced-parentheses-using-a-stack</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/asteroid-collision</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/implement-a-stack-using-a-linked-list</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/maximum-sum-subarray-of-size-k</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-platforms-required-for-a-railway-station</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/n-meetings-in-one-room</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/candy-distribution-problem</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/boats-to-save-people</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-number-of-coins</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/jump-game-ii-minimum-jumps</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/jump-game</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/search-in-a-row-and-column-wise-sorted-matrix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/lemonade-change</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/search-in-sorted-2d-matrix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/assign-cookies</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-the-row-with-maximum-1s-in-a-sorted-binary-matrix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-a-peak-element-in-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/single-element-in-a-sorted-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/implement-a-stack-using-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/implement-a-queue-using-stacks</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-minimum-in-a-rotated-sorted-array-2</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/sort-employees-by-salary-then-experience</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/sort-students-by-marks-then-name</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/trapping-rain-water</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/container-with-most-water</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-minimum-in-rotated-sorted-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/rotation-count-sorted-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/two-sum-ii-input-array-is-sorted</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/search-in-rotated-sorted-array-ii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/valid-palindrome</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/prefix-sum-introduction-range-sum-query</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/two-pointer-introduction</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/intersection-of-two-arrays</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/union-of-two-sorted-arrays</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-subarrays-with-a-given-xor-k</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/continuous-subarray-sum</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/add-two-matrices</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/transpose-of-matrix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/check-if-matrix-is-square</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/search-in-rotated-sorted-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-occurrences-in-a-sorted-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/last-occurrence-in-a-sorted-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/first-occurrence-in-a-sorted-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/first-last-occurrences-and-count-in-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/divide-two-integers-without-multiplication-division-modulo</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/bitwise-arithmetic</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/sort-by-frequency</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/sort-strings-by-length</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/sort-pairs-by-second-value</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/counting-sort</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/bit-counting-tricks</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/quick-sort-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/single-number-iii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/single-number-ii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/single-number-i</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/sum-of-both-diagonals-in-matrix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/address-resolution-protocol-arp</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/error-detection</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/network-devices</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/evenodd-count-in-matrix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/full-duplex-vs-half-duplex-transmission-mode</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/maxmin-element-in-matrix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/coaxial-cables-types-and-connectors</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/column-wise-matrix-sum</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/fiber-optic-cables-types-and-connectors</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/twisted-pair-cables-types-and-connectors</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/transmission-media-guided-and-unguided-media</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/encapsulation-and-decapsulation</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-subarrays-with-given-sum</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/row-wise-matrix-sum</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/sum-of-matrix</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/subarray-sum-equals-k</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/pairs-with-difference-k</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/contains-duplicate-ii</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/anti-diagonal-print</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/product-of-array-except-self</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-ceil-in-a-sorted-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/merge-sort-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-floor</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/search-insert-position</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/insertion-sort-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/contains-duplicate</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/upper-bound-in-sorted-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/lower-bound-in-sorted-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/binary-search-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/equilibrium-index</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/missing-number</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/xor-of-numbers-in-a-range-l-to-r</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/binary-search-introduction</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/xor-basics</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/maximum-sum-circular-subarray</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/bit-basics-and-operators</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/multiplication-of-n-using-recursion</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/factorial-of-a-number-using-recursion</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/maximum-product-subarray</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/print-n-to-1-using-recursion</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/print-1-to-n-using-recursion</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/print-name-n-times-using-recursion</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/column-wise-traversal</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/osi-model-vs-tcpip-model</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/tcpip-model</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/why-do-we-need-layered-architecture</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/matrix-aggregation-one-shot-covers-sum-of-matrix-row-wise-sum-column-wise-sum-maxmin-element-evenodd-count-and-sum-of-both-diagonals</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-divisors</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/check-whether-a-number-is-prime</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/perfect-number</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/armstrong-number</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/gcd-and-lcm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/bubble-sort-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/4sum</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/selection-sort-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/matrix-traversal-one-shot</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/how-is-data-transported</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/clients-servers-and-peers</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/the-internet-as-a-network-of-networks</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/computer-networks/network-types</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/3sum</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/two-sum</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/Count Digits in a Number Using Recursion</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/remove-duplicates-from-a-sorted-array-in-place</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/move-zeros-to-the-end-of-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/leaders-in-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/maximum-consecutive-ones-in-a-binary-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/second-largest-element</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/check-if-a-number-is-palindrome-using-recursion</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/check-if-string-contains-a-given-substring</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/check-if-two-strings-are-anagrams</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-the-largest-word-in-a-string</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/check-whether-a-string-is-a-palindrome</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/check-if-an-array-is-sorted-in-ascending-order</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/check-if-array-is-sorted-using-recursion</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/power-of-a-number-using-recursion</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/reversing-an-array-using-recursion</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/factorial-of-a-number</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/odd-elements-in-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/check-whether-a-number-is-a-palindrome</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/counting-even-numbers-in-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/minimum-element-of-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-the-largest-element-in-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/mean-of-an-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/sum-of-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/reverse-digits-of-a-number</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-the-largest-digit-in-a-number</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/array-basics</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-odd-digits-in-a-number</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-digits-in-a-number</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/left-rotate-array-by-k-places</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/left-rotate-array-by-one</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-frequency-of-a-given-element-in-the-array</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/linear-search-algorithm</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/check-even-or-odd</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/find-remainder</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/mastering-number-basics-in-programming</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/string-introduction-vowels-consonants-search-frequency-reverse-and-case-conversion</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://takeuforward.org/blogs/data-structure-and-algorithm/count-words-in-a-string</loc>
<lastmod>2026-10-05T17:36:03.661Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
</urlset>
