<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
  <url>
    <loc>https://huanganni.hashnode.dev</loc>
    <lastmod>2026-08-31T22:18:47.579Z</lastmod>
    <changefreq>always</changefreq>
    <priority>1.0</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/llm-for-coding-benchmarks-and-datasets</loc>
    <lastmod>2025-08-14T02:28:46.807Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/how-to-change-a-base-model-to-a-reasoning-model</loc>
    <lastmod>2025-08-14T01:55:49.280Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/deepseek-grpo-explanation-why-we-need-it-how-does-it-work-what-are-the-findings</loc>
    <lastmod>2025-08-14T03:41:16.237Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/beyond-pre-training-the-power-of-rlhf-in-llm-alignment</loc>
    <lastmod>2025-08-15T08:17:33.213Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-daily-challenge-3477-fruits-into-baskets-iieasy-on</loc>
    <lastmod>2025-08-05T03:30:46.231Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-daily-challenge-904-fruit-into-baskets</loc>
    <lastmod>2025-08-04T08:53:12.426Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-daily-challenge-2044-count-number-of-maximum-bitwise-or-subsets</loc>
    <lastmod>2025-07-28T01:15:39.190Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-daily-challenge-2210-count-hills-and-valleys-in-an-arrayeasy-two-pointers-on</loc>
    <lastmod>2025-07-27T04:01:29.345Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-1695-maximum-erasure-valuemed-java-on</loc>
    <lastmod>2025-07-22T15:10:20.017Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-daily-challenge-leetcode-1948-delete-duplicate-folders-in-system-two-solutionshard-java</loc>
    <lastmod>2025-07-21T03:26:15.053Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-daily-challenge-1233-remove-sub-folders-from-the-filesystemmed-java</loc>
    <lastmod>2025-07-19T11:12:52.261Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/pytorch-complete-guide-book</loc>
    <lastmod>2025-07-18T07:20:03.435Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/layer-normalization-benefits-over-batch-norm-and-how-to-tune-its-hyperparameters</loc>
    <lastmod>2025-07-18T05:51:08.382Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-daily-challenge-2163-minimum-difference-in-sums-after-removal-of-elementshard-java-dppriorityqueuegreedy</loc>
    <lastmod>2025-07-18T04:47:26.847Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-560-subarray-sum-equals-k-from-intuitive-on-to-optimized-on-solution-using-hashmapmed-java</loc>
    <lastmod>2025-07-17T08:38:07.450Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-3202-find-the-maximum-length-of-valid-subsequence-ii-dpmed-java-okn</loc>
    <lastmod>2025-07-17T02:41:32.514Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/when-depth-first-search-gets-it-wrong-shortest-path-problem-analysis</loc>
    <lastmod>2025-07-16T07:53:13.704Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-3201-find-the-maximum-length-of-valid-subsequence-i</loc>
    <lastmod>2025-07-17T02:41:08.973Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-695-max-area-of-island-dfs-med-java-om-n</loc>
    <lastmod>2025-07-16T06:08:58.280Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-556-next-greater-element-iii</loc>
    <lastmod>2025-07-15T09:53:58.531Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/can-we-always-change-bfs-solution-to-dfs-solution</loc>
    <lastmod>2025-07-15T01:37:47.847Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-547-number-of-provinces-med-java-on-on</loc>
    <lastmod>2025-07-14T08:10:21.393Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-540-single-element-in-a-sorted-array-med-java-ologn</loc>
    <lastmod>2025-07-15T09:54:34.716Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-519-random-flip-matrix</loc>
    <lastmod>2025-07-15T09:55:50.224Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-516-longest-palindromic-subsequencemed-java-on</loc>
    <lastmod>2025-07-14T06:30:54.158Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-503-next-greater-element-ii-monotonic-decreasing-stack</loc>
    <lastmod>2025-07-14T06:14:48.482Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-486-predict-the-winner-dp-score-differencemed-java-on</loc>
    <lastmod>2025-07-14T06:04:12.742Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-457-circular-array-loop-classic-rabbit-and-turtle-two-pointer-techniquemed-java-on</loc>
    <lastmod>2025-07-14T05:56:43.174Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-460-lfu-cache-hard-java</loc>
    <lastmod>2025-07-14T02:28:23.970Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-456-132-patternmed-java-tc-o-n-sc-on</loc>
    <lastmod>2025-07-14T01:27:57.359Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-445-add-two-numbers-ii-stackmed-java-tc-maxm-n-sc-omn</loc>
    <lastmod>2025-07-14T01:13:36.135Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-435-non-overlapping-intervals-greedymed-java-onlogn</loc>
    <lastmod>2025-07-13T23:35:02.590Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-421-maximum-xor-of-two-numbers-in-an-arraymed-java-on</loc>
    <lastmod>2025-07-13T09:28:00.796Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-417-pacific-atlantic-water-flow-dfs-and-bfs-solutionsmed-java-omn</loc>
    <lastmod>2025-07-13T08:40:42.982Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-416-partition-equal-subset-sum-four-solutionsmed-java-on-sum</loc>
    <lastmod>2025-07-13T07:39:17.461Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-316-remove-duplicate-letters</loc>
    <lastmod>2025-07-13T08:41:39.053Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-275-h-index-ii-binary-searchmed-java-ologn</loc>
    <lastmod>2025-07-13T06:42:16.008Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-264-ugly-number-ii-two-approachesmed-java-on</loc>
    <lastmod>2025-07-13T06:23:55.785Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-240-search-a-2d-matrix-ii-med-java-omn</loc>
    <lastmod>2025-07-13T05:56:57.126Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-227-basic-calculator-ii-stackmed-java-on</loc>
    <lastmod>2025-07-13T05:07:35.598Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-204-count-primes-sieve-of-eratosthenes-solution-med-java-onn</loc>
    <lastmod>2025-07-13T04:34:41.959Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-160-intersection-of-two-linked-lists-four-complete-solutions-easy-java-on</loc>
    <lastmod>2025-07-13T05:04:22.256Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-152-maximum-product-subarray-two-efficient-solutions-med-java-on</loc>
    <lastmod>2025-07-13T02:56:55.509Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-2006-count-number-of-pairs-with-absolute-difference-k-from-brute-force-on-to-optimal-on-using-frequency-array-easy-java-on</loc>
    <lastmod>2025-07-12T09:19:23.670Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-1910-remove-all-occurrences-of-a-substring-optimal-solution-using-stack-med-java-on</loc>
    <lastmod>2025-07-13T05:08:11.240Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-1909-remove-one-element-to-make-the-array-strictly-increasing-optimal-solution-by-analyzing-possible-cases-and-find-patterns-java-on</loc>
    <lastmod>2025-07-12T08:35:39.590Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/key-rag-implementation-strategies-and-patterns</loc>
    <lastmod>2025-07-11T06:57:21.102Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-problem-1356-sort-integers-by-the-number-of-1-bits-easy-java-onlogn</loc>
    <lastmod>2025-07-11T05:18:14.372Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/leetcode-653-two-sum-iv-input-is-a-bst-in-order-traversal-easy-java-on</loc>
    <lastmod>2025-07-11T00:33:48.089Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/next-greater-element-i-from-brute-force-to-optimized-solution-explanation-easy-java-on</loc>
    <lastmod>2025-07-11T00:33:14.114Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/archive</loc>
    <lastmod>2026-08-31T22:18:47.579Z</lastmod>
    <changefreq>daily</changefreq>
    <priority>0.5</priority>
  </url>
  <url>
    <loc>https://huanganni.hashnode.dev/recommendations</loc>
    <lastmod>2026-08-31T22:18:47.579Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.4</priority>
  </url>
</urlset>