One post tagged with "part-1"

Let us start with a problem

Problem​

Given a list of integers L = [A₁, A₂, A₃, …, A_N]. Where A_i ≥ 0, 0 ≤ i ≤ N. You have to find the shortest contiguous segment in the list which adds up to a given integer K. If there are more than one such segment, print one of them.