AlgoMaster AI
v1.0.0
Curriculum
1. Foundations
1. Foundations
What is Programming?
Flowcharts
Algorithms & Pseudocode
Variables & Data Types
Loops
Recursion
Big O Notation
2. Core Data Structures
2. Core Data Structures
Arrays & Strings
Linked Lists
Stack
Queue
Hashing
3. Searching & Sorting
3. Searching & Sorting
Linear Search
Binary Search
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
4. Trees & Heaps
4. Trees & Heaps
Binary Search Tree
Heaps
AVL Tree
H
Trie (Prefix Tree)
5. Graph Algorithms
5. Graph Algorithms
Graph Representations
Breadth-First Search (BFS)
Depth-First Search (DFS)
Topological Sort
6. Advanced Graphs
6. Advanced Graphs
Dijkstra's Algorithm
H
Bellman-Ford Algorithm
H
Kruskal's Algorithm
H
Union-Find (Disjoint Set)
7. Algorithmic Paradigms
7. Algorithmic Paradigms
Greedy Algorithms
Dynamic Programming
Knapsack Problem
H
Longest Common Subsequence
H
Backtracking
8. Advanced Techniques
8. Advanced Techniques
Segment Tree
H
Fenwick Tree
H
Bit Manipulation
Toggle Sidebar
Documentation
AlgoMaster AI