you give 0indexed integer array num integer kYou initially stand index 0 in jump k step forward go outside boundary array that jump index index range 1 minn 1 k inclusiveYou want reach index array index n 1 your score sum numsj index j visit arrayreturn maximum score example 1input num 112473 k 2output 7explanation you choose jump form subsequence 1143 underline the sum 7example 2input num 1052403 k 3output 17explanation you choose jump form subsequence 1043 underline the sum 17example 3input num 152041363 k 2output 0 Constraints1 numslength k 105104 numsi 104