✅ Solutions to LeetCode by Go, 100% test coverage, runtime beats 100% | LeetCode 题解
Repository Index
47,133 repositories indexed
1–19 of 19 · Most stars
Algorithms and Data Structures implemented in Go for beginners, following best practices.
Unified querying, transformation, and modification of JSON, TOML, YAML, XML, INI, HCL, KDL and CSV.
Lightweight, fast and reliable key/value storage engine based on Bitcask.
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.
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
Graph algorithms and data structures
A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist
No description provided by the repository host.
LibraDB is a simple, persistent key/value store written in pure Go in less than 1000 lines for learning purposes.
Bitset data structure
Generic graph data structures and algorithms for Go (Golang): dependency graphs (DAGs) with cycle checks and topological sort, BFS and DFS traversal, Dijkstra and other shortest paths, connectivity and partitioning. No dependencies.
A comprehensive, reusable and efficient concurrent-safe generics utility functions and data structures library.
Probabilistic set data structure
radix tree (also "radix trie" or "compact prefix tree" or "compressed trie")
Generic, zero-alloc, 100%-test covered Quadtree for golang
A simple Set data structure implementation in Go (Golang) using LinkedHashMap.
Sliding-window and regular top-K sketches, based on HeavyKeeper
The kitchen sink for clean Go projects — generic helpers for slices, maps, parallel work, JSON, HTTP, and containers