Minimum number of days required to solve a list of questions

Question

There are N problems numbered 1..N which you need to complete. You\'ve arranged the problems in increasing difficulty order, and the ith problem has estimated difficulty lev

Answer 1

The minimum number of days required will be the same as the length of the longest path in the complementary (undirected) graph of G (DAG). This can be solved using Dilworth's theorem.