go-fundamentals

Just a simple repository to build some common datastructures and algorithms from scratch in go.

Datastructures

• Linked List
• Stack
• Queue
• Binary Search Tree
• Heap
• Hash Table
• Trie
• AVL Tree
• Graph
• Bloom Filter
• LRU Cache
• Disjoint Set
• Segment Tree
• Fenwick Tree
• Suffix Array
• Suffix Tree
• Suffix Automaton
• KMP
• Aho-Corasick
• Rabin-Karp

Algorithms

• Standard Iterators
• Binary Search
• Bubble Sort
• Insertion Sort
• Selection Sort
• Merge Sort
• Quick Sort
• Bucket Sort
• Heap Sort
• Breadth First Search
• Depth First Search
• Counting Sort
• Radix Sort
• Topological Sort
• Z Algorithm
• Manacher'word Algorithm
• Dijkstra'word Algorithm