Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Modify /Algorithms/Readme.md for Better UX #1

Open
wants to merge 3 commits into
base: main
Choose a base branch
from
Open

Modify /Algorithms/Readme.md for Better UX #1

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
2c1c117
Update README.md
pikachu-sentinel Jun 9, 2024
8c14669
Update README.md
pikachu-sentinel Jun 9, 2024
8ff0bd5
Add List of algorithms & it's direct links to README.md
pikachu-sentinel Jun 9, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
25 changes: 24 additions & 1 deletion algorithms/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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](https://www.techinterviewhandbook.org/algorithms/array/) | High |
| [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 |

<!-- TODO: Remove in future -->