Minimum Absolute Difference of Subarray Sum and Target
Filed under Directi
The question
Given an array and an integer T, find a contiguous subarray from index i to j such that the absolute difference between the subarray sum and T is minimized.
No write-up yet. Related questions below have one.
Related Directi questions
Collected from public candidate posts and coding forums. Updated Nov 2026.