sadafshaik/Data-Structures-and-Algorithms-specialization-University-of-California-San-Diego

Data Structures and Algorithms specialization offered by University of California San Diego and National Research University Higher School of Economics

This specialization content can be found here on coursera
please note that solutions to different questions are provided in python language, so complete solutions are available in .py files and .ipynb files. cpp and java files are just starter files provided by coursera.

Algorithmic Toolbox, course 1

This course content can be found here on coursera

Week 1: Programming challenges

questions and solutions

Week 2: Algorithmic_warmup

questions and solutions

Week 3: Greedy algorithms

questions and solutions

Week 4: Divide and conquer

questions and solutions

Week 5: Dynamic programming 1

questions and solutions

Week 6: Dynamic programming 2

questions and solutions

notes about dynamic programming

Data Structures, course 2

This course content can be found here on coursera

Week 1: Basic data structures

questions and solutions

Week 2: Amortized analysis

questions and solutions

Week 3: Priority queues and Disjoint sets

questions and solutions

Week 4: Hash tables

questions and solutions

Week 5 and Week 6: Binary Search trees

questions and solutions

Algorithms on Graphs, course 3

This course content can be found here on coursera

Week 1: Decomposition of Graphs 1

questions and solutions
Study Notes

Graph basics
Exploring undirected graphs

Week 2: Decomposition of Graphs 2

questions and solutions

Study Notes

Directed Graphs

Week 3: Paths in Graphs 1

questions and solutions

Study Notes

Most Direct Route

Week 4: Paths in Graphs 2

questions and solutions

Study Notes

Fastest Route
Currency Exchange

Week 5: Minimum Spanning Trees

questions and solutions

Study Notes

Minimum Spanning Trees

thanks for the studynotes akueisara

Algorithms on strings, course 4

This course content can be found here on coursera. The solutions are little untidy and only few of the assignments are solved(enough to pass), not all.

running test cases provided in assignments

Coursera provides test cases under "tests" folder for some of the assignments. Code is not written for all assignments to read and check if your code passes all the test cases. But as an example, I wrote it for one assignment

I added few lines of code at the end of the file (under "test if everything in tests folder passes" heading) match brackets
def test_function():
That snippet of code reads test files, apply your function and compare your result and the actual result. It can be tweaked according to the need/assignment

Todo
Data structures

week1

• 5)max_sliding_window

week4

• 4)substring inequality

ALgorithmic toolbox

week2

• 2-7: Last Digit of the Sum of Fibonacci Numbers Again

graph algorithms

week 1 .ipynb files are deleted, re-upload them

algorithms on strings

• improve readme
• find unsolved problems and solve.