🌟 Wiki of OI / ICPC for everyone. (某大型游戏线上攻略,内含炫酷算术魔法)
-
Updated
Dec 5, 2024 - TypeScript
A data structure is a particular way storing and organizing data in a computer for efficient access and modification. Data structures are designed for a specific purpose. Examples include arrays, linked lists, and classes.
🌟 Wiki of OI / ICPC for everyone. (某大型游戏线上攻略,内含炫酷算术魔法)
🌌 A complete search engine and RAG pipeline in your browser, server or edge network with support for full-text, vector, and hybrid search in less than 2kb.
📚 collection of JavaScript and TypeScript data structures and algorithms for education purposes. Source code bundle of JavaScript algorithms and data structures book
⛱ Broadly scoped ecosystem & mono-repository of 199 TypeScript projects (and ~180 examples) for general purpose, functional, data driven development
📕 Data Structures and Algorithms library in TypeScript and JavaScript
Algorithms and Data Structures implemented in TypeScript for beginners, following best practices.
🐆 An immutable list with unmatched performance and a comprehensive functional API.
A javascript standard data structure library which benchmark against C++ STL.
The fastest JavaScript priority queue out there. Zero dependencies.
Data structures for high-performance JavaScript applications.
Functional programming, immutable collections and FP constructs for typescript and javascript
Project is in active development and has been moved to the EthereumJS VM monorepo.
Data structures & algorithms implemented in TypeScript
High-performance immutable data structures for modern JavaScript and TypeScript applications. Functional interfaces, deep/composite operations API, mixed mutability API, TypeScript definitions, ES2015 module exports.
Converts an array of items with ids and parent ids to a nested tree in a performant O(n) way. Runs in browsers and Node.js.
Algorithms and data structures implemented in Go, JS, TypeScript, Rust, and Swift.
🔖 Algorithms and data structures implemented in TypeScript
Javascript Data Structure & TypeScript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree, AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue, Stack.
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.