Algorithm implementation:
- largest consistent sum
- merge sort(array, list)
- quicksort
- heapsort
- count sort
Data structure:
- hashmap
- bst
- skiplist
- rb tree
- disjoint-set
Graph algorithms:
- bfs
- dfs
- connected component
- Hamilton path
- topological sort
- strongly connected component
- MST - Prim
- MST - Klskal
- Dijkstra(matrix, list)
- Bellman-Ford
- Floyd-Warshall
- eulerian cycle
- articulation points
Dynamic programing:
- longest increasing subsequence
- 0/1 knapsack problem
- unbounded knapsack problem
- longest common subsequence
Solutions may contain errors, if you found one please create new issue.