➊ Arrays ➀ Creating an Array ➁ Iterate through Array ➂ Get an Element ➃ Search an Element ➄ Insert Element(s) ➅ Delete Element(s) ➆ Filter an Array ➇ Fetch a Sub-Array ➈ Merging Arrays ➉ Reverse Array ➀➀ Rotate Array

➋ Linked Lists ➀ Creating a Linked List ➁ Iterate through Linked List ➂ Get an Element ➃ Find an Element ➤ Insert Element(s) ➄ At Start ➅ At End ➆ At Anywhere ➤ Delete Element(s) ➇ From Start ➈ From End ➉ From Anywhere ➀➀ IsEmpty ➀➁

➌ Stacks ➀ Push ➁ Pop ➂ IsEmpty ➃ IsFull ➄ Peek ➅ Size Implement the stack using both Array and Linked List.

➍ Queues (also Priority Queue) ➀ Enqueue ➁ Dequeue ➂ IsEmpty ➃ IsFull ➄ Peek ➅ Size ➆ Update Priority * Implement the queue using both Array and Linked List. ** Implement these for a Priority Queue

➎ Hash Tables ➤ Hash Function ➀ Division Method ➁ Multiplication Method ➂ Universal Hashing ➤ Hash Collision ➃ Collision Resolution ➤ Open Addressing ➄ Linear Probing ➅ Quadratic Probing ➆ Double Hashing

➏ Trees ➀ Traversal ➁ Height of a Node/Tree ➂ Depth of a Node ➃ Degree of a Node ➤ Traversal ➄ In Order ➅ Pre Order ➆ Post Order ➇ Level Order ➈ Insert ➉ Delete

➐ Binary Search Tree ➀ Formation of a BST ➁ Insert a Node ➂ Delete a Node ➃ Search for a Node ➤ Traversal ➄, ➅, ➆: In Order, Pre Order, Post Order ➇ & ➈ Find Min, Max ➉ & ➀➀ Find Predecessor & Successor ➤ Balance a BST ➀➁ AVL Tree ➀➂ Red-Black

➑ Heaps ➀ Heapify ➁ Insert Element ➂ Delete Element ➃ Peek (Max/Min Element) ➄ Extract (Max/Min Element) Implement Min Heap, Max Heap, Binary Heap, and Fibonacci Heap.

➒ Suffix Tree ➀ Construct a suffix tree ➁ Pattern Matching ➂ Substring Checking ➃ Longest Common Substring ➄ Longest Repeated Substring ➅ Substring Frequency ➆ Edit Distance ➇ Suffix Links ➈ Finding all palindromic substrings

➓ Trie ➀ Insertion in a Trie ➁ Search for a word in a Trie ➂ Prefix Search ➃ Delete a word from the Trie ➄ Find the count of a word in a Trie ➅ Longest Common Prefix

➊➊ Disjoint Set ➀ Union ➁ Find ➂ Path Compression ➃ Union by Rank ➄ Union by Size

➊➋ Graphs ➤ Adjacency Matrix ➀ Add Edge ➁ Remove Edge ➤ Adjacency List ➂ Add Edge ➃ Remove Edge ➤ Traverse Nodes ➄ Depth First Search ➅ Breadth First Search ➤ Shortest Path ➆ Dijkstra's Algorithm ➇ Floyd-Warshall Algorithm

➊➌ Searching Algorithms ➀ Linear Search ➁ Jump Search ➂ Binary Search ➃ Interpolation Search ➄ Exponential Search ➅ Ternary Search

➊➍ Sorting Algorithms ➀ Bubble Sort ➁ Selection Sort ➂ Insertion Sort ➃ Merge Sort ➄ Quick Sort And, a few advanced ones, ➅ Binary Insertion Sort ➆ 3-way Merge Sort ➇ 3-way Quick Sort ➈ Counting Sort ➉ Radix Sort ➀➀ Bucket Sort ➀➁ Heap Sort ➀➂ Shell Sort ➀➃

➊➎ Greedy Algorithms ➀ Greedy Coin Change Problem ➁ Activity Selection Problem ➂ Fractional Knapsack Problem ➃ Huffman Coding

➊➏ Backtracking Algorithms ➀ Graph Coloring ➁ Hamiltonian Path/Cycle ➂ Subset Sum Problem ➃ Permutation Generation

➊➐ Dynamic Programming ➀ Fibonacci Sequence ➁ Longest Common Subsequence ➂ Knapsack Problem ➃ Matrix Chain Multiplication

@swapnakpanda Amazing list🔥mastering algorithms sharpens the way you think, not just code. Language is just syntax, logic is universal 💪 Thanks for sharing this amazing list.

@RShmider Absolutely Ram. I like to solve puzzles and explore algorithms in my free time.

@swapnakpanda Wow, this thread is quite lengthy and packed with valuable information.

@csaba_kissi Thanks Csaba.

@swapnakpanda Excellent Share, Swapna 🙌🏻

@codewithhajra Thanks Hajra.

@swapnakpanda Thanks for putting this together 🙌

@_jaydeepkarale This is the list I keep referring to whenever I come across a new algorithm. Good way to compare and find the better or alternative ways.

@swapnakpanda Nice list. Binary search is one of my favorites

@systemdesignone It’s easy to relate. One of my favorites too.

@swapnakpanda Ohhh 😮

@codeharmann Good or bad?

@swapnakpanda Excellent share. Swapna!

@Shefali__J Thanks Shefali.

@swapnakpanda Fantastic list Swapna!

@RitikaAgrawal08 Thanks for checking it out Ritika.