🌲 Data Structures:

    Linear:
    🔵 Arrays
    🔵 Linked Lists (Singly, Doubly, Circular)
    🔵 Stacks (LIFO) and Queues (FIFO)

    Non-Linear:
    🟢 Hash Maps & Tables
    🟢 Graphs
    🟢 Trees
    🟢 Binary Trees & Binary Search Trees (BSTs)
    🟢 Self-Balancing Trees (AVL, Red-Black, Splay)
    🟢 Heaps

    Special:
    🟣 Tries
    🟣 Segment Trees
    🟣 Fenwick Trees (Binary Indexed Tree)
    🟣 Disjoint Set Union (DSU)
    🟣 Minimum Spanning Trees

♾️ Algorithms:

🔴 Divide & Conquer

    Sorting Algorithms: 
    🟠 Bubble Sort
    🟠 Insertion Sort
    🟠 Selection Sort
    🟠 Counting Sort
    🟠 Quick Sort
    🟠 Merge Sort
    🟠 Heap Sort
    🟠 Radix Sort
    🟠 Bucket Sort

    Searching Algorithms: 
    🟡 Linear Search
    🟡 Binary Search
    
🟣 Sieve of Eratosthenes

🔴 Knuth-Morris-Pratt Algorithm

    Greedy:
    🟢 Max Number Non-Overlapping Intervals on Axis
    🟢 Fractional Knapsack Problem

    Dynamic Programming:
    🟠 0-1 Knapsack Problem
    🟠 Longest Common Subsequence
    🟠 Longest Increasing Subsequence

🔵 Convex Hull

    Graph Traversals: 
    🔴 Bredth-First Search (BFS)
    🔴 Depth-First Search (DFS)

    Graph Algorithms:
    🟡 Floyd-Warshall/Roy-Floyd Algorithm
    🟡 Dijkstra's Algorithm & Bellman-Ford Algorithm

🟢 Topological Sorting

🪪 License

MIT License