Coursera

Free Algorithms Course Part II: Graphs, Strings and Compression

Connections between objects create problems that simple lists cannot represent well.

Free learning access

No trial required. Access information checked on 20 October 2026. See the details below for credentials and any separate tool costs.

About this course

Connections between objects create problems that simple lists cannot represent well. Princeton’s Algorithms, Part II turns to graphs and strings, extending the structures and performance ideas introduced in the first course.

The syllabus includes directed and undirected graphs, shortest paths, spanning trees and network flow. It then explores string sorting, tries, searching, regular expressions and compression, with later discussion of reductions and computational limits.

Official course Algorithms, Part II
Created by Princeton University
Platform Coursera
Level / language Intermediate / English
Estimated study time 6 weeks at 10 hours a week (Coursera estimate)
Format 14 modules; see the published syllabus for activities
Access Learning content free; account needed
Certificate No certificate offered for this course

Skills you’ll gain

  • Graph algorithms
  • String processing
  • Data compression
  • Java problem solving

Coursya recommends completing Part I or equivalent work first. Expect substantial programming time: the six-week estimate makes this a sustained technical course rather than a brief survey.

Videos, exercises and assignments are free, while the accompanying textbook is optional. When comparing algorithms, keep the representation and input assumptions visible; a method’s usefulness depends on the problem it is actually solving.

Enroll Now ↗

Affiliate disclosure: an eligible later purchase may earn Coursya a commission. The learning access described here is free.

Related courses for your next step

Compare course focus, level and study time
Compare the published course outlines. A lower level is a preparation option, not a required prerequisite.
Course Level Focus Study time
This course — Free Algorithms Course Part II: Graphs, Strings and Compression Intermediate Graph algorithms · String processing · Data compression 6 weeks at 10 hours a week (Coursera estimate)
Free Algorithms Course Part I: Data Structures and Sorting Intermediate Java data structures · Sorting · Searching 5 weeks at 10 hours a week (Coursera estimate)
Free Analysis of Algorithms Course: Recurrences and Asymptotics Professional Recurrence analysis · Generating functions · Asymptotic reasoning 2 weeks at 10 hours a week (Coursera estimate)

Frequently asked questions

Can I take this before learning basic data structures?

The sequence builds on Part I. Comfortable Java programming and earlier data-structure knowledge make a more appropriate starting point.

Independent Coursya overview based on the official syllabus and access information, reviewed 20 October 2026.

Share this course

Questions & discussion

Share a useful question or correction. Comments appear after moderation. Please avoid personal or sensitive information.

Add to the discussion

Your email address will not be published. Required fields are marked *