Stanford Algorithms Specialization

This repository contains solutions to all programming assignments that are part of Stanford's Algorithms Specialization.

Structure

This specialization contains 4 parts, namely:

• Divide and Conquer, Sorting and Searching, and Randomized Algorithms
• Graph Search, Shortest Paths, and Data Structures
• Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
• Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

Each part contains content worth 4 weeks each.

The content of each part is mentioned in a README of its own.