Question: Given N real numbers a[i] and a target value V, design an algorithm to find a contiguous block (of any length) whose sum is as
Given N real numbers a[i] and a target value V, design an algorithm to find a contiguous block (of any length) whose sum is as close to V as possible. Implement it in your favorite language.
(python or c++)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
