✅ Solutions to LeetCode by Go, 100% test coverage, runtime beats 100% | LeetCode 题解
- leetcode
- golang
- go
- leetcode-golang
Repository Index
47,133 repositories indexed
1–22 of 22 · Most stars
Algorithms and Data Structures implemented in Go for beginners, following best practices.
- algorithms
- algorithms-implemented
- data-structures
- datastructures
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
- go
- golang
- data-structure
- map
Unified querying, transformation, and modification of JSON, TOML, YAML, XML, INI, HCL, KDL and CSV.
- json
- yaml
- configuration
- selector
Lightweight, fast and reliable key/value storage engine based on Bitcask.
- database
- kv-store
- golang
- data-structures
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
- axiom
- data-structures
- go
- golang
Graph algorithms and data structures
- graph-algorithms
- graph-theory
- data-structures
- go
A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist
- skiplist
- golang
- golang-library
- go
No description provided by the repository host.
- cache
- data-structures
- go
- golang
LibraDB is a simple, persistent key/value store written in pure Go in less than 1000 lines for learning purposes.
- data-structures
- database
- go
- golang
Bitset data structure
- bit-twiddling
- bit-array
- data-structures
- bitset
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.
- generic
- golang
- graph
- graph-algorithms
A comprehensive, reusable and efficient concurrent-safe generics utility functions and data structures library.
- go
- golang
- data-structures
- functional
Probabilistic set data structure
- bloom-filter
- data-structures
- go
Ordered-concurrently a library for concurrent processing with ordered output in Go. Process work concurrently and returns output in a channel in the order of input. It is useful in concurrently processing items in a queue, and get output in the order provided by the queue.
- concurrent
- golang
- golang-library
- data-science
radix tree (also "radix trie" or "compact prefix tree" or "compressed trie")
- radix-tree
- radix-trie
- prefix-tree
- trie
Generic, zero-alloc, 100%-test covered Quadtree for golang
- golang-library
- quadtree
- data-structures
- generics
A simple Set data structure implementation in Go (Golang) using LinkedHashMap.
- go
- golang
- set
- data-structures
Sliding-window and regular top-K sketches, based on HeavyKeeper
- go
- golang
- heavy-hitters
- probabilistic-data-structures
Generic double-ended heap (min-max heap) for Go — O(1) min and max, O(log n) push/pop
- heap
- min-max-heap
- priority-queue
- double-ended-queue
The kitchen sink for clean Go projects — generic helpers for slices, maps, parallel work, JSON, HTTP, and containers
- collections
- data-structures
- functional-programming
- generics