🔩 Like builtins, but boltons. 250+ constructs, recipes, and snippets which extend (and rely on nothing but) the Python standard library. Nothing like Michael Bolton.
Repository Index
47,133 repositories indexed
25–48 of 92 · Most stars
180+ Algorithm & Data Structure Problems using C++
An Open-Source Collection of Flash Cards to Help You Preparing Your Algorithms & Data Structures and System Design Interviews 💯
Solutions to LeetCode by Swift
Lightweight, fast and reliable key/value storage engine based on Bitcask.
C++ implementation of the Python Numpy library
No description provided by the repository host.
A library of common data structures and algorithms written in C.
KTH Algorithm Competition Template Library (... eller KTHs AC-tillverkande lapp)
A simple, fast, embeddable, persistent key/value store written in pure Go. It supports fully serializable transactions and many data structures such as list, set, sorted set.
Master repository for the JGraphT project
Eclipse Collections is a collections framework for Java with optimized data structures and a rich, functional and fluent API.
:gem:Collection of algorithms and data structures
The repository contains the ENGLISH description files attached to the video series in my ARABIC algorithms channel.
🐆 An immutable list with unmatched performance and a comprehensive functional API.
The bidirectional mapping library for Python.
C++ implementation of a fast hash map and hash set using robin hood hashing
An advanced, but easy to use, platform for writing functional applications in Java 8.
stdgpu: Efficient STL-like Data Structures on the GPU
A complete, fully tested and documented data structure library written in pure JavaScript.
The MEGA interview guide, JavaSciript, Front End, Comp Sci
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
A curated list of courses, online judges, visualizations, books and competitions for learning and practicing algorithms. English and Korean.
🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of items using orders of magnitude less space than traditional indexes