def longest_subseq_with_diff_one(arr, n):
    if not arr or n <= 0:
        return 0

    dp = {}
    best = 0

    for x in arr[:n]:
        curr = max(dp.get(x - 1, 0), dp.get(x + 1, 0)) + 1
        if curr > dp.get(x, 0):
            dp[x] = curr
        if dp[x] > best:
            best = dp[x]

    return best