a playground to implement common things
- Insertion sort, Selection sort, Merge Sort, Quicksort
- Binary Search
- Breadth First Search (BFS)
- Depth First Search (DFS)
- Lee algorithm | Shortest path in a Maze
- Flood fill Algorithm
- Astar
- Astar Visualization
- Floyd’s Cycle Detection Algorithm
- Kadane’s algorithm
- Longest Increasing Subsequence
- Inorder, Preorder, Postorder Tree Traversals
- Heap Sort
- Topological Sorting in a DAG
- Disjoint-Set Data Structure (Union-Find Algorithm)
- Kruskal’s Algorithm for finding Minimum Spanning Tree
- Single-Source Shortest Paths — Dijkstra’s Algorithm
- All-Pairs Shortest Paths — Floyd Warshall Algorithm