- Algorithms
- Dynamic Programming
- Greedy Algorithm
- Divide And Conquer Algorithms
January 17, 2023
Approximately 2 months at 10 hours a week to completeHiroki Nagasawa's account is verified. Coursera certifies their successful completion of Stanford University Algorithms Specialization.
Course Certificates Completed
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Graph Search, Shortest Paths, and Data Structures
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Earned after completing each course in the Specialization
Stanford University
Taught by: Tim Roughgarden
Completed by: Hiroki Nagasawa by November 13, 2022
4 weeks of study, 4-8 hours/week
Stanford University
Taught by: Tim Roughgarden
Completed by: Hiroki Nagasawa by December 3, 2022
4 weeks of study, 4-8 hours/week
Stanford University
Taught by: Tim Roughgarden
Completed by: Hiroki Nagasawa by December 25, 2022
4 weeks of study, 4-8 hours/week
Stanford University
Taught by: Tim Roughgarden
Completed by: Hiroki Nagasawa by January 17, 2023
4 weeks of study, 4-8 hours/week