Translated✅ Solutions to LeetCode by Go, 100% test coverage, runtime beats 100% | LeetCode Solutions
- leetcode
- golang
- go
- leetcode-golang
47,133 repositories indexed
1–24 of 28 · Most stars
Translated✅ Solutions to LeetCode by Go, 100% test coverage, runtime beats 100% | LeetCode Solutions
Algorithms and Data Structures implemented in Go for beginners, following best practices.
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
Unified querying, transformation, and modification of JSON, TOML, YAML, XML, INI, HCL, KDL and CSV.
Implements a deep pretty printer for Go data structures to aid in debugging
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.
Probabilistic data structures for processing continuous, unbounded streams.
Data structure and algorithm library for go, designed to provide functions similar to C++ STL
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
EliasDB a graph-based database.
Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
Graph algorithms and data structures
Package goraph implements graph data structure and algorithms.
A library provides spatial data and geometric algorithms
A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist
The repository host gives no description.
Lightweight RESTful database engine based on stack data structures
LibraDB is a simple, persistent key/value store written in pure Go in less than 1000 lines for learning purposes.
Go implementation of C++ STL iterators and algorithms.
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