wiki-review: 2026-07-08T013943Z
wiki-review: 2026-05-02T073012Z
Was reviewing today and this got me thinking. There are \sum_{i=0}^N i = n*(n+1)/2 total substrings and where are doing n work for each each substring , so it should O(N^3)
Remove math formatting from dp guides.
Add dynamic programming guides.