Commit graph

101 commits

Author SHA1 Message Date
Yudong Jin
075c3abf88
Add the section of max product cutting problem. (#642) 2023-07-21 21:56:14 +08:00
Yudong Jin
76f11ae168
Add the section of max capacity problem. (#639) 2023-07-21 15:16:51 +08:00
Yudong Jin
2b7d7aa827
Add the chapter of greedy. (#633)
Add the section of fractional knapsack.
2023-07-20 18:26:54 +08:00
krahets
4e13755023 Add implementation of array binary tree.
Rewrite the tree serialization and deserialization methods.
Add applications of array and linked list.
2023-07-19 16:09:27 +08:00
krahets
c68f18e480 Finetune 2023-07-19 01:45:14 +08:00
krahets
34985bdf2b Add the summary of chapter divide and conquer
Enable instant loading feature
Fix the math rendering in mathjax.js
2023-07-17 20:23:46 +08:00
krahets
06b309d021 1. Add section links to the chapter page.
2. Add chapter icons to navigation panel.
3. Replace recently added text with icon.
2023-07-17 17:54:48 +08:00
krahets
fc7bcb615d Add the section of binary_search_recur. 2023-07-17 03:48:33 +08:00
Yudong Jin
909daea105
Add the section of hanota problem. (#614) 2023-07-17 02:20:49 +08:00
Yudong Jin
51a4c5089e
feat: Add the chapter of divide and conquer (#609)
* Add the chapter of divide and conquer.
Add the section of divide and conquer algorithm.
Add the section of build tree problem.

* Update build_tree.py
2023-07-16 04:24:04 +08:00
krahets
b2b2fa335c Update the summary of the chapter DP. 2023-07-14 03:08:08 +08:00
Yudong Jin
c3f80e52af
Add the section of edit distance problem (#599) 2023-07-13 05:27:47 +08:00
krahets
1c02859b13 Add the section of unbounded knapsack problem. 2023-07-11 19:22:41 +08:00
Yudong Jin
d6cc92614c
add the section of dp solution pipeline (#588) 2023-07-09 02:43:00 +08:00
Yudong Jin
55d8b710fa
Add the section of knapsack problem. (#580) 2023-07-06 00:06:14 +08:00
krahets
663ac70064 Divide the intro_to_dp into two sections. 2023-07-01 22:38:20 +08:00
krahets
92d165cfcc Modify the chapter names.
Fix the definition of algorithm.
Update the buttons in the landing page.
2023-07-01 03:03:42 +08:00
krahets
98e797f1fc Fix the bst python code.
Fitune the chapters name.
2023-06-30 05:09:17 +08:00
krahets
be8912073e Collapse the navigation by default 2023-06-30 04:49:03 +08:00
Yudong Jin
3f03663d2e
feat: add the section of the introduction to dynamic programming (#571)
* add the section of the introduction to
dynamic programming

* add a code comments.
2023-06-30 04:31:43 +08:00
Yudong Jin
674ff2910a
Add the summary of backtracking (#561) 2023-06-22 00:22:15 +08:00
krahets
d57469e2b8 Update slogan 2023-06-21 19:39:15 +08:00
Yudong Jin
0e2ddba30f
Add the section of subset sum problem. (#558) 2023-06-21 02:58:24 +08:00
krahets
fd8b9ce853 Update README and the landing page. 2023-06-19 05:34:41 +08:00
krahets
c070d9f933 Update the landing page and README.
Add a example to algorithms_are_everywhere.md.
2023-06-18 04:39:20 +08:00
Yudong Jin
29e6617ec1
Add the section of hash algorithm. Refactor the section of hash map. (#555) 2023-06-16 21:20:57 +08:00
krahets
5a2a03416f Update the section of hash collision. 2023-06-14 03:58:39 +08:00
Yudong Jin
9563965a20
Add the codes of hashmap (#553)
of chaining and open addressing
2023-06-14 02:01:06 +08:00
krahets
6c372542ae Add new label. 2023-06-12 23:14:16 +08:00
Yudong Jin
a111b94f23
feat: Add the section of Top-K problem (#551)
* Add the section of Top-K problem

* Update my_heap.py

* Update build_heap.md

* Update my_heap.py
2023-06-12 23:04:01 +08:00
Yudong Jin
041a989d33
Add the chapter cover images (#528) 2023-06-02 01:36:51 +08:00
krahets
fb72aa385e Polish some texts. 2023-05-26 20:34:48 +08:00
Yudong Jin
ee716a2c23
feat: Add the section of heap sort. (#516)
* Add the section of heap sort.

* Update heap_sort.cpp
2023-05-26 04:46:56 +08:00
krahets
b9178bc7d6 Polish some texts. 2023-05-24 20:57:08 +08:00
Yudong Jin
77b4f4c400
Add the section of selection sort. (#513) 2023-05-24 00:35:46 +08:00
krahets
d3cc149c5a Merge the chapter of binary tree and searching. 2023-05-21 19:26:52 +08:00
Yudong Jin
b5eb9ca271
feat: Add the section of binary search edge. (#508)
* Add the section of binary search edge.

* Delete binary_search_rotation.py
2023-05-21 19:04:21 +08:00
krahets
e66fc03399 Add Q&A to the chapter of data structure.
Update the section of character encoding.
2023-05-17 20:33:45 +08:00
krahets
7cfe6d7efe Add the section of number encoding
and character encoding
2023-05-17 04:38:32 +08:00
krahets
db6caf0d43 Update n queens. 2023-05-05 03:42:01 +08:00
Yudong Jin
67d647ab59
feat: Add the section of n queens problem (#483)
* Add the section of n queens problem

* Update n_queens.py

* Update n_queens.java

* Update n_queens.cpp

* Update n_queens.java
2023-05-04 05:27:17 +08:00
Yudong Jin
c6eecfd0dc
feat: Add the section of permutations problem. (#476)
* Add the section of permutations problem.

* Update permutations_problem.md
2023-04-24 03:33:30 +08:00
krahets
1d6b7a5644 Reconstruct the chapter of the tree. 2023-04-17 21:01:06 +08:00
Yudong Jin
881d573790
Refactor the articles related to searching algorithm. Add the chapter of binary search. Add the section of searching algorithm revisited. (#464) 2023-04-17 18:22:18 +08:00
krahets
0ade8d87ad Update the page tree 2023-04-16 16:38:04 +08:00
Yudong Jin
49606fd199
Add the chapter of backtracking. (#459) 2023-04-16 04:52:42 +08:00
Yudong Jin
34a1bca627
Add the section of radix sort. (#441) 2023-03-26 22:02:37 +08:00
krahets
c338a6d8d8 Add the section of bucket sort 2023-03-26 04:47:05 +08:00
Yudong Jin
ceeb138487
Add the section of counting sort. (#427) 2023-03-19 23:42:12 +08:00
krahets
ba78fead8e Update README.md 2023-03-10 02:06:29 +08:00