689. Maximum Sum of 3 Non-Overlapping Subarrays

Pick three non-overlapping length-k subarrays with maximum total sum, returning their (lexicographically smallest) start indices. The cubic brute force — choose three window positions — is hopeless,…