-
Notifications
You must be signed in to change notification settings - Fork 3
Description
Feature Overview
We need a page on which the blog readers can see a n Algorithms and Data Structures Roadmap. It should be visually good and easy to see and navigate.
The items in the roadmap are sequential and organized in categories.
Each item information:
- Title
- Small Description
- Links (optional, array of links)
- Icon
- Title
- URL
The category for now could be only a title, but with flexibility for future extensions.
Personas
Blog Readers
These are the readers of the blog, these users should be able to see the roadmap.
Blog Admin (Aka Creators)
These are the blog admins, these users should be able to edit the list in a configuration file, the entire roadmap should be configurable in only one file.
Use Cases
-
[Blog Reader] As a reader I want to see a DSA roadmap page, so I can easily find the materials regarding the topics and structure my studies.
-
[Blog Reader] As a reader, I want to be able to find the DSA Roadmap in the main blog navigation
-
[Blog Admin] As an admin, I want to be able to easily edit the roadmap just editing one file in the blog content files
Example in mermaid of the roadmap.
- But it should not be a mermaid chart, this is just an example
- Use this structure as the first version, but this should not be hard-coded, it should be configurable
timeline
Big O Notation
Arrays
: Binary Search (Basic)
Strings
Sorting (Basic)
: Bubble Sort
: Insertion Sort
: Selection Sort
Linked List
: Doubly Linked List
: Sentinels
: Fast and Slow
: Dummy node (pointer)
: Identify Cycles
: Floyd Cycle
Binary Search (Deep)
Array Techniques
: Two Pointers
: Sliding Window
: Prefix Sum
Hash Map / Set
: Colision resolution (Buckets / Open Adrress)
: Counter/Frequency
Stack
Recursion
: Functional Programming
: Reverse LinkedList
: Fibonnacci : Power of 2/3/4
Queue
Trees
: Binary Tree
: DFS - Recursion
: DFS - Stack
: DFS - Pre Order
: DFS - In Order
: DFS - Post Order
: DFS - Boundary
: DFS - Diagonal
: BFS (Queue)
: K-ary
: Binary Search Tree
Binary Heap
Sorting (Medium)
: Heap Sort
: Merge Sort
: Shell Sort
: Quick Sort
Graphs
: DFS / DFS on Graphs
: SSSP - Dijkstra
: SSSP - Bellman-Ford
: SSSP - A*
: APSP - Floyd Warshall
Topological Sorting
Backtracking
Top-Down
: Memoization
: Botton-Up
: Tabulation
Dynamic Programing
: DP - 1D
: DP - Multidimensional
Bit Manipulation
: Base 2 / Base 8 / Base 16
: Complement
: Bit Shift Left and Right
: And / Or / Xor
Sorting (Advanced)
: Counting Sort
: Radix Sort
: Bucket Sort
Trie
Intervals
Greedy
Graphs (Advanced)
Math & Geometry