diff --git a/2023/11/02/data/csv2parquet/index.html b/2023/11/02/data/csv2parquet/index.html
index 244da63..23b8bf0 100644
--- a/2023/11/02/data/csv2parquet/index.html
+++ b/2023/11/02/data/csv2parquet/index.html
@@ -82,6 +82,8 @@
     <span id="actions">
       <ul>
         
+        <li><a class="icon" aria-label="Previous post" href="/2023/12/02/training/202312/"><i class="fa-solid fa-chevron-left" aria-hidden="true" onmouseover="$('#i-prev').toggle();" onmouseout="$('#i-prev').toggle();"></i></a></li>
+        
         
         <li><a class="icon" aria-label="Next post" href="/2023/10/11/mongodb_import_csv/"><i class="fa-solid fa-chevron-right" aria-hidden="true" onmouseover="$('#i-next').toggle();" onmouseout="$('#i-next').toggle();"></i></a></li>
         
diff --git a/2023/12/02/training/202312/index.html b/2023/12/02/training/202312/index.html
new file mode 100644
index 0000000..f40c218
--- /dev/null
+++ b/2023/12/02/training/202312/index.html
@@ -0,0 +1,312 @@
+<!DOCTYPE html>
+<html lang=en>
+<head>
+    <!-- so meta -->
+    <meta charset="utf-8">
+    <meta http-equiv="X-UA-Compatible" content="IE=edge">
+    <meta name="HandheldFriendly" content="True">
+    <meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=5" />
+    <meta name="description" content="2023 12月 Training plan今个月的重点:    滑动窗口 递归 DP  滑动窗口统计最大元素出现至少 K 次的子数组给你一个整数数组 nums 和一个 正整数 k 。请你统计有多少满足 「 nums 中的 最大 元素」至少出现 k 次的子数组，并返回满足这一条件的子数组的数目。子数组是数组中的一个连续元素序列。   示例 1：输入：nums &#x3D; [1,3,2,3,3], k &#x3D;">
+<meta property="og:type" content="article">
+<meta property="og:title" content="Algorithms training - 2023 12月 Training plan">
+<meta property="og:url" content="https://stepfenshawn.github.io/2023/12/02/training/202312/index.html">
+<meta property="og:site_name" content="Stepfen Shawn">
+<meta property="og:description" content="2023 12月 Training plan今个月的重点:    滑动窗口 递归 DP  滑动窗口统计最大元素出现至少 K 次的子数组给你一个整数数组 nums 和一个 正整数 k 。请你统计有多少满足 「 nums 中的 最大 元素」至少出现 k 次的子数组，并返回满足这一条件的子数组的数目。子数组是数组中的一个连续元素序列。   示例 1：输入：nums &#x3D; [1,3,2,3,3], k &#x3D;">
+<meta property="og:locale" content="en_US">
+<meta property="article:published_time" content="2023-12-01T16:00:00.000Z">
+<meta property="article:modified_time" content="2023-12-22T07:14:53.507Z">
+<meta property="article:author" content="Stepfen Shawn">
+<meta property="article:tag" content="alog">
+<meta name="twitter:card" content="summary">
+    
+    
+      
+        
+          <link rel="shortcut icon" href="/images/favicon.ico">
+        
+      
+      
+        
+          <link rel="icon" type="image/png" href="/images/favicon-192x192.png" sizes="192x192">
+        
+      
+      
+        
+          <link rel="apple-touch-icon" sizes="180x180" href="/images/apple-touch-icon.png">
+        
+      
+    
+    <!-- title -->
+    <title>Algorithms training - 2023 12月 Training plan</title>
+    <!-- async scripts -->
+    <!-- Google Analytics -->
+
+
+    <!-- Umami Analytics -->
+
+
+    <!-- styles -->
+    
+<link rel="stylesheet" href="/css/style.css">
+
+    <!-- persian styles -->
+    
+    <!-- rss -->
+    
+    
+	<!-- mathjax -->
+	
+<meta name="generator" content="Hexo 5.4.2"></head>
+
+<body class="max-width mx-auto px3 ltr">
+    
+      <div id="header-post">
+  <a id="menu-icon" href="#" aria-label="Menu"><i class="fa-solid fa-bars fa-lg"></i></a>
+  <a id="menu-icon-tablet" href="#" aria-label="Menu"><i class="fa-solid fa-bars fa-lg"></i></a>
+  <a id="top-icon-tablet" href="#" aria-label="Top" onclick="$('html, body').animate({ scrollTop: 0 }, 'fast');" style="display:none;"><i class="fa-solid fa-chevron-up fa-lg"></i></a>
+  <span id="menu">
+    <span id="nav">
+      <ul>
+        <!--
+       --><li><a href="/">Home</a></li><!--
+     --><!--
+       --><li><a href="/about/">About</a></li><!--
+     --><!--
+       --><li><a href="/archives/">Writing</a></li><!--
+     --><!--
+       --><li><a href="/search/">Search</a></li><!--
+     -->
+      </ul>
+    </span>
+    <br/>
+    <span id="actions">
+      <ul>
+        
+        
+        <li><a class="icon" aria-label="Next post" href="/2023/11/02/data/csv2parquet/"><i class="fa-solid fa-chevron-right" aria-hidden="true" onmouseover="$('#i-next').toggle();" onmouseout="$('#i-next').toggle();"></i></a></li>
+        
+        <li><a class="icon" aria-label="Back to top" href="#" onclick="$('html, body').animate({ scrollTop: 0 }, 'fast');"><i class="fa-solid fa-chevron-up" aria-hidden="true" onmouseover="$('#i-top').toggle();" onmouseout="$('#i-top').toggle();"></i></a></li>
+        <li><a class="icon" aria-label="Share post" href="#"><i class="fa-solid fa-share-alt" aria-hidden="true" onmouseover="$('#i-share').toggle();" onmouseout="$('#i-share').toggle();" onclick="$('#share').toggle();return false;"></i></a></li>
+      </ul>
+      <span id="i-prev" class="info" style="display:none;">Previous post</span>
+      <span id="i-next" class="info" style="display:none;">Next post</span>
+      <span id="i-top" class="info" style="display:none;">Back to top</span>
+      <span id="i-share" class="info" style="display:none;">Share post</span>
+    </span>
+    <br/>
+    <div id="share" style="display: none">
+      <ul>
+  <li><a class="icon" target="_blank" rel="noopener" href="http://www.facebook.com/sharer.php?u=https://stepfenshawn.github.io/2023/12/02/training/202312/"><i class="fab fa-facebook " aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="https://twitter.com/share?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&text=Algorithms training - 2023 12月 Training plan"><i class="fab fa-twitter " aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="http://www.linkedin.com/shareArticle?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&title=Algorithms training - 2023 12月 Training plan"><i class="fab fa-linkedin " aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="https://pinterest.com/pin/create/bookmarklet/?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&is_video=false&description=Algorithms training - 2023 12月 Training plan"><i class="fab fa-pinterest " aria-hidden="true"></i></a></li>
+  <li><a class="icon" href="mailto:?subject=Algorithms training - 2023 12月 Training plan&body=Check out this article: https://stepfenshawn.github.io/2023/12/02/training/202312/"><i class="fa-solid fa-envelope " aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="https://getpocket.com/save?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&title=Algorithms training - 2023 12月 Training plan"><i class="fab fa-get-pocket " aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="http://reddit.com/submit?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&title=Algorithms training - 2023 12月 Training plan"><i class="fab fa-reddit " aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="http://www.stumbleupon.com/submit?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&title=Algorithms training - 2023 12月 Training plan"><i class="fab fa-stumbleupon " aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="http://digg.com/submit?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&title=Algorithms training - 2023 12月 Training plan"><i class="fab fa-digg " aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="http://www.tumblr.com/share/link?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&name=Algorithms training - 2023 12月 Training plan&description="><i class="fab fa-tumblr " aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="https://news.ycombinator.com/submitlink?u=https://stepfenshawn.github.io/2023/12/02/training/202312/&t=Algorithms training - 2023 12月 Training plan"><i class="fab fa-hacker-news " aria-hidden="true"></i></a></li>
+</ul>
+
+    </div>
+    
+    
+      <div id="toc">
+        <ol class="toc"><li class="toc-item toc-level-1"><a class="toc-link" href="#2023-12%E6%9C%88-Training-plan"><span class="toc-number">1.</span> <span class="toc-text">2023 12月 Training plan</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3"><span class="toc-number">2.</span> <span class="toc-text">滑动窗口</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E9%80%92%E5%BD%92"><span class="toc-number">3.</span> <span class="toc-text">递归</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#DP"><span class="toc-number">4.</span> <span class="toc-text">DP</span></a></li></ol>
+      </div>
+    
+  </span>
+</div>
+
+    
+    <div class="content index py4 ">
+        
+        <article class="post h-entry" itemscope itemtype="http://schema.org/BlogPosting">
+  <header>
+    
+    <h1 class="posttitle p-name" itemprop="name headline">
+        Algorithms training - 2023 12月 Training plan
+    </h1>
+
+
+
+    <div class="meta">
+      <span class="author p-author h-card" itemprop="author" itemscope itemtype="http://schema.org/Person">
+        <span class="p-name" itemprop="name">Stepfen Shawn</span>
+      </span>
+      
+    <div class="postdate">
+      
+        <time datetime="2023-12-01T16:00:00.000Z" class="dt-published" itemprop="datePublished">2023-12-02</time>
+        
+      
+    </div>
+
+
+      
+
+      
+    <div class="article-tag">
+        <i class="fa-solid fa-tag"></i>
+        <a class="p-category" href="/tags/alog/" rel="tag">alog</a>
+    </div>
+
+
+    </div>
+  </header>
+  
+
+  <div class="content e-content" itemprop="articleBody">
+    <h1 id="2023-12月-Training-plan"><a href="#2023-12月-Training-plan" class="headerlink" title="2023 12月 Training plan"></a>2023 12月 Training plan</h1><p>今个月的重点:  </p>
+<ul>
+<li>滑动窗口</li>
+<li>递归</li>
+<li>DP</li>
+</ul>
+<h1 id="滑动窗口"><a href="#滑动窗口" class="headerlink" title="滑动窗口"></a>滑动窗口</h1><p><a target="_blank" rel="noopener" href="https://leetcode.cn/problems/count-subarrays-where-max-element-appears-at-least-k-times/description/">统计最大元素出现至少 K 次的子数组</a><br>给你一个整数数组 nums 和一个 正整数 k 。<br>请你统计有多少满足 「 nums 中的 最大 元素」至少出现 k 次的子数组，并返回满足这一条件的子数组的数目。<br>子数组是数组中的一个连续元素序列。  </p>
+<p>示例 1：<br>输入：nums = [1,3,2,3,3], k = 2<br>输出：6<br>解释：包含元素 3 至少 2 次的子数组为：[1,3,2,3]、[1,3,2,3,3]、[3,2,3]、[3,2,3,3]、[2,3,3] 和 [3,3]。  </p>
+<p>思路: 首先找到nums中的最大元素mx, 我们要统计子数组的个数可以考虑滑动窗口算法。<br>设置左右指针 l 和 r, 于是我们枚举右指针 r 继续滑动, 途中我们要维护一个 cnt_max 来记录该窗口中最大元素出现的次数。<br>于是我们可以在 cnt_max == k 移动左指针 l, 目的知道 cnt_max != k 为止, 此时 [l, r] 有 k - 1 个最大元素并且 nums[l - 1]一定是最大元素, 于是对答案的贡献就为 l 了。(因为区间运算 l - 1 - 0 + 1, 子数组数量相当于从l - 1到0的每个元素开始到当前区间结束, 也就是 l 次。) </p>
+<figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span> &#123;</span><br><span class="line"><span class="keyword">public</span>:</span><br><span class="line">    <span class="keyword">using</span> ll = <span class="type">long</span> <span class="type">long</span>;</span><br><span class="line">    <span class="function">ll <span class="title">countSubarrays</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> k)</span> </span>&#123;</span><br><span class="line">        ll ans = <span class="number">0</span>;</span><br><span class="line">        <span class="type">int</span> l = <span class="number">0</span>, r = <span class="number">0</span>;</span><br><span class="line">        <span class="type">int</span> mx = *<span class="built_in">max_element</span>(nums.<span class="built_in">begin</span>(), nums.<span class="built_in">end</span>());</span><br><span class="line">        <span class="type">int</span> n = nums.<span class="built_in">size</span>();</span><br><span class="line">        <span class="type">int</span> cnt_max = <span class="number">0</span>;</span><br><span class="line">        <span class="keyword">while</span> (r &lt; n) &#123;</span><br><span class="line">            <span class="keyword">if</span> (nums[r] == mx) cnt_max++;</span><br><span class="line">            <span class="keyword">while</span> (cnt_max == k) &#123;</span><br><span class="line">                <span class="keyword">if</span> (nums[l] == mx) &#123;</span><br><span class="line">                    cnt_max--;</span><br><span class="line">                &#125;</span><br><span class="line">                l++;</span><br><span class="line">            &#125;</span><br><span class="line">            ans += (l - <span class="number">1</span>) - <span class="number">0</span> + <span class="number">1</span>;</span><br><span class="line">            r++;</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        <span class="keyword">return</span> ans;   </span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure>
+
+<h1 id="递归"><a href="#递归" class="headerlink" title="递归"></a>递归</h1><h1 id="DP"><a href="#DP" class="headerlink" title="DP"></a>DP</h1>
+  </div>
+</article>
+
+
+
+        
+          <div id="footer-post-container">
+  <div id="footer-post">
+
+    <div id="nav-footer" style="display: none">
+      <ul>
+        
+          <li><a href="/">Home</a></li>
+        
+          <li><a href="/about/">About</a></li>
+        
+          <li><a href="/archives/">Writing</a></li>
+        
+          <li><a href="/search/">Search</a></li>
+        
+      </ul>
+    </div>
+
+    
+    
+      <div id="toc-footer" style="display: none">
+        <ol class="toc"><li class="toc-item toc-level-1"><a class="toc-link" href="#2023-12%E6%9C%88-Training-plan"><span class="toc-number">1.</span> <span class="toc-text">2023 12月 Training plan</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3"><span class="toc-number">2.</span> <span class="toc-text">滑动窗口</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E9%80%92%E5%BD%92"><span class="toc-number">3.</span> <span class="toc-text">递归</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#DP"><span class="toc-number">4.</span> <span class="toc-text">DP</span></a></li></ol>
+      </div>
+    
+
+    <div id="share-footer" style="display: none">
+      <ul>
+  <li><a class="icon" target="_blank" rel="noopener" href="http://www.facebook.com/sharer.php?u=https://stepfenshawn.github.io/2023/12/02/training/202312/"><i class="fab fa-facebook fa-lg" aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="https://twitter.com/share?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&text=Algorithms training - 2023 12月 Training plan"><i class="fab fa-twitter fa-lg" aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="http://www.linkedin.com/shareArticle?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&title=Algorithms training - 2023 12月 Training plan"><i class="fab fa-linkedin fa-lg" aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="https://pinterest.com/pin/create/bookmarklet/?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&is_video=false&description=Algorithms training - 2023 12月 Training plan"><i class="fab fa-pinterest fa-lg" aria-hidden="true"></i></a></li>
+  <li><a class="icon" href="mailto:?subject=Algorithms training - 2023 12月 Training plan&body=Check out this article: https://stepfenshawn.github.io/2023/12/02/training/202312/"><i class="fa-solid fa-envelope fa-lg" aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="https://getpocket.com/save?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&title=Algorithms training - 2023 12月 Training plan"><i class="fab fa-get-pocket fa-lg" aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="http://reddit.com/submit?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&title=Algorithms training - 2023 12月 Training plan"><i class="fab fa-reddit fa-lg" aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="http://www.stumbleupon.com/submit?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&title=Algorithms training - 2023 12月 Training plan"><i class="fab fa-stumbleupon fa-lg" aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="http://digg.com/submit?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&title=Algorithms training - 2023 12月 Training plan"><i class="fab fa-digg fa-lg" aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="http://www.tumblr.com/share/link?url=https://stepfenshawn.github.io/2023/12/02/training/202312/&name=Algorithms training - 2023 12月 Training plan&description="><i class="fab fa-tumblr fa-lg" aria-hidden="true"></i></a></li>
+  <li><a class="icon" target="_blank" rel="noopener" href="https://news.ycombinator.com/submitlink?u=https://stepfenshawn.github.io/2023/12/02/training/202312/&t=Algorithms training - 2023 12月 Training plan"><i class="fab fa-hacker-news fa-lg" aria-hidden="true"></i></a></li>
+</ul>
+
+    </div>
+
+    <div id="actions-footer">
+        <a id="menu" class="icon" href="#" onclick="$('#nav-footer').toggle();return false;"><i class="fa-solid fa-bars fa-lg" aria-hidden="true"></i> Menu</a>
+        
+          <a id="toc" class="icon" href="#" onclick="$('#toc-footer').toggle();return false;"><i class="fa-solid fa-list fa-lg" aria-hidden="true"></i> TOC</a>
+        
+        <a id="share" class="icon" href="#" onclick="$('#share-footer').toggle();return false;"><i class="fa-solid fa-share-alt fa-lg" aria-hidden="true"></i> Share</a>
+        <a id="top" style="display:none" class="icon" href="#" onclick="$('html, body').animate({ scrollTop: 0 }, 'fast');"><i class="fa-solid fa-chevron-up fa-lg" aria-hidden="true"></i> Top</a>
+    </div>
+
+  </div>
+</div>
+
+        
+        <footer id="footer">
+  <div class="footer-left">
+    Copyright &copy;
+    
+    
+    2018-2023
+    Stepfen Shawn
+  </div>
+  <div class="footer-right">
+    <nav>
+      <ul>
+        <!--
+       --><li><a href="/">Home</a></li><!--
+     --><!--
+       --><li><a href="/about/">About</a></li><!--
+     --><!--
+       --><li><a href="/archives/">Writing</a></li><!--
+     --><!--
+       --><li><a href="/search/">Search</a></li><!--
+     -->
+      </ul>
+    </nav>
+  </div>
+</footer>
+
+    </div>
+    <!-- styles -->
+
+
+
+  <link rel="preload" as="style" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/6.4.0/css/all.min.css" crossorigin="anonymous" onload="this.onload=null;this.rel='stylesheet'"/>
+
+
+    <!-- jquery -->
+
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/jquery/3.6.0/jquery.min.js" crossorigin="anonymous"></script>
+
+
+
+
+<!-- clipboard -->
+
+  
+    <script src="https://cdnjs.cloudflare.com/ajax/libs/clipboard.js/2.0.7/clipboard.min.js" crossorigin="anonymous"></script>
+  
+  <script type="text/javascript">
+  $(function() {
+    // copy-btn HTML
+    var btn = "<span class=\"btn-copy tooltipped tooltipped-sw\" aria-label=\"Copy to clipboard!\">";
+    btn += '<i class="fa-regular fa-clone"></i>';
+    btn += '</span>';
+    // mount it!
+    $(".highlight table").before(btn);
+    var clip = new ClipboardJS('.btn-copy', {
+      text: function(trigger) {
+        return Array.from(trigger.nextElementSibling.querySelectorAll('.code')).reduce((str,it)=>str+it.innerText+'\n','')
+      }
+    });
+    clip.on('success', function(e) {
+      e.trigger.setAttribute('aria-label', "Copied!");
+      e.clearSelection();
+    })
+  })
+  </script>
+
+
+<script src="/js/main.js"></script>
+
+<!-- search -->
+
+<!-- Baidu Analytics -->
+
+<!-- Cloudflare Analytics -->
+
+<!-- Disqus Comments -->
+
+<!-- utterances Comments -->
+
+</body>
+</html>
diff --git a/archives/2023/12/index.html b/archives/2023/12/index.html
new file mode 100644
index 0000000..4ac11c2
--- /dev/null
+++ b/archives/2023/12/index.html
@@ -0,0 +1,186 @@
+<!DOCTYPE html>
+<html lang=en>
+<head>
+    <!-- so meta -->
+    <meta charset="utf-8">
+    <meta http-equiv="X-UA-Compatible" content="IE=edge">
+    <meta name="HandheldFriendly" content="True">
+    <meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=5" />
+    <meta name="description" content="I started coding at the age of 13, and I&#39;ve never been tired of it!  Now I&#39;m a 19 years old guy, a part-time financial quant developer, focusing on C++, Rust, Python and SQL !!!">
+<meta property="og:type" content="website">
+<meta property="og:title" content="Stepfen Shawn">
+<meta property="og:url" content="https://stepfenshawn.github.io/archives/2023/12/index.html">
+<meta property="og:site_name" content="Stepfen Shawn">
+<meta property="og:description" content="I started coding at the age of 13, and I&#39;ve never been tired of it!  Now I&#39;m a 19 years old guy, a part-time financial quant developer, focusing on C++, Rust, Python and SQL !!!">
+<meta property="og:locale" content="en_US">
+<meta property="article:author" content="Stepfen Shawn">
+<meta name="twitter:card" content="summary">
+    
+    
+      
+        
+          <link rel="shortcut icon" href="/images/favicon.ico">
+        
+      
+      
+        
+          <link rel="icon" type="image/png" href="/images/favicon-192x192.png" sizes="192x192">
+        
+      
+      
+        
+          <link rel="apple-touch-icon" sizes="180x180" href="/images/apple-touch-icon.png">
+        
+      
+    
+    <!-- title -->
+    <title>Writing: 2023/12</title>
+    <!-- async scripts -->
+    <!-- Google Analytics -->
+
+
+    <!-- Umami Analytics -->
+
+
+    <!-- styles -->
+    
+<link rel="stylesheet" href="/css/style.css">
+
+    <!-- persian styles -->
+    
+    <!-- rss -->
+    
+    
+	<!-- mathjax -->
+	
+<meta name="generator" content="Hexo 5.4.2"></head>
+
+<body class="max-width mx-auto px3 ltr">
+    
+    <div class="content index py4 ">
+        
+          <header id="header">
+  <a class="u-url u-uid" href="/">
+  
+    
+      <img id="logo" alt class="u-logo" src="/images/avatar.png" />
+    
+  
+    <div id="title">
+      <h1 class="p-name">Stepfen Shawn</h1>
+    </div>
+  </a>
+  <div id="nav">
+    <ul>
+      <li class="icon">
+        <a href="#" aria-label="Menu"><i class="fa-solid fa-bars fa-2x"></i></a>
+      </li>
+      <!--
+     --><li><a href="/">Home</a></li><!--
+   --><!--
+     --><li><a href="/about/">About</a></li><!--
+   --><!--
+     --><li><a href="/archives/">Writing</a></li><!--
+   --><!--
+     --><li><a href="/search/">Search</a></li><!--
+   -->
+    </ul>
+  </div>
+</header>
+
+        
+        <div id="archive">
+  <ul class="post-list">
+    
+    
+    
+    
+      
+      
+      
+      
+        <li class="post-year"><h2>2023</h2></li>
+      
+      <li class="post-item">
+        
+    <div class="meta">
+      
+        
+          <time datetime="2023-12-01T16:00:00.000Z" class="dt-published" itemprop="datePublished">2023-12-02</time>
+        
+      
+    </div>
+
+
+        <span>
+    
+        <a class="" href="/2023/12/02/training/202312/">Algorithms training - 2023 12月 Training plan</a>
+    
+
+
+</span>
+      </li>
+    
+  </ul>
+  
+
+</div>
+
+        
+        <footer id="footer">
+  <div class="footer-left">
+    Copyright &copy;
+    
+    
+    2018-2023
+    Stepfen Shawn
+  </div>
+  <div class="footer-right">
+    <nav>
+      <ul>
+        <!--
+       --><li><a href="/">Home</a></li><!--
+     --><!--
+       --><li><a href="/about/">About</a></li><!--
+     --><!--
+       --><li><a href="/archives/">Writing</a></li><!--
+     --><!--
+       --><li><a href="/search/">Search</a></li><!--
+     -->
+      </ul>
+    </nav>
+  </div>
+</footer>
+
+    </div>
+    <!-- styles -->
+
+
+
+  <link rel="preload" as="style" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/6.4.0/css/all.min.css" crossorigin="anonymous" onload="this.onload=null;this.rel='stylesheet'"/>
+
+
+    <!-- jquery -->
+
+  <script src="https://cdnjs.cloudflare.com/ajax/libs/jquery/3.6.0/jquery.min.js" crossorigin="anonymous"></script>
+
+
+
+
+<!-- clipboard -->
+
+
+<script src="/js/main.js"></script>
+
+<!-- search -->
+
+<!-- Baidu Analytics -->
+
+<!-- Cloudflare Analytics -->
+
+<!-- Disqus Comments -->
+
+<!-- utterances Comments -->
+
+</body>
+</html>
diff --git a/archives/2023/index.html b/archives/2023/index.html
index 24044fb..1790468 100644
--- a/archives/2023/index.html
+++ b/archives/2023/index.html
@@ -101,6 +101,30 @@ <h1 class="p-name">Stepfen Shawn</h1>
       
         <li class="post-year"><h2>2023</h2></li>
       
+      <li class="post-item">
+        
+    <div class="meta">
+      
+        
+          <time datetime="2023-12-01T16:00:00.000Z" class="dt-published" itemprop="datePublished">2023-12-02</time>
+        
+      
+    </div>
+
+
+        <span>
+    
+        <a class="" href="/2023/12/02/training/202312/">Algorithms training - 2023 12月 Training plan</a>
+    
+
+
+</span>
+      </li>
+    
+      
+      
+      
+      
       <li class="post-item">
         
     <div class="meta">
diff --git a/archives/index.html b/archives/index.html
index 8cafba7..5c95047 100644
--- a/archives/index.html
+++ b/archives/index.html
@@ -101,6 +101,30 @@ <h1 class="p-name">Stepfen Shawn</h1>
       
         <li class="post-year"><h2>2023</h2></li>
       
+      <li class="post-item">
+        
+    <div class="meta">
+      
+        
+          <time datetime="2023-12-01T16:00:00.000Z" class="dt-published" itemprop="datePublished">2023-12-02</time>
+        
+      
+    </div>
+
+
+        <span>
+    
+        <a class="" href="/2023/12/02/training/202312/">Algorithms training - 2023 12月 Training plan</a>
+    
+
+
+</span>
+      </li>
+    
+      
+      
+      
+      
       <li class="post-item">
         
     <div class="meta">
diff --git a/index.html b/index.html
index f9a880d..a174e62 100644
--- a/index.html
+++ b/index.html
@@ -154,7 +154,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
     <div class="meta">
       
         
-          <time datetime="2023-11-01T16:00:00.000Z" class="dt-published" itemprop="datePublished">2023-11-02</time>
+          <time datetime="2023-12-01T16:00:00.000Z" class="dt-published" itemprop="datePublished">2023-12-02</time>
         
       
     </div>
@@ -162,7 +162,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
 
         <span>
     
-        <a class="" href="/2023/11/02/data/csv2parquet/">csv to parquet in duckdb. 使用 duckdb将csv文件转为 parquet.</a>
+        <a class="" href="/2023/12/02/training/202312/">Algorithms training - 2023 12月 Training plan</a>
     
 
 
@@ -174,7 +174,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
     <div class="meta">
       
         
-          <time datetime="2023-10-11T05:46:21.000Z" class="dt-published" itemprop="datePublished">2023-10-11</time>
+          <time datetime="2023-11-01T16:00:00.000Z" class="dt-published" itemprop="datePublished">2023-11-02</time>
         
       
     </div>
@@ -182,7 +182,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
 
         <span>
     
-        <a class="" href="/2023/10/11/mongodb_import_csv/">Import csv data to mongodb. MongoDB导入csv文件</a>
+        <a class="" href="/2023/11/02/data/csv2parquet/">csv to parquet in duckdb. 使用 duckdb将csv文件转为 parquet.</a>
     
 
 
@@ -194,7 +194,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
     <div class="meta">
       
         
-          <time datetime="2023-09-07T16:00:00.000Z" class="dt-published" itemprop="datePublished">2023-09-08</time>
+          <time datetime="2023-10-11T05:46:21.000Z" class="dt-published" itemprop="datePublished">2023-10-11</time>
         
       
     </div>
@@ -202,7 +202,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
 
         <span>
     
-        <a class="" href="/2023/09/08/alog/linear_dp/">Algorithms training - Linear DP. 算法训练(三) 线性DP.</a>
+        <a class="" href="/2023/10/11/mongodb_import_csv/">Import csv data to mongodb. MongoDB导入csv文件</a>
     
 
 
@@ -214,7 +214,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
     <div class="meta">
       
         
-          <time datetime="2023-09-01T16:00:00.000Z" class="dt-published" itemprop="datePublished">2023-09-02</time>
+          <time datetime="2023-09-07T16:00:00.000Z" class="dt-published" itemprop="datePublished">2023-09-08</time>
         
       
     </div>
@@ -222,7 +222,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
 
         <span>
     
-        <a class="" href="/2023/09/02/alog/dp_on_tree/">Algorithms training - DP on trees. 算法训练(二) 树上DP.</a>
+        <a class="" href="/2023/09/08/alog/linear_dp/">Algorithms training - Linear DP. 算法训练(三) 线性DP.</a>
     
 
 
@@ -234,7 +234,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
     <div class="meta">
       
         
-          <time datetime="2023-08-23T16:00:00.000Z" class="dt-published" itemprop="datePublished">2023-08-24</time>
+          <time datetime="2023-09-01T16:00:00.000Z" class="dt-published" itemprop="datePublished">2023-09-02</time>
         
       
     </div>
@@ -242,7 +242,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
 
         <span>
     
-        <a class="" href="/2023/08/24/alog/sliding_window/">Algorithms training - Sliding window algorithm. 算法训练(一) 滑动窗口.</a>
+        <a class="" href="/2023/09/02/alog/dp_on_tree/">Algorithms training - DP on trees. 算法训练(二) 树上DP.</a>
     
 
 
@@ -254,7 +254,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
     <div class="meta">
       
         
-          <time datetime="2023-08-17T07:40:21.000Z" class="dt-published" itemprop="datePublished">2023-08-17</time>
+          <time datetime="2023-08-23T16:00:00.000Z" class="dt-published" itemprop="datePublished">2023-08-24</time>
         
       
     </div>
@@ -262,7 +262,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
 
         <span>
     
-        <a class="" href="/2023/08/17/mysql_over_trick/">Mysql trick -- windows function. Mysql小技巧:窗口函数</a>
+        <a class="" href="/2023/08/24/alog/sliding_window/">Algorithms training - Sliding window algorithm. 算法训练(一) 滑动窗口.</a>
     
 
 
@@ -274,7 +274,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
     <div class="meta">
       
         
-          <time datetime="2023-07-19T01:11:21.000Z" class="dt-published" itemprop="datePublished">2023-07-19</time>
+          <time datetime="2023-08-17T07:40:21.000Z" class="dt-published" itemprop="datePublished">2023-08-17</time>
         
       
     </div>
@@ -282,7 +282,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
 
         <span>
     
-        <a class="" href="/2023/07/19/spark_bug_mark1/">Cluster on windows with spark. 用Spark搭建人生第一个Windows集群</a>
+        <a class="" href="/2023/08/17/mysql_over_trick/">Mysql trick -- windows function. Mysql小技巧:窗口函数</a>
     
 
 
diff --git a/page/2/index.html b/page/2/index.html
index 1f7b068..15a4892 100644
--- a/page/2/index.html
+++ b/page/2/index.html
@@ -154,7 +154,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
     <div class="meta">
       
         
-          <time datetime="2023-03-17T13:48:11.000Z" class="dt-published" itemprop="datePublished">2023-03-17</time>
+          <time datetime="2023-07-19T01:11:21.000Z" class="dt-published" itemprop="datePublished">2023-07-19</time>
         
       
     </div>
@@ -162,7 +162,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
 
         <span>
     
-        <a class="" href="/2023/03/17/derivation_program_in_lisp/">Create a derivation program in lisp. 用 Lisp 写个求导程序</a>
+        <a class="" href="/2023/07/19/spark_bug_mark1/">Cluster on windows with spark. 用Spark搭建人生第一个Windows集群</a>
     
 
 
@@ -174,7 +174,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
     <div class="meta">
       
         
-          <time datetime="2023-01-04T15:53:10.000Z" class="dt-published" itemprop="datePublished">2023-01-04</time>
+          <time datetime="2023-03-17T13:48:11.000Z" class="dt-published" itemprop="datePublished">2023-03-17</time>
         
       
     </div>
@@ -182,7 +182,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
 
         <span>
     
-        <a class="" href="/2023/01/04/how_to_eval_in_computer/">Dive into the programming language. 在编程语言中计算过程是如何求值的?</a>
+        <a class="" href="/2023/03/17/derivation_program_in_lisp/">Create a derivation program in lisp. 用 Lisp 写个求导程序</a>
     
 
 
@@ -194,7 +194,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
     <div class="meta">
       
         
-          <time datetime="2022-04-10T03:45:09.000Z" class="dt-published" itemprop="datePublished">2022-04-10</time>
+          <time datetime="2023-01-04T15:53:10.000Z" class="dt-published" itemprop="datePublished">2023-01-04</time>
         
       
     </div>
@@ -202,7 +202,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
 
         <span>
     
-        <a class="" href="/2022/04/10/cantonese/get_cvoid19_data_in_cantonese/">Get cvoid-19 data by Cantonese! 咩话? 用粤语编程语言获取疫情数据</a>
+        <a class="" href="/2023/01/04/how_to_eval_in_computer/">Dive into the programming language. 在编程语言中计算过程是如何求值的?</a>
     
 
 
@@ -214,7 +214,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
     <div class="meta">
       
         
-          <time datetime="2021-06-28T16:00:00.000Z" class="dt-published" itemprop="datePublished">2021-06-29</time>
+          <time datetime="2022-04-10T03:45:09.000Z" class="dt-published" itemprop="datePublished">2022-04-10</time>
         
       
     </div>
@@ -222,7 +222,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
 
         <span>
     
-        <a class="" href="/2021/06/29/cantonese/cantonese_pl/">Cantonese gets 700 stars on github! 粤语编程語言集齐700个stars喇!</a>
+        <a class="" href="/2022/04/10/cantonese/get_cvoid19_data_in_cantonese/">Get cvoid-19 data by Cantonese! 咩话? 用粤语编程语言获取疫情数据</a>
     
 
 
@@ -234,7 +234,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
     <div class="meta">
       
         
-          <time datetime="2020-12-20T14:32:55.000Z" class="dt-published" itemprop="datePublished">2020-12-20</time>
+          <time datetime="2021-06-28T16:00:00.000Z" class="dt-published" itemprop="datePublished">2021-06-29</time>
         
       
     </div>
@@ -242,7 +242,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
 
         <span>
     
-        <a class="" href="/2020/12/20/cantonese/first_cantonese_pl/">What 7 your code? It&#39;s Cantonese programming language! 整古做怪 -- 开发粤语編程語言</a>
+        <a class="" href="/2021/06/29/cantonese/cantonese_pl/">Cantonese gets 700 stars on github! 粤语编程語言集齐700个stars喇!</a>
     
 
 
@@ -254,7 +254,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
     <div class="meta">
       
         
-          <time datetime="2020-07-22T14:10:52.000Z" class="dt-published" itemprop="datePublished">2020-07-22</time>
+          <time datetime="2020-12-20T14:32:55.000Z" class="dt-published" itemprop="datePublished">2020-12-20</time>
         
       
     </div>
@@ -262,7 +262,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
 
         <span>
     
-        <a class="" href="/2020/07/22/sql_inject_mark/">Dont be a SQL boy. Let&#39;s be a hacker. 记录一次 sql 注入</a>
+        <a class="" href="/2020/12/20/cantonese/first_cantonese_pl/">What 7 your code? It&#39;s Cantonese programming language! 整古做怪 -- 开发粤语編程語言</a>
     
 
 
@@ -274,7 +274,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
     <div class="meta">
       
         
-          <time datetime="2020-04-03T04:35:06.000Z" class="dt-published" itemprop="datePublished">2020-04-03</time>
+          <time datetime="2020-07-22T14:10:52.000Z" class="dt-published" itemprop="datePublished">2020-07-22</time>
         
       
     </div>
@@ -282,7 +282,7 @@ <h1 class="p-name">Stepfen Shawn</h1>
 
         <span>
     
-        <a class="" href="/2020/04/03/draw_stock_map/">Get stocks data with python. 用python获得股票数据</a>
+        <a class="" href="/2020/07/22/sql_inject_mark/">Dont be a SQL boy. Let&#39;s be a hacker. 记录一次 sql 注入</a>
     
 
 
diff --git a/page/3/index.html b/page/3/index.html
index ac3ceec..69ca391 100644
--- a/page/3/index.html
+++ b/page/3/index.html
@@ -149,6 +149,26 @@ <h1 class="p-name">Stepfen Shawn</h1>
       
     
     
+      <li class="post-item">
+        
+    <div class="meta">
+      
+        
+          <time datetime="2020-04-03T04:35:06.000Z" class="dt-published" itemprop="datePublished">2020-04-03</time>
+        
+      
+    </div>
+
+
+        <span>
+    
+        <a class="" href="/2020/04/03/draw_stock_map/">Get stocks data with python. 用python获得股票数据</a>
+    
+
+
+</span>
+      </li>
+    
       <li class="post-item">
         
     <div class="meta">
diff --git a/search.xml b/search.xml
index 0dec91b..c89a7cb 100644
--- a/search.xml
+++ b/search.xml
@@ -3,6 +3,25 @@
   
   
     
+    <entry>
+      <title>Algorithms training - 2023 12月 Training plan</title>
+      <link href="/2023/12/02/training/202312/"/>
+      <url>/2023/12/02/training/202312/</url>
+      
+        <content type="html"><![CDATA[<h1 id="2023-12月-Training-plan"><a href="#2023-12月-Training-plan" class="headerlink" title="2023 12月 Training plan"></a>2023 12月 Training plan</h1><p>今个月的重点:  </p><ul><li>滑动窗口</li><li>递归</li><li>DP</li></ul><h1 id="滑动窗口"><a href="#滑动窗口" class="headerlink" title="滑动窗口"></a>滑动窗口</h1><p><a href="https://leetcode.cn/problems/count-subarrays-where-max-element-appears-at-least-k-times/description/">统计最大元素出现至少 K 次的子数组</a><br>给你一个整数数组 nums 和一个 正整数 k 。<br>请你统计有多少满足 「 nums 中的 最大 元素」至少出现 k 次的子数组，并返回满足这一条件的子数组的数目。<br>子数组是数组中的一个连续元素序列。  </p><p>示例 1：<br>输入：nums = [1,3,2,3,3], k = 2<br>输出：6<br>解释：包含元素 3 至少 2 次的子数组为：[1,3,2,3]、[1,3,2,3,3]、[3,2,3]、[3,2,3,3]、[2,3,3] 和 [3,3]。  </p><p>思路: 首先找到nums中的最大元素mx, 我们要统计子数组的个数可以考虑滑动窗口算法。<br>设置左右指针 l 和 r, 于是我们枚举右指针 r 继续滑动, 途中我们要维护一个 cnt_max 来记录该窗口中最大元素出现的次数。<br>于是我们可以在 cnt_max == k 移动左指针 l, 目的知道 cnt_max != k 为止, 此时 [l, r] 有 k - 1 个最大元素并且 nums[l - 1]一定是最大元素, 于是对答案的贡献就为 l 了。(因为区间运算 l - 1 - 0 + 1, 子数组数量相当于从l - 1到0的每个元素开始到当前区间结束, 也就是 l 次。) </p><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br></pre></td><td class="code"><pre><span class="line"><span class="keyword">class</span> <span class="title class_">Solution</span> &#123;</span><br><span class="line"><span class="keyword">public</span>:</span><br><span class="line">    <span class="keyword">using</span> ll = <span class="type">long</span> <span class="type">long</span>;</span><br><span class="line">    <span class="function">ll <span class="title">countSubarrays</span><span class="params">(vector&lt;<span class="type">int</span>&gt;&amp; nums, <span class="type">int</span> k)</span> </span>&#123;</span><br><span class="line">        ll ans = <span class="number">0</span>;</span><br><span class="line">        <span class="type">int</span> l = <span class="number">0</span>, r = <span class="number">0</span>;</span><br><span class="line">        <span class="type">int</span> mx = *<span class="built_in">max_element</span>(nums.<span class="built_in">begin</span>(), nums.<span class="built_in">end</span>());</span><br><span class="line">        <span class="type">int</span> n = nums.<span class="built_in">size</span>();</span><br><span class="line">        <span class="type">int</span> cnt_max = <span class="number">0</span>;</span><br><span class="line">        <span class="keyword">while</span> (r &lt; n) &#123;</span><br><span class="line">            <span class="keyword">if</span> (nums[r] == mx) cnt_max++;</span><br><span class="line">            <span class="keyword">while</span> (cnt_max == k) &#123;</span><br><span class="line">                <span class="keyword">if</span> (nums[l] == mx) &#123;</span><br><span class="line">                    cnt_max--;</span><br><span class="line">                &#125;</span><br><span class="line">                l++;</span><br><span class="line">            &#125;</span><br><span class="line">            ans += (l - <span class="number">1</span>) - <span class="number">0</span> + <span class="number">1</span>;</span><br><span class="line">            r++;</span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        <span class="keyword">return</span> ans;   </span><br><span class="line">    &#125;</span><br><span class="line">&#125;;</span><br></pre></td></tr></table></figure><h1 id="递归"><a href="#递归" class="headerlink" title="递归"></a>递归</h1><h1 id="DP"><a href="#DP" class="headerlink" title="DP"></a>DP</h1>]]></content>
+      
+      
+      
+        <tags>
+            
+            <tag> alog </tag>
+            
+        </tags>
+      
+    </entry>
+    
+    
+    
     <entry>
       <title>csv to parquet in duckdb. 使用 duckdb将csv文件转为 parquet.</title>
       <link href="/2023/11/02/data/csv2parquet/"/>
diff --git a/tags/alog/index.html b/tags/alog/index.html
index 3dd5650..855bf25 100644
--- a/tags/alog/index.html
+++ b/tags/alog/index.html
@@ -101,6 +101,30 @@ <h1 class="p-name">Stepfen Shawn</h1>
       
         <li class="post-year"><h2>2023</h2></li>
       
+      <li class="post-item">
+        
+    <div class="meta">
+      
+        
+          <time datetime="2023-12-01T16:00:00.000Z" class="dt-published" itemprop="datePublished">2023-12-02</time>
+        
+      
+    </div>
+
+
+        <span>
+    
+        <a class="" href="/2023/12/02/training/202312/">Algorithms training - 2023 12月 Training plan</a>
+    
+
+
+</span>
+      </li>
+    
+      
+      
+      
+      
       <li class="post-item">
         
     <div class="meta">
