Leetcode 3351. Sum of Good Subsequences

Compute the total sum of elements over all subsequences of nums that are "good" (every pair of consecutive elements in the subsequence has absolute difference 1), returning the result modulo 1e9+7; due to n and value range up to 1e5 this is solved with a DP that accumulates counts/sums per value rather than enumerating subsequences.