Assumes that the 0 index of prices corresponds to a rod of 0 length (and will have a price of 0).

Returns the longest common subsequence of two strings in O(mn) time and space complexity, where m and n are the lengths of the strings.