JPMorgan Chase logoJPMorgan Chase
Coding·60 minMembers

Circular Active Computers Window

Members only

Given `n` computers arranged in a circle as 0/1 states, find the maximum number of active computers in any `k` adjacent computers.

SWE
sliding-window
array
binary-string
oa
easy
Frequency
Single report
Last asked
2025-07-29
Stage
oa · tech-screen

Log in to continue reading the full content

Comments

Sign in to join the discussion
Loading...