Yep. It's a complete oversimpliification to consider all DP problems at O(n^2). Anybody familiar with modern algorithms will tell you that certain DP problems c

Yep. It's a complete oversimpliification to consider all DP problems at O(n^2). Anybody familiar with modern algorithms will tell you that certain DP problems can even be O(nloglogn)! https://en.wikipedia.org/wiki/Van_Emde_Boas_tree https://en.wikipedia.org/wiki/Van_Emde_Boas_tree For example, implementing VEB trees or even (countably distinct length) dictionary-based tries can speed up execution by orders of logn/n