Given two seperate arrays of integers, create a function that take two arrays and check for common itemss.
Example, [2, 4, 7] and [7, 5, 1] will return true While [0, 2] and [6,7,8] will return false.
There are two seperate solution, the first being the Brute force approach in the brute approach file
Second approach, in improved.go file should solve the same problem, but with better run time evaluation
pipeline This package provides a simplistic implementation of Go pipelines as outlined in Go Concurrency Patterns: Pipelines and cancellation. Docs Go
gocrud Go framework to simplify creating, reading, updating, and deleting arbitrary depth structured data — to make building REST services fast and ea
syncmap A typed implementation of the Go sync.Map using code generation. Install go get -u github.com/a8m/syncmap@master Examples: Using CLI $ syncma
This project has been archived. Please check out Uhaha for a fitter, happier, more productive Raft framework. Finn is a fast and simple framework for
faststringmap faststringmap is a fast read-only string keyed map for Go (golang). For our use case it is approximately 5 times faster than using Go's
Skipfilter This package provides a data structure that combines a skiplist with a roaring bitmap cache. This library was created to efficiently filter
goSetReconciliation An implementation to sync distributed sets using bloom filters. Based on the paper "Low complexity set reconciliation using Bloom
A Go library to iterate over potentially nested map keys using the visitor pattern
SliceX provides functional operations on Go slices using Go 1.18 type parameters.
A Go package for calculating the Levenshtein distance between two strings This package implements distance and similarity metrics for strings, based o
Graphoscope A solution to access multiple independent data sources from a common UI and show data relations as a graph: Contains a list of by default
Common Algorithms in Go This repository contains a collection of a variety of common algorithms implemented using Go. Algorithms Implemented Search Li
This is a repository dedicated to study, learn and solve Data Structure algorith
Set Set is a simple Set data structure implementation in Go (Golang) using LinkedHashMap. This library allow you to get a set of int64 or string witho
This project is no longer maintained - feel free to fork the project! gringo A high-performance minimalist queue implemented using a stripped-down loc
Queue A fast Golang queue using a ring-buffer, based on the version suggested by Dariusz Górecki. Using this instead of other, simpler, queue implemen
Some data structures and algorithms using golang
Implementation of missing colections for Golang using Generics. Free of dependencies. Curently in early development phase. Requirements Go 1.18+ Insta
Multi-String Pattern Matching algorithm. This implementation is inspired from Aho-Corasick algorithm Getting Started modelA = mspm.NewModel("mspm_mode
