-
Updated
Nov 30, 2021 - JavaScript
{{ message }}
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.
120+ interactive Python coding interview challenges (algorithms and data structures). Includes Anki flashcards.
Minimal examples of data structures and algorithms in Python
GoDS (Go Data Structures). Containers (Sets, Lists, Stacks, Maps, Trees), Sets (HashSet, TreeSet, LinkedHashSet), Lists (ArrayList, SinglyLinkedList, DoublyLinkedList), Stacks (LinkedListStack, ArrayStack), Maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), Trees (RedBlackTree, AVLTree, BTree, BinaryHeap), Comparators, Iterators, Enumerables, Sort, JSON
ApacheCN 数据结构与算法译文集
Achieve a tiny STL in C++11
Curated collection of data structures for the JavaScript/TypeScript language.
Python Library for Studying Binary Trees
A minimal but extreme fast B+ tree indexing structure demo for billions of key-value storage
General Resources for Competitive Programming
A Python package for manipulating 2-dimensional tabular data structures
Life is a moment
Algorithm is a library of tools that is used to create intelligent applications.
Rust Persistent Data Structures
This repo contains links of resources, theory subjects content and DSA questions & their solution for interview preparation from different websites like geeksforgeeks, leetcode, etc.
A Graph Data Structure in Pure Swift
A lightweight, easy-to-use, and efficient C++ library for processing and rendering 3D data
Sample projects using Material, Graph, and Algorithm.
A lightweight, modular standard library extension, string library, and interfaces to various libraries (unix, threads, etc.) BSD license.
基于java语言的数据结构及算法实现,LeetCode算法示例
swift-algorithm-club的翻译。使用Swift学习算法和数据结构。
The smallest and simplest priority queue in JavaScript.
A Generic Priority Queue in Pure Swift
Easy to use, header only, macro generated, generic and type-safe Data Structures in C
Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics.
https://usaco.guide/plat/range-sweep