Sliding Window With Duplication | Dataford Interview Questions

Hiver can represent a repeating support schedule as a circular array of workload values. Given the schedule and a window size, find the maximum total workload across any k consecutive positions, allowing the window to wrap from the end back to the beginning.

Treat the circular schedule as nums + nums, but return only windows whose starting positions correspond to the original array. Use a sliding-window technique rather than recomputing every window from scratch.

Formal Specification

Implement max_circular_window(nums, k), where nums is a non-empty list of integers and k is the number of consecutive circular positions. Return an integer representing the largest possible sum of exactly k consecutive values.

Constraints

1 <= len(nums) <= 100,000
1 <= k <= len(nums)
-10^9 <= nums[i] <= 10^9
The result fits within a signed 64-bit integer

Function Signature

def max_circular_window(nums, k):

Your question is Sliding Window With Duplication. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Formal Specification

Constraints

1 <= len(nums) <= 100,000
1 <= k <= len(nums)
-10^9 <= nums[i] <= 10^9
The result fits within a signed 64-bit integer

Function Signature

def max_circular_window(nums, k):

Your question is Sliding Window With Duplication. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.