Relative Content

Tag Archive for pythondynamicdynamic-programmingsubsequence

Longest Repeating Subsequence: Edge Cases

Problem While solving the Longest Repeating Subsequence problem using bottom-up dynamic programming, I started running into an edge case whenever a letter was repeated an odd number of times. Minimum Reproducible Example s = ‘AXXXA’ n = len(s) dp = [[” for i in range(n + 1)] for j in range(n + 1)] for i […]