<?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:xsi="http://www.w3.org/2001/XMLSchema-instance"
        xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9 http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd"
        xmlns:mobile="http://www.google.com/schemas/sitemap-mobile/1.0"
        xmlns:image="http://www.google.com/schemas/sitemap-image/1.1"
        xmlns:video="http://www.google.com/schemas/sitemap-video/1.1">
<url><loc>http://www.nxcoding.com/archives/current-limiter-design</loc>
<lastmod>2024-11-13T10:24:04+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/1panel-https-auto-renew</loc>
<lastmod>2024-11-13T10:24:07+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/wu-fu-zhu-kong-jian-jiao-huan</loc>
<lastmod>2024-11-13T10:24:10+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/java-ji-ben-shu-ju-lei-xing-xiang-jie</loc>
<lastmod>2024-11-13T10:24:12+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/wsl-an-zhuang-yu-guan-li-windows-shang-de-linux-zi-xi-tong</loc>
<lastmod>2024-11-13T10:24:14+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/xing-neng-ce-shi-gong-ju-wrk-shi-jian</loc>
<lastmod>2024-11-14T00:41:44+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/web-3-xue-xi-bi-ji-web-3-gai-nian-xue-xi</loc>
<lastmod>2024-11-16T04:52:00+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/web-3-xue-xi-bi-ji-yi-tai-fang-xue-xi</loc>
<lastmod>2024-11-16T04:52:06+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/web-3-xue-xi-bi-ji-fungible-token-tong-zhi-hua-huo-bi-he-yue-kai-fa-xue-xi</loc>
<lastmod>2024-11-17T23:05:27+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/xing-neng-ce-shi-gong-ju-wrk-jin-jie-xue-xi</loc>
<lastmod>2024-11-18T00:32:04+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mian-shi-ti-yi-cuo-dian-bi-ji-java-ji-chu-mian-shi-ti</loc>
<lastmod>2024-12-02T01:37:47+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-2024_12_03-3274.-jian-cha-qi-pan-fang-ge-yan-se-shi-fou-xiang-tong</loc>
<lastmod>2024-12-03T01:05:13+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-2056.-qi-pan-shang-you-xiao-yi-dong-zu-he-de-shu-mu</loc>
<lastmod>2024-12-04T10:34:50+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3001.-bu-huo-hei-huang-hou-xu-yao-de-zui-shao-yi-dong-ci-shu</loc>
<lastmod>2024-12-05T00:31:58+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-999.-ke-yi-bei-yi-bu-bu-huo-de-qi-zi-shu</loc>
<lastmod>2024-12-06T00:27:37+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-688.-qi-shi-zai-qi-pan-shang-de-gai-lu</loc>
<lastmod>2024-12-07T00:49:37+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-782.-bian-wei-qi-pan</loc>
<lastmod>2024-12-08T02:43:46+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-1812.-pan-duan-guo-ji-xiang-qi-qi-pan-zhong-yi-ge-ge-zi-de-yan-se</loc>
<lastmod>2024-12-09T10:36:00+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-935.-qi-shi-bo-hao-qi</loc>
<lastmod>2024-12-11T00:00:23+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-2717.-ban-you-xu-pai-lie</loc>
<lastmod>2024-12-11T08:21:14+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-2931.-gou-mai-wu-pin-de-zui-da-kai-xiao</loc>
<lastmod>2024-12-12T09:19:53+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3264.-k-ci-cheng-yun-suan-hou-de-zui-zhong-shu-zu-i</loc>
<lastmod>2024-12-13T01:16:38+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/kuai-su-mi-suan-fa</loc>
<lastmod>2024-12-14T11:12:31+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3266.-k-ci-cheng-yun-suan-hou-de-zui-zhong-shu-zu-ii</loc>
<lastmod>2024-12-14T11:07:29+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-1338.-shu-zu-da-xiao-jian-ban</loc>
<lastmod>2024-12-15T01:09:19+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-1387.-jiang-zheng-shu-an-quan-chong-pai-xu</loc>
<lastmod>2024-12-22T22:40:39+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-855.-kao-chang-jiu-zuo</loc>
<lastmod>2024-12-23T11:45:41+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-1705.-chi-ping-guo-de-zui-da-shu-mu</loc>
<lastmod>2024-12-24T10:53:00+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/os-study-notes-overview</loc>
<lastmod>2024-12-24T16:54:08+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/os-study-notes-boot-and-core-mechanisms</loc>
<lastmod>2024-12-25T00:09:56+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3218.-qie-dan-gao-de-zui-xiao-zong-kai-xiao-i</loc>
<lastmod>2024-12-25T18:05:06+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3083.-zi-fu-chuan-ji-qi-fan-zhuan-zhong-shi-fou-cun-zai-tong-yi-zi-zi-fu-chuan</loc>
<lastmod>2024-12-26T09:56:18+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/os-study-notes-physical-memory-management-contiguous-allocation</loc>
<lastmod>2024-12-26T23:22:35+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3159.-cha-xun-shu-zu-zhong-yuan-su-de-chu-xian-wei-zhi</loc>
<lastmod>2024-12-27T11:02:38+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3046.-fen-ge-shu-zu</loc>
<lastmod>2024-12-28T09:26:06+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/os-study-notes-physical-memory-management-non-contiguous-allocation</loc>
<lastmod>2024-12-28T23:52:52+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-1366.-tong-guo-tou-piao-dui-tuan-dui-pai-ming</loc>
<lastmod>2024-12-29T11:09:39+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-1367.-er-cha-shu-zhong-de-lian-biao</loc>
<lastmod>2024-12-30T00:51:40+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3219.-qie-dan-gao-de-zui-xiao-zong-kai-xiao-ii</loc>
<lastmod>2024-12-31T20:47:44+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3280.-jiang-ri-qi-zhuan-huan-wei-er-jin-zhi-biao-shi</loc>
<lastmod>2025-01-01T09:26:10+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-729.-wo-de-ri-cheng-an-pai-biao-i</loc>
<lastmod>2025-01-02T21:37:20+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-731.-wo-de-ri-cheng-an-pai-biao-ii</loc>
<lastmod>2025-01-03T09:19:51+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-732.-wo-de-ri-cheng-an-pai-biao-iii</loc>
<lastmod>2025-01-04T21:35:28+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-2241.-she-ji-yi-ge-atm-ji-qi</loc>
<lastmod>2025-01-05T02:11:53+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/java-concurrency-basics-study-notes</loc>
<lastmod>2025-01-06T21:11:35+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-2274.-bu-han-te-shu-lou-ceng-de-zui-da-lian-xu-lou-ceng-shu</loc>
<lastmod>2025-01-06T11:26:08+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3019.-an-jian-bian-geng-de-ci-shu</loc>
<lastmod>2025-01-07T01:15:42+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-2264.-zi-fu-chuan-zhong-zui-da-de-3-wei-xiang-tong-shu-zi</loc>
<lastmod>2025-01-08T20:14:15+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3297</loc>
<lastmod>2025-01-09T18:16:09+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3270.-qiu-chu-shu-zi-da-an</loc>
<lastmod>2025-01-11T10:08:03+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-2275.-an-wei-yu-jie-guo-da-yu-ling-de-zui-chang-zu-he</loc>
<lastmod>2025-01-12T08:53:52+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mybatis-plus-upgrade-pagination-plugin-error</loc>
<lastmod>2025-01-12T10:57:17+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-2270.-fen-ge-shu-zu-de-fang-an-shu</loc>
<lastmod>2025-01-13T15:51:43+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3065.-chao-guo-yu-zhi-de-zui-shao-cao-zuo-shu-i</loc>
<lastmod>2025-01-14T10:36:22+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/java-platform-architecture</loc>
<lastmod>2025-01-14T17:38:05+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/min-operations-to-make-all-elements-greater-or-equal-to-k</loc>
<lastmod>2025-01-15T10:30:19+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3095.-huo-zhi-zhi-shao-k-de-zui-duan-zi-shu-zu-i</loc>
<lastmod>2025-01-16T18:17:22+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3097.-huo-zhi-zhi-shao-wei-k-de-zui-duan-zi-shu-zu-ii</loc>
<lastmod>2025-01-17T21:24:01+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-3287.-qiu-chu-shu-zu-zhong-zui-da-xu-lie-zhi</loc>
<lastmod>2025-01-18T23:17:19+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-2266.-tong-ji-da-zi-fang-an-shu</loc>
<lastmod>2025-01-19T15:59:02+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-2239.-zhao-dao-zui-jie-jin-0-de-shu-zi</loc>
<lastmod>2025-01-20T15:06:15+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/lombok-annotation-not-working-springboot</loc>
<lastmod>2025-01-20T19:07:33+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-2218.-cong-zhan-zhong-qu-chu-k-ge-ying-bi-de-zui-da-mian-zhi-he</loc>
<lastmod>2025-01-21T19:09:29+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-1561.-ni-ke-yi-huo-de-de-zui-da-ying-bi-shu-mu</loc>
<lastmod>2025-01-22T19:54:49+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-2920.-shou-ji-suo-you-jin-bi-ke-huo-de-de-zui-da-ji-fen</loc>
<lastmod>2025-01-23T18:12:48+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/java-singleton-pattern-eager-double-checked-static-inner-class</loc>
<lastmod>2025-01-23T21:27:01+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-2944-buy-fruits-minimum-coins</loc>
<lastmod>2025-01-24T17:33:44+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-2412-minimum-initial-money-to-complete-all-transactions</loc>
<lastmod>2025-01-25T23:26:19+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-40.-zu-he-zong-he-ii</loc>
<lastmod>2025-01-26T19:52:49+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-45-jump-game-ii-minimum-jumps</loc>
<lastmod>2025-01-27T21:04:06+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-mei-ri-yi-ti-119.-yang-hui-san-jiao-ii</loc>
<lastmod>2025-01-28T17:26:11+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-219-contains-duplicate-ii</loc>
<lastmod>2025-01-29T20:07:38+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-350-intersection-of-two-arrays-ii</loc>
<lastmod>2025-01-30T20:15:01+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-541-reverse-string-ii</loc>
<lastmod>2025-01-31T20:37:42+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-81-search-in-rotated-sorted-array-ii</loc>
<lastmod>2025-02-01T22:38:44+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-598-max-count-of-the-number-with-max-value-in-matrix</loc>
<lastmod>2025-02-02T17:31:24+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-680-valid-palindrome-ii</loc>
<lastmod>2025-02-03T16:14:27+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-90-subsets-ii</loc>
<lastmod>2025-02-05T21:02:12+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-47-permute-unique</loc>
<lastmod>2025-02-06T23:09:47+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-59-spiral-matrix-ii</loc>
<lastmod>2025-02-07T17:26:35+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/web-3-bitcoin-cryptographic-principles-hash-signature</loc>
<lastmod>2025-02-08T18:17:57+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-63-unique-paths-ii</loc>
<lastmod>2025-02-08T18:14:36+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-80-remove-duplicates-from-sorted-array-ii</loc>
<lastmod>2025-02-09T16:10:19+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/web-3-bitcoin-data-structure-hash-pointers-merkle-tree</loc>
<lastmod>2025-02-10T16:10:41+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-1760-minimum-limit-of-balls-in-a-bag</loc>
<lastmod>2025-02-12T11:42:23+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-1742-boxes-max-balls-in-boxes</loc>
<lastmod>2025-02-13T10:48:36+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/spring-cloud-gateway-dependency-error-solution</loc>
<lastmod>2025-02-13T11:47:53+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-1552-max-magnetic-force-between-two-balls</loc>
<lastmod>2025-02-15T00:02:49+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-1706-ball-fall-location</loc>
<lastmod>2025-02-15T10:07:55+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-problem-1299-replace-elements-with-greatest-element-on-right</loc>
<lastmod>2025-02-16T09:14:44+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/operating-system-virtual-memory</loc>
<lastmod>2025-02-17T00:07:36+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1287-find-integer-occurs-more-than-25-percent</loc>
<lastmod>2025-02-17T10:22:45+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2080-range-query-frequency</loc>
<lastmod>2025-02-18T10:32:21+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-624-max-distance-in-array-lists</loc>
<lastmod>2025-02-19T11:42:03+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mysql-storage-engines-innoDB-myISAM-memory-comparison</loc>
<lastmod>2025-02-19T15:55:41+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2595-even-odd-bits</loc>
<lastmod>2025-02-20T08:58:43+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mysql-bplus-tree-index-performance-query-storage</loc>
<lastmod>2025-02-20T21:57:21+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2209-minimum-white-tiles-after-carpeting</loc>
<lastmod>2025-02-21T10:07:54+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mysql-index-usage-covering-index-vs-lookup-query</loc>
<lastmod>2025-02-21T15:08:15+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2506-count-similar-string-pairs</loc>
<lastmod>2025-02-22T10:56:47+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mysql-index-optimization-performance-and-best-practices</loc>
<lastmod>2025-02-22T22:58:53+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1206-design-skiplist</loc>
<lastmod>2025-02-23T11:56:47+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1656-design-ordered-stream</loc>
<lastmod>2025-02-24T11:12:31+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2502-memory-allocator-design</loc>
<lastmod>2025-02-25T11:45:35+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1472-browser-history-design</loc>
<lastmod>2025-02-26T11:21:25+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mysql-transaction-basics</loc>
<lastmod>2025-02-27T11:33:03+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2296-text-editor-design</loc>
<lastmod>2025-02-27T10:50:40+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mysql-transaction-isolation-levels-dirty-read-non-repeatable-read-phantom-read</loc>
<lastmod>2025-02-27T13:55:50+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2353-food-ratings-system-design</loc>
<lastmod>2025-02-28T13:04:09+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mysql-lock-types-and-deadlock-resolution</loc>
<lastmod>2025-02-28T22:29:11+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-131-palindrome-partitioning</loc>
<lastmod>2025-03-01T10:58:23+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mysql-advanced-interview-topics-transaction-two-phase-commit-pagination-master-slave-synchronization</loc>
<lastmod>2025-03-01T19:49:54+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-132-palindrome-partitioning-ii</loc>
<lastmod>2025-03-02T12:17:16+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/redis-basics-data-structures-performance</loc>
<lastmod>2025-03-02T22:54:07+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1278-palindrome-partitioning-iii</loc>
<lastmod>2025-03-03T17:53:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/redis-cache-consistency-strategies-and-common-issues</loc>
<lastmod>2025-03-03T21:55:11+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1745-palindrome-partitioning-iv</loc>
<lastmod>2025-03-04T10:47:44+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/redis-distributed-lock-interview-guide</loc>
<lastmod>2025-03-04T20:12:07+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1328-break-palindrome</loc>
<lastmod>2025-03-05T17:45:33+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/redis-persistence-and-expiration-strategies</loc>
<lastmod>2025-03-05T17:38:34+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2588-count-beautiful-subarrays</loc>
<lastmod>2025-03-06T23:07:29+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2597-number-of-beautiful-subsets</loc>
<lastmod>2025-03-07T22:59:35+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2234-maximum-beauty-of-an-gardens</loc>
<lastmod>2025-03-08T12:51:08+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/interview-notes-http</loc>
<lastmod>2025-03-09T01:06:31+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2070-maximum-beauty-of-an-item-within-price-range</loc>
<lastmod>2025-03-09T22:17:34+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/http-evolution-http1-http2-http3-differences%20%20</loc>
<lastmod>2025-03-09T22:10:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2269-find-the-k-beauty-of-a-number</loc>
<lastmod>2025-03-10T10:16:25+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2012-sum-of-beauty-in-the-array</loc>
<lastmod>2025-03-11T23:05:11+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3305-vowel-consonant-substring-count-i</loc>
<lastmod>2025-03-13T11:10:04+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/tcp-vs-udp-differences-reliability-and-performance</loc>
<lastmod>2025-03-12T23:04:48+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3306-vowel-consonant-substring-count-ii</loc>
<lastmod>2025-03-13T11:20:00+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/os-interview-process-thread-ipc-scheduling</loc>
<lastmod>2025-03-14T19:55:38+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3340-check-balanced-string</loc>
<lastmod>2025-03-14T20:05:11+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3110-score-of-string</loc>
<lastmod>2025-03-15T18:52:11+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2272-maximum-substring-variance</loc>
<lastmod>2025-03-16T22:02:51+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/interview-notes-operating-system-io-models</loc>
<lastmod>2025-03-16T22:48:25+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1963-minimum-swaps-to-balance-string</loc>
<lastmod>2025-03-17T22:47:17+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2614-diagonal-prime</loc>
<lastmod>2025-03-18T00:51:01+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2610-convert-2d-array</loc>
<lastmod>2025-03-19T23:02:31+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2612-minimum-reverse-operations</loc>
<lastmod>2025-03-20T22:58:37+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2680-maximum-or-prefix-bitwise</loc>
<lastmod>2025-03-21T23:19:48+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2643-row-with-max-ones</loc>
<lastmod>2025-03-22T11:54:20+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2116-valid-parentheses-string-redundancy-method</loc>
<lastmod>2025-03-23T23:18:57+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2255-count-prefixes-matching-strings</loc>
<lastmod>2025-03-24T18:31:42+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2711-diagonal-distinct-values-difference</loc>
<lastmod>2025-03-25T08:20:10+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2829-k-avoiding-array-minimum-sum</loc>
<lastmod>2025-03-26T11:11:54+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2712-minimum-cost-to-make-characters-equal</loc>
<lastmod>2025-03-27T13:22:09+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2716-minimized-string-length</loc>
<lastmod>2025-03-28T16:23:47+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2360-longest-cycle-in-a-graph-dfs-memoization</loc>
<lastmod>2025-03-29T19:25:38+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2109-insert-spaces-in-string-efficient-approach</loc>
<lastmod>2025-03-30T16:36:24+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2278-percentage-letter</loc>
<lastmod>2025-03-31T23:05:49+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2140-solving-intelligence-questions-dfs-memoization</loc>
<lastmod>2025-04-01T13:13:15+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2873-maximum-triplet-value-prefix-suffix-greedy</loc>
<lastmod>2025-04-02T10:20:22+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2874-maximum-triplet-value-prefix-suffix-greedy</loc>
<lastmod>2025-04-03T22:31:20+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1123-lowest-common-ancestor-of-deepest-leaves-dfs-recursion</loc>
<lastmod>2025-04-04T12:55:25+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1863-sum-of-all-subset-xor-totals</loc>
<lastmod>2025-04-05T13:22:36+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/system-design-heartbeat-renewal-watchdog-registry</loc>
<lastmod>2025-04-05T18:57:20+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-368-largest-divisible-subset-dfs-memoization</loc>
<lastmod>2025-04-06T23:13:25+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-416-partition-equal-subset-sum</loc>
<lastmod>2025-04-07T21:18:45+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3396-minimum-operations-to-make-array-unique</loc>
<lastmod>2025-04-08T20:57:26+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3375-minimum-operations-to-make-all-elements-k</loc>
<lastmod>2025-04-09T23:48:02+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2999-count-powerful-integers-digit-dp</loc>
<lastmod>2025-04-10T22:28:11+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2843-count-symmetric-integers</loc>
<lastmod>2025-04-11T18:26:49+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3272-count-the-number-of-good-integers</loc>
<lastmod>2025-04-12T22:11:09+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1922-count-good-numbers-fast-power</loc>
<lastmod>2025-04-13T23:16:05+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1534-count-good-triplets-prefix-sum</loc>
<lastmod>2025-04-14T23:12:03+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2179-count-good-triplets-fenwick-tree</loc>
<lastmod>2025-04-15T23:46:34+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/superchain-colearn-daily-notes</loc>
<lastmod>2025-04-16T10:10:52+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2537-count-the-number-of-good-subarrays</loc>
<lastmod>2025-04-16T10:41:59+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2176-count-equal-and-divisible-pairs-in-an-array</loc>
<lastmod>2025-04-17T22:22:09+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2364-count-bad-pairs-using-reverse-thinking</loc>
<lastmod>2025-04-18T22:19:50+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2563-count-fair-pairs-using-binary-search</loc>
<lastmod>2025-04-19T19:47:20+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-781-rabbits-in-forest-using-greedy-and-counting</loc>
<lastmod>2025-04-20T12:57:04+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2145-count-hidden-arrays-using-prefix-sum</loc>
<lastmod>2025-04-21T22:51:57+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1399-count-largest-group-using-digit-sum</loc>
<lastmod>2025-04-23T12:21:52+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2799-count-complete-subarrays</loc>
<lastmod>2025-04-24T16:24:07+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2845-count-interesting-subarrays</loc>
<lastmod>2025-04-25T18:42:31+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2444-count-bounded-subarrays</loc>
<lastmod>2025-04-26T17:08:27+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/blockchain-and-money-web2-problem-cryptography-financial-sector-challenges</loc>
<lastmod>2025-04-26T17:17:11+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3392-count-length-3-subarrays</loc>
<lastmod>2025-04-27T23:03:21+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2302-count-subarrays-score-less-than-k</loc>
<lastmod>2025-04-28T23:17:03+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2962-count-subarrays-where-max-element-appears-at-least-k-times</loc>
<lastmod>2025-04-29T11:49:41+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1295-find-numbers-with-even-number-of-digits</loc>
<lastmod>2025-04-30T23:21:54+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2071-maximum-number-of-tasks-you-can-assign</loc>
<lastmod>2025-05-01T11:55:54+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mit-blockchain-and-money-lecture-2-money-ledgers-bitcoin</loc>
<lastmod>2025-05-01T23:51:04+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-838-push-dominoes-conditional-interval-handling</loc>
<lastmod>2025-05-02T22:36:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1007-minimum-domino-rotations-equal-row-conditional-checking</loc>
<lastmod>2025-05-03T21:53:48+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1128-number-of-equivalent-domino-pairs-hash-map-counting</loc>
<lastmod>2025-05-04T22:34:02+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-790-domino-and-tromino-tiling-dp</loc>
<lastmod>2025-05-05T23:45:20+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/web-deploy-mixed-content-error-https-http-camera</loc>
<lastmod>2025-05-06T23:11:14+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3341-minimum-time-to-reach-last-room-bfs</loc>
<lastmod>2025-05-07T22:33:17+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3342-minimum-time-to-reach-last-room-ii-priority-queue</loc>
<lastmod>2025-05-08T23:28:34+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3343-count-balanced-permutations-dp</loc>
<lastmod>2025-05-09T23:13:22+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mit-blockchain-and-money-lecture-3-blockchain-basics-and-cryptography</loc>
<lastmod>2025-05-10T18:01:58+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2918-minimum-equal-sum-of-two-arrays-greedy</loc>
<lastmod>2025-05-10T18:45:27+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/blockchain-money-lecture4-blockchain-consensus</loc>
<lastmod>2025-05-11T22:58:39+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1550-three-consecutive-odds-simple</loc>
<lastmod>2025-05-11T23:05:29+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/blockchain-and-money-lecture-5-transactions-utxo-script</loc>
<lastmod>2025-05-12T17:41:19+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2094-find-3-digit-even-numbers</loc>
<lastmod>2025-05-12T17:51:53+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3335-length-of-string-after-transformations</loc>
<lastmod>2025-05-13T20:03:17+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3337-length-of-string-after-transformations-ii</loc>
<lastmod>2025-05-14T10:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3067-longest-alternating-group-subsequence-i</loc>
<lastmod>2025-05-15T20:35:04+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mit-6.824-mapreduce-paper-notes</loc>
<lastmod>2025-05-16T22:04:07+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2901-longest-subsequence-with-hamming-distance-one</loc>
<lastmod>2025-05-16T22:15:15+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-75-sort-colors-two-pointers</loc>
<lastmod>2025-05-17T22:24:56+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1931-color-grid-dynamic-programming</loc>
<lastmod>2025-05-18T21:58:25+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3355-zero-array-transformation-i-difference-array</loc>
<lastmod>2025-05-20T08:11:54+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3356-minimum-k-to-zero-array</loc>
<lastmod>2025-05-21T08:40:02+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3362-max-removal-zero-array</loc>
<lastmod>2025-05-22T09:19:57+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3068-maximum-node-value-sum</loc>
<lastmod>2025-05-23T08:06:04+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2942-find-words-containing-character</loc>
<lastmod>2025-05-24T09:22:29+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2131-longest-palindrome-by-connecting-two-letter-words</loc>
<lastmod>2025-05-25T08:55:42+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1857-largest-color-value-in-directed-graph</loc>
<lastmod>2025-05-26T09:25:46+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mit6824-lab1-mapreduce-practice-and-lessons</loc>
<lastmod>2025-05-27T23:52:12+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3372-max-target-nodes-connection-dfs</loc>
<lastmod>2025-05-28T22:35:30+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3373-max-target-nodes-after-connecting-trees</loc>
<lastmod>2025-05-29T23:08:45+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2359-closest-meeting-node-dfs</loc>
<lastmod>2025-05-30T22:45:47+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-909-snakes-and-ladders-bfs</loc>
<lastmod>2025-05-31T22:56:50+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2929-distribute-candies-ii</loc>
<lastmod>2025-06-01T23:15:28+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mit-6824-ft-vm-paper-notes-fault-tolerance-vm</loc>
<lastmod>2025-06-02T11:40:26+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-135-candy-greedy-algorithm</loc>
<lastmod>2025-06-02T11:52:09+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mit6824-lab2-keyvalue-server-lock</loc>
<lastmod>2025-06-03T23:23:19+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-1061-smallest-equivalent-string-union-find</loc>
<lastmod>2025-06-05T09:28:14+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-2434-robot-print-smallest-string-greedy-stack</loc>
<lastmod>2025-06-06T22:45:14+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-3170-clear-stars-to-get-minimum-string</loc>
<lastmod>2025-06-07T09:32:20+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mit6824-week2-linearizability-lab2-analysis</loc>
<lastmod>2025-06-09T20:42:40+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mit-6.824-paxos-made-simple-study-notes</loc>
<lastmod>2025-06-12T23:06:52+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/mit6-824-raft-section1-5-analysis</loc>
<lastmod>2025-06-28T16:28:03+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/archives/leetcode-daily-from-boolean-return-to-engineering-abstraction</loc>
<lastmod>2025-10-26T18:29:47+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/categories/xi-tong-she-ji</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/categories/zhi-shi-bi-ji</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/categories/java</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/categories/hou-duan</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/categories/web3</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/categories/mian-shi-qiu-zhi</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/categories/cai-keng-ji-lu</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/categories/suan-fa-shua-ti</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/zhong-jian-jian</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/fen-bu-shi</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/fu-wu-qi</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/wang-luo</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/suan-fa</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/java</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/kai-fa-gong-ju</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/linux</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/cao-zuo-xi-tong</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/hou-duan</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/xing-neng-you-hua</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/qu-kuai-lian</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/qu-zhong-xin-hua</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/ethereum</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/solidity</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/she-ji-mo-shi</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags/spring</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/xiao-you-xi</loc>
<lastmod>2024-11-13T19:35:28+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/aimbot</loc>
<lastmod>2024-11-13T19:40:27+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/2048</loc>
<lastmod>2024-11-13T19:34:53+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.7</priority>
</url>
<url><loc>http://www.nxcoding.com/tags</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.5</priority>
</url>
<url><loc>http://www.nxcoding.com/categories</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.5</priority>
</url>
<url><loc>http://www.nxcoding.com/archives</loc>
<lastmod>2026-04-04T05:21:32+08:00</lastmod>
<changefreq>daily</changefreq>
<priority>0.5</priority>
</url>

</urlset>
