Data Structures and Algorithms

Data structures and algorithms ~ Simple code

Data structure implementations

Implement a stack class using a linked list – Stack part 2

Implement a stack class using an array – stack part 1

Implement a 2d array (matrix) – Array part 3

Implement a doubly linked list class – Linked list part 2

Implement a linked list class – Linked list part 1

Implement an array class – Array part 1

Implement a sorted array – Array part 2

Hash table implementation

Implement a circular linked list class – Linked list part 3

• 1
• 2
• ›

Trees and variations

Max heap implementation

Trie map – trie implementation using a hashmap

Min heap implementation

Trie implementation using an array

Binary tree implementation – Binary tree 1

Trie list – trie implementation using a linked list

Binary search tree implementation – Binary tree 2

Binary search tree with parent pointer – Binary tree 3

Graph theory

Weighted graph as adjacency list – Graph implementation 2

Adjacency list graph implementation

A short post of Dijkstra’s algorithm

Kruskal’s algorithm find Minimum Spanning Tree using – Graph algorithm 1

Topological Sort using DFS and Kahn’s algorithm – Graph algorithm 2

Fundamental algorithms

Merge sort gif | code and visuals

Bubble sort gif

Selection sort gif | code and visuals

Insertion sort gif | code and visuals

Quick sort gif | Code and visuals

Heapsort gif – how heapify works

Math

Factorial number – calculate factorials 2 solutions

Prime number – check a number is prime number 3 solutions

Fibonacci number – find nth fibonacci 4 solutions

Catalan number – find nth Catalan number 3 solutions