String-Dp

Find minimum operations to convert one string to another

Find the length of the longest common subsequence between two strings

Implement regular expression matching with '.' and '*'

Solve LeetCode 140 Word Break II with DFS + memoization DP. Output-sensitive (≈O(n²)+answers). Step-by-step for interviews—practice now.