The repository is a collection of open-source implementation of a variety of algorithms implemented in Go and licensed under MIT License.

Read our Contribution Guidelines before you contribute.

• Caesar
• Diffie Hellman Key Exchange
• Polybius
• Rot13
• Rsa
• Xor

• Roman Numeral To Integer
• Integer To Roman Numeral
• Decimal To Binary
• Binary To Decimal

• AVL Tree
• Binary Tree
• Dynamic Array
• Hashmap
• Linked-List
  • Doubly Linked List
  • Singly Linked List
  • Cyclic Linked List AKA Looped Linked List
• Queue
  • Array Based
  • Custom Linked List Based
  • Standard Library Container/List Based
• Set
• Stack
  • Array Based
  • Custom Linked List
  • Standard Library Container/List Based
• Trie

• Binomial Coefficient
• Fibonacci
• Knapsack
• Longest Common Subsequence
• Longest Palindromic Subsequence
• Matrix Multiplication
• Cutting a Rod

• Breadth First Search
• Depth First Search
• Floyd Warshall
• Coloring Algorithms
  • Using BFS
  • Using Backtracking
  • Using Greedy Approach

• Gcd
  • Extended
  • Recursive
  • Iterative
• Lcm
• Max
• Modular
  • Exponentiation
  • Inverse
• Moser-de Bruijn sequence
• Permutation
• Power
• Prime
  • Miller Rabin Primality Test
  • Naive and Pair Approach
  • Sieve
• Pythagoras
• Sieve
• Straight Lines

• Max Subarray Sum
• Nested Brackets
• Password Generator

• Binary Search
• Linear Search
• Interpolation Search

• Bubble Sort

• Heap Sort

• Insertion Sort

• Merge Sort

• Quick Sort

• Radix Sort

• Selection Sort

• Shell Sort

• Sorts Test

• Levenshtein Distance
• Multiple String Matching
  • Advanced Aho Corasick
  • Aho Corasick
• Single String Matching
  • Bom
  • Horspool
  • Kmp