π¦Developer First100% Type-safe with Generics, zero external dependencies, and fully tree-shakable for minimal bundle size.
πΈοΈGraphsComprehensive support for Directed and Undirected graphs with built-in traversal and pathfinding algorithms.
π²Binary Search TreeAdvanced Binary Search Trees, including randomized self-balancing logic for guaranteed O(log n) performance.
πLinear StructuresBattle-tested implementations of Stack, Queue, Binary Heap, and Priority Queue with optimal time complexity.
β‘Sorting algorithmsComplete suite of sorting algorithms including Merge, Quick, Bubble, Selection, and Insertion sorts.
π οΈUtility AlgorithmsEssential tools like Binary Search, Memoization, and Matrix Transposition to accelerate your development.