DSA implementations and solutions to programming problems on different websites.

TODO

data_structures/

• Stack
• Circular queue
• BST
• Trie
• Segment tree
• Disjoint set / union find

graph/graph_algo.hpp

• Iterative BFS for AdjMatrixGraph (traversal)
• Recursive DFS for AdjMatrixGraph (traversal)
• Iterative DFS
• Djikstra (shortest path)
• Bellman-Ford (shortest path)
• Prim (MST)
• Kruskal (MST)
• Topological sort
• Edmonds-Karp (Max flow)

leetcode/

• find-if-path-exists-in-graph.cpp: learn union find solution
• majority-element.cpp: look at Boyer-Moore majority vote algorithm for O(1) space
• container-with-most-water.cpp: revise this

math/

• FFT
• JLT
• Strassen

search_sort/

• Quick sort
• Merge sort
• Insertion sort
• Selection sort
• Radix sort
• Binary search