π Sorting Algorithms - Bubble sort - Insertion sort - Quick sort - Merge sort - Heap sort - Counting sort
π Searching algorithms - Linear search - Binary search (with all its variants) - Breadth-first search (BFS) - Depth-first search (DFS)
π Array algorithms - Kadane's algorithm - Floyd cycle detection algorithm - KMP algorithm - Quick select algorithm
π Stack - Tower of Hanoi problem - Infix to postfix conversion - Parenthesis matching
π Tree and Heap algorithms - Creation of heap - Implementation of Priority queue - Traversals - preorder, inorder, postorder
π Graph algorithms - Kruskal's algorithm - Prim's algorithm - Dijkstra's algorithm - Bellman ford algorithm - Topological sort algorithm
π Dynamic programming -(Recursion+Memoization) - Fibonacci series - Longest common subsequence - Matrix chain multiplication
π Other -Huffman coding for compression - Bit vector - Disjoint set data structure (Union find)
Thank You so much for getting to the end of the article! Let me know your thoughts below in comments
Top comments (0)