algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-31 06:13:32 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-08-03 04:38:02 +08:00
parent 3e3c4a6b0d
commit 6fc6e13139
27 changed files with 187 additions and 105 deletions
Download Patch File Download Diff File Expand all files Collapse all files

BIN
assets/covers/chapter_array_and_linkedlist.jpg
View File

Binary file not shown.
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 106 KiB

After

Width:  |  Height:  |  Size: 125 KiB

BIN
assets/covers/chapter_backtracking.jpg
View File

Binary file not shown.
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 125 KiB

After

Width:  |  Height:  |  Size: 126 KiB

BIN
assets/covers/chapter_dynamic_programming.jpg
View File

Binary file not shown.
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 70 KiB

After

Width:  |  Height:  |  Size: 164 KiB

BIN
assets/covers/chapter_greedy.jpg
View File

Binary file not shown.
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 125 KiB

After

Width:  |  Height:  |  Size: 135 KiB

BIN
assets/covers/chapter_heap.jpg
View File

Binary file not shown.
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 96 KiB

After

Width:  |  Height:  |  Size: 109 KiB

BIN
assets/covers/chapter_sorting.jpg
View File

Binary file not shown.
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 48 KiB

After

Width:  |  Height:  |  Size: 60 KiB

6
chapter_array_and_linkedlist/index.html
View File

@ -3316,6 +3316,12 @@
<div class="center-table">
<p><img alt="数组与链表" src="../assets/covers/chapter_array_and_linkedlist.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>数组的砖块整齐排列，紧贴在一起。</p>
<p>链表的砖块分散各处，连接的藤蔓自由地穿梭于砖缝之间。</p>
<p>它们共同构成了数据结构的世界。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_array_and_linkedlist/array/">4.1 &nbsp; 数组</a></li>

5
chapter_backtracking/index.html
View File

@ -3316,6 +3316,11 @@
<div class="center-table">
<p><img alt="回溯" src="../assets/covers/chapter_backtracking.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>我们如同迷宫中的探索者，在寻找出口的道路上可能会遇到困难。</p>
<p>回溯的力量让我们能够重新开始，最终寻找到正确的道路。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_backtracking/backtracking_algorithm/">13.1 &nbsp; 回溯算法</a></li>

5
chapter_computational_complexity/index.html
View File

@ -3316,6 +3316,11 @@
<div class="center-table">
<p><img alt="复杂度" src="../assets/covers/chapter_complexity_analysis.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>复杂度犹如浩瀚的算法宇宙中的指南针。</p>
<p>它引导我们在时间与空间的维度上深入探索，寻找更优雅的解决方案。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_computational_complexity/performance_evaluation/">2.1 &nbsp; 算法效率评估</a></li>

5
chapter_data_structure/index.html
View File

@ -3316,6 +3316,11 @@
<div class="center-table">
<p><img alt="数据结构" src="../assets/covers/chapter_data_structure.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>数据结构如同一副稳固而多样的框架。</p>
<p>它为数据的有序组织提供了蓝图，使算法得以在此基础上生动起来。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_data_structure/classification_of_data_structure/">3.1 &nbsp; 数据结构分类</a></li>

5
chapter_divide_and_conquer/index.html
View File

@ -3316,6 +3316,11 @@
<div class="center-table">
<p><img alt="分治" src="../assets/covers/chapter_divide_and_conquer.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>分治一次又一次地拆解难题，每一次的拆解都让问题变得更为简单。</p>
<p>从简单做起，一切都不再复杂。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_divide_and_conquer/divide_and_conquer/">12.1 &nbsp; 分治算法</a></li>

5
chapter_dynamic_programming/index.html
View File

@ -3316,6 +3316,11 @@
<div class="center-table">
<p><img alt="动态规划" src="../assets/covers/chapter_dynamic_programming.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>小溪汇入河流，江河汇入大海。</p>
<p>动态规划将小问题的解汇集成大问题的答案，一步步引领我们走向解决问题的彼岸。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_dynamic_programming/intro_to_dynamic_programming/">14.1 &nbsp; 初探动态规划</a></li>

5
chapter_graph/index.html
View File

@ -3316,6 +3316,11 @@
<div class="center-table">
<p><img alt="图" src="../assets/covers/chapter_graph.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>在生命旅途中，我们就像是每个节点，被无数看不见的边相连。</p>
<p>每一次的相识与相离，都在这张巨大的网络图中留下独特的印记。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_graph/graph/">9.1 &nbsp; 图</a></li>

5
chapter_greedy/index.html
View File

@ -3316,6 +3316,11 @@
<div class="center-table">
<p><img alt="贪心" src="../assets/covers/chapter_greedy.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>向日葵朝着太阳转动，时刻都在追求自身成长的最大可能。</p>
<p>这便是贪心的智慧，一种简单且高效的问题求解策略。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_greedy/greedy_algorithm/">15.1 &nbsp; 贪心算法</a></li>

5
chapter_hashing/index.html
View File

@ -3316,6 +3316,11 @@
<div class="center-table">
<p><img alt="散列表" src="../assets/covers/chapter_hashing.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>在计算机世界中，散列表如同一位智能的图书管理员。</p>
<p>他知道如何有序地组织数据，从而可以通过索书号快速找到目标书籍。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_hashing/hash_map/">6.1 &nbsp; 哈希表</a></li>

5
chapter_heap/index.html
View File

@ -3316,6 +3316,11 @@
<div class="center-table">
<p><img alt="堆" src="../assets/covers/chapter_heap.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>堆就像是山川的峰峦，它们层叠起伏、形态各异。</p>
<p>每一座山峰都有其高低之分，而最高的山峰总是最先映入眼帘。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_heap/heap/">8.1 &nbsp; 堆</a></li>

5
chapter_introduction/index.html
View File

@ -3316,6 +3316,11 @@
<div class="center-table">
<p><img alt="初识算法" src="../assets/covers/chapter_introduction.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>一位少女翩翩起舞，与数据交织在一起，裙摆上飘扬着算法的旋律。</p>
<p>她邀请你共舞，请紧跟她的步伐，踏入充满逻辑与美感的算法世界。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_introduction/algorithms_are_everywhere/">1.1 &nbsp; 算法无处不在</a></li>

5
chapter_preface/index.html
View File

@ -3314,6 +3314,11 @@
<div class="center-table">
<p><img alt="前言" src="../assets/covers/chapter_preface.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>这本书是为所有想要了解并掌握算法的读者编写的。</p>
<p>无论你的背景如何，都可以在这里找到属于你的学习之旅。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_preface/about_the_book/">0.1 &nbsp; 关于本书</a></li>

5
chapter_searching/index.html
View File

@ -3316,6 +3316,11 @@
<div class="center-table">
<p><img alt="搜索" src="../assets/covers/chapter_searching.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>搜索是一场未知的冒险，我们或许需要走遍神秘空间的每个角落，又或许可以快速锁定目标。</p>
<p>在这场寻觅之旅中，每一次探索都可能得到一个未曾料想的答案。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_searching/binary_search/">10.1 &nbsp; 二分查找</a></li>

5
chapter_sorting/index.html
View File

@ -3316,6 +3316,11 @@
<div class="center-table">
<p><img alt="排序" src="../assets/covers/chapter_sorting.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>排序犹如一把将混乱变为秩序的魔法钥匙，使我们能以更高效的方式理解与处理数据。</p>
<p>无论是简单的升序，还是复杂的分类排列，排序都向我们展示了数据的和谐美感。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_sorting/sorting_algorithm/">11.1 &nbsp; 排序算法</a></li>

5
chapter_stack_and_queue/index.html
View File

@ -3316,6 +3316,11 @@
<div class="center-table">
<p><img alt="栈与队列" src="../assets/covers/chapter_stack_and_queue.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>栈如同叠猫猫，而队列就像猫猫排队。</p>
<p>两者分别代表着先入后出和先入先出的逻辑关系。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_stack_and_queue/stack/">5.1 &nbsp; 栈</a></li>

3
chapter_tree/binary_search_tree/index.html
View File

@ -4100,7 +4100,8 @@
<p><img alt="在二叉搜索树中删除节点（度为 1）" src="../binary_search_tree.assets/bst_remove_case2.png" /></p>
<p align="center"> Fig. 在二叉搜索树中删除节点（度为 1） </p>
<p>当待删除节点的度为 <span class="arithmatex">\(2\)</span> 时，我们无法直接删除它，而需要使用一个节点替换该节点。由于要保持二叉搜索树“左 <span class="arithmatex">\(&lt;\)</span> 根 <span class="arithmatex">\(&lt;\)</span> 右”的性质，因此这个节点可以是右子树的最小节点或左子树的最大节点。假设我们选择右子树的最小节点（或者称为中序遍历的下个节点），则删除操作为：</p>
<p>当待删除节点的度为 <span class="arithmatex">\(2\)</span> 时，我们无法直接删除它，而需要使用一个节点替换该节点。由于要保持二叉搜索树“左 <span class="arithmatex">\(&lt;\)</span> 根 <span class="arithmatex">\(&lt;\)</span> 右”的性质，因此这个节点可以是右子树的最小节点或左子树的最大节点。</p>
<p>假设我们选择右子树的最小节点（即中序遍历的下一个节点），则删除操作为：</p>
<ol>
<li>找到待删除节点在“中序遍历序列”中的下一个节点，记为 <code>tmp</code> 。</li>
<li>将 <code>tmp</code> 的值覆盖待删除节点的值，并在树中递归删除节点 <code>tmp</code> 。</li>

5
chapter_tree/index.html
View File

@ -3316,6 +3316,11 @@
<div class="center-table">
<p><img alt="树" src="../assets/covers/chapter_tree.jpg" width="600" /></p>
</div>
<div class="admonition abstract">
<p class="admonition-title">Abstract</p>
<p>参天大树充满生命力，其根深叶茂，分枝扶疏。</p>
<p>它为我们展现了数据分治的生动形态。</p>
</div>
<h2 id="_1">本章内容<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h2>
<ul>
<li><a href="https://www.hello-algo.com/chapter_tree/binary_tree/">7.1 &nbsp; 二叉树</a></li>

6
index.html
View File

@ -3355,9 +3355,9 @@
<hr />
<h2 align="center"> 序 </h2>
<p>两年前，我在力扣上分享了《剑指 Offer》系列题解，受到了许多朋友的喜爱与支持。在此期间，我回答了众多读者的评论问题，其中最常见的一个问题是“如何入门学习算法”。我逐渐也对这个问题产生了浓厚的兴趣。</p>
<p>两眼一抹黑地刷题似乎是最受欢迎的方法，简单直接且有效。然而，刷题就如同玩“扫雷”游戏，自学能力强的同学能够顺利地将地雷逐个排掉，而基础不足的同学很可能被炸的满头是包，并在挫折中步步退缩。通读教材书籍也是一种常见做法，但对于面向求职的同学来说，毕业季、投递简历、准备笔试面试已经占据了大部分精力，厚重的书籍往往变成了一项艰巨的挑战。</p>
<p>如果你也面临类似的困扰，那么很幸运这本书找到了你。本书是我对此问题的给出的答案，虽然不一定正确，但至少是一次积极的尝试。这本书虽然不足以让你直接拿到 Offer ，但会引导你探索数据结构与算法的“知识地图”，带你了解不同“地雷”的形状大小和分布位置，让你掌握各种“排雷方法”。有了这些本领，相信你可以更加自如地应对刷题和阅读文献，逐步构建起完整的知识体系。</p>
<p>两年前，我在力扣上分享了《剑指 Offer》系列题解，受到了许多同学的喜爱和支持。在与读者的交流期间，最常收到的一个问题是“如何入门学习算法”。逐渐地，我对这个问题产生了浓厚的兴趣。</p>
<p>两眼一抹黑地刷题似乎是最受欢迎的方法，简单直接且有效。然而刷题就如同玩“扫雷”游戏，自学能力强的同学能够顺利地将地雷逐个排掉，而基础不足的同学很可能被炸的满头是包，并在挫折中步步退缩。通读教材书籍也是一种常见做法，但对于面向求职的同学来说，毕业季、投递简历、准备笔试面试已经占据了大部分精力，厚重的书籍往往变成了一项艰巨的挑战。</p>
<p>如果你也面临类似的困扰，那么很幸运这本书找到了你。本书是我对此问题的给出的答案，即使不是最优解，也至少是一次积极的尝试。这本书虽然不足以让你直接拿到 Offer ，但会引导你探索数据结构与算法的“知识地图”，带你了解不同“地雷”的形状大小和分布位置，让你掌握各种“排雷方法”。有了这些本领，相信你可以更加自如地应对刷题和阅读文献，逐步构建起完整的知识体系。</p>
<h3 align="left"> 作者简介 </h3>
<p>靳宇栋 (<a href="https://leetcode.cn/u/jyd/">Krahets</a>)，大厂高级算法工程师，上海交通大学硕士。力扣（LeetCode）全网阅读量最高博主，其 LeetBook《图解算法数据结构》已被订阅 24 万本。</p>

2
search/search_index.json
View File

File diff suppressed because one or more lines are too long

200
sitemap.xml
View File

@ -2,502 +2,502 @@
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://www.hello-algo.com/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_appendix/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_appendix/contribution/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_appendix/installation/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/array/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/linked_list/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/list/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/backtracking_algorithm/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/n_queens_problem/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/permutations_problem/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/subset_sum_problem/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/performance_evaluation/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/space_complexity/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/time_complexity/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/basic_data_types/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/character_encoding/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/classification_of_data_structure/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/number_encoding/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/binary_search_recur/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/build_binary_tree_problem/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/divide_and_conquer/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/hanota_problem/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/dp_problem_features/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/dp_solution_pipeline/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/edit_distance_problem/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/intro_to_dynamic_programming/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/knapsack_problem/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/unbounded_knapsack_problem/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/graph/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/graph_operations/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/graph_traversal/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/fractional_knapsack_problem/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/greedy_algorithm/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/max_capacity_problem/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/max_product_cutting_problem/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/hash_algorithm/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/hash_collision/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/hash_map/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/build_heap/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/heap/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/top_k/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_introduction/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_introduction/algorithms_are_everywhere/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_introduction/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_introduction/what_is_dsa/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_preface/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_preface/about_the_book/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_preface/suggestions/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_preface/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_reference/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/binary_search/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/binary_search_edge/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/replace_linear_by_hashing/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/searching_algorithm_revisited/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/bubble_sort/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/bucket_sort/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/counting_sort/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/heap_sort/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/insertion_sort/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/merge_sort/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/quick_sort/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/radix_sort/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/selection_sort/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/sorting_algorithm/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/deque/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/queue/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/stack/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/array_representation_of_tree/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/avl_tree/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/binary_search_tree/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/binary_tree/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/binary_tree_traversal/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/summary/</loc>
<lastmod>2023-08-01</lastmod>
<lastmod>2023-08-02</lastmod>
<changefreq>daily</changefreq>
</url>
</urlset>

BIN
sitemap.xml.gz
View File

Binary file not shown.