Lecture 06: Dynamic Programming on Strings and Trees

Content locked

The catalog is public. Reading this content requires approved access.

Optimal binary search trees

Resolving the cost discussion in class

Longest common subsequence (LCS)

Why two independent prefixes are needed

Edit distance mentioned as further practice

Maximum matching on a tree

Derive the transitions from the root’s action

The recorded example

Correctness and implementation details

Beyond this class: a connection to reinforcement learning

Exam reminders from this recording

Connections