DSA (Data Structures and Algorithms)

Data Structures: Linear: Skip List, Array List, Stack, Queue, Single-Linked List, Double-Linked List Circular: Circular Buffer Heaps: Binary-Min Heap, Binary-Max Heap, Binomial-Min Heap Priority Queues: Min-Priority Queue, Key-value Priority Queue Hashing: Prime Hashing Family, Universal Hashing Family Hash Tables: Chained Hash Table, Cuckoo Hash Table, Open-Addressing Hash Table Sorted Collections: Sorted List, Sorted Dictionary Trees: Binary Search Tree, AVL Tree, B-Tree, Red-Black Tree, Trie, Trie Map Graphs: Undirected (Sparse/Dense), Directed (Sparse/Dense), Weighted variants

Algorithms: Sorting: Bubble, Bucket, BST, Comb, Counting, Cycle, Gnome, Heap, Insertion, LSD Radix, Merge, Selection, Shell, OddEven, PigeonHole, Quick Searching: Binary Search Graph Algorithms: DFS, BFS, Shortest Paths (Bellman-Ford, Dijkstra), Cycles Detection, Topological Sort, Connected Components, Bipartite Coloring Tree Algorithms: Recursive Binary Tree Walker String Algorithms: Permutations, Anagrams, Edit Distance Numeric Algorithms: Binomial Coefficients, Catalan Numbers, Greatest Common Divisor Visualization: Tree Drawer