build

en/docs/chapter_array_and_linkedlist/index.md

@@ -13,10 +13,10 @@ icon: material/view-list-outline
 
     In arrays, envision bricks snugly aligned, each resting seamlessly beside the next, creating a unified formation. Meanwhile, in linked lists, these bricks disperse freely, embraced by vines gracefully knitting connections between them.
 
-## Chapter Contents
+## Chapter contents
 
-- [4.1   Array](https://www.hello-algo.com/en/chapter_array_and_linkedlist/array/)
-- [4.2   Linked list](https://www.hello-algo.com/en/chapter_array_and_linkedlist/linked_list/)
-- [4.3   List](https://www.hello-algo.com/en/chapter_array_and_linkedlist/list/)
-- [4.4   Memory and cache](https://www.hello-algo.com/en/chapter_array_and_linkedlist/ram_and_cache/)
-- [4.5   Summary](https://www.hello-algo.com/en/chapter_array_and_linkedlist/summary/)
+- [4.1   Array](array.md)
+- [4.2   Linked list](linked_list.md)
+- [4.3   List](list.md)
+- [4.4   Memory and cache](ram_and_cache.md)
+- [4.5   Summary](summary.md)

en/docs/chapter_computational_complexity/index.md

@@ -13,10 +13,10 @@ icon: material/timer-sand
 
     It guides us in exploring deeper within the the dimensions of time and space, seeking more elegant solutions.
 
-## Chapter Contents
+## Chapter contents
 
-- [2.1   Algorithm efficiency assessment](https://www.hello-algo.com/en/chapter_computational_complexity/performance_evaluation/)
-- [2.2   Iteration and recursion](https://www.hello-algo.com/en/chapter_computational_complexity/iteration_and_recursion/)
-- [2.3   Time complexity](https://www.hello-algo.com/en/chapter_computational_complexity/time_complexity/)
-- [2.4   Space complexity](https://www.hello-algo.com/en/chapter_computational_complexity/space_complexity/)
-- [2.5   Summary](https://www.hello-algo.com/en/chapter_computational_complexity/summary/)
+- [2.1   Algorithm efficiency assessment](performance_evaluation.md)
+- [2.2   Iteration and recursion](iteration_and_recursion.md)
+- [2.3   Time complexity](time_complexity.md)
+- [2.4   Space complexity](space_complexity.md)
+- [2.5   Summary](summary.md)

en/docs/chapter_data_structure/index.md

@@ -13,10 +13,10 @@ icon: material/shape-outline
 
     They offer a blueprint for the orderly organization of data, upon which algorithms come to life.
 
-## Chapter Contents
+## Chapter contents
 
-- [3.1   Classification of data structures](https://www.hello-algo.com/en/chapter_data_structure/classification_of_data_structure/)
-- [3.2   Fundamental data types](https://www.hello-algo.com/en/chapter_data_structure/basic_data_types/)
-- [3.3   Number encoding *](https://www.hello-algo.com/en/chapter_data_structure/number_encoding/)
-- [3.4   Character encoding *](https://www.hello-algo.com/en/chapter_data_structure/character_encoding/)
-- [3.5   Summary](https://www.hello-algo.com/en/chapter_data_structure/summary/)
+- [3.1   Classification of data structures](classification_of_data_structure.md)
+- [3.2   Fundamental data types](basic_data_types.md)
+- [3.3   Number encoding *](number_encoding.md)
+- [3.4   Character encoding *](character_encoding.md)
+- [3.5   Summary](summary.md)

en/docs/chapter_graph/index.md

@@ -13,9 +13,9 @@ icon: material/graphql
     
     Every encountering and parting leaves a unique mark on this vast network graph.
 
-## Chapter Contents
+## Chapter contents
 
-- [9.1   Graph](https://www.hello-algo.com/en/chapter_graph/graph/)
-- [9.2   Basic Graph Operations](https://www.hello-algo.com/en/chapter_graph/graph_operations/)
-- [9.3   Graph Traversal](https://www.hello-algo.com/en/chapter_graph/graph_traversal/)
-- [9.4   Summary](https://www.hello-algo.com/en/chapter_graph/summary/)
+- [9.1   Graph](graph.md)
+- [9.2   Basic Graph Operations](graph_operations.md)
+- [9.3   Graph Traversal](graph_traversal.md)
+- [9.4   Summary](summary.md)

en/docs/chapter_hashing/index.md

@@ -13,9 +13,9 @@ icon: material/table-search
     
     It understands how to compute index numbers, enabling swift retrieval of the desired book.
 
-## Chapter Contents
+## Chapter contents
 
-- [6.1   Hash table](https://www.hello-algo.com/en/chapter_hashing/hash_map/)
-- [6.2   Hash collision](https://www.hello-algo.com/en/chapter_hashing/hash_collision/)
-- [6.3   Hash algorithm](https://www.hello-algo.com/en/chapter_hashing/hash_algorithm/)
-- [6.4   Summary](https://www.hello-algo.com/en/chapter_hashing/summary/)
+- [6.1   Hash table](hash_map.md)
+- [6.2   Hash collision](hash_collision.md)
+- [6.3   Hash algorithm](hash_algorithm.md)
+- [6.4   Summary](summary.md)

en/docs/chapter_heap/index.md

@@ -13,9 +13,9 @@ icon: material/family-tree
 
     Among these peaks, the highest one always catches the eye first.
 
-## Chapter Contents
+## Chapter contents
 
-- [8.1   Heap](https://www.hello-algo.com/en/chapter_heap/heap/)
-- [8.2   Building a Heap](https://www.hello-algo.com/en/chapter_heap/build_heap/)
-- [8.3   Top-k Problem](https://www.hello-algo.com/en/chapter_heap/top_k/)
-- [8.4   Summary](https://www.hello-algo.com/en/chapter_heap/summary/)
+- [8.1   Heap](heap.md)
+- [8.2   Building a Heap](build_heap.md)
+- [8.3   Top-k Problem](top_k.md)
+- [8.4   Summary](summary.md)

en/docs/chapter_introduction/index.md

@@ -13,8 +13,8 @@ icon: material/calculator-variant-outline
    
     She invites you to a dance, follow her steps, and enter the world of algorithms full of logic and beauty.
 
-## Chapter Contents
+## Chapter contents
 
-- [1.1   Algorithms are everywhere](https://www.hello-algo.com/en/chapter_introduction/algorithms_are_everywhere/)
-- [1.2   What is an algorithm](https://www.hello-algo.com/en/chapter_introduction/what_is_dsa/)
-- [1.3   Summary](https://www.hello-algo.com/en/chapter_introduction/summary/)
+- [1.1   Algorithms are everywhere](algorithms_are_everywhere.md)
+- [1.2   What is an algorithm](what_is_dsa.md)
+- [1.3   Summary](summary.md)

en/docs/chapter_preface/index.md

@@ -13,8 +13,8 @@ icon: material/book-open-outline
    
     May this book ring softly in your mind, leaving a unique and profound melody.
 
-## Chapter Contents
+## Chapter contents
 
-- [0.1   About this book](https://www.hello-algo.com/en/chapter_preface/about_the_book/)
-- [0.2   How to read](https://www.hello-algo.com/en/chapter_preface/suggestions/)
-- [0.3   Summary](https://www.hello-algo.com/en/chapter_preface/summary/)
+- [0.1   About this book](about_the_book.md)
+- [0.2   How to read](suggestions.md)
+- [0.3   Summary](summary.md)

en/docs/chapter_stack_and_queue/index.md

@@ -13,9 +13,9 @@ icon: material/stack-overflow
     
     They represent the logical relationships of Last-In-First-Out (LIFO) and First-In-First-Out (FIFO), respectively.
 
-## Chapter Contents
+## Chapter contents
 
-- [5.1   Stack](https://www.hello-algo.com/en/chapter_stack_and_queue/stack/)
-- [5.2   Queue](https://www.hello-algo.com/en/chapter_stack_and_queue/queue/)
-- [5.3   Double-ended queue](https://www.hello-algo.com/en/chapter_stack_and_queue/deque/)
-- [5.4   Summary](https://www.hello-algo.com/en/chapter_stack_and_queue/summary/)
+- [5.1   Stack](stack.md)
+- [5.2   Queue](queue.md)
+- [5.3   Double-ended queue](deque.md)
+- [5.4   Summary](summary.md)

en/docs/chapter_tree/index.md

@@ -13,11 +13,11 @@ icon: material/graph-outline
     
     It vividly demonstrates the form of data divide-and-conquer.
 
-## Chapter Contents
+## Chapter contents
 
-- [7.1   Binary Tree](https://www.hello-algo.com/en/chapter_tree/binary_tree/)
-- [7.2   Binary Tree Traversal](https://www.hello-algo.com/en/chapter_tree/binary_tree_traversal/)
-- [7.3   Array Representation of Tree](https://www.hello-algo.com/en/chapter_tree/array_representation_of_tree/)
-- [7.4   Binary Search Tree](https://www.hello-algo.com/en/chapter_tree/binary_search_tree/)
-- [7.5   AVL Tree *](https://www.hello-algo.com/en/chapter_tree/avl_tree/)
-- [7.6   Summary](https://www.hello-algo.com/en/chapter_tree/summary/)
+- [7.1   Binary Tree](binary_tree.md)
+- [7.2   Binary Tree Traversal](binary_tree_traversal.md)
+- [7.3   Array Representation of Tree](array_representation_of_tree.md)
+- [7.4   Binary Search Tree](binary_search_tree.md)
+- [7.5   AVL Tree *](avl_tree.md)
+- [7.6   Summary](summary.md)