<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Leetcodes on TzJ&#39;s Net</title>
    <link>https://tzj2006.github.io/leetcode/</link>
    <description>Recent content in Leetcodes on TzJ&#39;s Net</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Sat, 06 Dec 2025 17:15:36 -0500</lastBuildDate>
    <atom:link href="https://tzj2006.github.io/leetcode/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>LeetCode Daily Question 2025-12-05</title>
      <link>https://tzj2006.github.io/leetcode/2025-12-05/</link>
      <pubDate>Sat, 06 Dec 2025 17:15:36 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-12-05/</guid>
      <description>Solution to 3432. Count Partitions with Even Sum Difference</description>
    </item>
    <item>
      <title>LeetCode Question P.312 Burst Balloons</title>
      <link>https://tzj2006.github.io/leetcode/p312_burst_balloons/</link>
      <pubDate>Sat, 06 Sep 2025 15:59:08 -0400</pubDate>
      <guid>https://tzj2006.github.io/leetcode/p312_burst_balloons/</guid>
      <description>Solution to P.312</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-05-27</title>
      <link>https://tzj2006.github.io/leetcode/2025-05-27/</link>
      <pubDate>Tue, 27 May 2025 21:19:57 +0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-05-27/</guid>
      <description>Solution to 2894. Divisible and Non-divisible Sums Difference</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-05-25</title>
      <link>https://tzj2006.github.io/leetcode/2025-05-25/</link>
      <pubDate>Sun, 25 May 2025 12:17:29 +0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-05-25/</guid>
      <description>Solution to 2131. Longest Palindrome by Concatenating Two Letter Words</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-05-24</title>
      <link>https://tzj2006.github.io/leetcode/2025-05-24/</link>
      <pubDate>Sat, 24 May 2025 11:19:20 +0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-05-24/</guid>
      <description>Solution to 2942. Find Words Containing Character</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-05-23</title>
      <link>https://tzj2006.github.io/leetcode/2025-05-23/</link>
      <pubDate>Fri, 23 May 2025 21:16:05 +0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-05-23/</guid>
      <description>Solution to 3068. Find the Maximum Sum of Node Values</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-05-22</title>
      <link>https://tzj2006.github.io/leetcode/2025-05-22/</link>
      <pubDate>Thu, 22 May 2025 22:33:45 +0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-05-22/</guid>
      <description>Solution to 3362. Zero Array Transformation III</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-18</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-18/</link>
      <pubDate>Wed, 21 May 2025 15:40:56 +0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-18/</guid>
      <description>Solution to 2375. Construct Smallest Number From DI String</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-05-21</title>
      <link>https://tzj2006.github.io/leetcode/2025-05-21/</link>
      <pubDate>Wed, 21 May 2025 14:53:20 +0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-05-21/</guid>
      <description>Solution to 73. Set Matrix Zeroes</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-05-20</title>
      <link>https://tzj2006.github.io/leetcode/2025-05-20/</link>
      <pubDate>Tue, 20 May 2025 11:34:09 +0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-05-20/</guid>
      <description>Solution to 3355. Zero Array Transformation I</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-05-19</title>
      <link>https://tzj2006.github.io/leetcode/2025-05-19/</link>
      <pubDate>Mon, 19 May 2025 09:52:16 +0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-05-19/</guid>
      <description>Solution to 3024. Type of Triangle</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-05-18</title>
      <link>https://tzj2006.github.io/leetcode/2025-05-18/</link>
      <pubDate>Sun, 18 May 2025 10:34:30 +0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-05-18/</guid>
      <description>Solution to 1931. Painting a Grid With Three Different Colors</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-17</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-17/</link>
      <pubDate>Sat, 17 May 2025 15:18:23 +0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-17/</guid>
      <description>Solution to 1079. Letter Tile Possibilities</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-16</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-16/</link>
      <pubDate>Sat, 17 May 2025 14:50:49 +0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-16/</guid>
      <description>Solution to</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-05-17</title>
      <link>https://tzj2006.github.io/leetcode/2025-05-17/</link>
      <pubDate>Sat, 17 May 2025 13:37:19 +0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-05-17/</guid>
      <description>Solution to 75. Sort Colors</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-03-25</title>
      <link>https://tzj2006.github.io/leetcode/2025-03-25/</link>
      <pubDate>Tue, 25 Mar 2025 01:14:18 -0400</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-03-25/</guid>
      <description>Solution to 3394. Check if Grid can be Cut into Sections</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-03-19</title>
      <link>https://tzj2006.github.io/leetcode/2025-03-19/</link>
      <pubDate>Tue, 18 Mar 2025 22:07:40 -0400</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-03-19/</guid>
      <description>Solution to 3191. Minimum Operations to Make Binary Array Elements Equal to One I</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-15</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-15/</link>
      <pubDate>Sat, 15 Feb 2025 00:13:13 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-15/</guid>
      <description>Solution to 2698. Find the Punishment Number of an Integer</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-14</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-14/</link>
      <pubDate>Fri, 14 Feb 2025 15:29:59 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-14/</guid>
      <description>Solution to 1352. Product of the Last K Numbers</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-13</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-13/</link>
      <pubDate>Thu, 13 Feb 2025 00:06:39 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-13/</guid>
      <description>Solution to 3066. Minimum Operations to Exceed Threshold Value II</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-12</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-12/</link>
      <pubDate>Tue, 11 Feb 2025 21:06:38 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-12/</guid>
      <description>Solution to 2342. Max Sum of a Pair With Equal Sum of Digits</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-11</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-11/</link>
      <pubDate>Mon, 10 Feb 2025 20:21:28 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-11/</guid>
      <description>Solution to 1910. Remove All Occurrences of a Substring</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-10</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-10/</link>
      <pubDate>Sun, 09 Feb 2025 19:07:12 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-10/</guid>
      <description>Solution to 3174. Clear Digits</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-09</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-09/</link>
      <pubDate>Sun, 09 Feb 2025 14:50:35 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-09/</guid>
      <description>Solution to 2364. Count Number of Bad Pairs</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-08</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-08/</link>
      <pubDate>Sat, 08 Feb 2025 14:35:49 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-08/</guid>
      <description>Solution to 2349. Design a Number Container System</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-07</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-07/</link>
      <pubDate>Thu, 06 Feb 2025 23:22:59 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-07/</guid>
      <description>Solution to 3160. Find the Number of Distinct Colors Among the Balls</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-06</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-06/</link>
      <pubDate>Wed, 05 Feb 2025 21:36:51 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-06/</guid>
      <description>Solution to 1726. Tuple with Same Product</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-05</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-05/</link>
      <pubDate>Wed, 05 Feb 2025 21:36:48 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-05/</guid>
      <description>Solution to 1790. Check if One String Swap Can Make Strings Equal</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-04</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-04/</link>
      <pubDate>Tue, 04 Feb 2025 13:19:11 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-04/</guid>
      <description>Solution to 1800. Maximum Ascending Subarray Sum</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-03</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-03/</link>
      <pubDate>Tue, 04 Feb 2025 13:19:09 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-03/</guid>
      <description>Solution to 3105. Longest Strictly Increasing or Strictly Decreasing Subarray</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-02</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-02/</link>
      <pubDate>Sun, 02 Feb 2025 12:21:21 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-02/</guid>
      <description>Solution to 1752. Check if Array Is Sorted and Rotated</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-30</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-30/</link>
      <pubDate>Sat, 01 Feb 2025 13:07:45 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-30/</guid>
      <description>Solution to 2493. Divide Nodes Into the Maximum Number of Groups</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-02-01</title>
      <link>https://tzj2006.github.io/leetcode/2025-02-01/</link>
      <pubDate>Sat, 01 Feb 2025 12:29:35 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-02-01/</guid>
      <description>Solution to 3151. Special Array I</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-31</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-31/</link>
      <pubDate>Fri, 31 Jan 2025 12:55:41 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-31/</guid>
      <description>Solution to 827. Making A Large Island</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-29</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-29/</link>
      <pubDate>Wed, 29 Jan 2025 10:58:22 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-29/</guid>
      <description>Solution to 684. Redundant Connection</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-28</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-28/</link>
      <pubDate>Tue, 28 Jan 2025 01:17:20 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-28/</guid>
      <description>Solution to 2658. Maximum Number of Fish in a Grid</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-27</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-27/</link>
      <pubDate>Sun, 26 Jan 2025 19:58:52 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-27/</guid>
      <description>Solution to 1462. Course Schedule IV</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-26</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-26/</link>
      <pubDate>Sat, 25 Jan 2025 21:16:36 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-26/</guid>
      <description>Solution to 2127. Maximum Employees to Be Invited to a Meeting</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-25</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-25/</link>
      <pubDate>Sat, 25 Jan 2025 21:16:34 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-25/</guid>
      <description>Solution to 2948. Make Lexicographically Smallest Array by Swapping Elements</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-24</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-24/</link>
      <pubDate>Thu, 23 Jan 2025 22:31:15 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-24/</guid>
      <description>Solution to 802. Find Eventual Safe States</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-23</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-23/</link>
      <pubDate>Wed, 22 Jan 2025 21:23:43 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-23/</guid>
      <description>Solution to 1267. Count Servers that Communicate</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-22</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-22/</link>
      <pubDate>Wed, 22 Jan 2025 12:57:27 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-22/</guid>
      <description>Solution to 1765. Map of Highest Peak</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-21</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-21/</link>
      <pubDate>Mon, 20 Jan 2025 20:39:17 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-21/</guid>
      <description>Solution to 2017. Grid Game</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-20</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-20/</link>
      <pubDate>Mon, 20 Jan 2025 20:39:14 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-20/</guid>
      <description>Solution to 2661. First Completely Painted Row or Column</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-19</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-19/</link>
      <pubDate>Sun, 19 Jan 2025 14:51:51 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-19/</guid>
      <description>Solution to 407. Trapping Rain Water II</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-18</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-18/</link>
      <pubDate>Sat, 18 Jan 2025 17:47:12 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-18/</guid>
      <description>Solution to 1368. Minimum Cost to Make at Least One Valid Path in a Grid</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-17</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-17/</link>
      <pubDate>Fri, 17 Jan 2025 12:06:57 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-17/</guid>
      <description>Solution to 2683. Neighboring Bitwise XOR</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-16</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-16/</link>
      <pubDate>Thu, 16 Jan 2025 15:35:24 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-16/</guid>
      <description>Solution to 2425. Bitwise XOR of All Pairings</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-15</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-15/</link>
      <pubDate>Wed, 15 Jan 2025 10:28:02 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-15/</guid>
      <description>Solution to 2429. Minimize XOR</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-13</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-14/</link>
      <pubDate>Mon, 13 Jan 2025 21:19:48 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-14/</guid>
      <description>Solution to 2657. Find the Prefix Common Array of Two Arrays</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-13</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-13/</link>
      <pubDate>Sun, 12 Jan 2025 22:44:37 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-13/</guid>
      <description>&lt;ol start=&#34;3223&#34;&gt;
&lt;li&gt;Minimum Length of String After Operations&lt;/li&gt;
&lt;/ol&gt;
</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-12</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-12/</link>
      <pubDate>Sat, 11 Jan 2025 23:33:48 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-12/</guid>
      <description>&lt;ol start=&#34;2116&#34;&gt;
&lt;li&gt;Check if a Parentheses String Can Be Valid&lt;/li&gt;
&lt;/ol&gt;
</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-11</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-11/</link>
      <pubDate>Fri, 10 Jan 2025 23:40:52 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-11/</guid>
      <description>&lt;ol start=&#34;1400&#34;&gt;
&lt;li&gt;Construct K Palindrome Strings&lt;/li&gt;
&lt;/ol&gt;
</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-10</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-10/</link>
      <pubDate>Thu, 09 Jan 2025 23:42:20 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-10/</guid>
      <description>&lt;ol start=&#34;916&#34;&gt;
&lt;li&gt;Word Subsets&lt;/li&gt;
&lt;/ol&gt;
</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-09</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-09/</link>
      <pubDate>Wed, 08 Jan 2025 23:33:00 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-09/</guid>
      <description>&lt;ol start=&#34;2185&#34;&gt;
&lt;li&gt;Counting Words With a Given Prefix&lt;/li&gt;
&lt;/ol&gt;
</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-08</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-08/</link>
      <pubDate>Wed, 08 Jan 2025 10:00:00 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-08/</guid>
      <description>&lt;ol start=&#34;3042&#34;&gt;
&lt;li&gt;Count Prefix and Suffix Pairs I&lt;/li&gt;
&lt;/ol&gt;
</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-07</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-07/</link>
      <pubDate>Tue, 07 Jan 2025 00:38:22 -0500</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-07/</guid>
      <description>&lt;ol start=&#34;1408&#34;&gt;
&lt;li&gt;String Matching in an Array&lt;/li&gt;
&lt;/ol&gt;
</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-06</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-06/</link>
      <pubDate>Mon, 06 Jan 2025 16:00:00 -0600</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-06/</guid>
      <description>&lt;ol start=&#34;1769&#34;&gt;
&lt;li&gt;Minimum Number of Operations to Move All Balls to Each Box&lt;/li&gt;
&lt;/ol&gt;
</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-05</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-05/</link>
      <pubDate>Sun, 05 Jan 2025 10:22:44 -0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-05/</guid>
      <description>&lt;ol start=&#34;2381&#34;&gt;
&lt;li&gt;Shifting Letters II&lt;/li&gt;
&lt;/ol&gt;
</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-04</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-04/</link>
      <pubDate>Sat, 04 Jan 2025 12:25:34 -0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-04/</guid>
      <description>&lt;ol start=&#34;1930&#34;&gt;
&lt;li&gt;Unique Length-3 Palindromic Subsequences&lt;/li&gt;
&lt;/ol&gt;
</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-03</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-03/</link>
      <pubDate>Thu, 02 Jan 2025 23:11:27 -0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-03/</guid>
      <description>2270. Number of Ways to Split Array</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-02</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-02/</link>
      <pubDate>Thu, 02 Jan 2025 13:12:57 -0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-02/</guid>
      <description>2559. Count Vowel Strings in Ranges</description>
    </item>
    <item>
      <title>LeetCode Daily Question 2025-01-01</title>
      <link>https://tzj2006.github.io/leetcode/2025-01-01/</link>
      <pubDate>Wed, 01 Jan 2025 13:09:56 -0800</pubDate>
      <guid>https://tzj2006.github.io/leetcode/2025-01-01/</guid>
      <description>1422. Maximum Score After Splitting a String</description>
    </item>
  </channel>
</rss>
