<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://k5kc.com</loc>
<lastmod>2026-05-10T02:47:48.302Z</lastmod>
<changefreq>daily</changefreq>
<priority>1</priority>
</url>
<url>
<loc>https://k5kc.com/cs</loc>
<lastmod>2026-05-10T02:47:48.302Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.9</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems</loc>
<lastmod>2026-05-10T02:47:48.302Z</lastmod>
<changefreq>daily</changefreq>
<priority>0.9</priority>
</url>
<url>
<loc>https://k5kc.com/about</loc>
<lastmod>2026-05-10T02:47:48.302Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.5</priority>
</url>
<url>
<loc>https://k5kc.com/privacy</loc>
<lastmod>2026-05-10T02:47:48.302Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.3</priority>
</url>
<url>
<loc>https://k5kc.com/disclaimer</loc>
<lastmod>2026-05-10T02:47:48.302Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.3</priority>
</url>
<url>
<loc>https://k5kc.com/reporting</loc>
<lastmod>2026-05-10T02:47:48.302Z</lastmod>
<changefreq>yearly</changefreq>
<priority>0.3</priority>
</url>
<url>
<loc>https://k5kc.com/search</loc>
<lastmod>2026-05-10T02:47:48.302Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.6</priority>
</url>
<url>
<loc>https://k5kc.com/tools</loc>
<lastmod>2026-05-10T02:47:48.302Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.4</priority>
</url>
<url>
<loc>https://k5kc.com/tools/code-formatter</loc>
<lastmod>2026-05-10T02:47:48.302Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.4</priority>
</url>
<url>
<loc>https://k5kc.com/tools/uuid-generator</loc>
<lastmod>2026-05-10T02:47:48.302Z</lastmod>
<changefreq>monthly</changefreq>
<priority>0.4</priority>
</url>
<url>
<loc>https://k5kc.com/cs</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.9</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/analysis</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/array</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/graph</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/graph/color</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/graph/color/graph-coloring-introduction-and-applications</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/graph/mst</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/graph/mst/prims-algorithm-using-adjacency-list-and-priority-queue</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/graph/mst/prims-algorithms-using-adjacency-matrix</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/graph/shortest-path</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/graph/shortest-path/uniform-cost-search</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/graph/terminology</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/graph/terminology/bipartite-graph-definition</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/graph/vertex-cover</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/graph/vertex-cover/minimum-vertex-cover</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/intro</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/linked-list</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/linked-list/circular-linked-list-index</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/linked-list/singly-linked-list-data-structure-ds-index</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/paradigms</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/queue</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/recursion</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/search</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/search/sorted</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/search/sorted/exponential-search</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/sorting</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/stack</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/stack/monotonic-stack</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/techniques</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/techniques/breadth-first-search</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/techniques/depth-first-search</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/tree</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/tree/binary-tree-dfs-traversal</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/tree/height-and-depth-of-a-node-in-tree</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/algorithms/tree/height-of-a-tree-definition</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/database</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/java</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/java/core</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/java/core/introduction</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/java/core/introduction/architecture-jdk-vs-jre-vs-jvm</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/java/core/introduction/features</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/java/core/introduction/hello-world</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/java/core/introduction/history-and-evolution</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/java/core/introduction/introduction-index</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/java/core/introduction/jdk-installation</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/java/core/introduction/running-java-from-the-cli</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/network</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/network/application-layer</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/network/application-layer/web</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/network/application-layer/web/url-vs-uri-vs-urn</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/ood</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/ood/core-pillars</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/ood/core-pillars/polymorphism</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/ood/core-pillars/polymorphism/ad-hoc-polymorphism</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/ood/core-pillars/polymorphism/parametric-polymorphism</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/ood/core-pillars/polymorphism/subtype-polymorphism</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/pl</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/pl/bash</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/pl/java/introduction/features-of-java</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/pl/java/strings</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/pl/java/strings/java-string-hashcode-function</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/pl/java/strings/string-hashcode-function</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/pl/java/strings/what-is-java-string-s-immutability</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/pl/javascript</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/pl/sql</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/system-design</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/internal</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.9</priority>
</url>
<url>
<loc>https://k5kc.com/internal/test-kitchen-sink</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/maths</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.9</priority>
</url>
<url>
<loc>https://k5kc.com/maths/arithmetic</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/maths/arithmetic/multiplication-of-two-numbers</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/maths/number-systems</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/maths/number-systems/binary-to-decimal-number-conversion</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/maths/number-systems/decimal-to-binary-number-conversion</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/maths/statistics</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/maths/statistics/median-definition</loc>
<lastmod>2026-05-10T02:47:48.418Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.7</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/0-1-knapsack-problem</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/0-1-knapsack-with-gold-bars</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/solving-2-sat-problem</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/2sum-0-closest-find-two-elements-whose-sum-is-closest-to-zero</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/3sum-classic</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/4sum-output-in-sorted-order</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/design-sliding-8-puzzle-solver</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/add-two-numbers-represented-as-linked-list</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/add-one-to-a-number-without-using-plus-or-minus-sign</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/add-two-numbers-without-using-the-plus-operator</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/aggregate-sum-over-partitions-with-parts-at-least-k</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/aho-corasick-algorithm-for-multi-pattern-string-search</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/alice-joins-probability-student-club-by-calculating-expected-values-of-probabilistic-games</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/all-permutations-of-a-string-in-lexicographic-order</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/all-permutations-of-a-string-with-distinct-characters</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/all-permutations-of-a-string-with-duplicate-characters</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/alternating-two-instance-singleton-pattern</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/amount-of-new-area-painted-each-day</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/analyze-organization-hierarchy</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/analyze-subscription-conversion-</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/apply-substitutions</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/approximate-median-in-sub-linear-time</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/area-of-intersection-of-two-rectangles</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/arrange-given-number-to-form-the-biggest-number-possible</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/array-with-elements-not-equal-to-average-of-neighbors</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/array-based-trie-implementation</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/assign-elements-to-groups-with-constraints</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/assign-mice-to-holes</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/autocomplete-suggestion-system</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/avoid-overflow-when-calculating-mid-in-binary-search</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/bst-floor-and-ceiling</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/backend-design-for-restaurant-reservation-system</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/balance-parentheses-with-minimum-insertions-and-deletions</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/balanced-delimiters-in-an-expression</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/lazy-bartender-minimising-memorised-drink-recipes</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/basic-euclidean-algorithm-to-find-gcd-of-two-numbers-using-modulo-operator</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/best-position-for-a-service-centre</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/best-time-to-buy-and-sell-stock-any-number-of-times-overlapping-transactions</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/binary-search-without-multiplication-division-and-bit-shift-operations</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/binary-search-on-a-linked-list</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/binary-tree-bottom-view</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/binary-tree-left-side-view</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/binary-tree-level-order-traversal</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/binary-tree-path-sum-find-all-paths-between-any-two-nodes</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/binary-tree-path-sum-maximum-sum-leaf-to-root-path</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/binary-tree-path-sum-maximum-sum-root-to-leaf-path</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/binary-tree-path-sum-maximum-between-any-two-leaves</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/binary-tree-path-sum-minimum-sum-root-to-leaf-path</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/binary-tree-top-view</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/bishop-diagonally-attack-on-chess-board</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/blackjack-optimal-strategy-with-known-card-sequence</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/bloom-filter-implementation</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/blum-floyd-pratt-rivest-tarjan-algorithm</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/boolean-parenthesization-problem</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/boyer-moore-string-searching</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/brace-expansion</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/break-a-string-into-lines-of-length-k-without-breaking-words</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/breaking-an-integer-into-the-sum-of-pairwise-distinct-positive-integers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/buildings-with-sunset-view</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/busiest-period-in-a-building</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/button-with-longest-push-time</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/calculate-hash-code-for-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/calculate-rolling-hashcode-for-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/calculate-score-after-performing-instructions</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/calculate-floor-of-log2n-without-using-built-in-function</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/calculate-the-binomial-coefficient</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/calculate-the-number-of-valid-stack-permutations</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/calculating-the-mean-and-median-of-an-unsorted-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/can-make-palindrome-from-substring</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/capitalize-the-first-character-of-each-word-in-a-given-text</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/capturing-loop-variables-in-lambdas</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/car-pooling</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/car-refuelling-algorithm</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/catalan-numbers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/celebration-party</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/cellphone-base-covering</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-digits-are-equal-in-string-after-operations-i</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-digits-are-equal-in-string-after-operations-ii</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-a-string-contains-all-binary-codes-of-size-k</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-an-integer-s-bit-representation-is-a-palindrome</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-array-contains-all-elements-of-some-given-range</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-array-is-consecutive-integers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-array-is-consecutive-positive-integers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-duplicates-exist-within-k-manhattan-distance-in-matrix</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-intervals-overlap</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-tree-is-full-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-a-matrix-is-invertible</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-a-graph-is-minimally-connected</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-a-string-contains-an-anagram-of-another-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-an-array-of-integers-is-sorted</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-an-element-exists-in-a-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-any-pair-of-rectangles-overlap</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-doubly-linked-list-is-palindrome</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-given-array-is-palindrome-or-not</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-given-string-is-palindrome-or-not</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-given-undirected-graph-is-connected</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-ith-bit-is-set-in-a-32-bit-integer</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-number-is-odd-or-even</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-number-sequence-can-be-generated-using-stack-push-and-pop-operations</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-postordered-array-forms-a-binary-search-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-target-word-exists-in-matrix-horizontally-or-vertically</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-the-length-of-a-linked-list-is-even-or-odd</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-two-binary-trees-are-mirror-images-of-each-other</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-two-given-matrices-are-identical</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-two-nodes-in-a-binary-tree-are-siblings</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-words-chain-to-form-a-circle</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/determine-if-a-chess-king-is-in-check</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/choose-k-elements-with-maximum-sum</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/circus-tower-sorting</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/clear-the-n-th-bit</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/climbing-stairs-at-most-m-steps</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/climbing-stairs-take-atmost-3-steps</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/closest-equal-element-queries</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/closest-leaf-to-root-in-a-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/closest-pair-of-points</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/coin-change-count-number-of-ways-of-representing-amount-given-finite-supply-of-denominations</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/coin-change-problem-family-guide</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/coin-change-with-fewest-number-of-coins-given-canonical-system-and-infinite-supply</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/coin-change-with-fewest-number-of-coins-given-finite-supply</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/coins-in-a-line-game</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/collatz-sequence</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/coloring-a-graph-with-maximum-degree-d-using-d-1-colors</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/concatenated-divisibility</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/conditional-selection-between-x-and-y-with-bitwise-operations</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/construct-binary-search-tree-bst-from-postorder-traversal</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/construct-binary-tree-from-inorder-and-level-order-traversal</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/construct-cartesian-tree-from-sequence</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/construct-k-palindrome-strings</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/construct-ancestor-matrix-from-a-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/construct-binary-tree-from-an-ancestor-matrix</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/construct-reverse-sum-hierarchy-triangle-from-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/check-if-a-range-bounded-array-contains-duplicates</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/convert-binary-tree-into-threaded-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/convert-heap-ordered-linked-list-to-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/convert-a-sorted-doubly-linked-list-dll-to-balanced-binary-search-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/convert-a-sorted-doubly-linked-list-dll-to-balanced-binary-search-tree-in-place</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/convert-an-infix-expression-to-postfix</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/convert-binary-tree-to-its-sum-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-beautiful-numbers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-beautiful-splits-in-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-number-of-binary-strings-without-consecutive-1-s</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-cells-in-overlapping-horizontal-and-vertical-substrings</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-connected-components-in-lcm-graph</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-covered-buildings</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-employees-per-department</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-inversions-count-smaller-on-right</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-knight-s-tour</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-mentions-per-user</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-n-digit-stepping-numbers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-non-decreasing-subarrays-after-k-operations</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-number-of-leaf-nodes-in-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-numbers-with-non-decreasing-digits-</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-occurrences-of-anagram</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-pairs-with-given-sum-and-xor</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-partitions-with-even-sum-difference</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-paths-with-the-given-xor-value</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-sorted-vowel-strings</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-special-subsequences</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-squares-on-a-chessboard</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-subarrays-of-length-three-with-a-condition</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-substrings-divisible-by-last-digit</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-ways-to-tile-a-3xn-board-using-1x3-and-3x1-tiles</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-all-divisors-of-a-natural-number</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-distinct-binary-trees-for-a-given-number-of-nodes</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-domino-tiling-in-4xn-board</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-elements-in-range-in-sorted-matrix</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-frequency-of-target-element-in-sorted-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-number-of-ways-to-fill-an-n-x-4-grid-using-1-x-4-tiles</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-of-pairs-of-squares-summing-to-n-squared</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-reverse-pairs-in-two-individually-sorted-parts-of-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-the-number-of-arrays-with-k-matching-adjacent-elements</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-the-divisors-of-a-given-number</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-the-number-of-2s-between-0-and-n</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/count-the-number-of-elements-from-one-array-less-than-or-equal-to-elements-in-another-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/counting-roundtrip-paths-in-a-graph-given-a-number-of-steps</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/create-sorted-array-through-instructions</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/create-a-word-with-a-single-0-bit-at-the-position-of-the-rightmost-1-bit</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/create-a-word-with-a-single-1-bit-at-the-position-of-the-rightmost-0-bit</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/create-linked-lists-of-all-the-nodes-at-each-depth-for-a-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/cron-cheatsheet</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/validate-americn-style-crossword-grid</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/currency-exchange-problem-as-shortest-path</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/dna-pattern-recognition-</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/de-bruijn-sequence</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/decode-a-string-to-all-valid-interpretations</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/decrypt-word-with-cumulative-ascii-shift</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/deepest-left-node-in-a-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/delete-list-nodes-with-larger-value-node-on-the-right</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/delete-x-nodes-after-y-nodes</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/delete-a-binary-tree-completely</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/delivering-boxes-from-storage-to-ports</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/describe-and-give-an-example-of-ad-hoc-parametric-and-subtype-polymorphism</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/design-spreadsheet</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/design-task-manager</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/design-underground-system</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/design-a-3d-binary-matrix-with-efficient-layer-tracking</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/design-a-database-for-storing-students-grades</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/design-a-sparse-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/ood-generic-deck-of-cards</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/design-a-data-structure-for-generic-deck-of-cards</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/design-a-vending-machine-like-coffee-vending-machine</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/design-an-array-statistics-tracker</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/design-and-implement-connect-4</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/design-data-structures-for-an-online-book-reader-system</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/design-hit-counter-with-range-queries</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/design-log-order-records</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/design-the-classes-and-data-structures-for-a-call-center</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/detect-cycle-in-directed-graph</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/detect-cycle-in-undirected-graph</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/determine-if-a-string-has-all-unique-characters</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/determine-whether-two-lines-would-intersect-on-a-cartesian-plane</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/determining-the-existence-of-a-valid-secret-code-in-mastermind-based-on-given-guesses-and-scores</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/digit-operations-to-make-two-integers-equal</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/disjoint-subsequences-in-an-array-with-maximum-difference</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/distributed-wikipedia-crawler-system-design</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/divide-array-into-two-subsets-with-minimum-difference</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/dodgeball-team-division</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/dot-product-of-2-sparse-vectors</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/double-stacks</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/duplicate-each-node-in-a-binary-search-tree-and-add-as-its-left-child</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/eat-pizzas-</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/edge-disjoint-hamiltonian-circuits-and-the-round-table-seating-problemshow-thinking</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/edit-distance-insert-delete-no-replace</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/efficient-conversion-between-imperial-distance-units</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/election-voting-machine-monitor</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/encode-xml</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/equal-average-partition</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/equal-sum-grid-partition-i</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/equal-sum-grid-partition-ii</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/estimating-the-value-of-pi-using-monte-carlo-method</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/euler-graphs-origin-of-graph-theory-seven-bridges-of-konigsberg</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/evaluate-an-expression-tree-and-generate-a-parenthesised-form</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/evaluation-of-arithmetic-expression-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/expected-number-of-rounds-to-reach-one-remaining-coin</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/explain-n-n-1-0</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/explain-x-x-</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/expression-tree-definition</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/extended-euclidean-algorithm-using-modulo-operator</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/external-sorting-of-integers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/factorial-of-a-number</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/fancy-sequence</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/fast-way-to-multiply-a-number-by-7</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/fibonacci-iterator</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/fibonacci-numbers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/fill-a-special-grid</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-all-conflicting-appointments</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-all-elements-appearing-more-than-size-by-k-times-in-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-all-occurrences-of-the-pattern-in-the-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-circular-gift-exchange-chains</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-closest-person</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-coin-denominations-from-change-count</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-common-elements-in-two-sorted-linked-lists</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-deepest-node-in-a-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-even-occurring-element</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-first-index-where-zeros-begin-in-binary-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-first-intersection-point-between-two-sorted-arrays</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-followers-count</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-gcd-of-n-numbers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-gcd-of-two-numbers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-invalid-ip-addresses</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-lcm-of-two-numbers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-largest-element-in-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-leader-elements-in-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-minimum-cost-to-remove-array-elements</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-mirror-score-of-a-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-most-frequent-vowel-and-consonant</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-nth-node-from-end-of-linked-list</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-nth-fibonacci-modulo-m</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-peak-in-rotated-sorted-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-position-of-msb-in-binary-representation-of-an-integer</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-position-of-the-only-set-bit</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-product-recommendation-pairs</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-products-with-three-consecutive-digits-</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-products-with-valid-serial-numbers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-rightmost-set-bit-of-a-number</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-rightmost-unset-bit-of-a-number</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-second-largest-element-in-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-similar-communities</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-size-of-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-smallest-window-that-contains-all-characters-of-string-itself</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-special-substring-of-length-k</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-students-who-improved</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-sum-of-array-product-of-magical-sequences</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-time-required-to-eliminate-bacterial-strains</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-unique-binary-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-valid-emails</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-valid-pair-of-adjacent-digits-in-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-vertical-sum-in-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-x-value-of-array-i</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-x-value-of-array-ii</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-a-value-of-a-mysterious-function-closest-to-target</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-a-line-to-cut-two-squares-in-half</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-a-line-which-passes-the-most-number-of-points</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-all-divisors-of-a-natural-number</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-all-prime-factors-of-given-number</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-all-starting-indices-of-anagrams-of-a-word-in-a-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-all-unique-combinations-of-factors-for-given-number</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-ceiling-of-target-element-in-a-sorted-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-distance-from-root-to-given-node-in-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-distinct-elements-common-to-all-rows-of-a-matrix</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-duplicate-elements-in-the-array-with-4kb-memory-only</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-duplicate-number-in-array-with-1-to-n-1-numbers-with-one-number-repeating</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-duplicates-in-a-given-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-duplicates-in-an-array-of-integers-within-range-0-to-n-1</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-element-which-appears-maximum-number-of-times-in-the-ranged-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-first-duplicate-number-in-an-array-containing-numbers-from-1-to-n</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-first-position-of-target-element-in-sorted-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-floor-of-target-element-in-a-sorted-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-frequency-of-a-word-in-a-book</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-if-path-exists-in-directed-graph</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-if-a-number-is-divisible-by-17-using-bitwise-operators</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-if-there-is-a-path-between-two-vertices-in-a-directed-graph</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-increasing-triplet-subsequence</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-index-k-in-boolean-matrix-where-kth-row-has-all-0s-and-kth-column-has-all-1s</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-integer-average-of-two-integers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-k-smallest-numbers-from-a-million-numbers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-largest-1m-numbers-in-1b-numbers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-largest-subarray-with-sum-of-0-in-the-given-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-largest-three-elements-in-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-last-digit-of-nth-fibonacci-number</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-last-modular-node-in-linked-list-for-given-k</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-last-position-of-target-element-in-sorted-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-last-two-digits-of-nth-fibonacci-number</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-local-minima-in-a-given-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-local-minimum-or-maximum-in-o-1-time-in-an-array-with-elements-differing-by-plus-minus-1</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-longest-snake-sequence-in-a-given-matrix</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-maximum-of-two-numbers-without-using-comparison-operators-or-if-else</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-minimum-difference-element-in-sorted-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-minimum-difference-between-any-two-elements</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-missing-integer-in-an-array-with-only-access-to-jth-bit-of-elements</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-most-frequent-element-in-the-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-nodes-in-binary-tree-without-siblings</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-path-from-root-to-given-node-in-a-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-point-of-transition-from-0-to-1-in-an-infinite-sorted-binary-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-right-most-cousin-in-a-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-rotation-count-in-rotated-sorted-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-smallest-and-second-smallest-elements-in-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-smallest-missing-number-in-sorted-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-largest-almost-missing-integer</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-lexicographically-largest-string-from-the-box-ii</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-minimum-amount-of-time-to-brew-potions</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-most-common-response</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-nth-largest-element-in-a-rotated-sorted-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-number-of-copy-arrays</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-shortest-path-between-2-cells-in-boolean-maze</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-depth-of-a-node-in-a-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-height-of-a-node-in-a-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-largest-power-of-2-less-than-a-given-number</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-length-of-the-linked-list</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-median-in-a-row-wise-sorted-2d-matrix</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-nearest-numbers-that-have-same-number-of-1s-for-an-integer</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-next-higher-number-containing-the-same-number-of-set-bits</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-nth-sevenish-number</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-position-of-an-element-in-a-sorted-infinite-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-smallest-integer-that-cannot-be-represented-as-sum-of-any-subset-of-sorted-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-the-smallest-subarray-with-a-sum-greater-than-a-given-integer</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/find-two-repeating-elements-in-a-given-ranged-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/finding-n-th-smallest-sum-from-two-sorted-arrays</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/finding-the-critical-point-in-a-mountain-or-valley-shaped-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/finding-the-maximum-distance-between-increasing-elements-in-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/finding-the-most-frequent-element-in-an-array-of-numbers-from-0-to-n-1</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/first-duplicate-character-in-a-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/first-letter-capitalization-ii</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/first-unique-character-in-a-stream-of-characters</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/first-unique-element-in-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/first-duplicate-element-in-an-array-by-its-index</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/first-negative-number-in-every-window-of-size-k-or-w</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/fisher-yates-shuffle</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/fisher-yates-shuffle-vs-reservoir-sampling</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/fix-the-variable-capture-in-closure</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/flatten-binary-search-tree-to-circular-doubly-linked-list</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/flatten-binary-tree-to-double-linked-list-in-place</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/flatten-a-multi-level-linked-list-in-depth-first-way</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/flatten-a-multi-level-linked-list-level-by-level</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/flatten-a-nested-dictionary</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/flatten-binary-search-tree-to-sorted-linked-list</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/flatten-binary-tree-to-linked-list-in-order-of-inorder-traversal</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/floyd-cycle-finding-algorithm</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/floyd-warshall-algorithm</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/fractional-knapsack-problem</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/freivald-s-algorithm-to-check-if-a-matrix-is-product-of-two</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/frequencies-of-shortest-supersequences</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/fruits-into-baskets-ii</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/fruits-into-baskets-iii</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/game-of-master-mind</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/generate-0-and-1-with-25-and-75-probability-using-a-fair-coin</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/generate-all-strings-of-n-bits</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/generate-a-finite-but-an-arbitrarily-large-binary-tree-in-o-1-time</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/generate-one-of-3-numbers-according-to-given-probabilities</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/generate-random-numbers-from-list-based-on-given-probabilities</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/get-sqrt-nth-node-in-linked-list</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/ghost-word-game-winning-strategy</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/given-a-binary-search-tree-with-2-nodes-swapped-find-number-of-pairs-not-following-bst-properties</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/given-an-array-count-max-number-of-surpassers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/menu-combinations-given-menu-item-prices-and-budget</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/given-preorder-traversal-of-a-bst-check-if-each-non-leaf-node-has-only-one-child</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/good-vs-bad-hash-function-examples</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/graph-representation-adjacency-list-with-isdirected-</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/graph-representation-adjacency-list-and-map</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/highway-billboard</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/hotel-reviews</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/huffman-tree-character-encoding</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/identify-the-largest-outlier-in-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-3-stacks-in-1-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-3-stacks-in-1-list</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-arithematic-operators-using-bit-manipulation</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-elo-rating-system</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-exponentiation-using-bitwise-operator</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-hierarchical-locking-system-for-tree-structures</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-job-scheduler-with-delay-function-execution</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-power-function-2</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-router</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-a-2d-iterator-class</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-a-bit-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-circular-linked-list</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-circular-stack</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-insertion-sort-on-stack</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-multiplication-subtraction-and-division-using-only-addition</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-queue-using-deque</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-queue-using-linked-list</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-queue-using-resizing-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-rand0to6-using-rand01-</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-rand3-using-rand2-</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-rand5-using-rand7-</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-rand7-using-rand5-</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-selection-sort-on-stack</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-stack-using-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-stack-using-deque</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-stack-using-linked-list</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-stack-using-priority-queue</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implement-stack-using-resizing-of-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implementing-a-queue-using-a-fixed-size-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/implementing-car-and-cdr-functions-for-pair-construction</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/improve-search-in-bst-with-sentinel</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/increasing-decreasing-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/infinite-prime-generator</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/inorder-successor-in-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/inorder-predecessor-and-successor-of-a-node-in-binary-search-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/insertion-sort</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/integer-partition-algorithm</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/integer-to-binary-number</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/interleave-the-first-half-of-the-stack-with-second-half-using-one-queue</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/intersection-of-two-sorted-arrays</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/interval-scheduling-problem</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/isolate-the-rightmost-1-bit</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/jaro-winkler-algorithm-for-string-similarity</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/job-sequencing-problem</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/k-centers-problem</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/k-reverse-a-linked-list-in-alternating-way</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/k-th-lexicographic-permutation-of-a-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/kadane-s-algorithm-for-maximum-subarray-sum</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/kaprekar-s-constant-calculator</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/karatsuba-fast-multiplication</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/karger-s-algorithm-for-minimum-cut</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/knight-s-tour</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/knuth-morris-pratt-kmp-algorithm</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/kth-largest-element-using-randomized-selection</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/kth-smallest-element-using-randomized-selection</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/kth-smallest-element-in-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/kth-unique-character-in-a-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/kth-largest-element-in-binary-search-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/kth-smallest-absolute-difference-in-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/largest-1-bordered-rectangle</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/largest-string-with-swaps</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/largest-cross-in-a-sparse-matrix</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/largest-independent-subset-in-a-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/largest-value-path-in-a-directed-graph</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/last-duplicate-character-in-a-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/last-unique-character-in-a-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/last-digit-of-a-sum-of-the-first-n-fibonacci-numbers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/last-digit-of-partial-sum-of-the-n-m-fibonacci-numbers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/lazy-caterer-s-sequence</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/least-recently-used-lru-cache-replacement-algorithm</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/lee-s-algorithm</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/left-side-view-of-a-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/length-of-longest-v-shaped-diagonal-segment</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/length-of-the-longest-consecutive-1s-in-binary-representation</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/length-of-the-longest-path-in-a-weighted-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/letter-tile-possibilities</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/lexicographically-smallest-generated-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/lexicographically-smallest-palindrome-by-minimum-insertions</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/lexicographically-smallest-string-with-k-position-moves</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/lexicographically-smallest-prime-pair-with-target-sum</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/line-equation-from-two-points</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/linear-search-on-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/linked-list-cycle-3-find-length-of-cycle</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/linked-list-cycle-4-delete-cycle</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/list-combinations-generate-unique-combinations-from-list-selecting-1-element-from-each</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/locking-and-unlocking-resources-represented-as-binary-tree-nodes</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-bitonic-subsequence</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-chunked-palindrome-decomposition</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-common-prefix-after-at-most-one-removal</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-common-prefix-of-k-strings-after-removal</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-common-subsequence-lcs-2-get-subsequence</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-common-subsequence-of-three-sequences</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-common-substring</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-increasing-subarray-with-one-change-allowed</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-palindrome-after-substring-concatenation-i</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-palindrome-after-substring-concatenation-ii</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-palindromic-subsequence-get-subsequence</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-palindromic-subsequence-after-at-most-k-operations</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-special-path</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-special-path-ii</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-subarray-having-sum-of-elements-atmost-k-</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-subarray-with-ones-after-replacement</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-subsequence-with-decreasing-adjacent-difference</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-substring-of-one-repeating-character</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-substring-with-k-distinct-characters</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-team-pass-streak</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-zigzag-subsequence</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-arithmetic-progression-in-a-sorted-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-increasing-subarray</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-subarray-with-distinct-elements</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/longest-word-made-of-other-words-in-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/low-bandwidth-almost-similar-file-syncing-algorithm-between-two-computers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/lowest-common-ancestor-definition</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/lowest-common-ancestor-for-a-n-ary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/magic-square-of-doubly-even-order</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/magic-square-of-odd-order</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/magic-square-of-singly-even-order</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/make-array-non-decreasing</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/make-a-positive-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/manachar-s-algorithm-longest-palindromic-substring-in-linear-time</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/manhattan-distances-of-all-arrangements-of-pieces</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/map-based-trie-implementation</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/matrix-chain-multiplication</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/matrix-chain-multiplication-2-print-brackets</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/max-intervals-overlap</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/max-non-negative-subarray-sum</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/max-sum-without-adjacent-elements-in-2xn-grid-or-matrix</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/max-sum-of-two-coupled-corner-to-corner-grid-paths</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximize-active-section-with-trade-i</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximize-active-section-with-trade-ii</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximize-amount-after-two-days-of-conversions</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximize-profit-from-task-assignment</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximize-score-after-pair-deletions</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximize-subarray-sum-after-removing-all-occurrences-of-one-element</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximize-subarrays-after-removing-one-conflicting-pair</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximize-gems-collected-with-an-even-number-of-red-houses</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximize-the-distance-between-points-on-a-square</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximize-the-minimum-game-score</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximizing-revenue-in-online-ad-placement</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-alternating-subsequence-sum</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-amount-of-money-robot-can-earn</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-area-rectangle-with-point-constraints-i</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-area-rectangle-with-point-constraints-ii</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-cpu-load-for-running-tasks</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-coin-collection-</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-coins-from-k-consecutive-bags</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-containers-on-a-ship</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-difference-between-two-elements-in-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-edge-removal-for-even-subtrees</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-frequency-after-subarray-operation</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-manhattan-distance-after-k-changes</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-number-of-distinct-elements-after-operations</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-number-of-matching-indices-after-right-shifts</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-number-of-set-bits-after-flipping-a-single-contagious-segment-of-bits</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-pairwise-product-1-given-only-positive-integers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-pairwise-product-2-find-pair-with-maximum-product-in-array-of-integers</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-product-cutting</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-product-of-two-digits</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-product-of-two-elements-in-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-product-of-the-length-of-two-palindromic-subsequences</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-profit-from-valid-topological-order-in-dag</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-score-of-non-overlapping-intervals</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-students-on-a-single-bench</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-subarray-sum-with-length-divisible-by-k</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-subarray-with-equal-products</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-sum-subarray-of-size-k</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-sum-submatrix</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-sum-with-at-most-k-elements</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-sum-of-edge-values-in-a-graph</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-unique-subarray-sum-after-deletion</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-weight-spanning-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-weighted-k-edge-path</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-word-packing-on-board</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-and-minimum-sums-of-at-most-size-k-subarrays</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-and-minimum-sums-of-at-most-size-k-subsequences</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-and-minimum-sum-subsequences-at-a-distance-greater-than-equal-to-m</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-coins-from-top-left-to-bottom-right-with-right-or-down-moves</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-consecutive-repeating-character-in-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-flow-and-bipartite-matching</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-gain-in-a-two-player-game-with-picking-elements-from-array-ends</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-in-a-binary-search-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-in-a-binary-tree</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-of-number-of-unique-elements-in-a-sliding-window-of-size-k</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-of-two-numbers-without-conditionals</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/maximum-revenue-by-selling-k-tickets-from-n-windows</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/median-of-k-sorted-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/median-of-two-sorted-array-of-equal-or-same-size</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/merge-k-sorted-arrays</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/merge-operations-for-minimum-travel-time</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/merge-sort-algorithm</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/merge-sort-in-a-linked-list</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/merge-a-linked-list-into-another-at-alternate-positions</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/min-queue</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/min-xor-value</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimize-absolute-difference</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimize-cost-to-remove-gaps-between-people</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimize-maximum-mouse-distance-to-holes</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimize-the-maximum-edge-weight-of-graph</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-appends-to-make-string-palindrome</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-columns-to-remove-for-lexicographical-order-in-matrix</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-cost-good-caption</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-cost-tree-from-leaf-values</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-cost-to-divide-array-into-subarrays</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-cost-to-make-arrays-identical</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-cost-to-reach-every-position</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-deletion-steps-to-make-a-string-palindrome</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-deletions-for-at-most-k-distinct-characters</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-difference-between-highest-and-lowest-of-k-scores</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-distance-between-two-elements-in-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-flips-to-separate-x-and-y</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-increments-for-target-multiples-in-an-array</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-insertion-or-deletion-steps-to-make-a-string-palindrome</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-length-root-to-leaf-bst-path-for-given-sum</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-length-root-to-leaf-binary-tree-path-for-given-sum</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-moves-to-group-occupied-seats</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-number-of-platforms-for-train-station</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-number-of-days-to-eat-n-oranges</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-number-of-deletions-of-a-string</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-number-of-operations-to-make-elements-in-array-distinct</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-operations-to-convert-all-elements-to-zero</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-operations-to-make-array-elements-zero</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-operations-to-make-array-sum-divisible-by-k</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-operations-to-make-array-values-equal-to-k</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-operations-to-make-character-frequencies-equal</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-operations-to-make-columns-strictly-increasing</loc>
<lastmod>2026-05-10T02:47:49.548Z</lastmod>
<changefreq>weekly</changefreq>
<priority>0.8</priority>
</url>
<url>
<loc>https://k5kc.com/cs/problems/minimum-operations-to-make-elements-within-k-subarrays-equal</loc>
<lastmod>2026-05-10T02:47:49.548Z<