All the assignments and coursework done as a part of Coursera DSA course by Princeton University. Also, this repository contains the implementation of various data structures and various algorithms. This repository can be the one go-to resource for various technical interviews and even for getting a shorthand implementation of algos during your CP contest.😉
- Linked List
- Stacks
- Queues
- Union-Find (Set implementation)
- Binary Search Tree (BST)
- Segment Tree
- Various Sorting Algos
- Knapsack Problem (Both Variants 1 and 2)
- Binary Search
- Dijkstra ALgorithm for finding the shortest path
- Bellman Ford Algorithm for finding the shortest path
- Floyd Warshall Algorithm for finding shortest path between all pairs of vertices
- Kruskal's Algorithm for finding the shortest path
- Kadane's Algorithm for Maximum Sum of Contiguous Subarray
- Circular Kadane's Algorithm for Maximum Sum of Contiguous Subarray with both ends connected