Data Structures and AlgorithmsData structures and algorithms ~ Simple codeData structure implementationsHash table implementationImplement a circular linked list class – Linked list part 3Queue implementation using a linked list – Queue part 1Priority queue implementation using a heap – iterative solutionPriority queue implementation using a heap – recursive solutionCircular queue implementation using an array – Queue part 2Priority queue implementation using an ordered array – Priority queue 2Priority queue implementation using an unordered array – Priority queue 1 Trees and variationsMin heap implementation – Heap part 2Trie map – trie implementation using hashmapTrie list – trie implementation using a linked listMax heap implementation – Heap part 1Suffix trie implementation using hashmap – Trie variation 2Binary search tree implementation – Binary tree 2Binary search tree with parent pointer – Binary tree 3Suffix trie implementation using array – Trie variation 1Trie implementation using an array – Trie part 1 Graph theoryAdjacency list graph implementationA short post of Dijkstra’s algorithmKruskal’s algorithm find Minimum Spanning Tree using – Graph algorithm 1Topological Sort using DFS and Kahn’s algorithm – Graph algorithm 2Weighted graph as adjacency list – Graph implementation 2 Fundamental algorithmsBubble sort gifQuick sort gif | Code and visualsInsertion sort gif | code and visualsHeapsort gif – how heapify worksSelection sort gif | code and visualsMerge sort gif | code and visualsMathPrime number – check a number is prime number 3 solutionsFibonacci number – find nth fibonacci 4 solutionsCatalan number – find nth Catalan number 3 solutions
