<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Ryan Yang on Medium]]></title>
        <description><![CDATA[Stories by Ryan Yang on Medium]]></description>
        <link>https://medium.com/@ryanyang1221?source=rss-747aa9768a2b------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/2*XAin1MhfOg6xko_Z5L6Sow.jpeg</url>
            <title>Stories by Ryan Yang on Medium</title>
            <link>https://medium.com/@ryanyang1221?source=rss-747aa9768a2b------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Thu, 19 Nov 2026 13:12:45 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@ryanyang1221/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[ETL vs ELT]]></title>
            <link>https://medium.com/@ryanyang1221/etl-vs-elt-a3a68939ff07?source=rss-747aa9768a2b------2</link>
            <guid isPermaLink="false">https://medium.com/p/a3a68939ff07</guid>
            <category><![CDATA[etl]]></category>
            <dc:creator><![CDATA[Ryan Yang]]></dc:creator>
            <pubDate>Wed, 03 Mar 2021 18:12:07 GMT</pubDate>
            <atom:updated>2021-03-03T18:12:07.139Z</atom:updated>
            <content:encoded><![CDATA[<p>(不斷更新)</p><p>今天如果假設某個 Service 要 Train Model，他的資料來源可能是從很多服務背後的資料源而來 (microservices)，那就要想辦法先集合在一個 DB 或 Data Warehouse，再後續由例如 Spark 提取來做 Training。在 AI 的情境下，通常一般的 ETL 工具也很難做到複雜的 T，使得一開始就 T 的需求下降。而不同的應用，可能會需要不同的 ETL，導致 Source 被提取多次，且若需求改變，ETL 也需要花上一些力氣去修改。如果先把數據集中在某處，也就是 ELT，則可以降低對於源頭的壓力，例如 HBase，再根據需求進行存取後去做後續例如 Training。這樣子的重點就不再是在 T 身上，而是一個分散式的計算集群來作後續的事。</p><p>而 ETL 也要預先知道需求，不然不知道怎麼轉換，當出現問題的時候，也必須要重新來過， Analyst 也因為無法掌握 Transform 的過程邏輯，無法協助解決問題，也導致比較多的溝通成本。如果是 ELT，歸功於 Cloud Data Warehouse 的興起，例如 BigQuery、Redshift、Snowflake 等等，我們可以在需求產生的時候，直接在 Data Warehouse 上進行轉換，而以 SQL 的方式對於 Analyst 又更加友善。</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=a3a68939ff07" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[後端儲存小筆記 — 以電商為例]]></title>
            <link>https://medium.com/@ryanyang1221/%E5%BE%8C%E7%AB%AF%E5%84%B2%E5%AD%98%E5%B0%8F%E7%AD%86%E8%A8%98-%E4%BB%A5%E9%9B%BB%E5%95%86%E7%82%BA%E4%BE%8B-ab148a840a51?source=rss-747aa9768a2b------2</link>
            <guid isPermaLink="false">https://medium.com/p/ab148a840a51</guid>
            <category><![CDATA[software-development]]></category>
            <category><![CDATA[backend]]></category>
            <dc:creator><![CDATA[Ryan Yang]]></dc:creator>
            <pubDate>Wed, 03 Mar 2021 14:37:48 GMT</pubDate>
            <atom:updated>2021-03-03T16:58:19.881Z</atom:updated>
            <content:encoded><![CDATA[<h3>後端儲存小筆記 — 以電商為例</h3><p>(不斷更新)</p><p>“凡是那些讓你付出巨大代價的幾乎都是儲存系統的問題。通俗點說，你系統業務功能的最終結果就是數據。”</p><p>“以主鍵約束來實現例如訂單的冪等性(全局唯一訂單號)” (手滑手抖掰掰)</p><p>“以版本號來實現例如更新訂單的冪等性”</p><p>“不變的商品資訊放 MySQL + Redis、會變得商品參數放 Mongo + Redis、圖片影像放 Object Storage + CDN、靜態網頁放 CDN”</p><p>“購物車的場景可分為未登入以及登入後的購物車，未登入可以 Cookie 或 LocalStorage 存放，已登入之購物車可存放在 Mysql 或 Redis (可靠性彈性與性能的取捨)，登入後合併此兩購物車”</p><p>“以帳戶系統，ACID 是理想，犧牲 CI 來換取效能 (Read committed or Read repeatable-read)，另外增加一流水號並以 Where 條件來確保更新時不至於更新到已經更新後的值 (檢查更新成功不是看成不成功，而是更新 1 行不是 0 行唷)，而為了確保可追溯性，過程都要記錄下來，而非只是當前狀態 (event sourcing)”</p><p>“當分布式事務需要強一致性時用 2PC，但犧牲效能 (大家都準備好了一起提交!)。但若只需要最終一致性，可採用事務消息 (MQ)，也就是消息也可以被提交/ 回滾。無論是哪種，其實都是將分布式拆分成多個本地事務。本地事務以 DB 解決，那分布式事務則專注於如何讓這些本地事務保持一致。”</p><p>“MySQL 是不適合全文搜尋的，此時 index 就沒有作用了，而 ElasticSearch 將字詞做成 inverted index，並將字詞做成 Search Tree，這樣就把一個全文搜尋轉換成了對樹的搜尋。但寫入的效能當然就不如寫入 MySQL 的 B+ Tree 了，別拿來做交易系統了”</p><p>“MySQL 備份可以全量備份 + BinLog 的增量備份搭配，而 MySQL HA 也是個在日常就做到異地備份的方式 (同步 (效能差)/異步 (都資料) 複製，手動 (資料可控)/ 自動 (高可用) 切換)”</p><p>“利用 Redis 保護 MySQL，Cache Aside 的方式比 R/W Through 比起能避免髒數據，但都要小心雪崩問題：假使是初始化，可採取灰度或是預熱。也可以緩存所有資料，定期以背景程式更新”</p><p>“監控事件、點擊事件、日誌等等，是海量中的海量， 一種方式是先儲存再計算，放到特定資料庫給後續查詢。而這些海量數據第一要求是超效能的寫入與讀取，Kafka 是個很好的選擇 (不要把他當單純的 MQ，可是號稱分布式流數據平台呀)，但受限於 Partition 的容量限制 (該本機的容量)，若要無限容量，可考慮 HDFS，但效能較差，但配合像 Hive 能得到比 Kafka 更強大的查詢功能。如果是 Time Series 則可考慮像 InfluxDB。(Apache BookKeeper?)”</p><p>“海量數據查詢？假設透過 Streaming 計算、Batch 計算後仍然是海量數據。GB 量級仍然可以考慮 MySQL，如果超過了可以選擇像是 HBase、Cassandra、ClickHouse，效能提升，但查詢沒那麼靈活，需要變成他們的形狀，了解他們的脾氣。ElasticSearch 也可以，但需要較大的硬體成本，因為需要大內存。所以超過 TB 級的，瓶頸已經是在 IO 了，還是定期聚合計算為佳。換個角度，應該是根據查詢來選擇系統，而非希望一個單一系統來解決所有問題。儲存系統沒有銀彈，不要指望單一就可以解決數據量大，查詢慢的問題。即使是同樣一份數據，也要根據不同的查詢需求，組織成不同的數據結構，存放在適合的儲存系統中，才能在每一種業務中都達到理想的查詢效能。”</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=ab148a840a51" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Leetcode Challenge in June 六月挑戰題目講解總整理！面試必看！]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-snippet">&#x516D;&#x6708;&#x7684; Leetcode Challenge&#x2026;</p><p class="medium-feed-link"><a href="https://medium.com/@ryanyang1221/leetcode-challenge-in-june-%E5%85%AD%E6%9C%88%E6%8C%91%E6%88%B0%E9%A1%8C%E7%9B%AE%E8%AC%9B%E8%A7%A3%E7%B8%BD%E6%95%B4%E7%90%86-%E9%9D%A2%E8%A9%A6%E5%BF%85%E7%9C%8B-bf91bd055797?source=rss-747aa9768a2b------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@ryanyang1221/leetcode-challenge-in-june-%E5%85%AD%E6%9C%88%E6%8C%91%E6%88%B0%E9%A1%8C%E7%9B%AE%E8%AC%9B%E8%A7%A3%E7%B8%BD%E6%95%B4%E7%90%86-%E9%9D%A2%E8%A9%A6%E5%BF%85%E7%9C%8B-bf91bd055797?source=rss-747aa9768a2b------2</link>
            <guid isPermaLink="false">https://medium.com/p/bf91bd055797</guid>
            <category><![CDATA[30-day-leetcode-challenge]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[python]]></category>
            <category><![CDATA[leetcode]]></category>
            <dc:creator><![CDATA[Ryan Yang]]></dc:creator>
            <pubDate>Fri, 03 Jul 2020 10:38:59 GMT</pubDate>
            <atom:updated>2020-07-03T10:41:19.307Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Leetcode Challenge: Word Search II (6/30)]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@ryanyang1221/leetcode-challenge-word-search-ii-6-30-77e88cc6e517?source=rss-747aa9768a2b------2"><img src="https://cdn-images-1.medium.com/max/1804/1*amcfko5w2WQHgBSYtyRaWQ.png" width="1804"></a></p><p class="medium-feed-snippet">&#x4ECA;&#x5929; 6/30 &#x865F;&#x7684;&#x984C;&#x76EE;&#x662F; Word Search II&#xFF0C;&#x662F;&#x4E00;&#x984C; Hard &#x7684;&#x984C;&#x76EE;&#xFF0C;&#x51FA;&#x8655;&#x662F; &#x2116;212 (https://leetcode.com/problems/word-search-ii/)&#xFF0C;&#x5C31;&#x8B93;&#x6211;&#x5011;&#x4E00;&#x8D77;&#x4F86;&#x770B;&#x770B;&#x5427;&#xFF01;&#x984C;&#x76EE;&#x5982;&#x4E0B;&#x3002;&#x7C21;&#x55AE;&#x4F86;&#x8AAA;&#x5C31;&#x662F;&#x5F9E;&#x4E00;&#x500B;&#x4E8C;&#x7DAD;&#x7684;&#x5B57;&#x6BCD;&#x9663;&#x5217;&#x88E1;&#xFF0C;&#x770B;&#x2026;</p><p class="medium-feed-link"><a href="https://medium.com/@ryanyang1221/leetcode-challenge-word-search-ii-6-30-77e88cc6e517?source=rss-747aa9768a2b------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@ryanyang1221/leetcode-challenge-word-search-ii-6-30-77e88cc6e517?source=rss-747aa9768a2b------2</link>
            <guid isPermaLink="false">https://medium.com/p/77e88cc6e517</guid>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[python]]></category>
            <category><![CDATA[30-day-leetcode-challenge]]></category>
            <category><![CDATA[trie]]></category>
            <dc:creator><![CDATA[Ryan Yang]]></dc:creator>
            <pubDate>Fri, 03 Jul 2020 09:34:39 GMT</pubDate>
            <atom:updated>2020-07-03T09:36:29.091Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Leetcode Challenge: Unique Paths 系列 (6/29)]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@ryanyang1221/leetcode-challenge-unique-paths-%E7%B3%BB%E5%88%97%E5%A4%A7%E6%94%BE%E9%80%81-%E4%B8%8A-6-29-72dda9072ee1?source=rss-747aa9768a2b------2"><img src="https://cdn-images-1.medium.com/max/1802/1*ha_Z1kvhTuMrBcS7aHtN7w.png" width="1802"></a></p><p class="medium-feed-snippet">&#x4ECA;&#x5929;&#x7684;&#x984C;&#x76EE;&#x662F; Unique Paths&#xFF0C;&#x800C;&#x9019;&#x984C;&#x5728; Leetcode &#x4E0A;&#x53C8;&#x662F;&#x6709;&#x4E00;&#x7CFB;&#x5217;&#x7684;&#x984C;&#x76EE;&#x56C9;&#xFF01;&#x5206;&#x5225;&#x662F; Unique Paths I, II, III&#xFF0C;&#x4E00;&#x6A23;&#x901A;&#x901A;&#x628A;&#x4F60;&#x6559;&#x5230;&#x6703;&#x56C9;&#xFF01;</p><p class="medium-feed-link"><a href="https://medium.com/@ryanyang1221/leetcode-challenge-unique-paths-%E7%B3%BB%E5%88%97%E5%A4%A7%E6%94%BE%E9%80%81-%E4%B8%8A-6-29-72dda9072ee1?source=rss-747aa9768a2b------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@ryanyang1221/leetcode-challenge-unique-paths-%E7%B3%BB%E5%88%97%E5%A4%A7%E6%94%BE%E9%80%81-%E4%B8%8A-6-29-72dda9072ee1?source=rss-747aa9768a2b------2</link>
            <guid isPermaLink="false">https://medium.com/p/72dda9072ee1</guid>
            <category><![CDATA[30-day-leetcode-challenge]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[python]]></category>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[dynamic-programming]]></category>
            <dc:creator><![CDATA[Ryan Yang]]></dc:creator>
            <pubDate>Thu, 02 Jul 2020 11:36:44 GMT</pubDate>
            <atom:updated>2020-07-02T15:13:38.501Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Leetcode Challenge: Reconstruct Itinerary (6/28)]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@ryanyang1221/leetcode-challenge-reconstruct-itinerary-6-28-b56cf6e2d73a?source=rss-747aa9768a2b------2"><img src="https://cdn-images-1.medium.com/max/1842/1*YMortx5sWuSjlHxtA5s2Hw.png" width="1842"></a></p><p class="medium-feed-snippet">&#x4ECA;&#x5929; 6/28 &#x865F;&#x7684;&#x984C;&#x76EE;&#x662F; Reconstruct Itinerary&#xFF0C;&#x51FA;&#x8655;&#x662F; &#x2116;332 (https://leetcode.com/problems/reconstruct-itinerary/)&#xFF0C;&#x662F;&#x4E00;&#x9053; Medium &#x7684;&#x984C;&#x76EE;&#x3002;&#x984C;&#x76EE;&#x5982;&#x4E0B;&#x3002;&#x984C;&#x76EE;&#x7684;&#x5927;&#x610F;&#x662F;&#xFF0C;Input List&#x2026;</p><p class="medium-feed-link"><a href="https://medium.com/@ryanyang1221/leetcode-challenge-reconstruct-itinerary-6-28-b56cf6e2d73a?source=rss-747aa9768a2b------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@ryanyang1221/leetcode-challenge-reconstruct-itinerary-6-28-b56cf6e2d73a?source=rss-747aa9768a2b------2</link>
            <guid isPermaLink="false">https://medium.com/p/b56cf6e2d73a</guid>
            <category><![CDATA[python]]></category>
            <category><![CDATA[backtracking]]></category>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[dfs]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[Ryan Yang]]></dc:creator>
            <pubDate>Tue, 30 Jun 2020 17:47:01 GMT</pubDate>
            <atom:updated>2020-06-30T17:47:01.375Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Leetcode Challenge: Perfect Squares (6/27)]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@ryanyang1221/leetcode-challenge-perfect-squares-6-27-b507d2b8ffac?source=rss-747aa9768a2b------2"><img src="https://cdn-images-1.medium.com/max/1838/1*e13LnZkIAkCVXMBh3gec3w.png" width="1838"></a></p><p class="medium-feed-snippet">&#x4ECA;&#x5929; 6/27 &#x865F;&#x7684;&#x984C;&#x76EE;&#x662F; Perfect Squares&#xFF0C;&#x51FA;&#x8655;&#x662F; &#x2116;279 (https://leetcode.com/problems/perfect-squares/)&#xFF0C;&#x662F;&#x4E00;&#x9053; Medium &#x7684;&#x984C;&#x76EE;&#x3002;&#x984C;&#x76EE;&#x5982;&#x4E0B;&#x3002;&#x5C31;&#x662F;&#x6C42;&#x67D0;&#x6578;&#x6700;&#x5C11;&#x53EF;&#x4EE5;&#x7528;&#x591A;&#x5C11;&#x500B;&#x5E73;&#x65B9;&#x6578;&#x76F8;&#x52A0;&#x4F86;&#x5F97;&#x5230;&#x5462;&#xFF1F;</p><p class="medium-feed-link"><a href="https://medium.com/@ryanyang1221/leetcode-challenge-perfect-squares-6-27-b507d2b8ffac?source=rss-747aa9768a2b------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@ryanyang1221/leetcode-challenge-perfect-squares-6-27-b507d2b8ffac?source=rss-747aa9768a2b------2</link>
            <guid isPermaLink="false">https://medium.com/p/b507d2b8ffac</guid>
            <category><![CDATA[30-day-leetcode-challenge]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[python]]></category>
            <category><![CDATA[dynamic-programming]]></category>
            <category><![CDATA[leetcode]]></category>
            <dc:creator><![CDATA[Ryan Yang]]></dc:creator>
            <pubDate>Sun, 28 Jun 2020 10:04:34 GMT</pubDate>
            <atom:updated>2020-06-28T10:04:34.430Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Leetcode Challenge: Sum Root to Leaf Numbers (6/26)]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@ryanyang1221/leetcode-challenge-sum-root-to-leaf-numbers-6-26-9c8b1e8a6d08?source=rss-747aa9768a2b------2"><img src="https://cdn-images-1.medium.com/max/1816/1*B3WRChbL7UYDp3hiW_vJnw.png" width="1816"></a></p><p class="medium-feed-snippet">&#x4ECA;&#x5929; 6/26 &#x865F;&#x7684;&#x984C;&#x76EE;&#x662F; Sum Root to Leaf Numbers&#xFF0C;&#x51FA;&#x8655;&#x662F; &#x2116;129 (https://leetcode.com/problems/find-the-duplicate-number/)&#xFF0C;&#x662F;&#x4E00;&#x9053; Medium &#x7684;&#x984C;&#x76EE;&#x3002;&#x984C;&#x76EE;&#x5982;&#x4E0B;&#x3002;</p><p class="medium-feed-link"><a href="https://medium.com/@ryanyang1221/leetcode-challenge-sum-root-to-leaf-numbers-6-26-9c8b1e8a6d08?source=rss-747aa9768a2b------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@ryanyang1221/leetcode-challenge-sum-root-to-leaf-numbers-6-26-9c8b1e8a6d08?source=rss-747aa9768a2b------2</link>
            <guid isPermaLink="false">https://medium.com/p/9c8b1e8a6d08</guid>
            <category><![CDATA[python]]></category>
            <category><![CDATA[binary-tree]]></category>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[dfs]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[Ryan Yang]]></dc:creator>
            <pubDate>Sun, 28 Jun 2020 09:17:10 GMT</pubDate>
            <atom:updated>2020-06-28T09:30:20.668Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Leetcode Challenge: Find the Duplicate Number (6/25)]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@ryanyang1221/leetcode-challenge-find-the-duplicate-number-6-25-9da94314b93b?source=rss-747aa9768a2b------2"><img src="https://cdn-images-1.medium.com/max/1844/1*EhdwAYMjzcKdU7FUypwAVw.png" width="1844"></a></p><p class="medium-feed-snippet">&#x4ECA;&#x5929; 6/25 &#x865F;&#x7684;&#x984C;&#x76EE;&#x662F; Find the Duplicate Number&#xFF0C;&#x51FA;&#x8655;&#x662F; &#x2116;287 (https://leetcode.com/problems/find-the-duplicate-number/)&#xFF0C;&#x662F;&#x4E00;&#x9053; Medium &#x7684;&#x984C;&#x76EE;&#x3002;&#x984C;&#x76EE;&#x5982;&#x4E0B;&#x3002;</p><p class="medium-feed-link"><a href="https://medium.com/@ryanyang1221/leetcode-challenge-find-the-duplicate-number-6-25-9da94314b93b?source=rss-747aa9768a2b------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@ryanyang1221/leetcode-challenge-find-the-duplicate-number-6-25-9da94314b93b?source=rss-747aa9768a2b------2</link>
            <guid isPermaLink="false">https://medium.com/p/9da94314b93b</guid>
            <category><![CDATA[linked-lists]]></category>
            <category><![CDATA[python]]></category>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[linked-list-cycle]]></category>
            <dc:creator><![CDATA[Ryan Yang]]></dc:creator>
            <pubDate>Sun, 28 Jun 2020 07:25:22 GMT</pubDate>
            <atom:updated>2020-06-28T07:25:22.208Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Leetcode Challenge: Unique Binary Search Trees 系列 (6/24)]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/@ryanyang1221/leetcode-challenge-unique-binary-search-trees-%E7%B3%BB%E5%88%97-6-24-9f7ff1208c16?source=rss-747aa9768a2b------2"><img src="https://cdn-images-1.medium.com/max/1618/1*y9r8DJej6hFLs7bbOdmD9w.png" width="1618"></a></p><p class="medium-feed-snippet">&#x4ECA;&#x5929;&#x662F; 6/24&#xFF0C;&#x984C;&#x76EE;&#x662F; Unique Binary Search Trees&#xFF0C; &#x51FA;&#x8655;&#x662F; &#x2116;96 (https://leetcode.com/problems/unique-binary-search-trees/)&#xFF0C;&#x800C; &#x2116;95 &#x662F; Unique Binary Search&#x2026;</p><p class="medium-feed-link"><a href="https://medium.com/@ryanyang1221/leetcode-challenge-unique-binary-search-trees-%E7%B3%BB%E5%88%97-6-24-9f7ff1208c16?source=rss-747aa9768a2b------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://medium.com/@ryanyang1221/leetcode-challenge-unique-binary-search-trees-%E7%B3%BB%E5%88%97-6-24-9f7ff1208c16?source=rss-747aa9768a2b------2</link>
            <guid isPermaLink="false">https://medium.com/p/9f7ff1208c16</guid>
            <category><![CDATA[30-day-leetcode-challenge]]></category>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[python]]></category>
            <category><![CDATA[binary-tree]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[Ryan Yang]]></dc:creator>
            <pubDate>Sat, 27 Jun 2020 16:51:13 GMT</pubDate>
            <atom:updated>2020-06-27T16:51:13.905Z</atom:updated>
        </item>
    </channel>
</rss>