Longest path in a DAG - dynamic programming on topological order — IITM BS previous year questions

Longest path in a DAG - dynamic programming on topological order is part of Longest Path, Transitive Closure, and Matrix Multiplication, Week 11 in Mathematics 1. Prasnya files every IIT Madras BS previous year question from this subtopic here, each one with a worked explanation. Take the whole set as a timed mock and you get accuracy, pacing and per-question analysis back.