Word ladder shortest path

Graphs / BFS · submitted 1h ago

PASSED

Attempts

Time

18 min

Tutor turns

Communication

86/100

Tutor conversation

2 turns

BFS layer by layer, right? Each transformation is an edge.
09:11
Exactly. What's your visited set?
09:11

AI assessment of the conversation

drove the solution without prompting.

Character rubric

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

Grit60
Curiosity57
Initiative78
Speed70
Resilience64
Communication86

Academic rubric · this submission

Problem decomposition92
Algorithmic thinking94
Code quality88
Debugging discipline90
Communication with tutor86

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