README.md

Data Structures and Algorithms Specialization

Offered by: Coursera

Created by: University of California, San Diego, and National Research University Higher School of Economics

This repository contains my solutions to some programming assignments of the first two courses of Data Structures and Algorithms Specialization. I interrupted this specialization to focus on getting my master's degree in computer science.

To compile these solutions, I used GCC 4.2.1 (course 1) and 8.1.0 with the following command line:

$ gcc -pipe -O2 -std=c11 <filename> -lm

Disclaimer: If you are enrolled in this specialization or in one of its courses, do not access the content of this repository.

Course 1. Algorithmic Toolbox

Week 1. Programming Challenges

• Programming Assignment
• Sum of Two Digits
• Maximum Pairwise Product

Week 2. Algorithmic Warm-up

• Programming Assignment
• Fibonacci Number
• Last Digit of a Large 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

Week 3. Greedy Algorithms

• Programming Assignment
• Money Change
• Maximum Value of the Loot
• Maximum Advertisement Revenue
• Collecting Signatures
• Maximum Number of Prizes
• Maximum Salary

Week 4. Divide-and-Conquer

• Programming Assignment
• Binary Search
• Majority Element
• Improving Quick Sort
• Number of Inversions
• Organizing a Lottery
• Closest Points

Week 5. Dynamic Programming 1

• Programming Assignment
• Money Change Again
• Primitive Calculator
• Edit Distance
• Longest Common Subsequence of Two Sequences
• Longest Common Subsequence of Three Sequences

Week 6. Dynamic Programming 2

• Programming Assignment
• Maximum Amount of Gold
• Partitioning Souvenirs
• Maximum Value of an Arithmetic Expression

Course 2. Data Structures

Week 1. Basic Data Structures

• Programming Assignment
• Check Brackets in the Code
• Compute Tree Height
• Network Packet Processing Simulation

Week 2. Dynamic Arrays and Amortized Analysis

• There was no programming assignment this week.

Week 3. Priority Queues and Disjoint Sets

• Programming Assignment
• Convert Array Into Heap
• Parallel Processing
• Merging Tables

Week 4. Hash Tables

• Programming Assignment
• Phone Book
• Hashing With Chains
• Find Pattern in Text

Week 5. Binary Search Trees 1

• There was no programming assignment this week.

Week 6. Binary Search Trees 2

• Programming Assignment
• Binary Tree Traversals
• Is It a Binary Search Tree?
• Is It a Binary Search Tree? Hard Version