@Raphael i deleted that post migrated onto meta.so

@YvetteColomb Thanks! That was totally my bad... I auto-piloted through 'type "Stack Over", Enter, click the button' and saw too late that I had selected the wrong site. Again, sorry for the time wasted!

@Raphael not at all. I couldn't reverse it, so ended up deleting it.

@YvetteColomb Yes, that's fine. I deleted the migration history on our end and started over. :)

I have been stuck on this problem for a while. So far I have made the base cases S(0,0) = infinity and S(i, 0) = infinity. Then for the recursive case, S(i,j) = max( S(i-1, j-1), max(S(i-1, j), abs(L[i], L[i-1] ) ) where the first max is for deleting s[i] and the second is for keeping it. I'm not sure if my solution is correct or not or if I'm even on the right track. Can anybody check my work and help me out?

imgur.com/a/eGk2iUn