- Greedy
- Dynamic Processing
- Recursion
- Divide and conquer
- Graph
- Linked List
- Hash
- Heap
- Stack
- Queue
- Tree
- Select sort
- Merger sort
- Quick sort 2 and 3
- Couting sort
- Insert sort
- Heap sort
- Buble sort
- Shell sort
- Dijkstra
- Bellman ford
- BFS (Breath first Search)
- DFS (Depth first Search)
- Knuth-Morris-Pratt
- Rabin-Karp