Topic: Dynamic Programming Problem / Level: beginner

Problem: Find the longest subsequence in an array where adjacent elements have a difference of at most 1 using dynamic programming.

Run the code to see the output here...