Big-O(Notation)
1.Arrays
2.Strings
3.LinkedList
4.Doubly Linked List
5.Circular Linked List
6.Binary Trees
7.Binary Search Trees
8.Heaps
9.Min Heap
10.Map Heap
11.DFS
12.BFS
13.Trie
Algorithm Approach
1.Greedy Algorithms
2.Top-Down Approach
3.Bottom-up Approach
4.Backtracking.
Threads
https://github.com/angrave/SystemProgramming/wiki
Graphs
-
Min Spanning tree
-
Shortest path
-
BFS
-
DFS
5.Travelling salesman
6.Knapsack