Browse Code Data structures and algorithms Data structure implementations Implement a 2d array (matrix) – Array part 3 Implement a stack class using a linked list – Stack part 2 Implement a stack class using an array – stack part 1 Implement a circular linked list class – Linked list part 3 Implement a linked list class – Linked list part 1 Implement a sorted array – Array part 2 ‹ 1 2 Trees and variations Trie implementation using array – Trie part 1 Binary search tree with parent pointer – Binary tree 3 ‹ 1 2 Graph theory Minimum Spanning Tree using Kruskal’s algorithm – Graph algorithm 1 Graph as adjacency list – Graph implementation 1 Weighted graph as adjacency list – Graph implementation 2 Graph as adjacency matrix – Graph implementation 3 Topological Sort using DFS and Kahn’s algorithm – Graph algorithm 2 Shortest path using Dijkstra’s algorithm – Graph algorithm 3 Fundamental algorithms Merge sort – divide and conquer Quicksort – divide and conquer Bubble sort (2 solutions) – basic and optimized Binary search (2 solutions) – iteration and recursion Selection sort – code and visuals Insertion sort – code and visuals Heapsort (2 solutions) – iteration and recursion Math Factorial number – calculate factorials 2 solutions Prime number – check a number is prime number 3 solutions Catalan number – find nth Catalan number 3 solutions Fibonacci number – find nth fibonacci 4 solutions
