- Sum of numbers from 1 to n
- Fibonacci
- Reverse string
- factorial
- counting backward by 2
- check if number is polyndrome
- hanoi tower
- Solve laberinth
- Solve Sudoku
- ADN sequence
- Bubble sort
- Insertion sort
- Merge sort
- Selection sort
- Quick sort
- Bucket sort
- Radix sort
- Binary search using array (iterative)
- Binary search using array (recursive)
- Binary search tree (BST)
- ...
- K-Means
- Fibonacci (Top-DOWN, memoization)
- Fibonacci (Bottom-UP, tabulation)
- Solve Knapsack
- Max array sum
- coin change
- Largest common subsequence
- rod cut (Top-DOWN, memoization)
- rod cut (Bottom-UP, tabulation)
- ...
- Breath First Search (queue, iterative)
- Breath First Search (queue, recursive)
- Depth First Search (stack, iterative)
- Depth First Search (stack, recursive)
- Dijkstra
- Bellman Ford
- Floyd-Warshall
- Johnson's
- Kruskal
- Prim (with Min Priority Queue + Adjacency matrix)
- Prim (with node-color)
- Ford-Fulkerson
- ....
- ....
- Count consonants (iterative)
- Count consonants (recursive)
- Traversal INORDER
- Traversal PREORDER
- Traversal POSTORDER
- Traversal LEVEL ORDER
- Traversal LEVEL ORDER (reverse order)
- Find MIN
- Find MAX
- Find inorder PRECESSOR
- Find inorder SUCESSOR
- Operation INSERT
- Operation DELETE
- Operation SEARCH
- Rotation Left
- Rotation Right
- Bloom filters
- Heap Tree
- Black-Red Tree
- Queue
- Max Priority Queue
- Min Priority Queue