Commit

Author: prbhtkumr

readme.md

@@ -1,120 +1,119 @@
-Topic-Wise Roadmap To Learn Data Structures and Algorithms
+Topic-Wise Roadmap To Learning Data Structures and Algorithms
 ===============================================
--------------------
-<br>
+-------------
 <br>
 
 # 1. Arrays
 
 ###	-Bare Minimum
-- [ ] [  Top 50 Array Coding Problems - GeeksForGeeks](https://www.geeksforgeeks.org/top-50-array-coding-problems-for-interviews/ "Top 50 Array Coding Problems - GeeksForGeeks")
+> - [ ] [  Top 50 Array Coding Problems - GeeksForGeeks](https://www.geeksforgeeks.org/top-50-array-coding-problems-for-interviews/ "Top 50 Array Coding Problems - GeeksForGeeks")
 
 ###	-Bonus
-- [ ] [  Array Problems - InterviewBit](https://www.interviewbit.com/courses/programming/topics/arrays/ "Interview Bit Array Problems - InterviewBit")
-- [ ] [  Array Problems - LeetCode](https://leetcode.com/tag/array/ "Array Problems - LeetCode")
+> - [ ] [  Array Problems - InterviewBit](https://www.interviewbit.com/courses/programming/topics/arrays/ "Interview Bit Array Problems - InterviewBit")
+> - [ ] [  Array Problems - LeetCode](https://leetcode.com/tag/array/ "Array Problems - LeetCode")
 
 -------------
 
 # 2. Strings
 
 ###	-Bare Minimum
-- [ ] [  String Problems - InterviewBit](https://www.interviewbit.com/courses/programming/topics/strings/ "String Problems - InterviewBit")
+> - [ ] [  String Problems - InterviewBit](https://www.interviewbit.com/courses/programming/topics/strings/ "String Problems - InterviewBit")
 	
 ###	-Bonus
-- [ ] [  String Problems - LeetCode](https://leetcode.com/tag/string/ "String Problems - LeetCode")
-- [ ] [  Problem solving (String) - HackerRank](https://www.hackerrank.com/domains/algorithms?filters%5Bstatus%5D%5B%5D=unsolved%5Cu0026filters%5Bsubdomains%5D%5B%5D%3Dstrings%5Cu0026badge_type%3Dproblem-solving&filters%5Bstatus%5D%5B%5D=unsolved&filters%5Bsubdomains%5D%5B%5D=strings "Problem solving (String) - HackerRank")
+> - [ ] [  String Problems - LeetCode](https://leetcode.com/tag/string/ "String Problems - LeetCode")
+> - [ ] [  Problem solving (String) - HackerRank](https://www.hackerrank.com/domains/algorithms?filters%5Bstatus%5D%5B%5D=unsolved%5Cu0026filters%5Bsubdomains%5D%5B%5D%3Dstrings%5Cu0026badge_type%3Dproblem-solving&filters%5Bstatus%5D%5B%5D=unsolved&filters%5Bsubdomains%5D%5B%5D=strings "Problem solving (String) - HackerRank")
 
 --------
 
 # 3. Linked Lists
 
 ###	-Bare Minimum
-- [ ] [  Linked-List Problems - InterviewBit](https://www.interviewbit.com/courses/programming/topics/linked-lists/ "Linked-List Problems - InterviewBit")
+> - [ ] [  Linked-List Problems - InterviewBit](https://www.interviewbit.com/courses/programming/topics/linked-lists/ "Linked-List Problems - InterviewBit")
 
 ###	-Bonus
-- [ ] [  Linked-List Questions - LeetCode](https://leetcode.com/tag/linked-list/ "Linked-List Questions - LeetCode")
-- [ ] [  Top 20 Linked-List Questions - GeeksForGeeks](https://www.geeksforgeeks.org/top-20-linked-list-interview-question/ "Top 20 Linked-List Questions - GeeksForGeeks")
+> - [ ] [  Linked-List Questions - LeetCode](https://leetcode.com/tag/linked-list/ "Linked-List Questions - LeetCode")
+> - [ ] [  Top 20 Linked-List Questions - GeeksForGeeks](https://www.geeksforgeeks.org/top-20-linked-list-interview-question/ "Top 20 Linked-List Questions - GeeksForGeeks")
 
 --------
 
 # 4. Stacks and Queues
 
 ###	-Theory:
-- [ ] [  Stack Data Structure Introduction - GeeksForGeeks](https://www.geeksforgeeks.org/stack-data-structure-introduction-program/ "Stack Data Structure Introduction - GeeksForGeeks")
-- [ ] [  Queue Set Introduction and Array Implementation - GeeksForGeeks](https://www.geeksforgeeks.org/queue-set-1introduction-and-array-implementation/ "Queue Set Introduction and Array Implementation - GeeksForGeeks")
+> - [ ] [  Stack Data Structure Introduction - GeeksForGeeks](https://www.geeksforgeeks.org/stack-data-structure-introduction-program/ "Stack Data Structure Introduction - GeeksForGeeks")
+> - [ ] [  Queue Set Introduction and Array Implementation - GeeksForGeeks](https://www.geeksforgeeks.org/queue-set-1introduction-and-array-implementation/ "Queue Set Introduction and Array Implementation - GeeksForGeeks")
 
 ###	-Bare Minimum
-- [ ] [  Stacks and Queues - InterviewBit](https://www.interviewbit.com/courses/programming/topics/stacks-and-queues/ "Stacks and Queues - InterviewBit")
+> - [ ] [  Stacks and Queues - InterviewBit](https://www.interviewbit.com/courses/programming/topics/stacks-and-queues/ "Stacks and Queues - InterviewBit")
 
 ###	-Bonus
-- [ ] [  Stack Problems - LeetCode](https://leetcode.com/tag/stack/ "Stack Problems - LeetCode")
-- [ ] [  Queue Problems - LeetCode](https://leetcode.com/tag/queue/ "Queue Problems - LeetCode")
-- [ ] [  Queue Data Structure - GeeksForGeeks](https://www.geeksforgeeks.org/queue-data-structure/ "Queue Data Structure - GeeksForGeeks")
-- [ ] [  Stack Data Structure - GeeksForGeeks](https://www.geeksforgeeks.org/stack-data-structure0 "Stack Data Structure - GeeksForGeeks")
+> - [ ] [  Stack Problems - LeetCode](https://leetcode.com/tag/stack/ "Stack Problems - LeetCode")
+> - [ ] [  Queue Problems - LeetCode](https://leetcode.com/tag/queue/ "Queue Problems - LeetCode")
+> - [ ] [  Queue Data Structure - GeeksForGeeks](https://www.geeksforgeeks.org/queue-data-structure/ "Queue Data Structure - GeeksForGeeks")
+> - [ ] [  Stack Data Structure - GeeksForGeeks](https://www.geeksforgeeks.org/stack-data-structure0 "Stack Data Structure - GeeksForGeeks")
 
 ---------
 
 # 5. Tree-based data structures:
 
 ###	-Theory:
-- [ ] [  Binary Tree Data Structure - GeeksForGeeks](https://www.geeksforgeeks.org/binary-tree-data-structure/ "Binary Tree Data Structure - GeeksForGeeks")
-- [ ] [  Binary Search Tree Data Structure - GeeksForGeeks](https://www.geeksforgeeks.org/binary-search-tree-data-structure/ "Binary Search Tree Data Structure - GeeksForGeeks")
-- [ ] [  Trie Insert and Search - GeeksForGeeks](https://www.geeksforgeeks.org/trie-insert-and-search/ "Trie Insert and Search - GeeksForGeeks")
-- [ ] [  Heap Data Structure - GeeksForGeeks](https://www.geeksforgeeks.org/heap-data-structure/ "Heap Data Structure - GeeksForGeeks")
-- [ ] [  Hashing Data Structure - GeeksForGeeks](https://www.geeksforgeeks.org/hashing-data-structure/ "Hashing Data Structure - GeeksForGeeks")
+> - [ ] [  Binary Tree Data Structure - GeeksForGeeks](https://www.geeksforgeeks.org/binary-tree-data-structure/ "Binary Tree Data Structure - GeeksForGeeks")
+> - [ ] [  Binary Search Tree Data Structure - GeeksForGeeks](https://www.geeksforgeeks.org/binary-search-tree-data-structure/ "Binary Search Tree Data Structure - GeeksForGeeks")
+> - [ ] [  Trie Insert and Search - GeeksForGeeks](https://www.geeksforgeeks.org/trie-insert-and-search/ "Trie Insert and Search - GeeksForGeeks")
+> - [ ] [  Heap Data Structure - GeeksForGeeks](https://www.geeksforgeeks.org/heap-data-structure/ "Heap Data Structure - GeeksForGeeks")
+> - [ ] [  Hashing Data Structure - GeeksForGeeks](https://www.geeksforgeeks.org/hashing-data-structure/ "Hashing Data Structure - GeeksForGeeks")
 
 ###	-Bare minimum:
-- [ ] [  Tree Data Structure - InterviewBit](https://www.interviewbit.com/courses/programming/topics/tree-data-structure/ "Tree Data Structure - InterviewBit")
-- [ ] [  Heaps and Maps - InterviewBit](https://www.interviewbit.com/courses/programming/topics/heaps-and-maps/ "Heaps and Maps - InterviewBit")
-- [ ] [  Hashing - InterviewBit](https://www.interviewbit.com/courses/programming/topics/hashing/ "Hashing - InterviewBit")
+> - [ ] [  Tree Data Structure - InterviewBit](https://www.interviewbit.com/courses/programming/topics/tree-data-structure/ "Tree Data Structure - InterviewBit")
+> - [ ] [  Heaps and Maps - InterviewBit](https://www.interviewbit.com/courses/programming/topics/heaps-and-maps/ "Heaps and Maps - InterviewBit")
+> - [ ] [  Hashing - InterviewBit](https://www.interviewbit.com/courses/programming/topics/hashing/ "Hashing - InterviewBit")
 
 ###	-Bonus
-- [ ] [  Tree - LeetCode](https://leetcode.com/tag/tree/ "Tree - LeetCode")
-- [ ] [  Heap - LeetCode](https://leetcode.com/tag/heap/ "Heap - LeetCode")
-- [ ] [  Trie - LeetCode](https://leetcode.com/tag/trie/ "Trie - LeetCode")
-- [ ] [  Hash Table - LeetCode](https://leetcode.com/tag/hash-table/ "Hash Table - LeetCode")
+> - [ ] [  Tree - LeetCode](https://leetcode.com/tag/tree/ "Tree - LeetCode")
+> - [ ] [  Heap - LeetCode](https://leetcode.com/tag/heap/ "Heap - LeetCode")
+> - [ ] [  Trie - LeetCode](https://leetcode.com/tag/trie/ "Trie - LeetCode")
+> - [ ] [  Hash Table - LeetCode](https://leetcode.com/tag/hash-table/ "Hash Table - LeetCode")
 
 --------
 
 # 6. Graphs:
 
 ###	-Theory:
-- [ ] [  Graph and It's Representations](https://www.geeksforgeeks.org/graph-and-its-representations/ "Graph and It's Representations - GeeksForGeeks")
+> - [ ] [  Graph and It's Representations](https://www.geeksforgeeks.org/graph-and-its-representations/ "Graph and It's Representations - GeeksForGeeks")
 
 ###	-Standard Algos:
-- [ ] [  Breadth First Search - GeeksForGeeks](https://www.geeksforgeeks.org/breadth-first-search-or-bfs-for-a-graph/ "Breadth First Search - GeeksForGeeks")
-- [ ] [  Depth First Search - GeeksForGeeks](https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/ "Depth First Search - GeeksForGeeks")
-- [ ] [  Dijkstra's Shortest Path Algorithm - GeeksForGeeks](https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-greedy-algo-7/ "Dijkstra's Shortest Path Algorithm - GeeksForGeeks")
-- [ ] [  Prim's Minimum Spanning Tree - GeeksForGeeks](https://www.geeksforgeeks.org/prims-minimum-spanning-tree-mst-greedy-algo-5/ "Prim's Minimum Spanning Tree - GeeksForGeeks")
-- [ ] [  Kruskal's Minimum Spinning Tree Algorithm](https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/ "Kruskal's Minimum Spinning Tree Algorithm")
-- [ ] [  Floyd Warshall Algorithm - GeeksForGeeks](https://www.geeksforgeeks.org/floyd-warshall-algorithm-dp-16/ "Floyd Warshall Algorithm - GeeksForGeeks")
-- [ ] [  Union Find Algorithm - GeeksForGeeks](https://www.geeksforgeeks.org/union-find-algorithm-union-rank-find-optimized-path-compression/ "Union Find Algorithm - GeeksForGeeks")
+> - [ ] [  Breadth First Search - GeeksForGeeks](https://www.geeksforgeeks.org/breadth-first-search-or-bfs-for-a-graph/ "Breadth First Search - GeeksForGeeks")
+> - [ ] [  Depth First Search - GeeksForGeeks](https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/ "Depth First Search - GeeksForGeeks")
+> - [ ] [  Dijkstra's Shortest Path Algorithm - GeeksForGeeks](https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-greedy-algo-7/ "Dijkstra's Shortest Path Algorithm - GeeksForGeeks")
+> - [ ] [  Prim's Minimum Spanning Tree - GeeksForGeeks](https://www.geeksforgeeks.org/prims-minimum-spanning-tree-mst-greedy-algo-5/ "Prim's Minimum Spanning Tree - GeeksForGeeks")
+> - [ ] [  Kruskal's Minimum Spinning Tree Algorithm](https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/ "Kruskal's Minimum Spinning Tree Algorithm")
+> - [ ] [  Floyd Warshall Algorithm - GeeksForGeeks](https://www.geeksforgeeks.org/floyd-warshall-algorithm-dp-16/ "Floyd Warshall Algorithm - GeeksForGeeks")
+> - [ ] [  Union Find Algorithm - GeeksForGeeks](https://www.geeksforgeeks.org/union-find-algorithm-union-rank-find-optimized-path-compression/ "Union Find Algorithm - GeeksForGeeks")
 
 ###	-Bare Minimum:
-- [ ] [  Graph Problems - LeetCode](https://leetcode.com/tag/graph/ "Graph Problems - LeetCode") (Easy and Medium)
+> - [ ] [  Graph Problems - LeetCode](https://leetcode.com/tag/graph/ "Graph Problems - LeetCode") (Easy and Medium)
 
 ###	-Bonus:
-- [ ] [  Graph Data Structure Algorithms - InterviewBit](https://www.interviewbit.com/courses/programming/topics/graph-data-structure-algorithms/ "Graph Data Structure Algorithms - InterviewBit")
+> - [ ] [  Graph Data Structure Algorithms - InterviewBit](https://www.interviewbit.com/courses/programming/topics/graph-data-structure-algorithms/ "Graph Data Structure Algorithms - InterviewBit")
 
 ---------
 
 # 7. Dynamic Programming:
 
 ###	-Video lectures:
-- [ ] [  Dynamic Programming I: Fibonacci, Shortest Paths](https://www.youtube.com/watch?v=OQ5jsbhAv_M\u0026list=PLcDimPvbmfT8qAxD6JH_kmXiQwTNcoK78 "Dynamic Programming I: Fibonacci, Shortest Paths")
-- [ ] [  Dynamic Programming II: Text Justification, Blackjack](https://www.youtube.com/watch?v=ENyox7kNKeY\u0026list=PLcDimPvbmfT8qAxD6JH_kmXiQwTNcoK78\u0026index=2 "Dynamic Programming II: Text Justification, Blackjack")
-- [ ] [  Dynamic Programming III: Parenthesization, Edit Distance, Knapsack](https://www.youtube.com/watch?v=ocZMDMZwhCY\u0026list=PLcDimPvbmfT8qAxD6JH_kmXiQwTNcoK78\u0026index=3 "Dynamic Programming III: Parenthesization, Edit Distance, Knapsack")
+> - [ ] [  Dynamic Programming I: Fibonacci, Shortest Paths](https://www.youtube.com/watch?v=OQ5jsbhAv_M\u0026list=PLcDimPvbmfT8qAxD6JH_kmXiQwTNcoK78 "Dynamic Programming I: Fibonacci, Shortest Paths")
+> - [ ] [  Dynamic Programming II: Text Justification, Blackjack](https://www.youtube.com/watch?v=ENyox7kNKeY\u0026list=PLcDimPvbmfT8qAxD6JH_kmXiQwTNcoK78\u0026index=2 "Dynamic Programming II: Text Justification, Blackjack")
+> - [ ] [  Dynamic Programming III: Parenthesization, Edit Distance, Knapsack](https://www.youtube.com/watch?v=ocZMDMZwhCY\u0026list=PLcDimPvbmfT8qAxD6JH_kmXiQwTNcoK78\u0026index=3 "Dynamic Programming III: Parenthesization, Edit Distance, Knapsack")
 
 ###	-Bare minimum (Standard problems):
-- [ ] [  Program For nth Fibonacci Number - GeeksForGeeks](https://www.geeksforgeeks.org/program-for-nth-fibonacci-number/ "Program For nth Fibonacci Number - GeeksForGeeks")
-- [ ] [  0-1 Knapsack Problem - GeeksForGeeks](https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/ "0-1 Knapsack Problem - GeeksForGeeks")
-- [ ] [  Coin Change - GeeksForGeeks](https://www.geeksforgeeks.org/coin-change-dp-7/ "Coin Change - GeeksForGeeks")
-- [ ] [  Compute nCr % p - GeeksForGeeks](https://www.geeksforgeeks.org/compute-ncr-p-set-1-introduction-and-dynamic-programming-solution/ "Compute nCr % p - GeeksForGeeks")
-- [ ] [  Longest Increasing Subsequence - GeeksForGeeks](https://www.geeksforgeeks.org/longest-increasing-subsequence-dp-3/ "Longest Increasing Subsequence - GeeksForGeeks")
-- [ ] [  Longest Common Subsequence - GeeksForGeeks](https://www.geeksforgeeks.org/longest-common-subsequence-dp-4/ "Longest Common Subsequence - GeeksForGeeks")
-- [ ] [  Longest Commono Substring - GeeksForGeeks](https://www.geeksforgeeks.org/longest-common-substring-dp-29/ "Longest Commono Substring - GeeksForGeeks")
+> - [ ] [  Program For nth Fibonacci Number - GeeksForGeeks](https://www.geeksforgeeks.org/program-for-nth-fibonacci-number/ "Program For nth Fibonacci Number - GeeksForGeeks")
+> - [ ] [  0-1 Knapsack Problem - GeeksForGeeks](https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/ "0-1 Knapsack Problem - GeeksForGeeks")
+> - [ ] [  Coin Change - GeeksForGeeks](https://www.geeksforgeeks.org/coin-change-dp-7/ "Coin Change - GeeksForGeeks")
+> - [ ] [  Compute nCr % p - GeeksForGeeks](https://www.geeksforgeeks.org/compute-ncr-p-set-1-introduction-and-dynamic-programming-solution/ "Compute nCr % p - GeeksForGeeks")
+> - [ ] [  Longest Increasing Subsequence - GeeksForGeeks](https://www.geeksforgeeks.org/longest-increasing-subsequence-dp-3/ "Longest Increasing Subsequence - GeeksForGeeks")
+> - [ ] [  Longest Common Subsequence - GeeksForGeeks](https://www.geeksforgeeks.org/longest-common-subsequence-dp-4/ "Longest Common Subsequence - GeeksForGeeks")
+> - [ ] [  Longest Commono Substring - GeeksForGeeks](https://www.geeksforgeeks.org/longest-common-substring-dp-29/ "Longest Commono Substring - GeeksForGeeks")
 
 
 ###	-Bonus:
-- [ ] [  Dynamic Programming - InterviewBit](https://www.interviewbit.com/courses/programming/topics/dynamic-programming/ "Dynamic Programming - InterviewBit")
-- [ ] [  Dynamic Programming - LeetCode](https://leetcode.com/tag/dynamic-programming/ "Dynamic Programming - LeetCode")
+> - [ ] [  Dynamic Programming - InterviewBit](https://www.interviewbit.com/courses/programming/topics/dynamic-programming/ "Dynamic Programming - InterviewBit")
+> - [ ] [  Dynamic Programming - LeetCode](https://leetcode.com/tag/dynamic-programming/ "Dynamic Programming - LeetCode")