you give integer array num integer k find maximum subarray sum subarray num meet follow conditionsThe length subarray k andall element subarray distinctreturn maximum subarray sum subarray meet condition if subarray meet condition return 0A subarray contiguous nonempty sequence element array Example 1input num 1542999 k 3Output 15explanation the subarray num length 3 154 meet requirement sum 10 542 meet requirement sum 11 429 meet requirement sum 15 299 meet requirement element 9 repeat 999 meet requirement element 9 repeatedwe return 15 maximum subarray sum subarray meet conditionsExample 2input num 444 k 3output 0explanation the subarray num length 3 444 meet requirement element 4 repeatedwe return 0 subarray meet condition Constraints1 k numslength 1051 numsi 105