Ibm oa - How would you even solve this? Looks like a DP problem, can't find it on leetcode though

Give an array of integers of length n, arr, and two integers l and r, find another array brr, such that: - l <= brr[i] <= r - brr[i] - arr[i] <...