Software Engineer

Step 1: Initialize the ans variable to 0.
Step 2: Initialize the currentSum of our initially empty window to 0.
Step 3: Initialize the pointers of our sliding window: begin = 0, end = 0.
Step 4: Instantiate the hash map numToIndex to store the index of the last occurrence of numbers seen so far in nums.
Step 5: Start the sliding window process. While end < nums.length:
Step 6: Get the current number we are adding to our window: currNum = nums[end].
Step 7: Get its last occurrence: lastOccurrence = numToIndex.getOrDefault(currNum, -1).
Step 8: While the window still contains this current number (begin <= lastOccurrence) or our window size is too large (end - begin + 1 > k):

• Update the current sum: currentSum -= nums[begin].
• Shrink our window by 1: begin++.Step 9: Our window is good now. Add the newly added element to our map: numToIndex.put(currNum, end).

Step 10: Update the current sum: currentSum += nums[end].
Step 11: If our window is of size k, update ans if currentSum is larger: ans = max(ans, currentSum).
Step 12: Increment end to add the next element for the next iteration: end++.
Step 13: Return ans.