Minimize Sum of Absolute Differences

Problem Statement

Minimize Sum of Absolute Differences Problem Description Given an array, remove a single continuous subarray of length k such that the sum of absolute differences between adjacent elements in the resulting array is minimized. Constraints The length of the input array, n , can be up to 10 5 . The length of the continuous subarray to remove, k , can be up to 10 3 . It is implied that 1 .