<?xml version="1.0" encoding="utf-8" standalone="yes"?><urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:xhtml="http://www.w3.org/1999/xhtml"><url><loc>https://jiat-t.github.io/leetcode/string/easy/</loc><lastmod>2026-06-11T04:29:40+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/heap/easy/</loc><lastmod>2026-05-25T10:59:58+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/double-pointers/easy/</loc><lastmod>2026-06-30T04:18:45+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/technique/easy/</loc><lastmod>2026-05-27T03:48:13+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/binary-search/easy/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/easy/</loc></url><url><loc>https://jiat-t.github.io/leetcode/dynamic-programming/easy/</loc></url><url><loc>https://jiat-t.github.io/leetcode/greedy-algorithm/easy/</loc></url><url><loc>https://jiat-t.github.io/leetcode/hash/easy/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/easy/</loc></url><url><loc>https://jiat-t.github.io/leetcode/stack/easy/</loc></url><url><loc>https://jiat-t.github.io/leetcode/hash/easy/two-sum/</loc></url><url><loc>https://jiat-t.github.io/leetcode/substring/medium/</loc><lastmod>2026-05-26T01:41:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/array/medium/</loc><lastmod>2026-05-09T05:18:34+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/graph/medium/</loc><lastmod>2026-04-13T13:02:02+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/string/medium/</loc><lastmod>2026-05-27T03:48:13+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/back-track/medium/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-search/medium/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/medium/</loc></url><url><loc>https://jiat-t.github.io/leetcode/double-pointers/medium/</loc></url><url><loc>https://jiat-t.github.io/leetcode/dynamic-programming/medium/</loc></url><url><loc>https://jiat-t.github.io/leetcode/greedy-algorithm/medium/</loc></url><url><loc>https://jiat-t.github.io/leetcode/hash/medium/</loc></url><url><loc>https://jiat-t.github.io/leetcode/heap/medium/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/medium/</loc></url><url><loc>https://jiat-t.github.io/leetcode/matrix/medium/</loc></url><url><loc>https://jiat-t.github.io/leetcode/multidimensional-dynamic-programming/medium/</loc></url><url><loc>https://jiat-t.github.io/leetcode/sliding-window/medium/</loc></url><url><loc>https://jiat-t.github.io/leetcode/stack/medium/</loc></url><url><loc>https://jiat-t.github.io/leetcode/technique/medium/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/medium/add-two-numbers/</loc></url><url><loc>https://jiat-t.github.io/leetcode/substring/hard/</loc><lastmod>2026-06-03T04:39:14+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/hard/</loc><lastmod>2026-06-02T14:08:09+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/stack/hard/</loc><lastmod>2026-06-02T04:55:39+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/sliding-window/hard/</loc><lastmod>2026-05-30T02:43:42+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/list/hard/</loc></url><url><loc>https://jiat-t.github.io/leetcode/sliding-window/medium/longest-substring-without-repeating-characters/</loc></url><url><loc>https://jiat-t.github.io/leetcode/double-pointers/medium/longest-palindromic-substring/</loc></url><url><loc>https://jiat-t.github.io/leetcode/string/medium/reverse-integer/</loc><lastmod>2026-05-27T03:48:13+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/string/medium/string-to-integer-atoi/</loc><lastmod>2026-05-27T03:48:13+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/technique/easy/palindrome-number/</loc><lastmod>2026-05-27T03:48:13+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/double-pointers/medium/container-with-most-water/</loc></url><url><loc>https://jiat-t.github.io/leetcode/hash/medium/integer-to-roman/</loc></url><url><loc>https://jiat-t.github.io/leetcode/hash/easy/roman-to-integer/</loc></url><url><loc>https://jiat-t.github.io/leetcode/string/easy/longest-common-prefix/</loc><lastmod>2026-05-27T03:48:13+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/double-pointers/medium/3sum-closest/</loc></url><url><loc>https://jiat-t.github.io/leetcode/back-track/medium/letter-combinations-of-a-phone-number/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/medium/remove-nth-node-from-end-of-list/</loc></url><url><loc>https://jiat-t.github.io/leetcode/stack/easy/valid-parentheses/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/easy/merge-two-sorted-lists/</loc></url><url><loc>https://jiat-t.github.io/leetcode/back-track/medium/generate-parentheses/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/hard/merge-k-sorted-lists/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/medium/swap-nodes-in-pairs/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/hard/reverse-nodes-in-k-group/</loc></url><url><loc>https://jiat-t.github.io/leetcode/double-pointers/easy/remove-duplicates-from-sorted-array/</loc></url><url><loc>https://jiat-t.github.io/leetcode/double-pointers/easy/remove-element/</loc><lastmod>2026-06-30T04:18:45+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/technique/medium/next-permutation/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-search/medium/search-in-rotated-sorted-array/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-search/medium/find-first-and-last-position-of-element-in-sorted-array/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-search/easy/leetcode-binary-search-easy/</loc></url><url><loc>https://jiat-t.github.io/leetcode/back-track/medium/combination-sum/</loc></url><url><loc>https://jiat-t.github.io/leetcode/greedy-algorithm/medium/jump-game-ii/</loc></url><url><loc>https://jiat-t.github.io/leetcode/back-track/medium/permutations/</loc></url><url><loc>https://jiat-t.github.io/leetcode/matrix/medium/rotate-image/</loc></url><url><loc>https://jiat-t.github.io/leetcode/hash/medium/group-anagrams/</loc></url><url><loc>https://jiat-t.github.io/leetcode/array/medium/maximum-subarray/</loc><lastmod>2026-05-09T05:18:34+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/matrix/medium/spiral-matrix/</loc></url><url><loc>https://jiat-t.github.io/leetcode/greedy-algorithm/medium/jump-game/</loc></url><url><loc>https://jiat-t.github.io/leetcode/array/medium/merge-intervals/</loc><lastmod>2026-05-09T05:18:34+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/multidimensional-dynamic-programming/medium/unique-paths/</loc></url><url><loc>https://jiat-t.github.io/leetcode/multidimensional-dynamic-programming/medium/minimum-path-sum/</loc></url><url><loc>https://jiat-t.github.io/leetcode/dynamic-programming/easy/climbing-stairs/</loc></url><url><loc>https://jiat-t.github.io/leetcode/multidimensional-dynamic-programming/medium/edit-distance/</loc></url><url><loc>https://jiat-t.github.io/leetcode/matrix/medium/set-matrix-zeroes/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-search/medium/search-a-2d-matrix/</loc></url><url><loc>https://jiat-t.github.io/leetcode/technique/medium/sort-colors/</loc></url><url><loc>https://jiat-t.github.io/leetcode/substring/hard/leetcode-substring-hard/</loc><lastmod>2026-06-03T04:39:14+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/back-track/medium/subsets/</loc></url><url><loc>https://jiat-t.github.io/leetcode/back-track/medium/word-search/</loc></url><url><loc>https://jiat-t.github.io/leetcode/stack/hard/leetcode-stack-hard/</loc><lastmod>2026-06-02T04:55:39+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/list/medium/reverse-linked-list-ii/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/easy/binary-tree-inorder-traversal/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/medium/validate-binary-search-tree/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/easy/symmetric-tree/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/medium/binary-tree-level-order-traversal/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/easy/maximum-depth-of-binary-tree/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/medium/construct-binary-tree-from-preorder-and-inorder-traversal/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/easy/convert-sorted-array-to-binary-search-tree/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/medium/convert-sorted-list-to-binary-search-tree/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/easy/balanced-binary-tree/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/medium/flatten-binary-tree-to-linked-list/</loc></url><url><loc>https://jiat-t.github.io/leetcode/dynamic-programming/easy/pascals-triangle/</loc></url><url><loc>https://jiat-t.github.io/leetcode/greedy-algorithm/easy/best-time-to-buy-and-sell-stock/</loc></url><url><loc>https://jiat-t.github.io/leetcode/greedy-algorithm/medium/best-time-to-buy-and-sell-stock-ii/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/hard/leetcode-binary-tree-hard/</loc><lastmod>2026-06-02T14:08:09+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/double-pointers/easy/valid-palindrome/</loc><lastmod>2026-06-30T04:18:45+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/hash/medium/longest-consecutive-sequence/</loc></url><url><loc>https://jiat-t.github.io/leetcode/back-track/medium/palindrome-partitioning/</loc></url><url><loc>https://jiat-t.github.io/leetcode/technique/easy/single-number/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/medium/copy-list-with-random-pointer/</loc></url><url><loc>https://jiat-t.github.io/leetcode/dynamic-programming/medium/word-break/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/easy/linked-list-cycle/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/medium/linked-list-cycle-ii/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/medium/lru-cache/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/medium/sort-list/</loc></url><url><loc>https://jiat-t.github.io/leetcode/dynamic-programming/medium/maximum-product-subarray/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-search/medium/find-minimum-in-rotated-sorted-array/</loc></url><url><loc>https://jiat-t.github.io/leetcode/stack/medium/min-stack/</loc></url><url><loc>https://jiat-t.github.io/leetcode/heap/easy/leetcode-heap-easy/</loc><lastmod>2026-05-25T10:59:58+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/list/easy/intersection-of-two-linked-lists/</loc></url><url><loc>https://jiat-t.github.io/leetcode/double-pointers/medium/compare-version-numbers/</loc></url><url><loc>https://jiat-t.github.io/leetcode/technique/easy/majority-element/</loc></url><url><loc>https://jiat-t.github.io/leetcode/array/medium/rotate-array/</loc><lastmod>2026-05-09T05:18:34+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/dynamic-programming/medium/house-robber/</loc></url><url><loc>https://jiat-t.github.io/leetcode/graph/medium/number-of-islands/</loc><lastmod>2026-04-13T13:02:02+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/list/easy/reverse-linked-list/</loc></url><url><loc>https://jiat-t.github.io/leetcode/sliding-window/medium/minimum-size-subarray-sum/</loc></url><url><loc>https://jiat-t.github.io/leetcode/dynamic-programming/medium/house-robber-ii/</loc></url><url><loc>https://jiat-t.github.io/leetcode/heap/medium/kth-largest-element-in-an-array/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/easy/invert-binary-tree/</loc></url><url><loc>https://jiat-t.github.io/leetcode/stack/medium/basic-calculator-ii/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/medium/kth-smallest-element-in-a-bst/</loc></url><url><loc>https://jiat-t.github.io/leetcode/stack/easy/implement-queue-using-stacks/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/easy/palindrome-linked-list/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/medium/lowest-common-ancestor-of-a-binary-tree/</loc></url><url><loc>https://jiat-t.github.io/leetcode/array/medium/product-of-array-except-self/</loc><lastmod>2026-05-09T05:18:34+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/sliding-window/hard/leetcode-sliding-window-hard/</loc><lastmod>2026-05-30T02:43:42+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/matrix/medium/search-a-2d-matrix-ii/</loc></url><url><loc>https://jiat-t.github.io/leetcode/dynamic-programming/medium/perfect-squares/</loc></url><url><loc>https://jiat-t.github.io/leetcode/double-pointers/easy/move-zeroes/</loc><lastmod>2026-06-30T04:18:45+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/technique/medium/find-the-duplicate-number/</loc></url><url><loc>https://jiat-t.github.io/leetcode/dynamic-programming/medium/longest-increasing-subsequence/</loc></url><url><loc>https://jiat-t.github.io/leetcode/dynamic-programming/medium/coin-change/</loc></url><url><loc>https://jiat-t.github.io/leetcode/heap/medium/top-k-frequent-elements/</loc></url><url><loc>https://jiat-t.github.io/leetcode/stack/medium/decode-string/</loc></url><url><loc>https://jiat-t.github.io/leetcode/hash/easy/longest-palindrome/</loc></url><url><loc>https://jiat-t.github.io/leetcode/string/easy/leetcode-string-easy/</loc><lastmod>2026-06-11T04:29:40+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/dynamic-programming/medium/partition-equal-subset-sum/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/medium/path-sum-iii/</loc></url><url><loc>https://jiat-t.github.io/leetcode/sliding-window/medium/find-all-anagrams-in-a-string/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/easy/diameter-of-binary-tree/</loc></url><url><loc>https://jiat-t.github.io/leetcode/substring/medium/leetcode-substring-medium/</loc><lastmod>2026-05-26T01:41:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/stack/medium/daily-temperatures/</loc></url><url><loc>https://jiat-t.github.io/leetcode/greedy-algorithm/medium/partition-labels/</loc></url><url><loc>https://jiat-t.github.io/leetcode/greedy-algorithm/easy/largest-perimeter-triangle/</loc></url><url><loc>https://jiat-t.github.io/leetcode/graph/medium/rotting-oranges/</loc><lastmod>2026-04-13T13:02:02+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/multidimensional-dynamic-programming/medium/longest-common-subsequence/</loc></url><url><loc>https://jiat-t.github.io/leetcode/sliding-window/medium/longest-subarray-of-1s-after-deleting-one-element/</loc></url><url><loc>https://jiat-t.github.io/</loc><lastmod>2026-07-28T04:17:42+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/ability-task/</loc><lastmod>2026-07-28T04:17:42+00:00</lastmod></url><url><loc>https://jiat-t.github.io/categories/</loc><lastmod>2026-07-28T04:17:42+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/gameplay-ability/</loc><lastmod>2026-07-28T04:17:42+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/gas/</loc><lastmod>2026-07-28T04:17:42+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/networking/</loc><lastmod>2026-07-28T04:17:42+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/</loc><lastmod>2026-07-28T04:17:42+00:00</lastmod></url><url><loc>https://jiat-t.github.io/ue/gameplay-ability-system/</loc><lastmod>2026-07-28T04:17:42+00:00</lastmod></url><url><loc>https://jiat-t.github.io/categories/unreal-engine/</loc><lastmod>2026-07-28T04:17:42+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/unreal-engine/</loc><lastmod>2026-07-28T04:17:42+00:00</lastmod></url><url><loc>https://jiat-t.github.io/ue/</loc><lastmod>2026-07-28T04:17:42+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/dynamic-rendering/</loc><lastmod>2026-07-26T08:05:58+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/easyvulkan/</loc><lastmod>2026-07-26T08:05:58+00:00</lastmod></url><url><loc>https://jiat-t.github.io/vulkan/easyvulkan-chapter-6/</loc><lastmod>2026-07-26T08:05:58+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/framebuffer/</loc><lastmod>2026-07-26T08:05:58+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/rendering/</loc><lastmod>2026-07-26T08:05:58+00:00</lastmod></url><url><loc>https://jiat-t.github.io/categories/vulkan/</loc><lastmod>2026-07-26T08:05:58+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/vulkan/</loc><lastmod>2026-07-26T08:05:58+00:00</lastmod></url><url><loc>https://jiat-t.github.io/vulkan/</loc><lastmod>2026-07-26T08:05:58+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/buffer/</loc><lastmod>2026-07-26T06:29:55+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/descriptor-set/</loc><lastmod>2026-07-26T06:29:55+00:00</lastmod></url><url><loc>https://jiat-t.github.io/vulkan/easyvulkan-chapter-7/</loc><lastmod>2026-07-26T06:29:55+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/texture/</loc><lastmod>2026-07-26T06:29:55+00:00</lastmod></url><url><loc>https://jiat-t.github.io/categories/c++/</loc><lastmod>2026-07-02T15:17:55+00:00</lastmod></url><url><loc>https://jiat-t.github.io/cpp/</loc><lastmod>2026-07-02T15:17:55+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/c++/</loc><lastmod>2026-07-02T15:17:55+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/concurrency/</loc><lastmod>2026-07-02T15:17:55+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/operating-system/</loc><lastmod>2026-07-02T15:17:55+00:00</lastmod></url><url><loc>https://jiat-t.github.io/categories/%E7%BC%96%E7%A8%8B%E5%9F%BA%E7%A1%80/</loc><lastmod>2026-07-02T15:17:55+00:00</lastmod></url><url><loc>https://jiat-t.github.io/cpp/network-and-os-notes/</loc><lastmod>2026-07-02T15:17:55+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/game-architecture/</loc><lastmod>2026-06-30T14:27:27+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/garbage-collection/</loc><lastmod>2026-06-30T14:27:27+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/reflection/</loc><lastmod>2026-06-30T14:27:27+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/uobject/</loc><lastmod>2026-06-30T14:27:27+00:00</lastmod></url><url><loc>https://jiat-t.github.io/ue/ue-low-level-notes/</loc><lastmod>2026-06-30T14:27:27+00:00</lastmod></url><url><loc>https://jiat-t.github.io/ue/cpp-in-ue5/</loc><lastmod>2026-06-26T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/cpp/data-race-and-race-condition/</loc><lastmod>2026-06-26T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/graphics/rendering-paths/</loc><lastmod>2026-06-25T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/graphics/%E8%BE%90%E5%B0%84%E5%BA%A6%E9%87%8F%E5%AD%A6/</loc><lastmod>2026-06-25T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/graphics/</loc><lastmod>2026-06-25T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/vulkan/%E5%9F%BA%E7%A1%80%E7%9F%A5%E8%AF%86/queue-categories/</loc><lastmod>2026-06-24T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/cpp/cpp-to-exe/</loc><lastmod>2026-06-22T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/computer-graphics/</loc><lastmod>2026-06-20T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/ibl/</loc><lastmod>2026-06-20T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/pbr/</loc><lastmod>2026-06-21T07:43:56+00:00</lastmod></url><url><loc>https://jiat-t.github.io/graphics/split-sum-ibl/</loc><lastmod>2026-06-20T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/categories/%E5%9B%BE%E5%BD%A2%E5%AD%A6/</loc><lastmod>2026-06-20T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/materials/</loc><lastmod>2026-06-21T07:43:56+00:00</lastmod></url><url><loc>https://jiat-t.github.io/graphics/pbr-models/</loc><lastmod>2026-06-18T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/culling/</loc><lastmod>2026-06-28T06:45:53+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/deferred-rendering/</loc><lastmod>2026-06-28T06:45:53+00:00</lastmod></url><url><loc>https://jiat-t.github.io/ue/ue-deferred-rendering-pipeline/</loc><lastmod>2026-06-28T06:45:53+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/serialization/</loc><lastmod>2026-06-17T12:04:18+00:00</lastmod></url><url><loc>https://jiat-t.github.io/ue/ue-serialization/</loc><lastmod>2026-06-17T12:04:18+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/ubt/</loc><lastmod>2026-06-17T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/ue/reflection-system/</loc><lastmod>2026-06-17T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/uht/</loc><lastmod>2026-06-17T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/gameplay-framework/</loc><lastmod>2026-06-15T20:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/ue/gameplay-framework1/</loc><lastmod>2026-06-15T20:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/games104/</loc><lastmod>2026-06-14T11:00:12+00:00</lastmod></url><url><loc>https://jiat-t.github.io/graphics/games104-atmosphere-and-clouds/</loc><lastmod>2026-06-14T11:00:12+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/heightfield/</loc><lastmod>2026-06-14T11:00:12+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/lod/</loc><lastmod>2026-06-14T11:00:12+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/terrain/</loc><lastmod>2026-06-14T11:00:12+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/fence/</loc><lastmod>2026-06-14T02:06:17+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/pipeline-barrier/</loc><lastmod>2026-06-14T02:06:17+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/semaphore/</loc><lastmod>2026-06-14T02:06:17+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/synchronization/</loc><lastmod>2026-06-14T02:06:17+00:00</lastmod></url><url><loc>https://jiat-t.github.io/vulkan/vulkan-synchronization-primitives/</loc><lastmod>2026-06-14T02:06:17+00:00</lastmod></url><url><loc>https://jiat-t.github.io/categories/leetcode/</loc><lastmod>2026-06-30T04:18:45+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/</loc><lastmod>2026-06-30T04:18:45+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/leetcode/</loc><lastmod>2026-06-30T04:18:45+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/string/</loc><lastmod>2026-06-11T04:29:40+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E5%AD%97%E7%AC%A6%E4%B8%B2/</loc><lastmod>2026-06-11T04:29:40+00:00</lastmod></url><url><loc>https://jiat-t.github.io/vulkan/%E5%9F%BA%E7%A1%80%E7%9F%A5%E8%AF%86/layers-and-extensions/</loc><lastmod>2026-06-11T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/vulkan/%E5%9F%BA%E7%A1%80%E7%9F%A5%E8%AF%86/validationlayers/</loc><lastmod>2026-06-11T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/vulkan/%E5%9F%BA%E7%A1%80%E7%9F%A5%E8%AF%86/swapchain/</loc><lastmod>2026-06-10T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/vulkan/%E5%9F%BA%E7%A1%80%E7%9F%A5%E8%AF%86/physical-and-logic-device/</loc><lastmod>2026-06-10T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/graphics/games104-rendering-practice/</loc><lastmod>2026-06-09T12:38:02+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/gpu/</loc><lastmod>2026-06-09T12:38:02+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/nanite/</loc><lastmod>2026-06-09T12:38:02+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/npr/</loc><lastmod>2026-06-21T07:43:56+00:00</lastmod></url><url><loc>https://jiat-t.github.io/ue/ue5-material-reference/</loc><lastmod>2026-06-21T07:43:56+00:00</lastmod></url><url><loc>https://jiat-t.github.io/vulkan/%E5%9F%BA%E7%A1%80%E7%9F%A5%E8%AF%86/initialization/</loc><lastmod>2026-06-09T14:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/vulkan/%E5%9F%BA%E7%A1%80%E7%9F%A5%E8%AF%86/queuefamily/</loc><lastmod>2026-06-09T14:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/glfw/</loc><lastmod>2026-06-12T01:59:11+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/surface/</loc><lastmod>2026-06-12T01:59:11+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/swapchain/</loc><lastmod>2026-06-12T01:59:11+00:00</lastmod></url><url><loc>https://jiat-t.github.io/vulkan/vulkan-window-surface/</loc><lastmod>2026-06-12T01:59:11+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/window-system/</loc><lastmod>2026-06-12T01:59:11+00:00</lastmod></url><url><loc>https://jiat-t.github.io/vulkan/vulkan-glfw/</loc><lastmod>2026-06-07T06:44:40+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/error-handling/</loc><lastmod>2026-06-07T05:36:39+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/vkresult/</loc><lastmod>2026-06-07T05:36:39+00:00</lastmod></url><url><loc>https://jiat-t.github.io/vulkan/vulkan-vkresult/</loc><lastmod>2026-06-07T05:36:39+00:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/</loc><lastmod>2026-06-04T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/ray-tracing/</loc><lastmod>2026-06-04T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/technical-notes/</loc><lastmod>2026-06-04T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/acceleration-structure/</loc><lastmod>2026-06-04T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3/</loc><lastmod>2026-06-03T04:39:14+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/substring/</loc><lastmod>2026-06-03T04:39:14+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E5%AD%90%E4%B8%B2/</loc><lastmod>2026-06-03T04:39:14+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E9%80%92%E5%BD%92/</loc><lastmod>2026-06-02T14:08:09+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/binary-tree/</loc><lastmod>2026-06-02T14:08:09+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E4%BA%8C%E5%8F%89%E6%A0%91/</loc><lastmod>2026-06-02T14:08:09+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/bvh/</loc><lastmod>2026-06-02T08:17:15+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/mis/</loc><lastmod>2026-06-02T08:17:15+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/path-tracing/</loc><lastmod>2026-06-02T08:17:15+00:00</lastmod></url><url><loc>https://jiat-t.github.io/graphics/pathtracer-code-notes/</loc><lastmod>2026-06-02T08:17:15+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E5%8D%95%E8%B0%83%E6%A0%88/</loc><lastmod>2026-06-02T04:55:39+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/stack/</loc><lastmod>2026-06-02T04:55:39+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E6%A0%88/</loc><lastmod>2026-06-02T04:55:39+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/algorithms/</loc><lastmod>2026-06-11T08:55:56+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/quick-sort/</loc><lastmod>2026-06-11T08:55:56+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/sorting/</loc><lastmod>2026-06-11T08:55:56+00:00</lastmod></url><url><loc>https://jiat-t.github.io/cpp/sorting-algorithms/</loc><lastmod>2026-06-11T08:55:56+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E5%8D%95%E8%B0%83%E9%98%9F%E5%88%97/</loc><lastmod>2026-05-30T02:43:42+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/sliding-window/</loc><lastmod>2026-05-30T02:43:42+00:00</lastmod></url><url><loc>https://jiat-t.github.io/graphics/pathtracer-project-details/</loc><lastmod>2026-05-26T14:12:44+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/shadow/</loc><lastmod>2026-05-26T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/shadow-maps/</loc><lastmod>2026-05-26T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/heap/</loc><lastmod>2026-05-25T10:59:58+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E5%A0%86/</loc><lastmod>2026-05-25T10:59:58+00:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/shadow-techniques/</loc><lastmod>2026-05-24T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/anti-aliasing/</loc><lastmod>2026-05-22T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/anti-aliasing/</loc><lastmod>2026-05-22T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/ibl-notes/ibl-notes/</loc><lastmod>2026-05-21T11:10:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/design-modes/</loc><lastmod>2026-05-20T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/design-patterns/</loc><lastmod>2026-05-20T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/directx-12/</loc><lastmod>2026-05-19T13:38:41+00:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/dx12/</loc><lastmod>2026-05-19T20:57:06+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/transformation-matrix/</loc><lastmod>2026-05-15T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/space-transformation-matrix-derivation/space-transformation-matrix-derivation/</loc><lastmod>2026-05-15T00:00:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/cg/</loc><lastmod>2026-05-14T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/others/witted-and-mote-carlo/</loc><lastmod>2026-05-14T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/categories/%E5%85%89%E7%BA%BF%E8%BF%BD%E8%B8%AA/</loc><lastmod>2026-05-14T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/shadow-map/</loc><lastmod>2026-05-13T20:20:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/shadow-map-derivation/shadow-map-derivation/</loc><lastmod>2026-05-13T20:20:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/memory-management/</loc><lastmod>2026-05-10T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/modern-c++/</loc><lastmod>2026-05-10T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/raii/</loc><lastmod>2026-05-10T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/others/how-to-create-a-heaponly-or-stackonly-class/</loc><lastmod>2026-05-10T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/others/normal-combination/</loc><lastmod>2026-05-10T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/monte-carlo-integral-notes/monte-carlo-integral-notes/</loc><lastmod>2026-05-08T16:12:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/importance-sampling-notes/importance-sampling-notes/</loc><lastmod>2026-05-08T16:11:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/brdf-notes/brdf-notes/</loc><lastmod>2026-05-08T16:10:00+08:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E5%93%88%E5%B8%8C%E8%A1%A8/</loc><lastmod>2026-05-26T01:41:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E5%89%8D%E7%BC%80%E5%92%8C/</loc><lastmod>2026-05-26T01:41:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/back-track/</loc><lastmod>2026-05-17T05:35:09+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E5%9B%9E%E6%BA%AF/</loc><lastmod>2026-05-17T05:35:09+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/back-track/backtracking-overview/</loc><lastmod>2026-05-17T05:35:09+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/array/</loc><lastmod>2026-05-09T05:18:34+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E6%95%B0%E7%BB%84/</loc><lastmod>2026-05-09T05:18:34+00:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/hello/</loc><lastmod>2026-04-19T14:37:20+08:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/cpp-fundamentals/cpp-fundamentals/</loc><lastmod>2026-04-19T00:00:00+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/bfs/</loc><lastmod>2026-04-13T13:02:02+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/dfs/</loc><lastmod>2026-04-13T13:02:02+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/graph/</loc><lastmod>2026-04-13T13:02:02+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E5%9B%BE%E8%AE%BA/</loc><lastmod>2026-04-13T13:02:02+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/double-pointers/</loc><lastmod>2026-06-30T04:18:45+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E5%8F%8C%E6%8C%87%E9%92%88/</loc><lastmod>2026-06-30T04:18:45+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/games101/</loc><lastmod>2026-03-26T08:38:15+00:00</lastmod></url><url><loc>https://jiat-t.github.io/graphics/games101-assignment-5/</loc><lastmod>2026-03-26T08:38:15+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/component/</loc><lastmod>2026-04-02T05:50:08+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/game-engine/</loc><lastmod>2026-04-02T05:50:08+00:00</lastmod></url><url><loc>https://jiat-t.github.io/graphics/games104-game-world/</loc><lastmod>2026-04-02T05:50:08+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/scene-management/</loc><lastmod>2026-04-02T05:50:08+00:00</lastmod></url><url><loc>https://jiat-t.github.io/graphics/games104-engine-architecture/</loc><lastmod>2026-03-25T09:53:46+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/resource-management/</loc><lastmod>2026-03-25T09:53:46+00:00</lastmod></url><url><loc>https://jiat-t.github.io/categories/directx-12/</loc><lastmod>2026-05-19T13:38:41+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/dx12/</loc><lastmod>2026-05-19T13:38:41+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/dxr/</loc><lastmod>2026-03-22T11:37:20+00:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/dxr-dx12-functions/</loc><lastmod>2026-03-22T11:37:20+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/hlsl/</loc><lastmod>2026-03-22T11:37:20+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/dxc/</loc><lastmod>2026-03-22T11:37:06+00:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/dxr-dx12-types/</loc><lastmod>2026-03-22T11:37:06+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/bezier-curve/</loc><lastmod>2026-03-22T08:31:25+00:00</lastmod></url><url><loc>https://jiat-t.github.io/graphics/games101-assignment-4/</loc><lastmod>2026-03-22T08:31:25+00:00</lastmod></url><url><loc>https://jiat-t.github.io/graphics/games101-assignment-2/</loc><lastmod>2026-03-19T07:15:54+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/rasterization/</loc><lastmod>2026-03-19T07:15:54+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/%E5%9F%BA%E7%A1%80%E7%AE%97%E6%B3%95/</loc><lastmod>2026-05-27T03:48:13+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/technique/</loc><lastmod>2026-05-27T03:48:13+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/acceleration-structure/</loc><lastmod>2026-03-07T03:13:56+00:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/directx-raytracing-notes/</loc><lastmod>2026-03-07T03:13:56+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/com/</loc><lastmod>2026-05-19T13:38:41+00:00</lastmod></url><url><loc>https://jiat-t.github.io/posts/directx12-hresult/</loc><lastmod>2026-05-19T13:38:41+00:00</lastmod></url><url><loc>https://jiat-t.github.io/tags/hresult/</loc><lastmod>2026-05-19T13:38:41+00:00</lastmod></url><url><loc>https://jiat-t.github.io/leetcode/graph/easy/</loc></url><url><loc>https://jiat-t.github.io/posts/my_shared_ptr/</loc></url><url><loc>https://jiat-t.github.io/posts/normal-combination/normal-combination/</loc></url><url><loc>https://jiat-t.github.io/posts/plane-shadow-matrix-derivation/plane-shadow-matrix-derivation/</loc></url><url><loc>https://jiat-t.github.io/directx12/</loc></url><url><loc>https://jiat-t.github.io/leetcode/dynamic-programming/</loc></url><url><loc>https://jiat-t.github.io/leetcode/multidimensional-dynamic-programming/</loc></url><url><loc>https://jiat-t.github.io/leetcode/binary-search/</loc></url><url><loc>https://jiat-t.github.io/leetcode/hash/</loc></url><url><loc>https://jiat-t.github.io/archives/</loc></url><url><loc>https://jiat-t.github.io/leetcode/matrix/</loc></url><url><loc>https://jiat-t.github.io/leetcode/list/</loc></url><url><loc>https://jiat-t.github.io/search/</loc></url><url><loc>https://jiat-t.github.io/leetcode/greedy-algorithm/</loc></url><url><loc>https://jiat-t.github.io/portfolio/</loc></url></urlset>