Data-Structures-and-Algorithms-Specialization-Coursera

I have completed 4 out of 6 courses of Data Structures and Algorithms Specialization offered by University of California San Diego.

This repository contains all my solutions of programming assignments of the 4 courses in C++ language.

Kindly refer to this repository if you get stuck in any of the assignments.

Course 1: Algorithmic Toolbox

• Programming Assignment 1

  • Sum of Two Digits

  • Maximum Pairwise Product

• Programming Assignment 2

  • Fibonacci Number

  • Last Digit of Fibonacci Number

  • Greatest Common Divisor

  • Least Common Multiple

  • Fibonacci Number Again

  • Last Digit of the Sum of Fibonacci Numbers

  • Last Digit of the Sum of Fibonacci Numbers Again

  • Last Digit of the Sum of Squares of Fibonacci Numbers

• Programming Assignment 3

  • Money Change

  • Maximum Value of the Loot

  • Car Fueling

  • Maximum Advertisement Revenue

  • Collecting Signatures

  • Maximum Number of Prizes

  • Maximum Salary

• Programming Assignment 4

  • Binary Search

  • Majority Element

  • Improving Quicksort

  • Number of Inversions

  • Organizing a Lottery

  • Closest Points

• Programming Assignment 5

  • Money Change Again

  • Primitive Calculator

  • Edit Distance

  • Longest Common Subsequence of 2 Sequences

  • Longest Common Subsequence of 3 Sequences

• Programming Assignment 6

  • Maximum Amount of Gold

  • Partitioning Souvenirs

  • Maximum Value of an Arithmetic Expression

Course 2: Data Structures

• Programming Assignment 1

  • Brackets in Code

  • Tree Height

  • Network Simulation

  • Stack with Max

  • Maximum Sliding Window

• Programming Assignment 2

  • Make Heap

  • Parallel Processing

  • Merging Tables

• Programming Assignment 3

  • Phone Book

  • Hash Chains

  • Hash Substring

• Programming Assignment 4

  • Tree Traversals

  • Is BST?

  • Is BST?(Advanced)

Course 3: Algorithms on Graphs

• Programming Assignment 1

  • Reachability

  • Connected Components

• Programming Assignment 2

  • Acyclicity

  • Toposort

  • Strongly Connected

• Programming Assignment 3

  • BFS

  • Bipartite

• Programming Assignment 4

  • Dijkstra

  • Negative Cycle

• Programming Assignment 5

  • Connecting Points

  • Clustering

Course 4: Algorithms on Strings

• Programming Assignment 1

  • Trie

  • Trie Matching

  • Trie Matching(Extended)

  • Suffix Tree

• Programming Assigment 2

  • BWT

  • BWT Inverse

  • BWMatching

  • Suffix Array

• Programming Assignment 3

  • KMP

  • Suffix Array Long

  • Suffix Array Matching

  • Suffix Tree from Array