Union Find Algorithm with Rank and Compression to detect cycles in a graph. Tiem complexity: O(log n) View on GitHub
KMp(Knuth Morris Pratt) algorithm is a great way to find a pattern in given string in O(n) time complexity.
My implementation can be found here
This a great video to know more about KMP.
Ford-Fulkerson is a greedy algorithm that computes the maximum flow in a flow network. Click here to know more about Ford-Fulkerson. My implementation on github
A good video on learning Ford Fulkerson:
This is my implementation for the compressed Trie data structure. This video is really good to understand Trie data structure.
View Code on GitHub.
The following video is a good introduction to MaxHeap. Also, check this out for Min Heap.
View Code on GitHub.