Coding Challenge · ADVANCED
Given an array of integers and an integer k, find the kth largest sum of any contiguous subarray. A contiguous subarray is a subsequence of array elements that are consecutive in the array. For example, in the array 1,2,3, the subarrays include 1, 2, 3, 1,2, 2,3, and 1,2,3.