Updated README.rd - #10
Open
bikashdaga wants to merge 1 commit into
Open
Conversation
I have added supportive articles links for some of the topics under this section; "The sequence for studying Data Structures and Algorithms should be as follows" Added articles link to - 5️⃣ Hashing 8️⃣ Linked List 1️⃣0️⃣ Backtracking 1️⃣1️⃣ Tree 1️⃣2️⃣ BST 1️⃣3️⃣ Heap or priority queue 1️⃣4️⃣ Graph 1️⃣5️⃣ Greedy 1️⃣6️⃣ Dynamic programming 1️⃣7️⃣Trie I believe this will defiently help the information seeker.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
I have added supportive articles links for some of the topics under this section; "The sequence for studying Data Structures and Algorithms should be as follows"
Added articles link to these topics -
5️⃣ Hashing
8️⃣ Linked List
1️⃣0️⃣ Backtracking
1️⃣1️⃣ Tree
1️⃣2️⃣ BST
1️⃣3️⃣ Heap or priority queue
1️⃣4️⃣ Graph
1️⃣5️⃣ Greedy
1️⃣6️⃣ Dynamic programming
1️⃣7️⃣Trie
I believe this will defiently help the information seeker.