<?xml version="1.0" encoding="UTF-8"?><urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:news="http://www.google.com/schemas/sitemap-news/0.9" xmlns:xhtml="http://www.w3.org/1999/xhtml" xmlns:image="http://www.google.com/schemas/sitemap-image/1.1" xmlns:video="http://www.google.com/schemas/sitemap-video/1.1"><url><loc>https://waggertron.github.io/tech-learning/</loc></url><url><loc>https://waggertron.github.io/tech-learning/personal/</loc></url><url><loc>https://waggertron.github.io/tech-learning/personal/2026-04-24-prisoners-dilemma/</loc></url><url><loc>https://waggertron.github.io/tech-learning/personal/2026-04-27-dont-worry-darling/</loc></url><url><loc>https://waggertron.github.io/tech-learning/personal/2026-04-27-the-poor-alchemist/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-composition-over-inheritance/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-hipaa-for-software-engineers/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-idempotent-seed-and-compose-boot-order/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-ml-reranker-inside-or-tools-objective/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-modern-browser-security/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-multi-tenant-django-fails-closed/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-oasis-in-home-health-software/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-or-tools-vrp-with-skill-constraints/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-redis-three-roles-and-async-fanout/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-rest-api-design/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-sessions-jwts-cookies/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-soc-2-for-software-engineers/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-solid-principles/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-stateless-auth/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-throttling-and-rate-limiting/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-vehicle-routing-problem-intro/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-24-visit-state-machine-as-drf-action/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-27-common-algorithms-cheat-sheet/</loc></url><url><loc>https://waggertron.github.io/tech-learning/posts/2026-04-27-data-structure-complexity-cheat-sheet/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/benchmarks/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/benchmarks/agent-benchmarks/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/benchmarks/coding-benchmarks/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/benchmarks/evaluation-and-methods/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/benchmarks/knowledge-and-reasoning/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/benchmarks/long-context/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/benchmarks/math-benchmarks/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/benchmarks/multimodal/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/coding-tool-blindspots/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/coding-tool-blindspots/benchmark-contamination/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/coding-tool-blindspots/prompt-injection/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/coding-tool-blindspots/slopsquatting/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/design-md/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/harness-development/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/harness-development/context-engineering/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/harness-development/permission-models/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/harness-development/tool-design/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/prompt-engineering/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/prompt-engineering/context-window-management/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/prompt-engineering/prompt-injection-defense/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/prompt-engineering/structured-outputs/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/prompt-engineering/templates/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/rag/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/rag/chunking/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/rag/embeddings/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/rag/hybrid-search/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/rag/reranking/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/skill-development/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/skill-development/frontmatter-and-discovery/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/skill-development/patterns-from-a-production-skill-library/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/skill-development/skill-vs-tool-vs-agent/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ai/skill-development/writing-a-first-skill/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/data-structures/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/data-structures/arrays/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/data-structures/binary-trees/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/data-structures/graphs/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/data-structures/hash-tables/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/data-structures/heaps/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/data-structures/linked-lists/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/data-structures/queues/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/data-structures/stacks/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/data-structures/strings/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/data-structures/tries/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/flight-itinerary/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/functional-core-imperative-shell/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/haversine-distance/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/1d-dynamic-programming/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/1d-dynamic-programming/005-longest-palindromic-substring/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/1d-dynamic-programming/070-climbing-stairs/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/1d-dynamic-programming/091-decode-ways/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/1d-dynamic-programming/139-word-break/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/1d-dynamic-programming/152-maximum-product-subarray/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/1d-dynamic-programming/198-house-robber/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/1d-dynamic-programming/213-house-robber-ii/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/1d-dynamic-programming/300-longest-increasing-subsequence/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/1d-dynamic-programming/322-coin-change/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/1d-dynamic-programming/416-partition-equal-subset-sum/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/1d-dynamic-programming/647-palindromic-substrings/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/1d-dynamic-programming/746-min-cost-climbing-stairs/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/2d-dynamic-programming/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/2d-dynamic-programming/010-regular-expression-matching/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/2d-dynamic-programming/062-unique-paths/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/2d-dynamic-programming/072-edit-distance/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/2d-dynamic-programming/097-interleaving-string/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/2d-dynamic-programming/115-distinct-subsequences/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/2d-dynamic-programming/309-best-time-to-buy-and-sell-stock-with-cooldown/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/2d-dynamic-programming/312-burst-balloons/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/2d-dynamic-programming/329-longest-increasing-path-in-a-matrix/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/2d-dynamic-programming/494-target-sum/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/2d-dynamic-programming/518-coin-change-ii/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/2d-dynamic-programming/1143-longest-common-subsequence/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/advanced-graphs/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/advanced-graphs/332-reconstruct-itinerary/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/advanced-graphs/743-network-delay-time/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/advanced-graphs/778-swim-in-rising-water/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/advanced-graphs/787-cheapest-flights-within-k-stops/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/advanced-graphs/1584-min-cost-to-connect-all-points/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/arrays-and-hashing/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/arrays-and-hashing/001-two-sum/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/arrays-and-hashing/036-valid-sudoku/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/arrays-and-hashing/049-group-anagrams/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/arrays-and-hashing/128-longest-consecutive-sequence/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/arrays-and-hashing/217-contains-duplicate/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/arrays-and-hashing/238-product-of-array-except-self/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/arrays-and-hashing/242-valid-anagram/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/arrays-and-hashing/271-encode-and-decode-strings/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/arrays-and-hashing/347-top-k-frequent-elements/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/backtracking/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/backtracking/017-letter-combinations-of-a-phone-number/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/backtracking/039-combination-sum/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/backtracking/040-combination-sum-ii/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/backtracking/046-permutations/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/backtracking/051-n-queens/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/backtracking/078-subsets/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/backtracking/079-word-search/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/backtracking/090-subsets-ii/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/backtracking/131-palindrome-partitioning/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/binary-search/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/binary-search/004-median-of-two-sorted-arrays/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/binary-search/033-search-in-rotated-sorted-array/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/binary-search/074-search-a-2d-matrix/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/binary-search/153-find-minimum-in-rotated-sorted-array/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/binary-search/704-binary-search/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/binary-search/875-koko-eating-bananas/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/binary-search/981-time-based-key-value-store/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/bit-manipulation/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/bit-manipulation/007-reverse-integer/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/bit-manipulation/136-single-number/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/bit-manipulation/190-reverse-bits/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/bit-manipulation/191-number-of-1-bits/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/bit-manipulation/268-missing-number/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/bit-manipulation/338-counting-bits/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/bit-manipulation/371-sum-of-two-integers/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/by-difficulty/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/by-difficulty/easy/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/by-difficulty/hard/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/by-difficulty/medium/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/graphs/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/graphs/127-word-ladder/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/graphs/130-surrounded-regions/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/graphs/133-clone-graph/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/graphs/200-number-of-islands/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/graphs/207-course-schedule/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/graphs/210-course-schedule-ii/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/graphs/261-graph-valid-tree/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/graphs/269-alien-dictionary/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/graphs/323-number-of-connected-components-in-an-undirected-graph/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/graphs/417-pacific-atlantic-water-flow/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/graphs/684-redundant-connection/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/graphs/695-max-area-of-island/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/graphs/994-rotting-oranges/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/greedy/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/greedy/045-jump-game-ii/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/greedy/053-maximum-subarray/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/greedy/055-jump-game/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/greedy/134-gas-station/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/greedy/678-valid-parenthesis-string/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/greedy/763-partition-labels/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/greedy/846-hand-of-straights/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/greedy/1899-merge-triplets-to-form-target-triplet/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/heap-priority-queue/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/heap-priority-queue/215-kth-largest-element-in-an-array/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/heap-priority-queue/295-find-median-from-data-stream/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/heap-priority-queue/355-design-twitter/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/heap-priority-queue/621-task-scheduler/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/heap-priority-queue/703-kth-largest-element-in-a-stream/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/heap-priority-queue/973-k-closest-points-to-origin/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/heap-priority-queue/1046-last-stone-weight/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/intervals/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/intervals/056-merge-intervals/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/intervals/057-insert-interval/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/intervals/252-meeting-rooms/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/intervals/253-meeting-rooms-ii/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/intervals/435-non-overlapping-intervals/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/intervals/1851-minimum-interval-to-include-each-query/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/linked-list/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/linked-list/002-add-two-numbers/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/linked-list/019-remove-nth-node-from-end-of-list/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/linked-list/021-merge-two-sorted-lists/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/linked-list/023-merge-k-sorted-lists/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/linked-list/025-reverse-nodes-in-k-group/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/linked-list/138-copy-list-with-random-pointer/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/linked-list/141-linked-list-cycle/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/linked-list/143-reorder-list/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/linked-list/146-lru-cache/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/linked-list/206-reverse-linked-list/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/linked-list/287-find-the-duplicate-number/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/math-and-geometry/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/math-and-geometry/043-multiply-strings/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/math-and-geometry/048-rotate-image/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/math-and-geometry/050-pow-x-n/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/math-and-geometry/054-spiral-matrix/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/math-and-geometry/066-plus-one/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/math-and-geometry/073-set-matrix-zeroes/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/math-and-geometry/202-happy-number/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/math-and-geometry/2013-detect-squares/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/matrix/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/sliding-window/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/sliding-window/003-longest-substring-without-repeating-characters/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/sliding-window/076-minimum-window-substring/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/sliding-window/121-best-time-to-buy-and-sell-stock/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/sliding-window/239-sliding-window-maximum/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/sliding-window/424-longest-repeating-character-replacement/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/sliding-window/567-permutation-in-string/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/stack/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/stack/020-valid-parentheses/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/stack/022-generate-parentheses/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/stack/084-largest-rectangle-in-histogram/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/stack/150-evaluate-reverse-polish-notation/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/stack/155-min-stack/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/stack/739-daily-temperatures/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/stack/853-car-fleet/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/098-validate-binary-search-tree/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/100-same-tree/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/102-binary-tree-level-order-traversal/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/104-maximum-depth-of-binary-tree/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/105-construct-binary-tree-from-preorder-and-inorder-traversal/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/110-balanced-binary-tree/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/124-binary-tree-maximum-path-sum/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/199-binary-tree-right-side-view/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/226-invert-binary-tree/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/230-kth-smallest-element-in-a-bst/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/235-lowest-common-ancestor-of-a-bst/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/297-serialize-and-deserialize-binary-tree/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/543-diameter-of-binary-tree/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/572-subtree-of-another-tree/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/trees/1448-count-good-nodes-in-binary-tree/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/tries/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/tries/208-implement-trie/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/tries/211-design-add-and-search-words-data-structure/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/tries/212-word-search-ii/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/two-pointers/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/two-pointers/011-container-with-most-water/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/two-pointers/015-3sum/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/two-pointers/042-trapping-rain-water/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/two-pointers/125-valid-palindrome/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/leetcode-150/two-pointers/167-two-sum-ii/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/vehicle-routing/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/vehicle-routing/capacitated/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/vehicle-routing/pickup-and-delivery/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/vehicle-routing/solution-approaches/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/cs/vehicle-routing/time-windows/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ops/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ops/argocd/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ops/gitflow/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ops/gitops/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ops/helm/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ops/kubernetes/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ops/mlops/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/ops/terraform/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/testing/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/testing/component-tests/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/testing/e2e-tests/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/testing/fuzz-tests/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/testing/integration-tests/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/testing/smoke-tests/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/testing/tdd/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/testing/unit-tests/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/web/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/web/django/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/web/django/part-01-setup-and-mvt/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/web/django/part-02-models-and-orm/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/web/django/part-03-views-urls-templates/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/web/django/part-04-forms-and-user-input/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/web/django/part-05-authentication/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/web/django/part-06-drf-basics/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/web/django/part-07-advanced-orm/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/web/django/part-08-caching-and-performance/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/web/django/part-09-async-and-background-tasks/</loc></url><url><loc>https://waggertron.github.io/tech-learning/topics/web/django/part-10-production/</loc></url></urlset>