Topic: Dynamic Programming Problem / Level: intermediate

Problem: Compute the longest subsequence in an array where the difference between adjacent elements is at most 1 using dynamic programming.

Run the code to see the output here...