<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://www.embercode.me</loc>
</url>
<url>
<loc>https://www.embercode.me/course</loc>
</url>
<url>
<loc>https://www.embercode.me/plans</loc>
</url>
<url>
<loc>https://www.embercode.me/practice</loc>
</url>
<url>
<loc>https://www.embercode.me/privacy</loc>
</url>
<url>
<loc>https://www.embercode.me/terms</loc>
</url>
<url>
<loc>https://www.embercode.me/refunds</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/web-fundamentals</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/frontend</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/backend-databases</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/mern-projects</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/ai-development</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/devops-systems</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/core-cs-placement</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-computers-work/cpu-and-memory</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-computers-work/storage-and-files</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-computers-work/binary-and-data</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-computers-work/the-operating-system</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-computers-work/programs-and-processes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-computers-work/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-computers-work/logic-gates-and-truth-tables</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-computers-work/building-a-tiny-adder</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-computers-work/sound-and-video-as-samples</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-computers-work/bits-bytes-and-units</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-computers-work/compression-lossless-vs-lossy</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-computers-work/boot-from-power-button-to-login</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-the-internet-works/clients-servers-and-ip</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-the-internet-works/dns</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-the-internet-works/urls</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-the-internet-works/http-requests-and-responses</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-the-internet-works/browsers-and-https</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-the-internet-works/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-the-internet-works/latency-bandwidth-and-round-trips</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-the-internet-works/json-apis-and-rest-basics</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-the-internet-works/tcp-connections-handshakes-and-retries</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-the-internet-works/udp-and-when-to-skip-reliability</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-the-internet-works/nat-and-your-home-network</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-the-internet-works/routers-hops-and-traceroute</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-the-internet-works/cookies-sessions-and-login-state</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-the-internet-works/http-caching-headers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/how-the-internet-works/cors-and-same-origin</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/the-terminal/why-the-terminal</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/the-terminal/paths-and-navigation</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/the-terminal/working-with-files</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/the-terminal/flags-and-pipes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/the-terminal/environment-variables-and-permissions</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/the-terminal/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/the-terminal/loops-and-conditionals-in-scripts</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/the-terminal/regular-expressions-with-grep-and-sed</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/the-terminal/columns-with-awk-and-cut</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/the-terminal/processes-jobs-and-signals</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/the-terminal/archives-and-downloads-tar-gzip-and-curl</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/the-terminal/history-tab-completion-and-aliases</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/the-terminal/path-and-shell-startup-files</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/the-terminal/reading-manuals-and-help</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/what-is-version-control</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/install-and-configure</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/your-first-repository</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/branches-and-merging</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/github-and-pull-requests</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/fixing-the-last-commit-amend-and-restore</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/reset-revert-and-what-each-erases</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/stashing-unfinished-work</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/rebasing-your-branch-onto-main</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/finding-the-bad-commit-blame-and-bisect</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/tags-and-releases</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/issues-labels-and-milestones</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/diff-and-staging-hunks</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/reading-history-log-filters-and-show</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/git-and-github/code-review-on-github</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/vs-code/install-and-tour</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/vs-code/extensions-and-shortcuts</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/vs-code/running-code-and-the-terminal</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/vs-code/debugging-basics</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/vs-code/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/vs-code/the-source-control-panel</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/vs-code/dev-containers-and-wsl</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/vs-code/custom-keyboard-shortcuts</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/vs-code/terminal-profiles-and-tasks</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/vs-code/project-search-and-regex-replace</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/how-to-learn-programming</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/reading-errors</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/using-ai-assistants-well</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/the-course-tutor</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/building-a-study-routine</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/teach-back-finding-gaps-by-explaining</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/reading-official-docs-well</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/writing-a-good-bug-report</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/pair-programming-basics</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/reading-other-peoples-code</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/keeping-a-project-portfolio</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/spaced-repetition-with-flashcards</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/testing-ai-code-with-tests</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/taking-breaks-and-avoiding-burnout</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/learning-with-ai/choosing-your-next-small-project</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/data-formats-and-text/json-objects-arrays-and-parsing</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/data-formats-and-text/csv-and-spreadsheets</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/data-formats-and-text/unicode-and-utf-8</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/data-formats-and-text/dates-times-and-time-zones</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/data-formats-and-text/yaml-and-toml-config-files</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/data-formats-and-text/xml-and-html-as-trees</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/data-formats-and-text/data-cleaning-lab</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/safety-and-privacy/passwords-and-password-managers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/safety-and-privacy/two-factor-login-and-passkeys</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/safety-and-privacy/recognising-phishing-and-scams</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/safety-and-privacy/secrets-in-code-and-git-history</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/safety-and-privacy/backups-and-the-3-2-1-rule</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/foundations/safety-and-privacy/privacy-cookies-and-tracking</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/flowcharts-and-pseudocode/what-is-an-algorithm</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/flowcharts-and-pseudocode/flowchart-symbols</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/flowcharts-and-pseudocode/pseudocode-conventions</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/flowcharts-and-pseudocode/tracing-and-dry-runs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/flowcharts-and-pseudocode/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/flowcharts-and-pseudocode/algorithm-design-styles</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/flowcharts-and-pseudocode/flowcharts-for-loops-and-early-exits</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/flowcharts-and-pseudocode/pseudocode-for-input-validation</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/flowcharts-and-pseudocode/trace-tables-for-calls</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/flowcharts-and-pseudocode/reading-unfamiliar-pseudocode</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/flowcharts-and-pseudocode/recognising-problem-types</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/flowcharts-and-pseudocode/comparing-two-algorithms-on-paper</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/flowcharts-and-pseudocode/one-flowchart-in-three-languages</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-variables-and-data-types/first-program</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-variables-and-data-types/variables-and-types</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-variables-and-data-types/input-with-cin</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-variables-and-data-types/sizes-casting-auto-const</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-variables-and-data-types/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-variables-and-data-types/literals-and-number-bases</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-variables-and-data-types/char-arithmetic</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-variables-and-data-types/twos-complement-ranges</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-variables-and-data-types/big-integers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-variables-and-data-types/floating-point-comparisons</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-variables-and-data-types/uninitialised-variables</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-variables-and-data-types/booleans-and-the-trap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-variables-and-data-types/division-by-zero</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-variables-and-data-types/command-line-arguments</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-variables-and-data-types/naming-and-reading-declarations</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/your-first-python-program</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/variables-and-primitive-types</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/strings-introduction</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/type-casting</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/reading-input-with-scanner</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/literals-and-number-bases</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/char-arithmetic</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/twos-complement-ranges</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/big-integers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/floating-point-comparisons</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/uninitialised-variables</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/booleans-and-the-trap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/division-by-zero</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/command-line-arguments</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-variables-and-data-types/naming-and-reading-declarations</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-operators/arithmetic-operators</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-operators/assignment-and-increment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-operators/relational-and-logical</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-operators/bitwise-and-precedence</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-operators/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-operators/floor-division-and-modulo-for-negatives</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-operators/evaluation-order-and-i-equals-i-plus-plus</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-operators/precedence-trees</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-operators/bit-masks</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-operators/popcount-and-n-and-n-minus-1</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-operators/shifts-on-negative-and-unsigned-values</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-operators/compound-assignment-narrowing</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-operators/guards-with-short-circuit</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-operators/xor-tricks</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-operators/arithmetic-operators</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-operators/assignment-and-increment-operators</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-operators/relational-and-logical-operators</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-operators/bitwise-operators</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-operators/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-operators/floor-division-and-modulo-for-negatives</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-operators/evaluation-order-and-i-equals-i-plus-plus</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-operators/precedence-trees</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-operators/bit-masks</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-operators/popcount-and-n-and-n-minus-1</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-operators/shifts-on-negative-and-unsigned-values</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-operators/compound-assignment-narrowing</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-operators/guards-with-short-circuit</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-operators/xor-tricks</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-conditionals/if-and-else</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-conditionals/else-if-and-nesting</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-conditionals/switch</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-conditionals/ternary-and-choosing</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-conditionals/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-conditionals/guard-clauses-and-early-return</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-conditionals/de-morgan-rewrites</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-conditionals/range-checks-without-chained-comparisons</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-conditionals/switch-on-strings-and-enums</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-conditionals/fall-through-on-purpose</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-conditionals/decision-tables</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-conditionals/dangling-else-and-braces</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-conditionals/null-checks-before-conditions</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-conditionals/if-with-an-initializer</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-conditionals/if-else-statements</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-conditionals/switch-statements</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-conditionals/the-ternary-operator</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-conditionals/classic-conditional-problems</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-conditionals/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-conditionals/guard-clauses-and-early-return</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-conditionals/de-morgan-rewrites</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-conditionals/range-checks-without-chained-comparisons</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-conditionals/switch-on-strings-and-enums</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-conditionals/fall-through-on-purpose</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-conditionals/decision-tables</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-conditionals/dangling-else-and-braces</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-conditionals/null-checks-before-conditions</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-conditionals/instanceof-patterns-and-if-with-an-initializer</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/while-loop</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/for-loop</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/do-while-break-continue</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/nested-loops</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/classic-loop-problems</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/loop-invariants</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/step-and-reverse-ranges</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/range-for-and-for-each</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/sentinel-loops</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/digit-loops</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/input-driven-menus</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/sieve-of-eratosthenes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/floating-point-loop-drift</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/half-open-ranges</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-loops/buffered-output</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/the-for-loop</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/the-while-loop</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/the-do-while-loop</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/break-continue-and-labels</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/nested-loops-and-classic-problems</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/loop-invariants</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/step-and-reverse-ranges</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/range-for-and-for-each</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/sentinel-loops</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/digit-loops</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/input-driven-menus</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/sieve-of-eratosthenes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/floating-point-loop-drift</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/half-open-ranges</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-loops/buffered-output</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-patterns/row-column-method</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-patterns/number-and-letter-patterns</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-patterns/pyramids-and-hollow-shapes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-patterns/diamond-and-advanced-patterns</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-patterns/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-patterns/hourglass-arrow-and-cross-shapes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-patterns/pascals-triangle</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-patterns/floyds-triangle</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-patterns/building-rows-as-strings</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-patterns/mirror-symmetry</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-patterns/pattern-debugging-lab</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-patterns/zigzag-and-wave</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-patterns/aligned-tables</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-patterns/checkerboard-and-grid-art</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-patterns/row-column-method-and-star-patterns</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-patterns/number-and-alphabet-patterns</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-patterns/pyramids</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-patterns/hollow-patterns</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-patterns/diamonds-and-butterflies</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-patterns/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-patterns/hourglass-arrow-and-cross-shapes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-patterns/pascals-triangle</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-patterns/floyds-triangle</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-patterns/building-rows-as-strings</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-patterns/mirror-symmetry</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-patterns/pattern-debugging-lab</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-patterns/zigzag-and-wave</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-patterns/aligned-tables</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-patterns/checkerboard-and-grid-art</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/functions-and-prototypes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/default-arguments-and-overloading</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/pass-by-value-and-reference</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/scope-and-lifetime</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/call-stack-and-recursion</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/returning-multiple-values</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/pure-functions</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/static-methods-and-utility-classes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/lambdas</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/generic-functions</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/shadowing</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/static-locals-and-counters</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/refactoring-a-long-main</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/read-only-parameters</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/varargs-and-parameter-packs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-functions-and-scope/callbacks-and-function-pointers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/writing-and-calling-methods</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/parameters-and-return-values</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/method-overloading</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/variable-scope</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/call-stack-and-pass-by-value</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/returning-multiple-values</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/pure-functions</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/static-methods-and-utility-classes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/lambdas</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/generic-functions</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/shadowing</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/static-locals-and-counters</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/refactoring-a-long-main</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/read-only-parameters</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/varargs-and-parameter-packs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-functions-and-scope/callbacks-and-function-pointers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/one-dimensional-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/vectors-a-resizable-array</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/prefix-sums-and-two-pointers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/kadanes-algorithm</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/two-dimensional-arrays-and-matrices</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/fixed-size-sliding-window</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/variable-size-sliding-window</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/rotation-by-reversal</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/difference-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/counting-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/matrix-rotation-and-transpose</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/spiral-traversal</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/jagged-arrays-and-copying</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/out-of-bounds-debugging-lab</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/dutch-national-flag-partition</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/product-except-self</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-arrays/boolean-seen-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/one-dimensional-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/prefix-sums-and-two-pointers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/kadane-and-subarray-problems</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/two-dimensional-arrays-and-spiral</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/fixed-size-sliding-window</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/variable-size-sliding-window</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/rotation-by-reversal</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/difference-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/counting-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/matrix-rotation-and-transpose</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/spiral-traversal</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/jagged-arrays-and-copying</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/out-of-bounds-debugging-lab</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/dutch-national-flag-partition</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/product-except-self</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-arrays/boolean-seen-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/bubble-selection-insertion</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/counting-sort-and-stability</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/merge-sort-and-quick-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/std-sort-and-comparators</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/heap-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/multi-key-sorting</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/insertion-sort-on-nearly-sorted-data</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/radix-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/comparison-contracts</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/partial-sorting</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/custom-order-by-frequency</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/timing-and-counting-comparisons</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/bad-comparator-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/sort-then-search</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-sorting/shell-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/bubble-selection-insertion</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/counting-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/merge-sort-and-quick-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/arrays-sort-comparators-and-stability</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/heap-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/multi-key-sorting</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/insertion-sort-on-nearly-sorted-data</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/radix-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/comparison-contracts</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/partial-sorting</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/custom-order-by-frequency</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/timing-and-counting-comparisons</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/bad-comparator-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/sort-then-search</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-sorting/shell-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/character-arrays-and-cstring</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/std-string-and-its-methods</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/palindromes-and-anagrams</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/common-interview-problems</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/csv-splitting</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/naive-substring-search</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/letter-counting-with-26-slot-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/caesar-cipher</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/reverse-words-and-trim</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/regex-basics</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/code-points-and-emoji</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/longest-common-prefix</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/formatting-output</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/lexicographic-comparison</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-character-arrays-and-strings/rolling-hash</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/string-basics-and-immutability</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/building-strings-and-join</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/palindromes-and-anagrams</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/compression-and-interview-problems</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/csv-splitting</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/naive-substring-search</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/letter-counting-with-26-slot-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/caesar-cipher</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/reverse-words-and-trim</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/regex-basics</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/code-points-and-emoji</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/longest-common-prefix</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/formatting-output</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/lexicographic-comparison</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-strings/rolling-hash</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/addresses-and-pointers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/pointer-arithmetic-and-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/references-and-passing-arguments</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/stack-heap-new-and-delete</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/smart-pointers-intro</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/dangling-and-null-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/drawing-pointer-diagrams</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/shared-ownership-and-weak-references</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/leaks-and-detection</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/row-major-layout</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/struct-padding-and-object-sizes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/cache-locality</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/stack-overflow-limits</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/const-and-final</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-pointers-and-memory-addresses/aliasing</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-references-and-memory/stack-and-heap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-references-and-memory/references-null-and-equality</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-references-and-memory/pass-by-value</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-references-and-memory/garbage-collection-copying-and-no-pointers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-references-and-memory/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-references-and-memory/dangling-and-null-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-references-and-memory/drawing-pointer-diagrams</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-references-and-memory/shared-ownership-and-weak-references</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-references-and-memory/leaks-and-detection</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-references-and-memory/row-major-layout</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-references-and-memory/struct-padding-and-object-sizes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-references-and-memory/cache-locality</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-references-and-memory/stack-overflow-limits</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-references-and-memory/const-and-final</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-references-and-memory/aliasing</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/vector-pair-list-and-deque</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/stack-queue-and-priority-queue</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/set-map-and-unordered-map</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/iterators-and-algorithms</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/choosing-a-container</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/hash-collisions</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/custom-keys</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/ordered-sets-and-range-lookups</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/two-sum-and-frequency-maps</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/monotonic-deque</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/top-k-with-a-heap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/iterator-invalidation</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/immutable-collections</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/generics-and-erasure</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/grouping-with-maps-of-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stl/streams-and-ranges</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/arraylist-and-linkedlist</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/stack-queue-and-deque</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/priorityqueue</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/hashmap-hashset-and-treemap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/iterator-collections-utility-and-choosing</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/hash-collisions</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/custom-keys</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/ordered-sets-and-range-lookups</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/two-sum-and-frequency-maps</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/monotonic-deque</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/top-k-with-a-heap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/iterator-invalidation</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/immutable-collections</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/generics-and-erasure</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/grouping-with-maps-of-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-built-in-collections/streams-and-ranges</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/time-and-space-complexity/counting-steps-and-big-o</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/time-and-space-complexity/common-growth-rates</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/time-and-space-complexity/analysing-loops-and-recursion</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/time-and-space-complexity/space-complexity-and-amortised-cost</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/time-and-space-complexity/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/time-and-space-complexity/best-average-and-worst-case</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/time-and-space-complexity/hidden-library-costs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/time-and-space-complexity/hash-table-costs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/time-and-space-complexity/memoisation-trade-offs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/time-and-space-complexity/estimating-from-constraints</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/time-and-space-complexity/benchmarking-honestly</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/time-and-space-complexity/grids-and-graphs-cost-terms</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/time-and-space-complexity/big-number-arithmetic-cost</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/time-and-space-complexity/recurrence-trees</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/base-case-and-call-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/recursion-on-arrays-and-strings</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/subsets</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/permutations</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/n-queens-and-sudoku</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/recursion-trees</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/memoised-recursion</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/k-subsets</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/balanced-parentheses</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/flood-fill</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/tail-calls</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/pruning-backtracking</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/fast-power</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/towers-of-hanoi</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-recursion-and-backtracking/explicit-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-recursion-and-backtracking/base-case-and-call-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-recursion-and-backtracking/recursion-on-arrays-and-strings</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-recursion-and-backtracking/subsets-and-permutations</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-recursion-and-backtracking/n-queens-and-the-sudoku-idea</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-recursion-and-backtracking/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-recursion-and-backtracking/recursion-trees</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-recursion-and-backtracking/memoised-recursion</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-recursion-and-backtracking/k-subsets</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-recursion-and-backtracking/balanced-parentheses</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-recursion-and-backtracking/flood-fill</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-recursion-and-backtracking/tail-calls</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-recursion-and-backtracking/pruning-backtracking</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-recursion-and-backtracking/fast-power</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-recursion-and-backtracking/towers-of-hanoi</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-recursion-and-backtracking/explicit-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-divide-and-conquer/divide-and-conquer-and-binary-search</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-divide-and-conquer/merge-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-divide-and-conquer/quick-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-divide-and-conquer/search-in-rotated-array</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-divide-and-conquer/counting-inversions</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-divide-and-conquer/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-divide-and-conquer/iterative-binary-search-templates</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-divide-and-conquer/binary-search-on-the-answer</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-divide-and-conquer/closest-pair-of-points</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-divide-and-conquer/master-theorem</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-divide-and-conquer/majority-element-and-max-subarray</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-divide-and-conquer/median-of-two-sorted-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-divide-and-conquer/matrix-multiplication-cost</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-divide-and-conquer/merging-intervals</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-divide-and-conquer/quickselect</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-divide-and-conquer/the-pattern-and-binary-search</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-divide-and-conquer/merge-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-divide-and-conquer/quick-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-divide-and-conquer/rotated-array-and-counting-inversions</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-divide-and-conquer/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-divide-and-conquer/iterative-binary-search-templates</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-divide-and-conquer/binary-search-on-the-answer</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-divide-and-conquer/closest-pair-of-points</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-divide-and-conquer/master-theorem</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-divide-and-conquer/majority-element-and-max-subarray</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-divide-and-conquer/median-of-two-sorted-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-divide-and-conquer/matrix-multiplication-cost</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-divide-and-conquer/merging-intervals</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-divide-and-conquer/quickselect</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/classes-objects-encapsulation</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/constructors-destructors-this</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/inheritance</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/polymorphism-and-abstraction</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/static-members-and-rule-of-three</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/composition-over-inheritance</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/invariants-and-validation</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/immutable-objects-and-records</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/operator-overloading-and-equals</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/interface-design</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/object-slicing-and-the-object-class</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/exceptions-in-class-design</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/factory-and-builder</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/enums-with-fields</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/raii-and-try-with-resources</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-oop/inventory-mini-project</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/classes-objects-and-constructors</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/encapsulation</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/inheritance</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/polymorphism-and-abstraction</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/interfaces-static-and-final</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/composition-over-inheritance</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/invariants-and-validation</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/immutable-objects-and-records</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/operator-overloading-and-equals</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/interface-design</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/object-slicing-and-the-object-class</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/exceptions-in-class-design</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/factory-and-builder</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/enums-with-fields</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/raii-and-try-with-resources</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-oop/inventory-mini-project</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/singly-linked-list-basics</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/insert-delete-memory-care</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/reverse-middle-cycle</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/merge-and-remove-nth</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/doubly-and-circular-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/sentinel-nodes-for-doubly-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/remove-every-occurrence-of-a-value</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/intersection-of-two-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/palindrome-linked-list</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/partition-and-odd-even-reordering</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/copy-a-list-with-random-pointers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/add-two-numbers-stored-as-digit-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/rotate-and-swap-nodes-in-pairs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/recursion-on-lists-and-the-stack-limit</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/reverse-in-groups-of-k</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-linked-lists/debugging-lab-pointer-bugs-in-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/singly-linked-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/doubly-and-circular-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/reverse-middle-and-cycle-detection</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/merge-and-remove-nth-from-end</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/sentinel-nodes-for-doubly-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/remove-every-occurrence-of-a-value</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/intersection-of-two-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/palindrome-linked-list</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/partition-and-odd-even-reordering</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/copy-a-list-with-random-pointers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/add-two-numbers-stored-as-digit-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/rotate-and-swap-nodes-in-pairs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/recursion-on-lists-and-the-stack-limit</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/reverse-in-groups-of-k</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-linked-lists/debugging-lab-pointer-bugs-in-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/stacks-and-balanced-parentheses</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/next-greater-and-monotonic-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/queues-and-queue-with-stacks</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/circular-queue</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/deque-and-sliding-window</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/shunting-yard-infix-to-postfix</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/calculator-with-two-stacks</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/min-stack-and-max-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/largest-rectangle-in-a-histogram</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/daily-temperatures-and-stock-span</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/trapping-rain-water-with-a-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/decode-nested-strings-and-simplify-paths</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/stack-from-linked-list-and-array-growth</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/multi-source-bfs-on-grids</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-stacks-and-queues/debugging-lab-stack-and-queue-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-stacks-and-queues/stacks-and-queues-basics</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-stacks-and-queues/balanced-parentheses</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-stacks-and-queues/next-greater-element-and-monotonic-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-stacks-and-queues/queue-with-stacks-circular-queue-and-deque</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-stacks-and-queues/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-stacks-and-queues/shunting-yard-infix-to-postfix</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-stacks-and-queues/calculator-with-two-stacks</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-stacks-and-queues/min-stack-and-max-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-stacks-and-queues/largest-rectangle-in-a-histogram</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-stacks-and-queues/daily-temperatures-and-stock-span</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-stacks-and-queues/trapping-rain-water-with-a-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-stacks-and-queues/decode-nested-strings-and-simplify-paths</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-stacks-and-queues/stack-from-linked-list-and-array-growth</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-stacks-and-queues/multi-source-bfs-on-grids</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-stacks-and-queues/debugging-lab-stack-and-queue-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/terminology-and-structure</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/traversals</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/height-and-diameter</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/level-order-and-views</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/lowest-common-ancestor</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/iterative-traversals-with-an-explicit-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/iterative-postorder-with-one-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/serialize-and-deserialize-a-binary-tree</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/build-tree-from-preorder-and-inorder</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/build-tree-from-inorder-and-postorder</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/root-to-leaf-and-any-path-sums</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/maximum-path-sum-with-negative-values</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/invert-mirror-and-symmetry-checks</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/same-tree-and-subtree-checks</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/vertical-order-boundary-and-top-view</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/zigzag-and-spiral-level-order</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/tree-dp-return-two-values-per-node</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/complete-full-and-perfect-trees-in-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-trees/debugging-lab-tree-recursion-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/terminology-and-traversals</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/height-and-diameter</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/level-order-and-views</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/lowest-common-ancestor</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/iterative-traversals-with-an-explicit-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/iterative-postorder-with-one-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/serialize-and-deserialize-a-binary-tree</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/build-tree-from-preorder-and-inorder</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/build-tree-from-inorder-and-postorder</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/root-to-leaf-and-any-path-sums</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/maximum-path-sum-with-negative-values</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/invert-mirror-and-symmetry-checks</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/same-tree-and-subtree-checks</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/vertical-order-boundary-and-top-view</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/zigzag-and-spiral-level-order</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/tree-dp-return-two-values-per-node</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/complete-full-and-perfect-trees-in-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-trees/debugging-lab-tree-recursion-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/bst-insert-and-search</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/bst-delete</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/validate-and-successor</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/balanced-bst-idea</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/avl-trees-intro</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/floor-and-ceiling-queries-in-a-bst</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/kth-smallest-with-subtree-sizes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/range-sum-queries-in-a-bst</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/lowest-common-ancestor-in-a-bst</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/why-sorted-input-makes-a-bst-a-chain</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/sorted-array-to-height-balanced-bst</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/recover-a-bst-with-two-swapped-nodes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/trim-a-bst-to-a-range</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/bst-iterator-with-a-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/avl-rotations-ll-rr-lr-rl</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/red-black-tree-rules-and-the-height-bound</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-binary-search-trees/debugging-lab-bst-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/bst-insert-and-search</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/delete-and-inorder-successor</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/validate-a-bst</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/balanced-bsts-and-avl-intro</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/floor-and-ceiling-queries-in-a-bst</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/kth-smallest-with-subtree-sizes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/range-sum-queries-in-a-bst</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/lowest-common-ancestor-in-a-bst</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/why-sorted-input-makes-a-bst-a-chain</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/sorted-array-to-height-balanced-bst</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/recover-a-bst-with-two-swapped-nodes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/trim-a-bst-to-a-range</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/bst-iterator-with-a-stack</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/avl-rotations-ll-rr-lr-rl</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/red-black-tree-rules-and-the-height-bound</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-binary-search-trees/debugging-lab-bst-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/heap-property-and-array-layout</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/push-pop-and-heapify</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/priority-queue-and-heap-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/top-k-and-merge-k-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/running-median</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/kth-largest-quickselect-versus-a-heap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/k-closest-points-with-a-size-k-heap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/task-scheduler-with-cooldown</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/reorganise-a-string-with-a-max-heap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/meeting-rooms-ii-with-a-min-heap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/sliding-window-median-with-two-heaps</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/indexed-heap-with-decrease-key</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/ugly-numbers-with-a-heap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/custom-comparators-and-tie-breaking</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-heaps/debugging-lab-heap-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-heaps/heap-property-and-array-layout</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-heaps/heapq-heapify-and-heap-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-heaps/top-k-and-merging-sorted-lists</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-heaps/median-of-a-stream</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-heaps/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-heaps/kth-largest-quickselect-versus-a-heap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-heaps/k-closest-points-with-a-size-k-heap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-heaps/task-scheduler-with-cooldown</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-heaps/reorganise-a-string-with-a-max-heap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-heaps/meeting-rooms-ii-with-a-min-heap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-heaps/sliding-window-median-with-two-heaps</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-heaps/indexed-heap-with-decrease-key</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-heaps/ugly-numbers-with-a-heap</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-heaps/custom-comparators-and-tie-breaking</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-heaps/debugging-lab-heap-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/hashing-and-collisions</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/unordered-map-and-set</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/ordered-map-and-set</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/classic-problems</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/lru-cache-idea</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/group-anagrams-with-canonical-keys</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/longest-consecutive-sequence-with-a-hash-set</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/sliding-window-with-a-frequency-map</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/isomorphic-strings-and-word-patterns</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/custom-keys-equals-hashcode-and-pair-hashing</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/iteration-order-and-changing-a-map-in-a-loop</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/insert-delete-and-random-pick-in-o1</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/time-based-key-value-store</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/top-k-frequent-words-heap-versus-bucket-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/multisets-and-counted-maps</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/sliding-window-rate-limiter</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-maps-and-sets/debugging-lab-map-and-set-pitfalls</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/hashing-and-collisions</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/hashmap-hashset-and-treemap-in-use</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/two-sum-counting-and-subarray-sums</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/lru-cache-idea</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/group-anagrams-with-canonical-keys</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/longest-consecutive-sequence-with-a-hash-set</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/sliding-window-with-a-frequency-map</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/isomorphic-strings-and-word-patterns</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/custom-keys-equals-hashcode-and-pair-hashing</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/iteration-order-and-changing-a-map-in-a-loop</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/insert-delete-and-random-pick-in-o1</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/time-based-key-value-store</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/top-k-frequent-words-heap-versus-bucket-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/multisets-and-counted-maps</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/sliding-window-rate-limiter</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dicts-and-sets/debugging-lab-map-and-set-pitfalls</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-tries/trie-structure</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-tries/prefix-and-autocomplete</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-tries/counting-and-deleting</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-tries/trie-problems-and-tradeoffs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-tries/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-tries/wildcard-search-with-dots</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-tries/replace-words-with-the-shortest-root</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-tries/longest-word-built-one-letter-at-a-time</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-tries/radix-tree-and-when-it-saves-memory</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-tries/ternary-search-tree-versus-array-tries</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-tries/suffix-trie-for-substring-queries</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-tries/palindrome-pairs-with-a-reversed-word-trie</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-tries/ip-longest-prefix-match-with-a-binary-trie</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-tries/debugging-lab-trie-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-tries/what-a-trie-is-and-node-design</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-tries/insert-search-and-prefix</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-tries/autocomplete-and-word-search</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-tries/the-xor-trie-idea</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-tries/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-tries/wildcard-search-with-dots</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-tries/replace-words-with-the-shortest-root</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-tries/longest-word-built-one-letter-at-a-time</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-tries/radix-tree-and-when-it-saves-memory</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-tries/ternary-search-tree-versus-array-tries</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-tries/suffix-trie-for-substring-queries</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-tries/palindrome-pairs-with-a-reversed-word-trie</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-tries/ip-longest-prefix-match-with-a-binary-trie</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-tries/debugging-lab-trie-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/representations-and-bfs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/dfs-components-and-cycles</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/topological-sort-and-dijkstra</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/union-find-and-mst</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/bellman-ford-and-choosing</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/grid-flood-fill-and-island-counting</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/state-space-bfs-with-keys-and-doors</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/zero-one-bfs-with-a-deque</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/bipartite-check-by-two-coloring</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/strongly-connected-components-with-kosaraju</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/bridges-and-articulation-points</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/euler-paths-and-cycles-with-hierholzer</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/course-schedule-and-alien-dictionary</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/shortest-path-reconstruction-with-parent-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/floyd-warshall-all-pairs-shortest-paths</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/cheapest-flights-within-k-stops</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/prims-algorithm-versus-kruskals</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/union-find-deeper-union-by-size-and-path-halving</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/accounts-merge-with-union-find-on-strings</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/number-of-islands-ii-union-find-on-a-growing-grid</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/critical-and-pseudo-critical-mst-edges</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/word-ladder-with-bfs-and-wildcard-buckets</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-graphs/debugging-lab-graph-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/graph-representations-and-bfs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/dfs-components-and-cycle-detection</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/topological-sort</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/shortest-paths-dijkstra-and-bellman-ford</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/union-find-and-minimum-spanning-trees</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/grid-flood-fill-and-island-counting</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/state-space-bfs-with-keys-and-doors</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/zero-one-bfs-with-a-deque</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/bipartite-check-by-two-coloring</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/strongly-connected-components-with-kosaraju</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/bridges-and-articulation-points</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/euler-paths-and-cycles-with-hierholzer</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/course-schedule-and-alien-dictionary</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/shortest-path-reconstruction-with-parent-arrays</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/floyd-warshall-all-pairs-shortest-paths</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/cheapest-flights-within-k-stops</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/prims-algorithm-versus-kruskals</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/union-find-deeper-union-by-size-and-path-halving</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/accounts-merge-with-union-find-on-strings</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/number-of-islands-ii-union-find-on-a-growing-grid</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/critical-and-pseudo-critical-mst-edges</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/word-ladder-with-bfs-and-wildcard-buckets</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-graphs/debugging-lab-graph-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/the-greedy-idea-and-activity-selection</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/fractional-knapsack-and-job-sequencing</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/huffman-coding</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/proving-greedy-and-when-it-fails</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/balloons-minimum-arrows</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/merge-intervals-and-insert-an-interval</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/jump-game-i-and-ii</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/gas-station-circular-greedy</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/partition-labels-with-last-occurrences</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/remove-k-digits-for-the-smallest-number</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/assign-cookies-with-two-pointers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/candy-distribution-with-two-passes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/coin-systems-when-greedy-coin-change-is-optimal</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/minimum-cost-to-hire-k-workers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/reconstruct-a-queue-by-height</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-greedy-algorithms/debugging-lab-greedy-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/the-greedy-idea-and-activity-selection</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/fractional-knapsack-and-job-sequencing</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/the-huffman-coding-idea</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/proving-greedy-and-when-it-fails</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/balloons-minimum-arrows</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/merge-intervals-and-insert-an-interval</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/jump-game-i-and-ii</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/gas-station-circular-greedy</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/partition-labels-with-last-occurrences</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/remove-k-digits-for-the-smallest-number</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/assign-cookies-with-two-pointers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/candy-distribution-with-two-passes</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/coin-systems-when-greedy-coin-change-is-optimal</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/minimum-cost-to-hire-k-workers</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/reconstruct-a-queue-by-height</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-greedy-algorithms/debugging-lab-greedy-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/memoization</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/tabulation-and-1d-dp</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/knapsack-and-coin-change</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/grid-paths-lcs-and-lis</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/edit-distance-and-string-dp</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/fibonacci-in-o1-space-and-matrix-exponentiation</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/decode-ways-and-string-partition-dp</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/word-break-with-a-dictionary-and-a-trie</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/palindromic-substrings-expanding-around-centres</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/palindrome-partitioning-and-minimum-cuts</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/maximum-product-subarray</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/unique-paths-with-obstacles-and-the-binomial-shortcut</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/minimum-path-sum-and-triangle-from-the-bottom</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/partition-into-equal-subsets-and-the-bitset-trick</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/target-sum-by-transforming-to-subset-sum</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/unbounded-knapsack-and-rod-cutting</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/lis-in-n-log-n-with-patience-piles</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/bitmask-dp-travelling-salesman-over-subsets</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/bitmask-dp-assigning-tasks-to-people</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/digit-dp-counting-numbers-with-a-property</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/interval-dp-matrix-chain-multiplication</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/interval-dp-burst-balloons</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/stock-trading-with-k-transactions-and-cooldown</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/regular-expression-and-wildcard-matching</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/distinct-subsequences-and-counting-paths-in-strings</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/longest-common-substring-and-rolling-rows</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/reconstructing-the-answer-by-storing-choices</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/probability-and-counting-dp-with-modulo</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/egg-drop-dp-over-moves</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/longest-path-in-a-dag-by-topological-dp</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-dynamic-programming/debugging-lab-dp-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/memoization-and-tabulation</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/one-dimensional-dp</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/knapsack-and-grid-paths</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/lcs-and-edit-distance</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/subsequence-patterns-and-dp-habits</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/fibonacci-in-o1-space-and-matrix-exponentiation</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/decode-ways-and-string-partition-dp</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/word-break-with-a-dictionary-and-a-trie</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/palindromic-substrings-expanding-around-centres</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/palindrome-partitioning-and-minimum-cuts</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/maximum-product-subarray</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/unique-paths-with-obstacles-and-the-binomial-shortcut</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/minimum-path-sum-and-triangle-from-the-bottom</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/partition-into-equal-subsets-and-the-bitset-trick</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/target-sum-by-transforming-to-subset-sum</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/unbounded-knapsack-and-rod-cutting</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/lis-in-n-log-n-with-patience-piles</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/bitmask-dp-travelling-salesman-over-subsets</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/bitmask-dp-assigning-tasks-to-people</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/digit-dp-counting-numbers-with-a-property</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/interval-dp-matrix-chain-multiplication</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/interval-dp-burst-balloons</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/stock-trading-with-k-transactions-and-cooldown</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/regular-expression-and-wildcard-matching</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/distinct-subsequences-and-counting-paths-in-strings</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/longest-common-substring-and-rolling-rows</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/reconstructing-the-answer-by-storing-choices</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/probability-and-counting-dp-with-modulo</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/egg-drop-dp-over-moves</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/longest-path-in-a-dag-by-topological-dp</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-dynamic-programming/debugging-lab-dp-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-segment-trees/range-queries-and-the-idea</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-segment-trees/build-and-query</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-segment-trees/point-update-and-min-tree</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-segment-trees/lazy-propagation-and-fenwick</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-segment-trees/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-segment-trees/range-minimum-with-a-sparse-table</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-segment-trees/range-gcd-and-why-it-is-not-invertible</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-segment-trees/counting-inversions-with-a-fenwick-tree</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-segment-trees/range-assign-and-range-add-with-lazy-tags</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-segment-trees/coordinate-compression-with-a-segment-tree</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-segment-trees/merge-sort-tree-for-range-order-queries</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-segment-trees/dynamic-segment-tree-for-huge-ranges</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-segment-trees/2d-prefix-sums-and-2d-fenwick-trees</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-segment-trees/maximum-subarray-with-node-merging</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/cpp-segment-trees/debugging-lab-segment-tree-bugs</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-segment-trees/range-queries-and-the-segment-idea</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-segment-trees/building-and-querying</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-segment-trees/point-updates-and-min-queries</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-segment-trees/lazy-propagation-and-fenwick-trees</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-segment-trees/module-assignment</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-segment-trees/range-minimum-with-a-sparse-table</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-segment-trees/range-gcd-and-why-it-is-not-invertible</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-segment-trees/counting-inversions-with-a-fenwick-tree</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-segment-trees/range-assign-and-range-add-with-lazy-tags</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-segment-trees/coordinate-compression-with-a-segment-tree</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-segment-trees/merge-sort-tree-for-range-order-queries</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-segment-trees/dynamic-segment-tree-for-huge-ranges</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-segment-trees/2d-prefix-sums-and-2d-fenwick-trees</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-segment-trees/maximum-subarray-with-node-merging</loc>
</url>
<url>
<loc>https://www.embercode.me/learn/programming-dsa/python-segment-trees/debugging-lab-segment-tree-bugs</loc>
</url>
</urlset>
