I have a moderate experience of solving DP questions. I got informed about the hackerrank dp problem set. I found it quite challenging (I wasn't able to solve more than 10 problems all by myself). Can anyone give me remarks on the problem set, like its level of difficulty as compared to div2 problems and also general tips on solving non-standard dp problems and dp on graphs?