README.md

Algorithmic-Toolbox

This repository contains my solutions for the assignments of the course - Algorithmic Toolbox offered on Coursera. It is part of Data Structures and Algorithms Specialization. All soulutions are only in Java.

These solutions are for reference only, for passing the course design and implement your own solutions

About the course

The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. We will learn a lot of theory: how to sort data and how it helps for searching; how to break a large problem into pieces and solve them recursively; when it makes sense to proceed greedily; how dynamic programming is used in genomic studies. You will practice solving computational problems, designing new algorithms, and implementing solutions efficiently (so that they run in less than a second).

Week 1 : Programming Challenges

1) Sum of Two Digits

2) Maximum Pairwise Product

Week 2 : Algorithmic Warm-up

1) Fibonacci Number

2) Last Digit of a Large Fibonacci Number

3) Greatest Common Divisor

4) Least Common Multiple

5) Fibonacci Number Again

Week 3 : Greedy Algorithms

1) Money Change

2) Maximum Value of the Loot

3) Car Fueling

4) Maximum Advertisement Revenue

5) Collecting Signatures

6) Maximum Number of Prizes

7) Maximum Salary

Week 4 : Divide and Conquer

1) Binary Search

2) Majority Element

3) Improving Quick Sort

4) Number of Inversions

Week 5 : Dynamic Programming 1

1) Money Change Again

2) Primitive Calculator

3) Edit Distance

4) Longest Common Subsequence of Two Sequences

5) Longest Common Subsequence of Three Sequences

Week 6 : Dynamic Programming 2

1) Maximum Amount of Gold

2) Partitioning Souvenirs

3) Maximum Value of an Arithmetic Expression