Sum of elements of smallest subarray greater than x

Given a number x and an array of integers arr, find the smallest subarray with sum greater than the given value. If such a subarray do not exist return 0 in that case.

Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.

Please log in to access the Solution tab and view detailed answers and explanations.

Please log in to access the Discussion tab and join conversations with other participants.