Algorithms in Java

Introduction to Graduate Algorithms - Udacity

Difficulty Legends

Difficulty	Easy	Medium	Hard	Very Hard
Icon	🍰	🌰	🌰🌰	🌰🌰🌰

Difficulty Table

Dynamic Programming	Lesson 1	Lesson 2	Lesson 3	---	---
Difficulty	🌰 🌰	🌰 🌰	🌰 🌰 🌰	---	---
Randomized Algorithms	Lesson 1	Lesson 2	Lesson 3	---	---
Difficulty	🍰	🌰 🌰	🌰	---	---
Divide and Conquer	Lesson 1	Lesson 2	Lesson 3	Lesson 4	Lesson 5
Difficulty	🍰	🌰	🍰	🌰 🌰 🌰	🌰 🌰 🌰
Graph Algorithms	Lesson 1	Lesson 2	Lesson 3	Lesson 4	---
Difficulty	🌰	---	---	---	---

Dynamic Programming

Lesson 1 - source code

1. Fibonacci
2. Longest Common Subsequence
3. Longest Uncommon Subsequence
4. Longest Increasing Subsequence

Lesson 2 - source code

1. Knapsack problems with or without repetition of items
2. Chain Matrix Multiplication
3. Balanced Binary Tree

Lesson 3 - source code

1. Find the shortest path using Dijkstra's algorithm
2. Find the shortest path using Bellman-Ford's algorithm

Randomized Algorothms

Lesson 1 - source code

1. Modular Arithmetic
2. Multiplicative Inverses
3. Euclid's Algorithm (GCD)

Lesson 2 - source code

1. RSA Algorithm and Implementation
2. Primality Tests

Lesson 3 - source code

1. Implementation of Hash Map
2. Implementation of Bloom Filter

Divide and Conquer

Lesson 1 - source code

1. Multiplication Algorithms - naive and faster approaches

Lesson 2 - source code

1. Kth Smallest and Kth Largest in an unsorted array
2. Quick Sort

Lesson 3 - source code

1. Sum of Geometric Series

Lesson 4 - source code

1. Polynomial Multiplication
2. Fast Fourier Transform - FFT

Lesson 5 - source code

1. Polynomial Multiplication using FFT

Graph Algorothms

Lesson 1 - source code

1. Depth First Search in Graph
2. Topological Sort
3. Find Strongly Connected Components in Graph

Credits:

• Udacity Course - Introducation to Graduate Algorithms
• Geeks for Geeks