gods - GoDS (Go Data Structures)

•    Go

---

Implementation of various data structures and algorithms in Go.Containers are either ordered or unordered. All ordered containers provide stateful iterators and some of them allow enumerable functions.

data-structure map tree set list stack iterator enumerable sort avl-tree red-black-tree b-tree binary-heap collections go-collection

go-datastructures

•    Go

---

Go-datastructures is a collection of useful, performant, and threadsafe Go datastructures.Interval tree for collision in n-dimensional ranges. Implemented via a red-black augmented tree. Extra dimensions are handled in simultaneous inserts/queries to save space although this may result in suboptimal time complexity. Intersection determined using bit arrays. In a single dimension, inserts, deletes, and queries should be in O(log n) time.

data-structure collections go-collection

Buckets-JS - A complete, fully tested and documented data structure library written in pure JavaScript

•    Javascript

---

Buckets is a complete, fully tested and documented data structure library written in pure JavaScript.

data-structures collections collection linked-list dictionary map multimap stack queue set bag binary-heap priority-queue binary-search binary-search-tree tree tree-structure buckets data structure linked list heap priority binary data-structure hashmap

mori - ClojureScript's persistent data structures and supporting API from the comfort of vanilla JavaScript

•    Clojure

---

Persistent Data Structures for JavaScript

data structure persistent clojurescript map filter reduce data-structure collections hashmap

BoomFilters - Probabilistic data structures for processing continuous, unbounded streams.

•    Go

---

Boom Filters are probabilistic data structures for processing continuous, unbounded streams. This includes Stable Bloom Filters, Scalable Bloom Filters, Counting Bloom Filters, Inverse Bloom Filters, Cuckoo Filters, several variants of traditional Bloom filters, HyperLogLog, Count-Min Sketch, and MinHash.Classic Bloom filters generally require a priori knowledge of the data set in order to allocate an appropriately sized bit array. This works well for offline processing, but online processing typically involves unbounded data streams. With enough data, a traditional Bloom filter "fills up", after which it has a false-positive probability of 1.

bloom-filter stable-bloom-filters cuckoo-filter probabilistic-programming counting-bloom-filters scalable-bloom-filters count-min-sketch data-stream filter data-structure collections go-collection

interactive-coding-challenges - Interactive Python coding interview challenges (algorithms and data structures)

•    Python

---

Overhauled to now include 120 challenges and solutions and added Anki flashcards.Also included are unit tested reference implementations of various data structures and algorithms.

algorithm data-structure development programming coding interview interview-questions interview-practice competitive-programming

mnemonist - Curated collection of data structures for the JavaScript language.

•    Javascript

---

Mnemonist is a curated collection of data structures for the JavaScript language. It gathers classic data structures (think heap, trie etc.) as well as more exotic ones such as Buckhard-Keller trees etc.

data-structure bag bimap bit-array bit-set bit-vector bitset bk-tree burkhard-keller-tree circular-buffer counter data-structures disjoint-set fibonacci-heap fuzzy-map hashed-array-tree heap interval-tree inverted-index linked-list multimap multiset queue sparse-set stack structures suffix-tree symspell trie union-find vantage-point-tree vector vp-tree

Redis - Advanced key-value store

•    C

---

Redis is an advanced key-value store. It is similar to memcached but the dataset is not volatile, and values can be strings, exactly like in memcached, but also lists, sets, and ordered sets. All this data types can be manipulated with atomic operations to push/pop elements, add/remove elements, perform server side union, intersection, difference between sets, and so forth. Redis supports different kind of sorting abilities.

database key-value key-value-store data-structure hyperloglog

algorithms - Minimal examples of data structures and algorithms in Python

•    Python

---

Minimal and clean example implementations of data structures and algorithms in Python 3.

algorithm competitive-programming data-structure interview algorithms sort search tree graph

LeetCode - :pencil: Python / C++ 11 Solutions of All LeetCode Questions

•    Python

---

:pencil: Python / C++ 11 Solutions of All LeetCode Questions

leetcode cpp algorithm data-structure cpp11

awesome-competitive-programming - :gem: A curated list of awesome Competitive Programming, Algorithm and Data Structure resources

•    HTML

---

A curated list of awesome Competitive Programming, Algorithm and Data Structure resources. Please kindly follow CONTRIBUTING.md to get started.

quora learning-materials contest practice reference-materials competitive-programming awesome-list awesome list algorithm programming-contests data-structure

awesome-algorithm - Leetcode 题解 (跟随思路一步一步撸出代码) 及经典算法实现

•    Python

---

If you are a newbie of Git, please check this tutorial we have made. Please note, this repository is inspired from KrisYu, and here is the approve letter. However, it has been modified, added and improved to reflect our knowledge, wisdom and efforts.

leetcode algorithm leetcode-solutions data-structure interview coding hacker geeker offer

binarytree - Python Library for Studying Binary Trees

•    Python

---

Binarytree is a Python library which provides a simple API to generate, visualize, inspect and manipulate binary trees. It allows you to skip the tedious work of setting up test data, and dive straight into practising your algorithms. Heaps and BSTs (binary search trees) are also supported. You may need to use sudo depending on your environment.

python3 python2 python-3 python-2 python-library binary-trees binary-tree interview-practice interview learning practise python-3-5 algorithm data-structures data-structure heap heaps bst binary-search-tree

bplustree - A minimal but extreme fast B+ tree indexing structure demo for billions of key-value storage

•    C

---

A minimal B+Tree implementation for millions (even billions) of key-value storage based on Posix. in-memory for learning and debugging.

storage algorithm data-structure tree-structure tree btree bplustree dictionary b+tree key-value

Immutable-js - Immutable persistent data collections for Javascript which increase efficiency and simplicity

•    Javascript

---

Immutable data cannot be changed once created, leading to much simpler application development, no defensive copying, and enabling advanced memoization and change detection techniques with simple logic. Persistent data presents a mutative API which does not update the data in-place, but instead always yields new updated data.

immutable persistent lazy data data-structure functional collection stateless sequence iteration

Immutable.js - Immutable collections for JavaScript

•    Javascript

---

Immutable data cannot be changed once created, leading to much simpler application development, no defensive copying, and enabling advanced memoization and change detection techniques with simple logic. Persistent data presents a mutative API which does not update the data in-place, but instead always yields new updated data. Immutable.js provides many Persistent Immutable data structures including: List, Stack, Map, OrderedMap, Set, OrderedSet and Record.

immutable persistent lazy data data-structure functional collection stateless sequence iteration collections

hyperloglog - HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction)

•    Go

---

An improved version of HyperLogLog for the count-distinct problem, approximating the number of distinct elements in a multiset using 20-50% less space than other usual HyperLogLog implementations.This work is based on "Better with fewer bits: Improving the performance of cardinality estimation of large data streams - Qingjun Xiao, You Zhou, Shigang Chen".

data-structure collections go-collection

golang-set - A simple set type for the Go language. Also used in Docker.

•    Go

---

The missing set collection for the Go language. Until Go has sets built-in...use this.I have to give some credit for helping seed the idea with this post on stackoverflow.

set threadsafe datastructures data-structure collections go-collection

JCTools - Java Concurrency Tools for the JVM

•    Java

---

Java Concurrency Tools for the JVM. This project aims to offer some concurrent data structures currently missing from the JDK.

concurrency data-structures queues lock-free wait-free awesome collections java-collection data-structure

Eclipse Collections - Best Java Collection Framework

•    Java

---

Eclipse Collections is a collections framework for Java. It has JDK-compatible List, Set and Map implementations with a rich API, additional types not found in the JDK like Bags, Multimaps, and set of utility classes that work with any JDK compatible Collections, Arrays, Maps, or Strings. The iteration protocol was inspired by the Smalltalk collection framework. It maximizes the power of Java 8 Lambda expressions and method references with rich APIs directly available on your collections.

collections java-collection collections-library utility data-structure