github_mirrors/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-02-02 22:43:50 +08:00
Code Issues Packages Projects Releases Wiki Activity
1,432 Commits 4 Branches 9 Tags 391 MiB
4e13755023
Commit Graph

749 Commits

Author SHA1 Message Date
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
hpstory
7a6fd4b3dd
feat(csharp): add csharp code for charper divide and conquer (#628) 2023-07-19 01:19:49 +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
2caf3464ad Add the chapter cover image for divide and conquer 2023-07-17 04:53:54 +08:00
krahets
1f784dadb0 Add Java and C++ code for the chapter of 
divide and conquer.
 2023-07-17 04:20:12 +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
krahets
f839dc1b0e Fix naming of the section 
build_binary_tree_problem
 2023-07-17 02:18:53 +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
krahets
bbf8aa2019 Add the summary of chapter DP. 
Finetune the articles of DP.
 2023-07-14 02:54:47 +08:00
Yudong Jin
c3f80e52af
Add the section of edit distance problem (#599) 2023-07-13 05:27:47 +08:00
krahets
73190703ea Add playing cards sorting example to 
algos_are_everywhere
 2023-07-12 03:52:33 +08:00
krahets
05cde001df Finetune the articles. 2023-07-11 19:23:46 +08:00
krahets
1c02859b13 Add the section of unbounded knapsack problem. 2023-07-11 19:22:41 +08:00
krahets
ad0fd45cfb Add Java and C++ code for the chapter of DP. 2023-07-11 01:08:26 +08:00
krahets
465dafe9ec Update the text and code of DP. 2023-07-10 20:36:48 +08:00
Yudong Jin
d6cc92614c
add the section of dp solution pipeline (#588) 2023-07-09 02:43:00 +08:00
krahets
cddddb8b8b Update knapsack_problem and intro_to_dp 
Fix avl_tree
 2023-07-09 02:39:58 +08:00
Yudong Jin
55d8b710fa
Add the section of knapsack problem. (#580) 2023-07-06 00:06:14 +08:00
krahets
470bc10a74 Fix some contents. 2023-07-06 00:04:11 +08:00
krahets
200275b39a Update index.md 
Add the code to hash_algorithm.md
 2023-07-03 16:56:42 +08:00
krahets
9b15072a85 Update the chapter of DP. 2023-07-03 16:35:37 +08:00
krahets
067e9d4fd1 Update intro_to_dp 2023-07-02 03:56:40 +08:00
krahets
663ac70064 Divide the intro_to_dp into two sections. 2023-07-01 22:38:20 +08:00
krahets
1113d03a8f Add new Q&As. 2023-07-01 22:37:26 +08:00
nuomi1
7f8b0fff54
feat: add Swift codes for hash_collision article (#569) 
* feat: add Swift codes for hash_collision article

* refactor: extract common Pair

* Update hash_map.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-01 20:39:55 +08:00
krahets
69920a0599 Fix binary search. 
Finetune a figure in intro_to_dp.
 2023-07-01 20:07:21 +08:00
krahets
d8b2eb1a32 Fix the introduction to DP. 2023-07-01 05:02:01 +08:00
krahets
1804f8759e Update the figures in algorithms_are_everywhere. 2023-07-01 04:43:55 +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
920512d872 Update the section of intro to DP. 2023-07-01 03:02:50 +08:00
krahets
ba481cb8e6 Simplify the python code of bst and avl tree. 2023-06-30 05:17:30 +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
hpstory
4722e7bca7
feat(csharp/hashing): add code and update docs to chapter hashing (#568) 
* feat(csharp/hashing): add code and update docs to chapter hashing

* revert linked list to list
 2023-06-26 23:08:55 +08:00
krahets
54dc288e61 1. Remove Pair class from hash coliision code. 
2. Fix the comment in my_list code.
3. Add a Q&A to the summary of sorting.
 2023-06-26 23:06:15 +08:00
krahets
7876e3e88c Update Go code of subset sum. 2023-06-25 21:59:44 +08:00
krahets
3902ccbfc7 Fine-tune the docs. 2023-06-25 21:11:24 +08:00
liuyuxin
62e8f0df50
feat: complete Dart codes for chapter_hashing (#566) 2023-06-25 20:57:37 +08:00
Sizhuo Long
efc1c2f49f
add Q&A of hashing, heap, sorting and tree chapter (#564) 
* add`Q&A` of `stack_and_queue` chapter

* Update summary.md

* Update summary.md

* add`Q&A` of `hashing` chapter

* add`Q&A` of `hashing` chapter

* add`Q&A` of `hashing` chapter

* add`Q&A` of `tree` chapter

* add`Q&A` of `heap` chapter

* Update summary.md

* add`Q&A` of `sorting` chapter

* Update summary.md

* Update summary.md

* Update summary.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-06-25 20:50:20 +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
1b1af8d038
Add Java and C++ code for the section hash algorithm (#560) 2023-06-21 19:26:16 +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
krahets
b6b03ef84b Fix the figures of binary tree. 
Replace null with None.
 2023-06-17 00:45:41 +08:00