Max Sum Sliding Window and Return Start Days (1-based)

Task (Python) You receive an integer list nums with n elements and a window length k (1 <= k <= n). Determine the total for each consecutive slice containing exactly k values. Return every window's starting position (or “start day”) when its total matches the largest window total. Report starting positions with 1-based indexing. When more than one window reaches the top sum, include each corresponding start position in ascending order. Input nums: an integer list containing…