Click here to see the full article post
In Approach #5 Dynamic Programming:
"choosing to put this string in any of the subset possible by using the previous strings traversed so far will impact the element denoted by dp[i][j] for i and j satisfying
m ≤ i ≤ x, n ≤ j ≤ y"
isn't the condition supposed to be x ≤ i ≤ m, y ≤ j ≤ n ?
@mnm Thanks for pointing this out. I've updated the conditions now.
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.