CoursesDynamic ProgrammingScheduling DP
Maximum Length of Pair Chain
Two correct answers, one clear winner: LIS-style DP after sorting by first element works in O(n^2) — but when every interval counts equally, greedy by END point solves it in O(n log n). Learn when scheduling DP collapses to greedy.
Dynamic Programming is part of AlgoFox Pro
You can read the whole course outline here. The exercises are in the app, along with your streak, your mistake review, and the progress that carries across your devices.
Pro starts with a 3 day free trial. The app store decides who is eligible for an introductory offer, and a lapsed subscription does not get another one.
Already subscribed in the app? Sign in with the same account and Pro works here too. Quick Play and Battle are free on the web, and so is the first course in every subject.