Hello all,

I wanted to improve my dp skill to next level and I see many problems have log N optimization that I cannot think of. Does anyone maybe have a list with such problems of DP, but with some log N optimization, for example N^2 -> NlogN or N^3 -> N^2logN. Any problems would help, preferably from Codeforces Div 2 C-E level.

Thank you!