Kth largest in stream

Heaps · submitted 3h ago

PASSED

Attempts

Time

9 min

Tutor turns

Communication

80/100

Tutor conversation

3 turns

Can I use a min-heap of size k for kth-largest streaming?
11:02
Yes — what's the per-element cost?
11:02
log k for push/pop; total n log k.
11:03

AI assessment of the conversation

drove the solution without prompting, moved quickly through the workflow.

Character rubric

Soft-skill signals inferred from the conversation pattern, attempts and pace.

Grit60
Curiosity53
Initiative82
Speed82
Resilience64
Communication80

Academic rubric · this submission

Problem decomposition90
Algorithmic thinking88
Code quality86
Debugging discipline82
Communication with tutor80

Code submission

def max_window_sum(nums, k):
    if k > len(nums): return 0
    window = sum(nums[:k])
    best = window
    for i in range(k, len(nums)):
        window += nums[i] - nums[i - k]
        best = max(best, window)
    return best