@@ -0,0 +1,1029 @@
+package com.fishercoder.solutions;%0A%0A/**%0A * 689. Maximum Sum of 3 Non-Overlapping Subarrays%0A *%0A * In a given array nums of positive integers, find three non-overlapping subarrays with maximum sum.%0A * Each subarray will be of size k, and we want to maximize the sum of all 3*k entries.%0A * Return the result as a list of indices representing the starting position of each interval (0-indexed).%0A * If there are multiple answers, return the lexicographically smallest one.%0A%0A Example:%0A Input: %5B1,2,1,2,6,7,5,1%5D, 2%0A Output: %5B0, 3, 5%5D%0A Explanation: Subarrays %5B1, 2%5D, %5B2, 6%5D, %5B7, 5%5D correspond to the starting indices %5B0, 3, 5%5D.%0A We could have also taken %5B2, 1%5D, but an answer of %5B1, 3, 5%5D would be lexicographically larger.%0A%0A Note:%0A nums.length will be between 1 and 20000.%0A nums%5Bi%5D will be between 1 and 65535.%0A k will be between 1 and floor(nums.length / 3).%0A */%0Apublic class _689 %7B%0A    public static class Solution1 %7B%0A        public int%5B%5D maxSumOfThreeSubarrays(int%5B%5D nums, int k) %7B%0A%0A            return new int%5B%5D%7B%7D;%0A        %7D%0A    %7D%0A%7D%0A

add 689 skeleton