From 2c1c117311646788be089aaeaa127cff53e5c2ce Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Senior=20IoT=20Engineer=20=F0=9F=9A=80?= <155702693+topone-engineer@users.noreply.github.com> Date: Sun, 9 Jun 2024 16:33:35 -0500 Subject: [PATCH 1/3] Update README.md --- algorithms/README.md | 25 ++++++++++++++++++++++++- 1 file changed, 24 insertions(+), 1 deletion(-) diff --git a/algorithms/README.md b/algorithms/README.md index bda76ae690..ad0f71c00d 100644 --- a/algorithms/README.md +++ b/algorithms/README.md @@ -1,5 +1,28 @@ # Algorithms -The contents have been moved to the [website](https://www.techinterviewhandbook.org/algorithms/study-cheatsheet). +The contents have been moved to the [www.techinterviewhandbook.org](https://www.techinterviewhandbook.org/algorithms/study-cheatsheet). + +Here's the Data Structure and Algorithmstable you can learn on [www.techinterviewhandbook.org](https://www.techinterviewhandbook.org/algorithms/study-cheatsheet) + +| Topic | Priority | +|-------------------|-----------| +| Array | High | +| String | High | +| Hash Table | Mid | +| Recursion | Mid | +| Sorting and searching | High | +| Matrix | High | +| Linked List | Mid | +| Queue | Mid | +| Stack | Mid | +| Tree | High | +| Graph | High | +| Heap | Mid | +| Trie | Mid | +| Interval | Mid | +| Dynamic programming | Low | +| Binary | Low | +| Math | Low | +| Geometry | Low | From 8c1466956f1b1dc2d6a9888a22e55170346c6e39 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Senior=20IoT=20Engineer=20=F0=9F=9A=80?= <155702693+topone-engineer@users.noreply.github.com> Date: Sun, 9 Jun 2024 16:34:28 -0500 Subject: [PATCH 2/3] Update README.md --- algorithms/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/algorithms/README.md b/algorithms/README.md index ad0f71c00d..b543c9543f 100644 --- a/algorithms/README.md +++ b/algorithms/README.md @@ -6,7 +6,7 @@ Here's the Data Structure and Algorithmstable you can learn on [www.techintervie | Topic | Priority | |-------------------|-----------| -| Array | High | +| [Array](https://www.techinterviewhandbook.org/algorithms/array/) | High | | String | High | | Hash Table | Mid | | Recursion | Mid | From 8ff0bd586681f2ef1e56c32e8c486369259d7d5f Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Senior=20IoT=20Engineer=20=F0=9F=9A=80?= <155702693+topone-engineer@users.noreply.github.com> Date: Sun, 9 Jun 2024 16:40:49 -0500 Subject: [PATCH 3/3] Add List of algorithms & it's direct links to README.md For prevent unexpected link to other website and increase better UX I modified [website] to [www.techinterviewhandbook.org] and give list of algorithms which can link directly. This is my first contribution and I hope I can contribute more and more. Thanks. --- algorithms/README.md | 34 +++++++++++++++++----------------- 1 file changed, 17 insertions(+), 17 deletions(-) diff --git a/algorithms/README.md b/algorithms/README.md index b543c9543f..999986a3dd 100644 --- a/algorithms/README.md +++ b/algorithms/README.md @@ -7,22 +7,22 @@ Here's the Data Structure and Algorithmstable you can learn on [www.techintervie | Topic | Priority | |-------------------|-----------| | [Array](https://www.techinterviewhandbook.org/algorithms/array/) | High | -| String | High | -| Hash Table | Mid | -| Recursion | Mid | -| Sorting and searching | High | -| Matrix | High | -| Linked List | Mid | -| Queue | Mid | -| Stack | Mid | -| Tree | High | -| Graph | High | -| Heap | Mid | -| Trie | Mid | -| Interval | Mid | -| Dynamic programming | Low | -| Binary | Low | -| Math | Low | -| Geometry | Low | +| [String](https://www.techinterviewhandbook.org/algorithms/string/) | High | +| [Hash Table](https://www.techinterviewhandbook.org/algorithms/hash-table/) | Mid | +| [Recursion](https://www.techinterviewhandbook.org/algorithms/recursion/) | Mid | +| [Sorting and searching](https://www.techinterviewhandbook.org/algorithms/sorting-searching/) | High | +| [Matrix](https://www.techinterviewhandbook.org/algorithms/matrix/) | High | +| [Linked List](https://www.techinterviewhandbook.org/algorithms/linked-list/) | Mid | +| [Queue](https://www.techinterviewhandbook.org/algorithms/queue/) | Mid | +| [Stack](https://www.techinterviewhandbook.org/algorithms/stack/) | Mid | +| [Tree](https://www.techinterviewhandbook.org/algorithms/tree/) | High | +| [Graph](https://www.techinterviewhandbook.org/algorithms/graph/) | High | +| [Heap](https://www.techinterviewhandbook.org/algorithms/heap/) | Mid | +| [Trie](https://www.techinterviewhandbook.org/algorithms/trie/) | Mid | +| [Interval](https://www.techinterviewhandbook.org/algorithms/interval/) | Mid | +| [Dynamic programming](https://www.techinterviewhandbook.org/algorithms/dynamic-programming/) | Low | +| [Binary](https://www.techinterviewhandbook.org/algorithms/binary/) | Low | +| [Math](https://www.techinterviewhandbook.org/algorithms/math/) | Low | +| [Geometry](https://www.techinterviewhandbook.org/algorithms/geometry/) | Low |