DIY: Maximum Sum of Three Non-Overlapping Arrays

Understand how to identify three non-overlapping subarrays of size k that produce the maximum sum from a given integer array. Explore techniques for returning the lexicographically smallest indices of these subarrays, and implement a solution suitable for coding interviews.