<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Rain Hu&apos;s Workspace</title><description>Rain Hu 記錄生活、工作、學習、個人創作的空間，包含了音樂創作、文字創作、演算法筆記、資工學習資料、架站資料、程式語言筆記、Leetcode 解題分析等各式各樣的資訊</description><link>https://intervalrain.github.io/</link><item><title>[System Design] Digital Twin Shadow 設計：高頻場景下如何確保 Desired / Reported 的順序性</title><link>https://intervalrain.github.io/posts/systemdesign/digital-twin-shadowmd/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/systemdesign/digital-twin-shadowmd/</guid><pubDate>Thu, 09 Apr 2026 12:35:38 GMT</pubDate></item><item><title>[Vim] 常見 Vim Commands</title><link>https://intervalrain.github.io/posts/vim/cmds/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/vim/cmds/</guid><description>My favorites Vim commands</description><pubDate>Wed, 08 Oct 2025 03:34:35 GMT</pubDate></item><item><title>[C#] 並行與異步編程完整教學</title><link>https://intervalrain.github.io/posts/csharp/concurrency_and_asyncchronous_programming/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/csharp/concurrency_and_asyncchronous_programming/</guid><description>A complete tutorial of C# asynchronous programming and concepts of channel and thread</description><pubDate>Tue, 07 Oct 2025 07:55:07 GMT</pubDate></item><item><title>[Docker] Docker 指令 以 NATS 為例</title><link>https://intervalrain.github.io/posts/docker/docker-nats-commands/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/docker/docker-nats-commands/</guid><description>Docker commands collection</description><pubDate>Sat, 04 Oct 2025 22:39:57 GMT</pubDate></item><item><title>[孫子兵法] 無智名，無勇功</title><link>https://intervalrain.github.io/posts/philosophies/no_reputation_no_credit/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/philosophies/no_reputation_no_credit/</guid><description>無智名，無勇功</description><pubDate>Fri, 19 Sep 2025 04:24:56 GMT</pubDate></item><item><title>[Linux] Screen command summary</title><link>https://intervalrain.github.io/posts/linux/screen/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/linux/screen/</guid><description>A simple summary of screen command in linux</description><pubDate>Wed, 10 Sep 2025 03:10:58 GMT</pubDate></item><item><title>EdgeSync ServiceFramework AspNetCore.Mvc</title><link>https://intervalrain.github.io/posts/nats/auto-convention/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/nats/auto-convention/</guid><description>EdgeSync ServiceFramework AspNetCore.Mvc 提供了一個強大的框架，用於在 ASP.NET Core 應用程式中自動化 NATS 通訊模式的配置。框架支援兩種主要的通訊模式：**Request/Response** 和 **Pub/Sub**，並可搭配 NATS JetStream 或 Classic NATS 使用。</description><pubDate>Mon, 07 Jul 2025 08:55:57 GMT</pubDate></item><item><title>Devcontainer</title><link>https://intervalrain.github.io/posts/cs/devcontainer/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/devcontainer/</guid><description>在 devcontainer 環境下 172 網段問題</description><pubDate>Thu, 10 Apr 2025 05:26:59 GMT</pubDate></item><item><title>[C#] 打包 nuget</title><link>https://intervalrain.github.io/posts/cs/nuget/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/nuget/</guid><description>將專案打包成 nuget</description><pubDate>Tue, 08 Apr 2025 08:17:30 GMT</pubDate></item><item><title>[.NET] User Secret CLI</title><link>https://intervalrain.github.io/posts/it/user_secrets/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/user_secrets/</guid><description>How to set user secret using dotnet</description><pubDate>Sun, 23 Mar 2025 08:00:02 GMT</pubDate></item><item><title>[AI] 卷積神經網路</title><link>https://intervalrain.github.io/posts/ai/6_1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/6_1/</guid><description>Introduction to CNN</description><pubDate>Sun, 02 Feb 2025 16:18:32 GMT</pubDate></item><item><title>[AI] 機器學習的流程</title><link>https://intervalrain.github.io/posts/ai/5_5/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/5_5/</guid><description>The flow of machine learning</description><pubDate>Sun, 12 Jan 2025 09:54:31 GMT</pubDate></item><item><title>[AI] 提高普適化能力</title><link>https://intervalrain.github.io/posts/ai/5_4/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/5_4/</guid><description>How to enhance the generalization ability of the model</description><pubDate>Sun, 12 Jan 2025 09:54:28 GMT</pubDate></item><item><title>[AI] 提升模型的表現</title><link>https://intervalrain.github.io/posts/ai/5_3/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/5_3/</guid><description>How to enhance the performance of the model</description><pubDate>Sun, 12 Jan 2025 09:54:27 GMT</pubDate></item><item><title>[AI] 評估模型</title><link>https://intervalrain.github.io/posts/ai/5_2/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/5_2/</guid><description>How to evaluate the model</description><pubDate>Sun, 12 Jan 2025 09:54:25 GMT</pubDate></item><item><title>[AI] 普適化</title><link>https://intervalrain.github.io/posts/ai/5_1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/5_1/</guid><description>Introduction to generalization</description><pubDate>Sun, 12 Jan 2025 09:52:09 GMT</pubDate></item><item><title>[AI] 迴歸問題</title><link>https://intervalrain.github.io/posts/ai/4_3/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/4_3/</guid><description>Regression problem</description><pubDate>Sun, 12 Jan 2025 08:39:58 GMT</pubDate></item><item><title>[AI] 多元分類問題</title><link>https://intervalrain.github.io/posts/ai/4_2/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/4_2/</guid><description>Multi categorical classification problem</description><pubDate>Mon, 06 Jan 2025 14:58:45 GMT</pubDate></item><item><title>[AI] 二元分類問題</title><link>https://intervalrain.github.io/posts/ai/4_1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/4_1/</guid><description>Binary categorical classification problem</description><pubDate>Thu, 02 Jan 2025 04:50:29 GMT</pubDate></item><item><title>[AI] 3-8. 客製化 Training</title><link>https://intervalrain.github.io/posts/ai/3_8/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/3_8/</guid><description>How to customize training in Keras</description><pubDate>Fri, 27 Dec 2024 07:49:27 GMT</pubDate></item><item><title>[AI] 3-7. Keras API</title><link>https://intervalrain.github.io/posts/ai/3_7/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/3_7/</guid><description>A introduction to Keras API</description><pubDate>Fri, 20 Dec 2024 07:49:27 GMT</pubDate></item><item><title>[AI] 3-6. 實作線性分類器</title><link>https://intervalrain.github.io/posts/ai/3_6/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/3_6/</guid><description>A implementation of linear classification using Tensorflow library</description><pubDate>Thu, 19 Dec 2024 08:55:12 GMT</pubDate></item><item><title>[AI] 3-5. 邏輯斯迴歸(logistic regression)</title><link>https://intervalrain.github.io/posts/ai/3_5/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/3_5/</guid><description>The introduction to logistic regression</description><pubDate>Thu, 19 Dec 2024 07:55:12 GMT</pubDate></item><item><title>[AI] 3-4. 線性迴歸</title><link>https://intervalrain.github.io/posts/ai/3_4/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/3_4/</guid><description>The introduction to linear regression</description><pubDate>Thu, 19 Dec 2024 07:01:12 GMT</pubDate></item><item><title>[AI] 3-3. 使用 TensorFlow 與 Keras 函式庫</title><link>https://intervalrain.github.io/posts/ai/3_3/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/3_3/</guid><description>Usages of TensorFlow and Keras</description><pubDate>Wed, 18 Dec 2024 08:56:55 GMT</pubDate></item><item><title>[AI] 3-2. Keras 介紹</title><link>https://intervalrain.github.io/posts/ai/3_2/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/3_2/</guid><description>Introduction to the Keras</description><pubDate>Wed, 18 Dec 2024 08:45:50 GMT</pubDate></item><item><title>[AI] 3-1. TensorFlow 介紹</title><link>https://intervalrain.github.io/posts/ai/3_1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/3_1/</guid><description>Introduction to the TensorFlow</description><pubDate>Wed, 18 Dec 2024 08:40:40 GMT</pubDate></item><item><title>[AI] 2-3. 優化器 Optimizer</title><link>https://intervalrain.github.io/posts/ai/2_3/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/2_3/</guid><description>The concept of optimizer in machine learning</description><pubDate>Mon, 16 Dec 2024 07:48:11 GMT</pubDate></item><item><title>[AI] 2-2. 張量 Tensor</title><link>https://intervalrain.github.io/posts/ai/2_2/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/2_2/</guid><description>The concept of tensor</description><pubDate>Sun, 15 Dec 2024 06:26:38 GMT</pubDate></item><item><title>[AI] 2-1. 初試神經網路-手寫辨識 mnist</title><link>https://intervalrain.github.io/posts/ai/2_1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/2_1/</guid><description>First trial for neural network using mnist</description><pubDate>Sun, 15 Dec 2024 05:05:53 GMT</pubDate></item><item><title>[AI] 1-3. 深度學習的發展</title><link>https://intervalrain.github.io/posts/ai/1_3/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/1_3/</guid><description>The development of deep learning</description><pubDate>Fri, 06 Dec 2024 08:26:30 GMT</pubDate></item><item><title>[AI] 1-2. 機器學習的基礎技術</title><link>https://intervalrain.github.io/posts/ai/1_2/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/1_2/</guid><description>The fundamentals of Machine Learning</description><pubDate>Tue, 03 Dec 2024 07:42:52 GMT</pubDate></item><item><title>[AI] 1-1. 何謂人工智慧?</title><link>https://intervalrain.github.io/posts/ai/1_1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/1_1/</guid><description>What is artificial intelligence?</description><pubDate>Tue, 03 Dec 2024 07:39:11 GMT</pubDate></item><item><title>[AI] Catalog</title><link>https://intervalrain.github.io/posts/ai/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ai/</guid><description>My learning note to AI</description><pubDate>Tue, 03 Dec 2024 07:30:11 GMT</pubDate></item><item><title>[IT] 初始 react project (TailwindCSS &amp; TypeScript &amp; Context)</title><link>https://intervalrain.github.io/posts/it/init_react_project/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/init_react_project/</guid><pubDate>Thu, 28 Nov 2024 08:33:39 GMT</pubDate></item><item><title>[Diary] 自由的第二天</title><link>https://intervalrain.github.io/posts/diary/20241126/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/diary/20241126/</guid><description>The second day of freelancing life</description><pubDate>Tue, 26 Nov 2024 14:45:35 GMT</pubDate></item><item><title>[Diary] 成為 freelancer 的第一天</title><link>https://intervalrain.github.io/posts/diary/20241125/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/diary/20241125/</guid><description>The first day of being the freelancer</description><pubDate>Mon, 25 Nov 2024 08:22:30 GMT</pubDate></item><item><title>About me</title><link>https://intervalrain.github.io/posts/aboutme/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/aboutme/</guid><description>Who am I?</description><pubDate>Sun, 24 Nov 2024 09:54:48 GMT</pubDate></item><item><title>[IT] 拯救 react</title><link>https://intervalrain.github.io/posts/it/save_react/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/save_react/</guid><pubDate>Thu, 15 Aug 2024 17:44:44 GMT</pubDate></item><item><title>基於 Ollama 和 LangChain 的 Naive RAG 實作(搭配 streamlit UI)</title><link>https://intervalrain.github.io/posts/genai/naiverag/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/genai/naiverag/</guid><description>本文將介紹一個使用 Streamlit、Ollama 和 LangChain 構建的文件查詢系統。</description><pubDate>Tue, 30 Jul 2024 15:55:29 GMT</pubDate></item><item><title>[Swift] UI Challenge</title><link>https://intervalrain.github.io/posts/swift/ui_challenge/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/swift/ui_challenge/</guid><description>UI Challenge for iOS View on IPhone</description><pubDate>Thu, 20 Jun 2024 17:19:02 GMT</pubDate></item><item><title>[IT] React + .Net</title><link>https://intervalrain.github.io/posts/it/csharp-react/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/csharp-react/</guid><pubDate>Tue, 11 Jun 2024 14:00:23 GMT</pubDate></item><item><title>[IT] ApiController Atrribute</title><link>https://intervalrain.github.io/posts/it/apicontroller/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/apicontroller/</guid><pubDate>Sun, 09 Jun 2024 12:27:03 GMT</pubDate></item><item><title>[IT] HTML + CSS</title><link>https://intervalrain.github.io/posts/it/html/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/html/</guid><pubDate>Sat, 08 Jun 2024 18:10:53 GMT</pubDate></item><item><title>[IT] EntityFramework Commands</title><link>https://intervalrain.github.io/posts/it/entityframework_command/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/entityframework_command/</guid><description>Some commands to trigger migration operations</description><pubDate>Sun, 31 Mar 2024 06:37:44 GMT</pubDate></item><item><title>[System Design] 系統設計概念與資源 System Design and Resources</title><link>https://intervalrain.github.io/posts/systemdesign/system_design_menu/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/systemdesign/system_design_menu/</guid><description>學習系統設計概念的資源</description><pubDate>Tue, 26 Mar 2024 14:35:38 GMT</pubDate></item><item><title>[IT] 用 C# 建置 Clean Architecture 專案</title><link>https://intervalrain.github.io/posts/it/ca_config/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/ca_config/</guid><pubDate>Sat, 09 Mar 2024 05:59:22 GMT</pubDate></item><item><title>[IT] 使用 Clean Architecture + DDD 建置 Restful API</title><link>https://intervalrain.github.io/posts/it/clean_arch_configuration/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/clean_arch_configuration/</guid><pubDate>Mon, 26 Feb 2024 07:03:15 GMT</pubDate></item><item><title>[ML] 選擇 loss function/ optimizer/ metrics</title><link>https://intervalrain.github.io/posts/ml/optimizer/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ml/optimizer/</guid><description>Optimizer</description><pubDate>Wed, 14 Feb 2024 07:39:25 GMT</pubDate></item><item><title>[IT] .NET Maui</title><link>https://intervalrain.github.io/posts/it/maui/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/maui/</guid><pubDate>Sun, 28 Jan 2024 05:30:34 GMT</pubDate></item><item><title>[Hugo] 使用 Hugo-notice</title><link>https://intervalrain.github.io/posts/hugo/notice/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hugo/notice/</guid><description>Desc Text.</description><pubDate>Thu, 18 Jan 2024 17:26:30 GMT</pubDate></item><item><title>[IT] CORS 跨原始來源要求</title><link>https://intervalrain.github.io/posts/it/cors/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/cors/</guid><pubDate>Thu, 18 Jan 2024 16:41:51 GMT</pubDate></item><item><title>[ML] General guide on ML</title><link>https://intervalrain.github.io/posts/ml/general_guide/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ml/general_guide/</guid><description>general guide on machine learning</description><pubDate>Sun, 14 Jan 2024 06:31:56 GMT</pubDate></item><item><title>archives</title><link>https://intervalrain.github.io/posts/archives/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/archives/</guid><pubDate>Sun, 31 Dec 2023 16:00:00 GMT</pubDate></item><item><title>binary_search</title><link>https://intervalrain.github.io/posts/leetcode_list/binary_search/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/binary_search/</guid><pubDate>Sun, 31 Dec 2023 16:00:00 GMT</pubDate></item><item><title>bit_manipulation</title><link>https://intervalrain.github.io/posts/leetcode_list/bit_manipulation/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/bit_manipulation/</guid><pubDate>Sun, 31 Dec 2023 16:00:00 GMT</pubDate></item><item><title>dynamic_programming</title><link>https://intervalrain.github.io/posts/leetcode_list/dynamic_programming/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/dynamic_programming/</guid><pubDate>Sun, 31 Dec 2023 16:00:00 GMT</pubDate></item><item><title>common_data_structure</title><link>https://intervalrain.github.io/posts/leetcode_list/common_data_structure/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/common_data_structure/</guid><pubDate>Sun, 31 Dec 2023 16:00:00 GMT</pubDate></item><item><title>graph</title><link>https://intervalrain.github.io/posts/leetcode_list/graph/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/graph/</guid><pubDate>Sun, 31 Dec 2023 16:00:00 GMT</pubDate></item><item><title>greedy</title><link>https://intervalrain.github.io/posts/leetcode_list/greedy/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/greedy/</guid><pubDate>Sun, 31 Dec 2023 16:00:00 GMT</pubDate></item><item><title>grid</title><link>https://intervalrain.github.io/posts/leetcode_list/grid/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/grid/</guid><pubDate>Sun, 31 Dec 2023 16:00:00 GMT</pubDate></item><item><title>linked_list_binary_tree</title><link>https://intervalrain.github.io/posts/leetcode_list/linked_list_binary_tree/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/linked_list_binary_tree/</guid><pubDate>Sun, 31 Dec 2023 16:00:00 GMT</pubDate></item><item><title>math</title><link>https://intervalrain.github.io/posts/leetcode_list/math/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/math/</guid><pubDate>Sun, 31 Dec 2023 16:00:00 GMT</pubDate></item><item><title>monotonic_stack</title><link>https://intervalrain.github.io/posts/leetcode_list/monotonic_stack/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/monotonic_stack/</guid><pubDate>Sun, 31 Dec 2023 16:00:00 GMT</pubDate></item><item><title>string</title><link>https://intervalrain.github.io/posts/leetcode_list/string/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/string/</guid><pubDate>Sun, 31 Dec 2023 16:00:00 GMT</pubDate></item><item><title>1834</title><link>https://intervalrain.github.io/posts/leetcode/1834/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/1834/</guid><pubDate>Sun, 31 Dec 2023 16:00:00 GMT</pubDate></item><item><title>2463</title><link>https://intervalrain.github.io/posts/leetcode/2463/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2463/</guid><pubDate>Sun, 31 Dec 2023 16:00:00 GMT</pubDate></item><item><title>[Statistics] a群體與b群體各別標準差求整體標準差</title><link>https://intervalrain.github.io/posts/statistics/sigma/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/statistics/sigma/</guid><pubDate>Tue, 12 Dec 2023 14:16:04 GMT</pubDate></item><item><title>[algo] timeline algorithm</title><link>https://intervalrain.github.io/posts/algo/timeline/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/algo/timeline/</guid><pubDate>Thu, 09 Nov 2023 19:10:09 GMT</pubDate></item><item><title>[IT] DDD, Hexagonal, Onion, Clean, CQRS 大整合</title><link>https://intervalrain.github.io/posts/hgraca/explicit-architecture-01-ddd-hexagonal-onion-clean-cqrs-how-i-put-it-all-together/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/explicit-architecture-01-ddd-hexagonal-onion-clean-cqrs-how-i-put-it-all-together/</guid><pubDate>Mon, 06 Nov 2023 15:38:13 GMT</pubDate></item><item><title>[IT] 服務導向的架構 Service Oriented Architecture (SOA)</title><link>https://intervalrain.github.io/posts/hgraca/service-oriented-architecture-soa/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/service-oriented-architecture-soa/</guid><pubDate>Thu, 02 Nov 2023 14:32:25 GMT</pubDate></item><item><title>[IT] 從 CQS 到 CQRS</title><link>https://intervalrain.github.io/posts/hgraca/from-cqs-to-cqrs/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/from-cqs-to-cqrs/</guid><pubDate>Wed, 01 Nov 2023 15:29:40 GMT</pubDate></item><item><title>[IT] 事件驅動架構 Event-Driven Architecture</title><link>https://intervalrain.github.io/posts/hgraca/event-driven-architecture/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/event-driven-architecture/</guid><pubDate>Tue, 31 Oct 2023 15:25:09 GMT</pubDate></item><item><title>[IT] 乾淨架構 Clean Architecture</title><link>https://intervalrain.github.io/posts/hgraca/clean-architecture/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/clean-architecture/</guid><pubDate>Sun, 29 Oct 2023 13:11:58 GMT</pubDate></item><item><title>[IT] 洋蔥架構 Onion Architecture</title><link>https://intervalrain.github.io/posts/hgraca/onion-architecture/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/onion-architecture/</guid><pubDate>Sun, 29 Oct 2023 12:34:57 GMT</pubDate></item><item><title>[ML] sample1 - 手寫數字辨識</title><link>https://intervalrain.github.io/posts/ml/ex1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ml/ex1/</guid><pubDate>Sat, 28 Oct 2023 06:11:35 GMT</pubDate></item><item><title>[IT] 埠與適配器架構 Ports &amp; Adapters Architecture aka 六邊形架構 Hexagonal Architecture</title><link>https://intervalrain.github.io/posts/hgraca/ports-adapters-architecture/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/ports-adapters-architecture/</guid><pubDate>Fri, 27 Oct 2023 15:46:32 GMT</pubDate></item><item><title>[IT] 領域驅動設計 Domain-Driven Design</title><link>https://intervalrain.github.io/posts/hgraca/domain-driven-design/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/domain-driven-design/</guid><pubDate>Thu, 26 Oct 2023 15:11:53 GMT</pubDate></item><item><title>[IT] 套件與命名空間 packaging &amp; namespacing</title><link>https://intervalrain.github.io/posts/hgraca/packaging-code/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/packaging-code/</guid><pubDate>Mon, 23 Oct 2023 15:14:14 GMT</pubDate></item><item><title>[IT] EBI 架構</title><link>https://intervalrain.github.io/posts/hgraca/ebi-architecture/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/ebi-architecture/</guid><pubDate>Sun, 22 Oct 2023 15:54:36 GMT</pubDate></item><item><title>[IT] Model1 &amp; Model2</title><link>https://intervalrain.github.io/posts/hgraca/model-1-model-2/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/model-1-model-2/</guid><pubDate>Thu, 19 Oct 2023 14:47:32 GMT</pubDate></item><item><title>[IT] Action-Domain-Responder(ADR) 架構</title><link>https://intervalrain.github.io/posts/hgraca/action-domain-responder/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/action-domain-responder/</guid><pubDate>Thu, 19 Oct 2023 14:43:08 GMT</pubDate></item><item><title>[IT] Resource-Method-Representation(RMR) 架構</title><link>https://intervalrain.github.io/posts/hgraca/resource-method-representation/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/resource-method-representation/</guid><pubDate>Thu, 19 Oct 2023 14:17:59 GMT</pubDate></item><item><title>[IT] MVC 及其變形</title><link>https://intervalrain.github.io/posts/hgraca/mvc-and-its-variants/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/mvc-and-its-variants/</guid><pubDate>Thu, 19 Oct 2023 02:54:19 GMT</pubDate></item><item><title>[IT] 分層架構 Layered Architecture</title><link>https://intervalrain.github.io/posts/hgraca/layered-architecture/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/layered-architecture/</guid><pubDate>Tue, 17 Oct 2023 13:44:07 GMT</pubDate></item><item><title>[IT] 單體架構 Monolithic Architecture</title><link>https://intervalrain.github.io/posts/hgraca/monolithic-architecture/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/monolithic-architecture/</guid><pubDate>Sun, 15 Oct 2023 04:06:51 GMT</pubDate></item><item><title>[IT] 架構風格 vs. 架構模式 vs. 設計模式 Architectural Styles vs. Architectural Patterns vs. Design Patterns</title><link>https://intervalrain.github.io/posts/hgraca/architectural-styles-vs-architectural-patterns-vs-design-patterns/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/architectural-styles-vs-architectural-patterns-vs-design-patterns/</guid><pubDate>Sat, 14 Oct 2023 06:29:21 GMT</pubDate></item><item><title>[IT] 程式語言的演進 Programming Language Evolution</title><link>https://intervalrain.github.io/posts/hgraca/programming-language-evolution/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/programming-language-evolution/</guid><pubDate>Fri, 13 Oct 2023 18:09:18 GMT</pubDate></item><item><title>[IT] 軟體架構前提 The Software Architecture Premises</title><link>https://intervalrain.github.io/posts/hgraca/software-architecture-premises/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/software-architecture-premises/</guid><pubDate>Fri, 13 Oct 2023 17:14:17 GMT</pubDate></item><item><title>[IT] 軟體架構編年史 The Software Architecture Chronicles</title><link>https://intervalrain.github.io/posts/hgraca/the-software-architecture-chronicles/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/hgraca/the-software-architecture-chronicles/</guid><pubDate>Fri, 13 Oct 2023 15:41:57 GMT</pubDate></item><item><title>[ML] Start Tensorflow Environment with Conda</title><link>https://intervalrain.github.io/posts/ml/environment/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ml/environment/</guid><pubDate>Wed, 11 Oct 2023 12:48:34 GMT</pubDate></item><item><title>[Leetcode] Arrangement</title><link>https://intervalrain.github.io/posts/leetcode/summary/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/summary/</guid><pubDate>Fri, 06 Oct 2023 08:30:47 GMT</pubDate></item><item><title>[IT] Clean Architecture - 第4章 - 結構化程式設計</title><link>https://intervalrain.github.io/posts/clean_arch/ch4/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/clean_arch/ch4/</guid><description>structured programming</description><pubDate>Tue, 03 Oct 2023 14:28:44 GMT</pubDate></item><item><title>[IT] Clean Architecture</title><link>https://intervalrain.github.io/posts/clean_arch/clean_arch/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/clean_arch/clean_arch/</guid><pubDate>Thu, 28 Sep 2023 18:03:47 GMT</pubDate></item><item><title>[IT] 事件總線 EventBus</title><link>https://intervalrain.github.io/posts/it/eventbus/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/eventbus/</guid><pubDate>Mon, 25 Sep 2023 15:50:02 GMT</pubDate></item><item><title>[IT] Clean Architecture - 重點整理</title><link>https://intervalrain.github.io/posts/it/ca/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/ca/</guid><pubDate>Sat, 23 Sep 2023 12:03:55 GMT</pubDate></item><item><title>[IT] LINQ: IQueryable Provider</title><link>https://intervalrain.github.io/posts/it/iq1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/iq1/</guid><description>一系列關於如何建立 LINQ IQueryable Provider 的文章，每篇都是建立在前一篇的基礎上。</description><pubDate>Thu, 21 Sep 2023 03:34:15 GMT</pubDate></item><item><title>[IT] Clean Architecture - 第3章 - 程式設計範式總覽</title><link>https://intervalrain.github.io/posts/clean_arch/ch3/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/clean_arch/ch3/</guid><description>paradigm overview</description><pubDate>Thu, 07 Sep 2023 14:07:54 GMT</pubDate></item><item><title>[IT] Clean Architecture - 第二部分 從基礎構件開始: 程式設計範式(Paradigms)</title><link>https://intervalrain.github.io/posts/clean_arch/sec2/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/clean_arch/sec2/</guid><pubDate>Tue, 05 Sep 2023 13:43:11 GMT</pubDate></item><item><title>[IT] Clean Architecture - 第2章 - 兩個價值維度</title><link>https://intervalrain.github.io/posts/clean_arch/ch2/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/clean_arch/ch2/</guid><description>two values</description><pubDate>Mon, 04 Sep 2023 07:18:12 GMT</pubDate></item><item><title>[IT] Clean Architecture - 第1章 - 設計與架構到底是什麼</title><link>https://intervalrain.github.io/posts/clean_arch/ch1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/clean_arch/ch1/</guid><description>What is design and architecture?</description><pubDate>Sun, 03 Sep 2023 15:14:07 GMT</pubDate></item><item><title>[IT] Clean Architecture - 第一部分 概述</title><link>https://intervalrain.github.io/posts/clean_arch/sec1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/clean_arch/sec1/</guid><pubDate>Sun, 03 Sep 2023 14:48:22 GMT</pubDate></item><item><title>[IT] Clean Architecture - Catalog</title><link>https://intervalrain.github.io/posts/clean_arch/toc/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/clean_arch/toc/</guid><pubDate>Sun, 03 Sep 2023 14:32:22 GMT</pubDate></item><item><title>[DXP] 在 spotfire 中創建自定義視覺化工具</title><link>https://intervalrain.github.io/posts/dxp/customvisualization/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/dxp/customvisualization/</guid><description>在 spotfire 中創建自定義的視覺化工具</description><pubDate>Mon, 14 Aug 2023 14:54:55 GMT</pubDate></item><item><title>[ML] 01. 機器學習基本概念簡介</title><link>https://intervalrain.github.io/posts/ml/lhy01/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ml/lhy01/</guid><description>什麼是機器學習，機器學習任務，監督式學習的運作流程</description><pubDate>Wed, 02 Aug 2023 15:56:25 GMT</pubDate></item><item><title>[C#] Large Object Heap</title><link>https://intervalrain.github.io/posts/csharp/loh/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/csharp/loh/</guid><description>Introduction to Large Object Heap</description><pubDate>Sat, 22 Jul 2023 12:59:57 GMT</pubDate></item><item><title>[DXP] Spotfire Extension 擴充程式</title><link>https://intervalrain.github.io/posts/dxp/extension/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/dxp/extension/</guid><description>spotfire sdk 介紹</description><pubDate>Thu, 22 Jun 2023 19:03:52 GMT</pubDate></item><item><title>[DXP] Spotfire Developer SDK</title><link>https://intervalrain.github.io/posts/dxp/sdk/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/dxp/sdk/</guid><description>spotfire sdk 介紹</description><pubDate>Thu, 22 Jun 2023 13:43:13 GMT</pubDate></item><item><title>[DXP] 在 spotfire 中創建自定義工具</title><link>https://intervalrain.github.io/posts/dxp/customtool/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/dxp/customtool/</guid><description>在 spotfire 中創建自定義工具</description><pubDate>Tue, 06 Jun 2023 14:38:08 GMT</pubDate></item><item><title>[DXP] 在 spotfire 中創建自定義任務</title><link>https://intervalrain.github.io/posts/dxp/customtask/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/dxp/customtask/</guid><description>在 spotfire 中創建自定義任務</description><pubDate>Tue, 06 Jun 2023 13:36:12 GMT</pubDate></item><item><title>[DXP] 使用 Visual Studio 對 Spotfire 開發進行環境設置</title><link>https://intervalrain.github.io/posts/dxp/config/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/dxp/config/</guid><description>spotfire 開發環境設置</description><pubDate>Tue, 06 Jun 2023 12:58:59 GMT</pubDate></item><item><title>[CS] Sample cost for performance test</title><link>https://intervalrain.github.io/posts/csharp/performancetest/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/csharp/performancetest/</guid><pubDate>Tue, 16 May 2023 13:26:24 GMT</pubDate></item><item><title>[IT] 關聯模式的五大鍵 Super key、Candidate Key、Primary Key、Alternate Key、Foreign Key</title><link>https://intervalrain.github.io/posts/it/keysinrelation/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/keysinrelation/</guid><description>關聯模式的五大鍵介紹</description><pubDate>Thu, 11 May 2023 13:50:43 GMT</pubDate></item><item><title>[Algo] 3-2. Binary Search</title><link>https://intervalrain.github.io/posts/cs/algo/binary_search/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/algo/binary_search/</guid><description>介紹二元搜索法，並介紹其適用情境</description><pubDate>Sun, 07 May 2023 10:46:56 GMT</pubDate></item><item><title>[C#] C#3、LINQ 及相關特性</title><link>https://intervalrain.github.io/posts/csharp/linq_props/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/csharp/linq_props/</guid><description>Introduction to LINQ in C#</description><pubDate>Mon, 01 May 2023 06:10:48 GMT</pubDate></item><item><title>[IT] Design Patterns</title><link>https://intervalrain.github.io/posts/it/design_pattern/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/design_pattern/</guid><description>簡介設計模式</description><pubDate>Sun, 30 Apr 2023 16:22:49 GMT</pubDate></item><item><title>[ML] 簡單實作測試</title><link>https://intervalrain.github.io/posts/ml/work/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ml/work/</guid><pubDate>Sat, 29 Apr 2023 16:35:59 GMT</pubDate></item><item><title>[Algo] 3-10. Binary Indexed Tree(Fenwick Tree, BIT)</title><link>https://intervalrain.github.io/posts/cs/algo/bit/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/algo/bit/</guid><description>利用 Binary Indexed Tree 做數組的動態更新與查詢，中譯為樹狀樹組</description><pubDate>Sat, 08 Apr 2023 09:46:12 GMT</pubDate></item><item><title>[Algo] 3-1. Two Pointer/Sliding Window</title><link>https://intervalrain.github.io/posts/cs/algo/two_pointer/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/algo/two_pointer/</guid><description>使用雙指標或是更進階的滑動窗口的技巧，對資料集合(可能是array，可能是list)做搜尋。</description><pubDate>Sun, 19 Mar 2023 14:56:03 GMT</pubDate></item><item><title>[LeetCode] 132. Palindrome Partitioning II</title><link>https://intervalrain.github.io/posts/leetcode/132/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/132/</guid><pubDate>Sat, 18 Mar 2023 08:10:36 GMT</pubDate></item><item><title>[Algo] 3-0. Sorting</title><link>https://intervalrain.github.io/posts/cs/algo/sorting/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/algo/sorting/</guid><description>從排序開始，練習將想法實踐，All start from sorting</description><pubDate>Thu, 16 Mar 2023 11:50:21 GMT</pubDate></item><item><title>[C#] Namespace Alias 命名空間別名</title><link>https://intervalrain.github.io/posts/csharp/namespace_alias/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/csharp/namespace_alias/</guid><description>Namespace alias in C#</description><pubDate>Tue, 28 Feb 2023 14:51:08 GMT</pubDate></item><item><title>[C#] Property getter/setter access separate 訪問權限分離</title><link>https://intervalrain.github.io/posts/csharp/getter_setter_access_separate/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/csharp/getter_setter_access_separate/</guid><description>Separate getter/setter property access in C#</description><pubDate>Tue, 28 Feb 2023 14:18:25 GMT</pubDate></item><item><title>[C#] static class 靜態類別</title><link>https://intervalrain.github.io/posts/csharp/static/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/csharp/static/</guid><description>Introduction to static class in C#</description><pubDate>Tue, 28 Feb 2023 13:08:01 GMT</pubDate></item><item><title>[C#] C# 筆記</title><link>https://intervalrain.github.io/posts/csharp/csharp/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/csharp/csharp/</guid><description>Notes for C#</description><pubDate>Tue, 28 Feb 2023 10:49:39 GMT</pubDate></item><item><title>[C#] Partial Type 局部類型</title><link>https://intervalrain.github.io/posts/csharp/partial/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/csharp/partial/</guid><description>Introduction to partial class ans partial method in C#</description><pubDate>Tue, 28 Feb 2023 07:11:11 GMT</pubDate></item><item><title>[C#] IEnumerable &amp; IEnumerator 迭代器</title><link>https://intervalrain.github.io/posts/csharp/iterator/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/csharp/iterator/</guid><description>Introduction to Iterator in C#, including IEnumerator and IEnumerable</description><pubDate>Mon, 27 Feb 2023 03:50:20 GMT</pubDate></item><item><title>[C#] Delegate 委派</title><link>https://intervalrain.github.io/posts/csharp/delegate/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/csharp/delegate/</guid><description>Introduction to Delegate in C#</description><pubDate>Sun, 26 Feb 2023 11:24:56 GMT</pubDate></item><item><title>[C#] Nullable 可空值類型</title><link>https://intervalrain.github.io/posts/csharp/nullable/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/csharp/nullable/</guid><description>Introduction to Nullable in C#</description><pubDate>Thu, 23 Feb 2023 13:40:03 GMT</pubDate></item><item><title>[C#] Generic 泛型</title><link>https://intervalrain.github.io/posts/csharp/generic/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/csharp/generic/</guid><description>Introduction to Generic in C#</description><pubDate>Wed, 22 Feb 2023 13:39:56 GMT</pubDate></item><item><title>[Life] 原子習慣</title><link>https://intervalrain.github.io/posts/life/20230218/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/life/20230218/</guid><description>對習慣演成的一些隨筆</description><pubDate>Sat, 18 Feb 2023 06:28:24 GMT</pubDate></item><item><title>[Algo] 2-4. 回溯法 Backtracking</title><link>https://intervalrain.github.io/posts/cs/algo/backtracking/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/algo/backtracking/</guid><description>演算法設計，介紹什麼是回溯法，並示範運用回溯法的思維解題</description><pubDate>Fri, 27 Jan 2023 02:50:26 GMT</pubDate></item><item><title>[Algo] 2-3. 分治法 Divide and Conquer</title><link>https://intervalrain.github.io/posts/cs/algo/divide_and_conquer/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/algo/divide_and_conquer/</guid><description>演算法設計，介紹什麼是分治法，分治法的核心思想與例題，與常見的一些技巧。</description><pubDate>Fri, 27 Jan 2023 02:48:42 GMT</pubDate></item><item><title>[Algo] 2-2. 貪心演算法 Greedy</title><link>https://intervalrain.github.io/posts/cs/algo/greedy/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/algo/greedy/</guid><description>演算法設計，介紹什麼是貪心法，貪心法的解題思維</description><pubDate>Tue, 24 Jan 2023 10:31:15 GMT</pubDate></item><item><title>[Algo] 2-1. 暴力演算法 Brute Force</title><link>https://intervalrain.github.io/posts/cs/algo/brute_force/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/algo/brute_force/</guid><description>演算法設計，介紹什麼是暴力演算法，並示範幾種資料結構的遍歷與枚舉</description><pubDate>Tue, 24 Jan 2023 07:57:40 GMT</pubDate></item><item><title>[LeetCode] 491. Non-decreasing Subsequences</title><link>https://intervalrain.github.io/posts/leetcode/491/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/491/</guid><pubDate>Fri, 20 Jan 2023 13:39:50 GMT</pubDate></item><item><title>[IT] C# Depth Ch.2 C# 2</title><link>https://intervalrain.github.io/posts/it/csharp_depth_ch2/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/csharp_depth_ch2/</guid><pubDate>Fri, 20 Jan 2023 02:10:46 GMT</pubDate></item><item><title>[LeetCode] 974. Subarray Sums Divisible by K</title><link>https://intervalrain.github.io/posts/leetcode/974/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/974/</guid><pubDate>Thu, 19 Jan 2023 05:50:19 GMT</pubDate></item><item><title>[LeetCode] 53. Maximum Subarray</title><link>https://intervalrain.github.io/posts/leetcode/53/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/53/</guid><pubDate>Wed, 18 Jan 2023 15:20:08 GMT</pubDate></item><item><title>[LeetCode] 918. Maximum Sum Circular Subarray</title><link>https://intervalrain.github.io/posts/leetcode/918/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/918/</guid><pubDate>Wed, 18 Jan 2023 15:07:56 GMT</pubDate></item><item><title>[IT] C# Depth Ch.1 與時俱進的語言</title><link>https://intervalrain.github.io/posts/it/csharp_depth_ch1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/csharp_depth_ch1/</guid><pubDate>Tue, 17 Jan 2023 14:27:58 GMT</pubDate></item><item><title>[LeetCode] 926. Flip String to Monotone Increasing</title><link>https://intervalrain.github.io/posts/leetcode/926/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/926/</guid><pubDate>Tue, 17 Jan 2023 08:36:26 GMT</pubDate></item><item><title>[IT] Shell 筆記</title><link>https://intervalrain.github.io/posts/it/shell/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/shell/</guid><pubDate>Thu, 12 Jan 2023 15:34:41 GMT</pubDate></item><item><title>[LeetCode] 1519. Number of Nodes in the Sub-Tree With the Same Level</title><link>https://intervalrain.github.io/posts/leetcode/1519/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/1519/</guid><pubDate>Thu, 12 Jan 2023 14:56:18 GMT</pubDate></item><item><title>[LeetCode] 100. Same Tree</title><link>https://intervalrain.github.io/posts/leetcode/100/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/100/</guid><pubDate>Tue, 10 Jan 2023 13:48:09 GMT</pubDate></item><item><title>[LeetCode] 149. Max Points on a Line</title><link>https://intervalrain.github.io/posts/leetcode/149/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/149/</guid><pubDate>Sun, 08 Jan 2023 15:44:07 GMT</pubDate></item><item><title>[LeetCode] 452. Minimum Number of Arrows to Burst Balloons</title><link>https://intervalrain.github.io/posts/leetcode/452/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/452/</guid><pubDate>Thu, 05 Jan 2023 12:19:49 GMT</pubDate></item><item><title>[Algo] 1-9. Algorithm</title><link>https://intervalrain.github.io/posts/cs/algo/algorithm/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/algo/algorithm/</guid><description>C++ 的內建演算法庫使用與範例</description><pubDate>Tue, 03 Jan 2023 13:49:42 GMT</pubDate></item><item><title>[LeetCode] 944. Delete Columns to Make Sorted</title><link>https://intervalrain.github.io/posts/leetcode/944/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/944/</guid><pubDate>Tue, 03 Jan 2023 12:09:30 GMT</pubDate></item><item><title>[LeetCode] 2522. Partition String Into Substrings With Values at Most K</title><link>https://intervalrain.github.io/posts/leetcode/2522/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2522/</guid><pubDate>Mon, 02 Jan 2023 15:15:00 GMT</pubDate></item><item><title>[LeetCode] 2523. Closest Prime Numbers in Range</title><link>https://intervalrain.github.io/posts/leetcode/2523/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2523/</guid><pubDate>Mon, 02 Jan 2023 08:33:40 GMT</pubDate></item><item><title>[LeetCode] 520. Detect Capital</title><link>https://intervalrain.github.io/posts/leetcode/520/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/520/</guid><pubDate>Mon, 02 Jan 2023 03:05:30 GMT</pubDate></item><item><title>[LeetCode] 2521. Distinct Prime Factors of Product of Array</title><link>https://intervalrain.github.io/posts/leetcode/2521/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2521/</guid><pubDate>Sun, 01 Jan 2023 15:52:02 GMT</pubDate></item><item><title>[LeetCode] 2520. Count the Digits That Divide a Number</title><link>https://intervalrain.github.io/posts/leetcode/2520/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2520/</guid><pubDate>Sun, 01 Jan 2023 15:41:54 GMT</pubDate></item><item><title>[LeetCode] 290. Word Pattern</title><link>https://intervalrain.github.io/posts/leetcode/290/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/290/</guid><pubDate>Sun, 01 Jan 2023 15:14:56 GMT</pubDate></item><item><title>[C#] Yield Return</title><link>https://intervalrain.github.io/posts/csharp/yield/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/csharp/yield/</guid><description>Introduction to yield return in C#, and the background of IEnumerable and IEnumerator </description><pubDate>Sun, 01 Jan 2023 13:40:25 GMT</pubDate></item><item><title>[LeetCode] 1962. Remove Stones to Minimize the Total</title><link>https://intervalrain.github.io/posts/leetcode/1962/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/1962/</guid><pubDate>Wed, 28 Dec 2022 16:03:22 GMT</pubDate></item><item><title>[LeetCode] 2279. Maximum Bags With Full Capacity of Rocks</title><link>https://intervalrain.github.io/posts/leetcode/2279/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2279/</guid><pubDate>Tue, 27 Dec 2022 12:48:32 GMT</pubDate></item><item><title>[LeetCode] 2389. Longest Subsequence With Limited Sum</title><link>https://intervalrain.github.io/posts/leetcode/2389/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2389/</guid><pubDate>Sun, 25 Dec 2022 12:07:51 GMT</pubDate></item><item><title>[LeetCode] 790. Domino and Tromino Tiling</title><link>https://intervalrain.github.io/posts/leetcode/790/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/790/</guid><pubDate>Sat, 24 Dec 2022 15:53:10 GMT</pubDate></item><item><title>[LeetCode] 841. Keys and Rooms</title><link>https://intervalrain.github.io/posts/leetcode/841/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/841/</guid><pubDate>Tue, 20 Dec 2022 15:00:22 GMT</pubDate></item><item><title>[LeetCode] 25. Reverse Nodes in k-Group</title><link>https://intervalrain.github.io/posts/leetcode/25/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/25/</guid><pubDate>Fri, 16 Dec 2022 15:32:48 GMT</pubDate></item><item><title>[LeetCode] 24. Swap Nodes in Pairs</title><link>https://intervalrain.github.io/posts/leetcode/24/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/24/</guid><pubDate>Wed, 14 Dec 2022 15:35:28 GMT</pubDate></item><item><title>[LeetCode] 931. Minimum Falling Path Sum</title><link>https://intervalrain.github.io/posts/leetcode/931/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/931/</guid><pubDate>Tue, 13 Dec 2022 13:53:27 GMT</pubDate></item><item><title>[LeetCode] 70. Climbing Stairs</title><link>https://intervalrain.github.io/posts/leetcode/70/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/70/</guid><pubDate>Mon, 12 Dec 2022 14:43:20 GMT</pubDate></item><item><title>[LeetCode] 2501. Longest Square Streak in an Array</title><link>https://intervalrain.github.io/posts/leetcode/2501/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2501/</guid><pubDate>Sun, 11 Dec 2022 14:42:14 GMT</pubDate></item><item><title>[LeetCode] 2500. Delete Greatest Value in Each Row</title><link>https://intervalrain.github.io/posts/leetcode/2500/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2500/</guid><pubDate>Sun, 11 Dec 2022 14:42:12 GMT</pubDate></item><item><title>[LeetCode] 124. Binary Tree Maximum Path Sum</title><link>https://intervalrain.github.io/posts/leetcode/124/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/124/</guid><pubDate>Sun, 11 Dec 2022 13:53:00 GMT</pubDate></item><item><title>[LeetCode] 1339. Maximum Product of Splitted Binary Tree</title><link>https://intervalrain.github.io/posts/leetcode/1339/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/1339/</guid><pubDate>Sat, 10 Dec 2022 12:12:36 GMT</pubDate></item><item><title>[LeetCode] 1026. Maximum Difference Between Node and Ancestor</title><link>https://intervalrain.github.io/posts/leetcode/1026/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/1026/</guid><pubDate>Fri, 09 Dec 2022 16:49:10 GMT</pubDate></item><item><title>[LeetCode] 872. Leaf-Similar Trees</title><link>https://intervalrain.github.io/posts/leetcode/872/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/872/</guid><pubDate>Thu, 08 Dec 2022 13:41:10 GMT</pubDate></item><item><title>[LeetCode] 938. Range Sum of BST</title><link>https://intervalrain.github.io/posts/leetcode/938/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/938/</guid><pubDate>Wed, 07 Dec 2022 15:41:31 GMT</pubDate></item><item><title>[LeetCode] 328. Odd Even Linked List</title><link>https://intervalrain.github.io/posts/leetcode/328/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/328/</guid><pubDate>Tue, 06 Dec 2022 15:56:11 GMT</pubDate></item><item><title>[LeetCode] 2472. Maximum Number of Non-overlapping Palindrome Substrings</title><link>https://intervalrain.github.io/posts/leetcode/2472/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2472/</guid><pubDate>Tue, 29 Nov 2022 15:55:22 GMT</pubDate></item><item><title>[LeetCode] 2471. Minimum Number of Operations to Sort a Binary Tree by Level</title><link>https://intervalrain.github.io/posts/leetcode/2471/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2471/</guid><pubDate>Tue, 29 Nov 2022 15:55:20 GMT</pubDate></item><item><title>[LeetCode] 2470. Number of Subarrays With LCM Equal to K</title><link>https://intervalrain.github.io/posts/leetcode/2470/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2470/</guid><pubDate>Tue, 29 Nov 2022 15:55:18 GMT</pubDate></item><item><title>[LeetCode] 2469. Convert the Temperature</title><link>https://intervalrain.github.io/posts/leetcode/2469/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2469/</guid><pubDate>Tue, 29 Nov 2022 15:55:11 GMT</pubDate></item><item><title>[LeetCode] 446. Arithmetic Slices II - Subsequence</title><link>https://intervalrain.github.io/posts/leetcode/446/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/446/</guid><pubDate>Mon, 28 Nov 2022 15:39:03 GMT</pubDate></item><item><title>[LeetCode] 2488. Count Subarrays With Median K</title><link>https://intervalrain.github.io/posts/leetcode/2488/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2488/</guid><pubDate>Sun, 27 Nov 2022 13:04:55 GMT</pubDate></item><item><title>[LeetCode] 2487. Remove Nodes From Linked List</title><link>https://intervalrain.github.io/posts/leetcode/2487/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2487/</guid><pubDate>Sun, 27 Nov 2022 13:04:51 GMT</pubDate></item><item><title>[LeetCode] 2486. Accept Characters to String to Make Subsequence</title><link>https://intervalrain.github.io/posts/leetcode/2486/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2486/</guid><pubDate>Sun, 27 Nov 2022 13:04:50 GMT</pubDate></item><item><title>[LeetCode] 2485. Find the Pivot Integer</title><link>https://intervalrain.github.io/posts/leetcode/2485/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2485/</guid><pubDate>Sun, 27 Nov 2022 13:04:47 GMT</pubDate></item><item><title>[LeetCode] 1235. Maximum Profit in Job Scheduling</title><link>https://intervalrain.github.io/posts/leetcode/1235/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/1235/</guid><pubDate>Sat, 26 Nov 2022 06:09:56 GMT</pubDate></item><item><title>[LeetCode] 1143. Longest Common Subsequence</title><link>https://intervalrain.github.io/posts/leetcode/1143/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/1143/</guid><pubDate>Thu, 24 Nov 2022 15:15:24 GMT</pubDate></item><item><title>[LeetCode] 300. Longest Increasing Subsequence</title><link>https://intervalrain.github.io/posts/leetcode/300/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/300/</guid><pubDate>Thu, 24 Nov 2022 12:59:40 GMT</pubDate></item><item><title>[LeetCode] 2468. Split Message Based on Limit</title><link>https://intervalrain.github.io/posts/leetcode/2468/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2468/</guid><pubDate>Wed, 23 Nov 2022 17:09:57 GMT</pubDate></item><item><title>[LeetCode] 2467. Most Profitable Path in a Tree</title><link>https://intervalrain.github.io/posts/leetcode/2467/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2467/</guid><pubDate>Wed, 23 Nov 2022 17:09:51 GMT</pubDate></item><item><title>[LeetCode] 1926. Nearest Exit from Entrance in Maze</title><link>https://intervalrain.github.io/posts/leetcode/1926/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/1926/</guid><pubDate>Tue, 22 Nov 2022 15:41:58 GMT</pubDate></item><item><title>[LeetCode] 279. Perfect Squares</title><link>https://intervalrain.github.io/posts/leetcode/279/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/279/</guid><pubDate>Tue, 22 Nov 2022 11:40:18 GMT</pubDate></item><item><title>[LeetCode] 337. House Robber III</title><link>https://intervalrain.github.io/posts/leetcode/337/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/337/</guid><pubDate>Sat, 19 Nov 2022 13:43:08 GMT</pubDate></item><item><title>[LeetCode] 587. Erect the Fence</title><link>https://intervalrain.github.io/posts/leetcode/587/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/587/</guid><pubDate>Sat, 19 Nov 2022 08:56:09 GMT</pubDate></item><item><title>[LeetCode] 322. Coin Change</title><link>https://intervalrain.github.io/posts/leetcode/322/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/322/</guid><pubDate>Thu, 17 Nov 2022 13:31:45 GMT</pubDate></item><item><title>[LeetCode] 2466. Count Ways To Build Good Strings</title><link>https://intervalrain.github.io/posts/leetcode/2466/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2466/</guid><pubDate>Thu, 17 Nov 2022 13:23:24 GMT</pubDate></item><item><title>[LeetCode] 2465. Number of Distinct Averages</title><link>https://intervalrain.github.io/posts/leetcode/2465/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2465/</guid><pubDate>Thu, 17 Nov 2022 13:00:05 GMT</pubDate></item><item><title>[LeetCode] 223. Rectangle Area</title><link>https://intervalrain.github.io/posts/leetcode/223/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/223/</guid><pubDate>Thu, 17 Nov 2022 12:39:17 GMT</pubDate></item><item><title>[LeetCode] 374. Guess Number Higher or Lower</title><link>https://intervalrain.github.io/posts/leetcode/374/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/374/</guid><pubDate>Wed, 16 Nov 2022 14:57:11 GMT</pubDate></item><item><title>[LeetCode] 213. House Robber II</title><link>https://intervalrain.github.io/posts/leetcode/213/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/213/</guid><pubDate>Tue, 15 Nov 2022 15:45:49 GMT</pubDate></item><item><title>[LeetCode] 198. House Robber</title><link>https://intervalrain.github.io/posts/leetcode/198/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/198/</guid><pubDate>Tue, 15 Nov 2022 15:33:01 GMT</pubDate></item><item><title>[Algo] 2-5. 動態規劃 Dynamic Programming</title><link>https://intervalrain.github.io/posts/cs/algo/dp/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/algo/dp/</guid><description>演算法設計，介紹什麼是動態規劃，並介紹幾種動態規劃常見的題型，與解題框架</description><pubDate>Tue, 15 Nov 2022 08:10:53 GMT</pubDate></item><item><title>[LeetCode] 947. Most Stones Removed with Same Row or Column</title><link>https://intervalrain.github.io/posts/leetcode/947/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/947/</guid><pubDate>Mon, 14 Nov 2022 16:12:30 GMT</pubDate></item><item><title>[LeetCode] 151. Reverse Words in a String</title><link>https://intervalrain.github.io/posts/leetcode/151/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/151/</guid><pubDate>Sun, 13 Nov 2022 09:35:59 GMT</pubDate></item><item><title>[LeetCode] 23. Merge k Sorted Lists</title><link>https://intervalrain.github.io/posts/leetcode/23/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/23/</guid><pubDate>Thu, 10 Nov 2022 16:24:47 GMT</pubDate></item><item><title>[LeetCode] 22. Generate Parentheses</title><link>https://intervalrain.github.io/posts/leetcode/22/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/22/</guid><pubDate>Thu, 10 Nov 2022 15:44:24 GMT</pubDate></item><item><title>[LeetCode] 21. Merge Two Sorted Lists</title><link>https://intervalrain.github.io/posts/leetcode/21/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/21/</guid><pubDate>Thu, 10 Nov 2022 12:25:07 GMT</pubDate></item><item><title>[LeetCode] 1047. Remove All Adjacent Duplicates In String</title><link>https://intervalrain.github.io/posts/leetcode/1047/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/1047/</guid><pubDate>Thu, 10 Nov 2022 12:01:29 GMT</pubDate></item><item><title>[LeetCode] 901. Online Stock Span</title><link>https://intervalrain.github.io/posts/leetcode/901/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/901/</guid><pubDate>Wed, 09 Nov 2022 15:35:42 GMT</pubDate></item><item><title>[LeetCode] 1544. Make The String Great</title><link>https://intervalrain.github.io/posts/leetcode/1544/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/1544/</guid><pubDate>Tue, 08 Nov 2022 15:14:34 GMT</pubDate></item><item><title>[LeetCode] 2462. Total Cost to Hire K</title><link>https://intervalrain.github.io/posts/leetcode/2462/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2462/</guid><pubDate>Mon, 07 Nov 2022 16:53:08 GMT</pubDate></item><item><title>[LeetCode] 2461. Maximum Sum of Distinct Subarrays With Length K</title><link>https://intervalrain.github.io/posts/leetcode/2461/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2461/</guid><pubDate>Mon, 07 Nov 2022 16:36:35 GMT</pubDate></item><item><title>[LeetCode] 2460. Apply Operations to an Array</title><link>https://intervalrain.github.io/posts/leetcode/2460/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2460/</guid><pubDate>Mon, 07 Nov 2022 16:09:13 GMT</pubDate></item><item><title>[LeetCode] 1323. Maximum 69 Number</title><link>https://intervalrain.github.io/posts/leetcode/1323/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/1323/</guid><pubDate>Mon, 07 Nov 2022 15:55:31 GMT</pubDate></item><item><title>[ML] 機器學習與統計學</title><link>https://intervalrain.github.io/posts/ml/lec1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ml/lec1/</guid><description>Introduction to Machine Learning</description><pubDate>Mon, 07 Nov 2022 10:18:52 GMT</pubDate></item><item><title>[LeetCode] 79. Word Search</title><link>https://intervalrain.github.io/posts/leetcode/79/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/79/</guid><pubDate>Sat, 05 Nov 2022 13:12:17 GMT</pubDate></item><item><title>[LeetCode] 212. Word Search II</title><link>https://intervalrain.github.io/posts/leetcode/212/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/212/</guid><pubDate>Sat, 05 Nov 2022 12:58:11 GMT</pubDate></item><item><title>[LeetCode] 2131. Longest Palindrome by Concatenating Two Letter Words</title><link>https://intervalrain.github.io/posts/leetcode/2131/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2131/</guid><pubDate>Thu, 03 Nov 2022 15:10:10 GMT</pubDate></item><item><title>[LeetCode] 433. Minimum Genetic Mutation</title><link>https://intervalrain.github.io/posts/leetcode/433/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/433/</guid><pubDate>Wed, 02 Nov 2022 15:36:32 GMT</pubDate></item><item><title>[LeetCode] 1610. Maximum Number of Visible Points</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1610/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1610/</guid><pubDate>Tue, 01 Nov 2022 20:00:00 GMT</pubDate></item><item><title>[LeetCode] 2009. Minimum Number of Operations to Make Array Continuous</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2009/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2009/</guid><pubDate>Tue, 01 Nov 2022 19:00:00 GMT</pubDate></item><item><title>[LeetCode] 2106. Maximum Fruits Harvested After at Most K Steps</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2106/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2106/</guid><pubDate>Tue, 01 Nov 2022 19:00:00 GMT</pubDate></item><item><title>[LeetCode] 2555. Maximize Win From Two Segments</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2555/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2555/</guid><pubDate>Tue, 01 Nov 2022 19:00:00 GMT</pubDate></item><item><title>[LeetCode] 2271. Maximum White Tiles Covered by a Carpet</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2271/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2271/</guid><pubDate>Tue, 01 Nov 2022 18:00:00 GMT</pubDate></item><item><title>[LeetCode] 2831. Find the Longest Equal Subarray</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2831/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2831/</guid><pubDate>Tue, 01 Nov 2022 17:00:00 GMT</pubDate></item><item><title>[LeetCode] 2516. Take K of Each Character From Left and Right</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2516/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2516/</guid><pubDate>Tue, 01 Nov 2022 16:00:00 GMT</pubDate></item><item><title>[LeetCode] 1658. Minimum Operations to Reduce X to Zero</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1658/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1658/</guid><pubDate>Tue, 01 Nov 2022 15:00:00 GMT</pubDate></item><item><title>[LeetCode] 1838. Frequency of the Most Frequent Element</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1838/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1838/</guid><pubDate>Tue, 01 Nov 2022 15:00:00 GMT</pubDate></item><item><title>[LeetCode] 1004. Max Consecutive Ones III</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1004/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1004/</guid><pubDate>Tue, 01 Nov 2022 14:00:00 GMT</pubDate></item><item><title>[LeetCode] 2024. Maximize the Confusion of an Exam</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2024/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2024/</guid><pubDate>Tue, 01 Nov 2022 13:00:00 GMT</pubDate></item><item><title>[LeetCode] 20. Valid Parentheses</title><link>https://intervalrain.github.io/posts/leetcode/20/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/20/</guid><pubDate>Tue, 01 Nov 2022 12:51:49 GMT</pubDate></item><item><title>[LeetCode] 2779. Maximum Beauty of an Array After Applying Operation</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2779/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2779/</guid><pubDate>Tue, 01 Nov 2022 12:00:00 GMT</pubDate></item><item><title>[LeetCode] 2958. Length of Longest Subarray With at Most K Frequency</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2958/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2958/</guid><pubDate>Tue, 01 Nov 2022 12:00:00 GMT</pubDate></item><item><title>[LeetCode] 1706. Where Will the Ball Fall</title><link>https://intervalrain.github.io/posts/leetcode/1706/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/1706/</guid><pubDate>Tue, 01 Nov 2022 11:02:00 GMT</pubDate></item><item><title>[LeetCode] 1695. Maximum Erasure Value</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1695/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1695/</guid><pubDate>Tue, 01 Nov 2022 11:00:00 GMT</pubDate></item><item><title>[LeetCode] 904. Fruit Into Baskets</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/904/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/904/</guid><pubDate>Tue, 01 Nov 2022 10:00:00 GMT</pubDate></item><item><title>[LeetCode] 2730. Find the Longest Semi-Repetitive Substring</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2730/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2730/</guid><pubDate>Tue, 01 Nov 2022 09:00:00 GMT</pubDate></item><item><title>[LeetCode] 1208. Get Equal Substrings Within Budget</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1208/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1208/</guid><pubDate>Tue, 01 Nov 2022 08:00:00 GMT</pubDate></item><item><title>[LeetCode] 1493. Longest Subarray of 1&apos;s After Deleting One Element</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1493/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1493/</guid><pubDate>Tue, 01 Nov 2022 07:00:00 GMT</pubDate></item><item><title>[LeetCode] 3. Longest Substring Without Repeating Characters</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/3/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/3/</guid><pubDate>Tue, 01 Nov 2022 06:00:00 GMT</pubDate></item><item><title>[LeetCode] 3090. Maximum Length Substring With Two Occurrences</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/3090/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/3090/</guid><pubDate>Tue, 01 Nov 2022 06:00:00 GMT</pubDate></item><item><title>[LeetCode] 不定長 Sliding Window Pattern</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/pattern_2/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/pattern_2/</guid><pubDate>Tue, 01 Nov 2022 06:00:00 GMT</pubDate></item><item><title>[LeetCode] 220. Contains Duplicate III</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/220/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/220/</guid><pubDate>Tue, 01 Nov 2022 05:00:00 GMT</pubDate></item><item><title>[LeetCode] 1984. Minimum Difference Between Highest and Lowest of K Scores</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1984/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1984/</guid><pubDate>Tue, 01 Nov 2022 04:00:00 GMT</pubDate></item><item><title>[LeetCode] 2269. Find the K-Beauty of a Number</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2269/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2269/</guid><pubDate>Tue, 01 Nov 2022 04:00:00 GMT</pubDate></item><item><title>[LeetCode] 766. Toeplitz Matrix</title><link>https://intervalrain.github.io/posts/leetcode/766/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/766/</guid><pubDate>Mon, 31 Oct 2022 16:40:55 GMT</pubDate></item><item><title>[LeetCode] 1016. Binary String With Substrings Representing 1 To N</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1016/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1016/</guid><pubDate>Mon, 31 Oct 2022 04:00:00 GMT</pubDate></item><item><title>[LeetCode] 19. Remove Nth Node From End of List</title><link>https://intervalrain.github.io/posts/leetcode/19/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/19/</guid><pubDate>Sun, 30 Oct 2022 16:05:10 GMT</pubDate></item><item><title>[LeetCode] 1293. Shortest Path in a Grid with Obstacles Elimination</title><link>https://intervalrain.github.io/posts/leetcode/1293/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/1293/</guid><pubDate>Sun, 30 Oct 2022 13:29:37 GMT</pubDate></item><item><title>[LeetCode] 2953. Count Complete Substrings</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2953/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2953/</guid><pubDate>Sun, 30 Oct 2022 04:00:00 GMT</pubDate></item><item><title>[LeetCode] 2136. Earliest Possible Day of Full Bloom</title><link>https://intervalrain.github.io/posts/leetcode/2136/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2136/</guid><pubDate>Sat, 29 Oct 2022 16:25:25 GMT</pubDate></item><item><title>[LeetCode] 2156. Find Substring With Given Hash Value</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2156/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2156/</guid><pubDate>Sat, 29 Oct 2022 04:00:00 GMT</pubDate></item><item><title>[LeetCode] 18. 4Sum</title><link>https://intervalrain.github.io/posts/leetcode/18/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/18/</guid><pubDate>Fri, 28 Oct 2022 15:58:48 GMT</pubDate></item><item><title>[LeetCode] 17. Letter Combinations of a Phone Number</title><link>https://intervalrain.github.io/posts/leetcode/17/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/17/</guid><pubDate>Fri, 28 Oct 2022 14:59:22 GMT</pubDate></item><item><title>[LeetCode] 16. 3Sum Closet</title><link>https://intervalrain.github.io/posts/leetcode/16/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/16/</guid><pubDate>Fri, 28 Oct 2022 13:51:20 GMT</pubDate></item><item><title>[LeetCode] 15. 3Sum</title><link>https://intervalrain.github.io/posts/leetcode/15/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/15/</guid><pubDate>Fri, 28 Oct 2022 05:30:19 GMT</pubDate></item><item><title>[LeetCode] 30. Substring with Concatenation of All Words</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/30/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/30/</guid><pubDate>Fri, 28 Oct 2022 04:30:00 GMT</pubDate></item><item><title>[LeetCode] 438. Find All Anagrams in a String</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/438/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/438/</guid><pubDate>Fri, 28 Oct 2022 04:20:00 GMT</pubDate></item><item><title>[LeetCode] 567. Permutation in String</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/567/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/567/</guid><pubDate>Fri, 28 Oct 2022 04:10:00 GMT</pubDate></item><item><title>[LeetCode] 1888. Minimum Number of Flips to Make the Binary String Alternating</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1888/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1888/</guid><pubDate>Fri, 28 Oct 2022 04:00:00 GMT</pubDate></item><item><title>[Leetcode] 14. Longest Common Prefix</title><link>https://intervalrain.github.io/posts/leetcode/14/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/14/</guid><pubDate>Thu, 27 Oct 2022 16:00:08 GMT</pubDate></item><item><title>[Leetcode] 13. Roman to Integer</title><link>https://intervalrain.github.io/posts/leetcode/13/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/13/</guid><pubDate>Thu, 27 Oct 2022 13:58:08 GMT</pubDate></item><item><title>[Leetcode] 835. Image Overlap</title><link>https://intervalrain.github.io/posts/leetcode/835/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/835/</guid><pubDate>Thu, 27 Oct 2022 09:35:25 GMT</pubDate></item><item><title>[LeetCode] 2653. Sliding Subarray Beauty</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2653/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2653/</guid><pubDate>Thu, 27 Oct 2022 04:00:00 GMT</pubDate></item><item><title>[Leetcode] 12. Integer to Roman</title><link>https://intervalrain.github.io/posts/leetcode/12/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/12/</guid><pubDate>Wed, 26 Oct 2022 12:36:08 GMT</pubDate></item><item><title>[Leetcode] 11. Container With Most Water</title><link>https://intervalrain.github.io/posts/leetcode/11/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/11/</guid><pubDate>Wed, 26 Oct 2022 11:36:06 GMT</pubDate></item><item><title>[Leetcode] 10. Regular Expression Matching</title><link>https://intervalrain.github.io/posts/leetcode/10/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/10/</guid><pubDate>Wed, 26 Oct 2022 10:36:01 GMT</pubDate></item><item><title>[LeetCode] 2134. Minimum Swaps to Group All 1&apos;s Together II</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2134/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2134/</guid><pubDate>Wed, 26 Oct 2022 04:00:00 GMT</pubDate></item><item><title>[Leetcode] 9. Palindrome Number</title><link>https://intervalrain.github.io/posts/leetcode/9/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/9/</guid><pubDate>Wed, 26 Oct 2022 02:20:08 GMT</pubDate></item><item><title>[Leetcode] 8. String to Integer (atoi)</title><link>https://intervalrain.github.io/posts/leetcode/8/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/8/</guid><pubDate>Tue, 25 Oct 2022 16:21:56 GMT</pubDate></item><item><title>[Leetcode] 7. Reverse Integer</title><link>https://intervalrain.github.io/posts/leetcode/7/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/7/</guid><pubDate>Tue, 25 Oct 2022 15:47:53 GMT</pubDate></item><item><title>[Leetcode] 6. Zigzag Conversion</title><link>https://intervalrain.github.io/posts/leetcode/6/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/6/</guid><pubDate>Tue, 25 Oct 2022 13:40:24 GMT</pubDate></item><item><title>[LeetCode] 5. Longest Palindromic Substring</title><link>https://intervalrain.github.io/posts/leetcode/5/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/5/</guid><pubDate>Tue, 25 Oct 2022 08:32:51 GMT</pubDate></item><item><title>[LeetCode] 4. Median of Two Sorted Arrays</title><link>https://intervalrain.github.io/posts/leetcode/4/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/4/</guid><pubDate>Tue, 25 Oct 2022 06:52:18 GMT</pubDate></item><item><title>[LeetCode] 3. Longest Substring Without Repeating Characters</title><link>https://intervalrain.github.io/posts/leetcode/3/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/3/</guid><pubDate>Tue, 25 Oct 2022 06:20:00 GMT</pubDate></item><item><title>[LeetCode] 2. Add Two Numbers</title><link>https://intervalrain.github.io/posts/leetcode/2/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/2/</guid><pubDate>Tue, 25 Oct 2022 05:38:00 GMT</pubDate></item><item><title>[LeetCode] 1297. Maximum Number of Occurrences of a Substring</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1297/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1297/</guid><pubDate>Tue, 25 Oct 2022 04:43:32 GMT</pubDate></item><item><title>[LeetCode] 1652. Defuse the Bomb</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1652/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1652/</guid><pubDate>Tue, 25 Oct 2022 04:42:32 GMT</pubDate></item><item><title>[LeetCode] 1. Two Sum</title><link>https://intervalrain.github.io/posts/leetcode/1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/1/</guid><pubDate>Tue, 25 Oct 2022 04:41:32 GMT</pubDate></item><item><title>[LeetCode] 1423. Maximum Points You Can Obtain from Cards</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1423/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1423/</guid><pubDate>Tue, 25 Oct 2022 04:41:32 GMT</pubDate></item><item><title>[LeetCode] 2461. Maximum Sum of Distinct Subarrays With Length K</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2461/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2461/</guid><pubDate>Tue, 25 Oct 2022 04:40:32 GMT</pubDate></item><item><title>[LeetCode] 2841. Maximum Sum of Almost Unique Subarray</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2841/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2841/</guid><pubDate>Tue, 25 Oct 2022 04:39:32 GMT</pubDate></item><item><title>[LeetCode] 1461. Check If a String Contains All Binary Codes of Size K</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1461/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1461/</guid><pubDate>Tue, 25 Oct 2022 04:38:32 GMT</pubDate></item><item><title>[LeetCode] 1052. Grumpy Bookstore Owner</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1052/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1052/</guid><pubDate>Tue, 25 Oct 2022 04:36:32 GMT</pubDate></item><item><title>[LeetCode] 2379. Minimum Recolors to Get K Consecutive Black Blocks</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2379/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2379/</guid><pubDate>Tue, 25 Oct 2022 04:35:32 GMT</pubDate></item><item><title>[LeetCode] 2090. K Radius Subarray Averages</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2090/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/2090/</guid><pubDate>Tue, 25 Oct 2022 04:34:32 GMT</pubDate></item><item><title>[LeetCode] 1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1343/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1343/</guid><pubDate>Tue, 25 Oct 2022 04:33:32 GMT</pubDate></item><item><title>[LeetCode] 643. Maximum Average Subarray I</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/643/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/643/</guid><pubDate>Tue, 25 Oct 2022 04:32:32 GMT</pubDate></item><item><title>[LeetCode] 1456. Maximum Number of Vowels in a Substring of Given Length</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1456/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/1456/</guid><pubDate>Tue, 25 Oct 2022 04:31:32 GMT</pubDate></item><item><title>[LeetCode] 定長 Sliding Window Pattern</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/pattern_1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/pattern_1/</guid><pubDate>Tue, 25 Oct 2022 04:31:32 GMT</pubDate></item><item><title>[LeetCode] Sliding Window and Double Pointer 科學刷題</title><link>https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/sliding_window_dblptr/</guid><pubDate>Tue, 25 Oct 2022 04:30:32 GMT</pubDate></item><item><title>[LeetCode] Catalog</title><link>https://intervalrain.github.io/posts/leetcode/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/</guid><pubDate>Tue, 25 Oct 2022 03:30:32 GMT</pubDate></item><item><title>[LeetCode] 分類清單</title><link>https://intervalrain.github.io/posts/leetcode_list/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode_list/</guid><pubDate>Tue, 25 Oct 2022 03:30:32 GMT</pubDate></item><item><title>[Problem] Version Query</title><link>https://intervalrain.github.io/posts/leetcode/versionquery/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/versionquery/</guid><pubDate>Thu, 20 Oct 2022 14:29:15 GMT</pubDate></item><item><title>[C++] Segment Tree</title><link>https://intervalrain.github.io/posts/c++/segtree/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/segtree/</guid><description>用 C++ 介紹資料結構線段樹</description><pubDate>Tue, 18 Oct 2022 15:14:38 GMT</pubDate></item><item><title>[C++] stringstream 類範例 - split 與 concat</title><link>https://intervalrain.github.io/posts/c++/stringstream/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/stringstream/</guid><description>C++ 中字拆的 split 實作與 concatenate 實作</description><pubDate>Thu, 13 Oct 2022 16:21:23 GMT</pubDate></item><item><title>[Algo] 0-1. 複雜度分析 Algorithmic complexity / Big-O / Asymptotic analysis</title><link>https://intervalrain.github.io/posts/cs/algo/bigo/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/algo/bigo/</guid><description>演算法的複雜度分析，與複雜度的表示法</description><pubDate>Thu, 06 Oct 2022 15:00:28 GMT</pubDate></item><item><title>[Algo] 0-4. 二叉樹(Binary Tree)</title><link>https://intervalrain.github.io/posts/cs/algo/binary_tree/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/algo/binary_tree/</guid><description>演算法思維，介紹二叉樹這種資料結構以及如何使用它與 Leetcode 相關範例介紹</description><pubDate>Thu, 06 Oct 2022 15:00:28 GMT</pubDate></item><item><title>[Algo] 0-3. 鏈表(Linked List)</title><link>https://intervalrain.github.io/posts/cs/algo/linked_list/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/algo/linked_list/</guid><description>演算法結構介紹，介紹鏈表的遍歷，與常見的經典考題與常用到的操作手法</description><pubDate>Thu, 06 Oct 2022 14:30:28 GMT</pubDate></item><item><title>[Algo] 0-2. 算法思維</title><link>https://intervalrain.github.io/posts/cs/algo/concept/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/algo/concept/</guid><description>演算法的思維，在深入 Leetcode 世界前的一些基礎引導</description><pubDate>Thu, 06 Oct 2022 14:15:28 GMT</pubDate></item><item><title>CS 學習筆記</title><link>https://intervalrain.github.io/posts/csindex/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/csindex/</guid><description>rainhu的資工學習筆記</description><pubDate>Thu, 06 Oct 2022 14:01:48 GMT</pubDate></item><item><title>[DS] 演算法筆記</title><link>https://intervalrain.github.io/posts/cs/algo/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/algo/</guid><description>演算法筆記，提供各式各樣的程式設計演算法，並以 leetcode 題目或是實際案例出發，介紹並分析解法。</description><pubDate>Thu, 06 Oct 2022 14:00:28 GMT</pubDate></item><item><title>[IT] 動態鏈結庫(DDL)</title><link>https://intervalrain.github.io/posts/it/ddl/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/ddl/</guid><description>Command to construct DDL</description><pubDate>Sun, 18 Sep 2022 14:45:56 GMT</pubDate></item><item><title>[IT] MySQL Functions</title><link>https://intervalrain.github.io/posts/it/mysql/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/mysql/</guid><description>Built-in function in MySQL</description><pubDate>Thu, 01 Sep 2022 05:28:14 GMT</pubDate></item><item><title>[IT] SQL</title><link>https://intervalrain.github.io/posts/it/sql/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/sql/</guid><description>Base command of SQL</description><pubDate>Thu, 01 Sep 2022 05:28:14 GMT</pubDate></item><item><title>[Leetcode] 347. Top K Frequent Elements</title><link>https://intervalrain.github.io/posts/leetcode/347/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/347/</guid><pubDate>Sat, 23 Jul 2022 15:48:15 GMT</pubDate></item><item><title>[Life] July&apos;s plan</title><link>https://intervalrain.github.io/posts/life/prepare/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/life/prepare/</guid><description>Study plan for July</description><pubDate>Sat, 16 Jul 2022 09:48:09 GMT</pubDate></item><item><title>[統計] 統計學概要</title><link>https://intervalrain.github.io/posts/device/statistics/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/device/statistics/</guid><description>用自身工經驗簡述實務上應用的統計學</description><pubDate>Sat, 09 Jul 2022 12:02:28 GMT</pubDate></item><item><title>[CA] 記憶體</title><link>https://intervalrain.github.io/posts/cs/ca/memory/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/ca/memory/</guid><pubDate>Sat, 02 Jul 2022 17:54:06 GMT</pubDate></item><item><title>[CA] Pipeline</title><link>https://intervalrain.github.io/posts/cs/ca/pipeline/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/ca/pipeline/</guid><pubDate>Sat, 02 Jul 2022 17:54:02 GMT</pubDate></item><item><title>[CA] 處理器</title><link>https://intervalrain.github.io/posts/cs/ca/processor/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/ca/processor/</guid><pubDate>Sat, 02 Jul 2022 17:54:02 GMT</pubDate></item><item><title>[CA] 計算機算術</title><link>https://intervalrain.github.io/posts/cs/ca/arithmetic/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/ca/arithmetic/</guid><pubDate>Sat, 02 Jul 2022 17:53:50 GMT</pubDate></item><item><title>[CA] 指令集架構</title><link>https://intervalrain.github.io/posts/cs/ca/isa/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/ca/isa/</guid><pubDate>Sat, 02 Jul 2022 17:53:45 GMT</pubDate></item><item><title>[作業系統] 計算機組織與結構</title><link>https://intervalrain.github.io/posts/cs/ca/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/ca/</guid><pubDate>Sat, 02 Jul 2022 17:39:35 GMT</pubDate></item><item><title>CPU 個數、CPU 核心數、CPU 執行緒數</title><link>https://intervalrain.github.io/posts/cs/os/cpucorethread/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/os/cpucorethread/</guid><description>Introduction to CPU, core and thread</description><pubDate>Sat, 02 Jul 2022 13:43:15 GMT</pubDate></item><item><title>[作業系統] 計算機作業系統</title><link>https://intervalrain.github.io/posts/cs/os/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/os/</guid><pubDate>Fri, 01 Jul 2022 20:00:55 GMT</pubDate></item><item><title>[計算機作業系統] 死鎖</title><link>https://intervalrain.github.io/posts/cs/os/deadlock/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/os/deadlock/</guid><pubDate>Fri, 01 Jul 2022 20:00:55 GMT</pubDate></item><item><title>[計算機作業系統] 設備管理</title><link>https://intervalrain.github.io/posts/cs/os/equipmentmanagement/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/os/equipmentmanagement/</guid><pubDate>Fri, 01 Jul 2022 20:00:55 GMT</pubDate></item><item><title>[計算機作業系統] 概述</title><link>https://intervalrain.github.io/posts/cs/os/intro/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/os/intro/</guid><pubDate>Fri, 01 Jul 2022 20:00:55 GMT</pubDate></item><item><title>[計算機作業系統] 鏈接</title><link>https://intervalrain.github.io/posts/cs/os/link/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/os/link/</guid><pubDate>Fri, 01 Jul 2022 20:00:55 GMT</pubDate></item><item><title>[計算機作業系統] 記憶體管理</title><link>https://intervalrain.github.io/posts/cs/os/memorymanagement/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/os/memorymanagement/</guid><pubDate>Fri, 01 Jul 2022 20:00:55 GMT</pubDate></item><item><title>[計算機作業系統] 進程管理</title><link>https://intervalrain.github.io/posts/cs/os/processmanagement/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/os/processmanagement/</guid><pubDate>Fri, 01 Jul 2022 20:00:55 GMT</pubDate></item><item><title>[ML] introduction</title><link>https://intervalrain.github.io/posts/ml/lec0/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/ml/lec0/</guid><description>Introduction to Machine Learning</description><pubDate>Sun, 19 Jun 2022 10:18:52 GMT</pubDate></item><item><title>[Life] Some change of road to SWE</title><link>https://intervalrain.github.io/posts/life/nikita_kothari/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/life/nikita_kothari/</guid><description>Suggestion from Nikita Kothari at LinkedIn</description><pubDate>Tue, 14 Jun 2022 14:43:59 GMT</pubDate></item><item><title>[C++] The C++ Standard Template Library(STL) - deque</title><link>https://intervalrain.github.io/posts/c++/stl_deque/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/stl_deque/</guid><description>C++ 中 STL 的 deque 函式與使用範例</description><pubDate>Sat, 11 Jun 2022 17:36:18 GMT</pubDate></item><item><title>[C++] Custom Comparator</title><link>https://intervalrain.github.io/posts/c++/custom_comparator/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/custom_comparator/</guid><description>C++ 中陣列與優先佇列的自定義排序使用方法</description><pubDate>Sat, 11 Jun 2022 02:07:49 GMT</pubDate></item><item><title>[C++] The C++ Standard Template Library(STL) - pair</title><link>https://intervalrain.github.io/posts/c++/stl_pair/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/stl_pair/</guid><description>C++ 中 STL 的 pair 的函式與使用範例</description><pubDate>Wed, 01 Jun 2022 17:23:15 GMT</pubDate></item><item><title>[VHDL] HDLbits 1 - Getting Started</title><link>https://intervalrain.github.io/posts/verilog/hdlbits1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/verilog/hdlbits1/</guid><description>Verilog tutorial</description><pubDate>Fri, 27 May 2022 16:10:20 GMT</pubDate></item><item><title>[VHDL] HDLbits 2 - Verilog Language</title><link>https://intervalrain.github.io/posts/verilog/hdlbits2/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/verilog/hdlbits2/</guid><description>Verilog tutorial</description><pubDate>Fri, 27 May 2022 16:10:20 GMT</pubDate></item><item><title>[VHDL] HDLbits 3 - Circuits</title><link>https://intervalrain.github.io/posts/verilog/hdlbits3/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/verilog/hdlbits3/</guid><description>Verilog tutorial</description><pubDate>Fri, 27 May 2022 16:10:20 GMT</pubDate></item><item><title>[VHDL] HDLbits 4 - Verification: Reading Simulations</title><link>https://intervalrain.github.io/posts/verilog/hdlbits4/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/verilog/hdlbits4/</guid><description>Verilog tutorial</description><pubDate>Fri, 27 May 2022 16:10:20 GMT</pubDate></item><item><title>[VHDL] HDLbits 5 - Verification: Writing Testbenches</title><link>https://intervalrain.github.io/posts/verilog/hdlbits5/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/verilog/hdlbits5/</guid><description>Verilog tutorial</description><pubDate>Fri, 27 May 2022 16:10:20 GMT</pubDate></item><item><title>[VHDL] HDLbits 6 - CS450</title><link>https://intervalrain.github.io/posts/verilog/hdlbits6/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/verilog/hdlbits6/</guid><description>Verilog tutorial</description><pubDate>Fri, 27 May 2022 16:10:20 GMT</pubDate></item><item><title>[TCAD] 模擬收斂問題</title><link>https://intervalrain.github.io/posts/device/simulationconvergece/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/device/simulationconvergece/</guid><description>TCAD simulation convergence problem</description><pubDate>Wed, 25 May 2022 14:52:15 GMT</pubDate></item><item><title>[VHDL] Verilog Hardware Description Language</title><link>https://intervalrain.github.io/posts/verilog/intro/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/verilog/intro/</guid><description>computer, computer languages, digital systems, electronic systems, hardware, hardward description languages, hardware design, HDL, PLI, programming language interface, Verilog, Verilog HDL, Verilog PL</description><pubDate>Sun, 01 May 2022 09:37:22 GMT</pubDate></item><item><title>[Java] 淺談 Java MVC</title><link>https://intervalrain.github.io/posts/java/java_mvc/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/java/java_mvc/</guid><description>Introduction to Java MVC.</description><pubDate>Fri, 29 Apr 2022 07:38:18 GMT</pubDate></item><item><title>[IT] Introduction to Microservices, Docker and Kubernetes</title><link>https://intervalrain.github.io/posts/it/microservices_docker_kubernetes/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/microservices_docker_kubernetes/</guid><description>Desc Text.</description><pubDate>Fri, 29 Apr 2022 03:40:10 GMT</pubDate></item><item><title>[C++] The C++ Standard Template Library(STL) - map</title><link>https://intervalrain.github.io/posts/c++/stl_map/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/stl_map/</guid><description>C++ 中 STL 的 map 的函式與使用範例</description><pubDate>Sat, 23 Apr 2022 14:24:21 GMT</pubDate></item><item><title>[Java] HashMap中的hashCode設計原理</title><link>https://intervalrain.github.io/posts/java/hashmap/hashcode/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/java/hashmap/hashcode/</guid><description>why hashcode &gt;&gt;&gt; 16</description><pubDate>Fri, 22 Apr 2022 03:22:39 GMT</pubDate></item><item><title>[C++] 易錯題目收集</title><link>https://intervalrain.github.io/posts/c++/question/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/question/</guid><description>網路上 C++ 易錯的題目收集</description><pubDate>Sun, 17 Apr 2022 09:34:39 GMT</pubDate></item><item><title>[C++] The C++ Standard Template Library(STL) - list, forward_list</title><link>https://intervalrain.github.io/posts/c++/stl_list/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/stl_list/</guid><description>C++ 中 STL 的 list 的函式與使用範例</description><pubDate>Sun, 17 Apr 2022 03:45:58 GMT</pubDate></item><item><title>[C++] The C++ Standard Template Library(STL) - vector</title><link>https://intervalrain.github.io/posts/c++/stl_vector/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/stl_vector/</guid><description>C++ 中 STL 的 vector 的函式與使用範例</description><pubDate>Sat, 16 Apr 2022 14:08:37 GMT</pubDate></item><item><title>[C++] The C++ Standard Template Library(STL) - Container</title><link>https://intervalrain.github.io/posts/c++/stl_container/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/stl_container/</guid><description>C++</description><pubDate>Thu, 14 Apr 2022 17:09:18 GMT</pubDate></item><item><title>[IDAS+] Optimize Summary Table Function</title><link>https://intervalrain.github.io/posts/vba/idas_record/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/vba/idas_record/</guid><description>An implementation of dictionary in VBA for searching algorithm</description><pubDate>Wed, 13 Apr 2022 16:39:50 GMT</pubDate></item><item><title>[C++] 如何產生 random 值</title><link>https://intervalrain.github.io/posts/c++/random/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/random/</guid><description>C++ 中如何產生隨機值</description><pubDate>Wed, 13 Apr 2022 16:26:23 GMT</pubDate></item><item><title>[C++] Cout functions</title><link>https://intervalrain.github.io/posts/c++/cout/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/cout/</guid><description>C++ 的 cout 函式介紹</description><pubDate>Fri, 08 Apr 2022 02:20:38 GMT</pubDate></item><item><title>[C++] The C++ Standard Template Library(STL) - Algorithm</title><link>https://intervalrain.github.io/posts/c++/stl_algo/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/stl_algo/</guid><description>C++ 中 STL 中的 algorithm lib 的函式與範例</description><pubDate>Wed, 06 Apr 2022 08:04:36 GMT</pubDate></item><item><title>[C++] The C++ Standard Template Library(STL)</title><link>https://intervalrain.github.io/posts/c++/stl/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/stl/</guid><description>C++ 中 STL 的介紹</description><pubDate>Mon, 04 Apr 2022 17:09:42 GMT</pubDate></item><item><title>[C++] STL: Vector 的使用與實作</title><link>https://intervalrain.github.io/posts/c++/vector/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/vector/</guid><description>C++ 中 STL 的 vector 的用法整理</description><pubDate>Sun, 03 Apr 2022 10:14:14 GMT</pubDate></item><item><title>[TCAD] 工具語言</title><link>https://intervalrain.github.io/posts/device/tcad/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/device/tcad/</guid><description>TCAD learning notes</description><pubDate>Sat, 26 Mar 2022 13:46:26 GMT</pubDate></item><item><title>[CA] 計算機的抽象化與科技</title><link>https://intervalrain.github.io/posts/cs/ca/abstraction/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs/ca/abstraction/</guid><pubDate>Wed, 23 Mar 2022 17:12:11 GMT</pubDate></item><item><title>[Leetcode] Maximum Frequency Stack 最大頻率堆疊</title><link>https://intervalrain.github.io/posts/leetcode/freqstack/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/leetcode/freqstack/</guid><description>Maximum Frequency Stack algorithm</description><pubDate>Sat, 19 Mar 2022 08:53:23 GMT</pubDate></item><item><title>[Java] 面試常見問題</title><link>https://intervalrain.github.io/posts/java/interviewq/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/java/interviewq/</guid><description>針對Java常見面試考題整理，持續更新。</description><pubDate>Tue, 15 Mar 2022 18:45:45 GMT</pubDate></item><item><title>[CS50] Lec 1 - C</title><link>https://intervalrain.github.io/posts/cs50/lec1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs50/lec1/</guid><description>Introduction to programming language C</description><pubDate>Wed, 09 Mar 2022 18:39:12 GMT</pubDate></item><item><title>[Java] transient 關鍵字</title><link>https://intervalrain.github.io/posts/java/transient/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/java/transient/</guid><description>Introduction to keyword transient</description><pubDate>Tue, 08 Mar 2022 15:53:27 GMT</pubDate></item><item><title>[Device] Mismatch Introduction</title><link>https://intervalrain.github.io/posts/device/mismatch/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/device/mismatch/</guid><description>Device mismatch intro.</description><pubDate>Sat, 05 Mar 2022 13:40:03 GMT</pubDate></item><item><title>[C++] How to Initialize vector in C++</title><link>https://intervalrain.github.io/posts/c++/newvector/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/c++/newvector/</guid><description>C++ 中 vector 的初始化</description><pubDate>Wed, 02 Mar 2022 17:33:02 GMT</pubDate></item><item><title>[Java] Integer.bitCount 解析</title><link>https://intervalrain.github.io/posts/java/bitcount/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/java/bitcount/</guid><description>Desc Text.</description><pubDate>Tue, 01 Mar 2022 12:37:02 GMT</pubDate></item><item><title>[OS] Lec 1 - Introduction</title><link>https://intervalrain.github.io/posts/os/lec1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/os/lec1/</guid><description>概觀作業系統的歷史發展與進程</description><pubDate>Wed, 23 Feb 2022 18:43:30 GMT</pubDate></item><item><title>[Java] Java 的中 HashMap.comparableClassFor(Object x) 的函式解讀</title><link>https://intervalrain.github.io/posts/java/hashmap/hashmap/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/java/hashmap/hashmap/</guid><description>認識泛型 generic type、類別 class</description><pubDate>Tue, 22 Feb 2022 17:36:40 GMT</pubDate></item><item><title>[CS50] Lec 0 - Introduction to Computer Science</title><link>https://intervalrain.github.io/posts/cs50/lec0/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/cs50/lec0/</guid><description>Intoduction to Computer Science</description><pubDate>Tue, 22 Feb 2022 16:43:18 GMT</pubDate></item><item><title>[IT] 在 GitHub Pages 中渲染 KaTex 公式</title><link>https://intervalrain.github.io/posts/it/latexrendering/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/it/latexrendering/</guid><description>如何讓 GitHub Pages 中支援 Latex 語法</description><pubDate>Mon, 21 Feb 2022 17:38:30 GMT</pubDate></item><item><title>[Device] Ring Oscillator 環形振盪器</title><link>https://intervalrain.github.io/posts/device/ringoscillator/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/device/ringoscillator/</guid><description>A ring circuit with an odd numbers of inverters</description><pubDate>Sun, 20 Feb 2022 17:29:24 GMT</pubDate></item><item><title>[Java] List of list of something equality</title><link>https://intervalrain.github.io/posts/java/listequal/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/java/listequal/</guid><description>Common Test methodology in Leetcode</description><pubDate>Fri, 18 Feb 2022 00:59:45 GMT</pubDate></item><item><title>Hello World</title><link>https://intervalrain.github.io/posts/helloworld/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/helloworld/</guid><description>How to hello world?</description><pubDate>Thu, 17 Feb 2022 07:15:36 GMT</pubDate></item><item><title>[Logic Design] Lec 01 - 數字系統與轉換</title><link>https://intervalrain.github.io/posts/logicdesign/lec1/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/logicdesign/lec1/</guid><description>Introduction to number systems in computer</description><pubDate>Fri, 17 Sep 2021 19:11:35 GMT</pubDate></item><item><title>[Logic Design] Lec 10 - 暫存器與計數器</title><link>https://intervalrain.github.io/posts/logicdesign/lec10/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/logicdesign/lec10/</guid><description>Registers and Counters</description><pubDate>Fri, 17 Sep 2021 19:11:35 GMT</pubDate></item><item><title>[Logic Design] Lec 11 - 創建圖表與設計電路</title><link>https://intervalrain.github.io/posts/logicdesign/lec11/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/logicdesign/lec11/</guid><description>Derivation of State Graph and Table</description><pubDate>Fri, 17 Sep 2021 19:11:35 GMT</pubDate></item><item><title>[Logic Design] Lec 12 - 電路實現與簡化</title><link>https://intervalrain.github.io/posts/logicdesign/lec12/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/logicdesign/lec12/</guid><description>Reduction of State Table/State Assignment</description><pubDate>Fri, 17 Sep 2021 19:11:35 GMT</pubDate></item><item><title>[Logic Design] Lec 02 - 布林代數</title><link>https://intervalrain.github.io/posts/logicdesign/lec2/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/logicdesign/lec2/</guid><description>Boolean Algebra operation and theory</description><pubDate>Fri, 17 Sep 2021 19:11:35 GMT</pubDate></item><item><title>[Logic Design] Lec 03 - Minterm 與 Maxterm 展開</title><link>https://intervalrain.github.io/posts/logicdesign/lec3/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/logicdesign/lec3/</guid><description>Minterm and Maxterm expression</description><pubDate>Fri, 17 Sep 2021 19:11:35 GMT</pubDate></item><item><title>[Logic Design] Lec 04 - 卡諾圖 Karnaugh Maps</title><link>https://intervalrain.github.io/posts/logicdesign/lec4/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/logicdesign/lec4/</guid><description>Simplify Boolean function with K-map</description><pubDate>Fri, 17 Sep 2021 19:11:35 GMT</pubDate></item><item><title>[Logic Design] Lec 05 - Quine-McClusky Method</title><link>https://intervalrain.github.io/posts/logicdesign/lec5/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/logicdesign/lec5/</guid><description>Quine-McClusky method - systematic method to simplify boolean algebra for computer.</description><pubDate>Fri, 17 Sep 2021 19:11:35 GMT</pubDate></item><item><title>[Logic Design] Lec 06 - Multi-Level Gate Circuits / NAND and NOR Gates</title><link>https://intervalrain.github.io/posts/logicdesign/lec6/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/logicdesign/lec6/</guid><description>Multi-level gate circuits. nand gates and nor gates introduction.</description><pubDate>Fri, 17 Sep 2021 19:11:35 GMT</pubDate></item><item><title>[Logic Design] Lec 07 - 組合電路設計與模擬</title><link>https://intervalrain.github.io/posts/logicdesign/lec7/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/logicdesign/lec7/</guid><description>Combinational Circuit Design and Simulation Using Gates</description><pubDate>Fri, 17 Sep 2021 19:11:35 GMT</pubDate></item><item><title>[Logic Design] Lec 08 - 多工器、編碼器、可程式化邏輯元件</title><link>https://intervalrain.github.io/posts/logicdesign/lec8/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/logicdesign/lec8/</guid><description>Combinational Circuit Design and Simulation</description><pubDate>Fri, 17 Sep 2021 19:11:35 GMT</pubDate></item><item><title>[Logic Design] Lec 09 - Flips-FLops</title><link>https://intervalrain.github.io/posts/logicdesign/lec9/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/logicdesign/lec9/</guid><description>Flips-Flops</description><pubDate>Fri, 17 Sep 2021 19:11:35 GMT</pubDate></item><item><title>[Washam] Way to SWE</title><link>https://intervalrain.github.io/posts/washam/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/washam/</guid><description>a study plan to be a software engineer</description><pubDate>Sat, 25 May 2019 14:35:48 GMT</pubDate></item><item><title>[創作] 關於未來</title><link>https://intervalrain.github.io/posts/music/about_future/</link><guid isPermaLink="true">https://intervalrain.github.io/posts/music/about_future/</guid><pubDate>Thu, 13 Mar 2014 16:01:46 GMT</pubDate></item></channel></rss>