AS
Karan Patel

Reverse a linked list

Linked Lists · submitted yesterday

FAILED
Attempts
6
Time
52 min
Tutor turns
14
Communication
48/100

Tutor conversation

3 turns

  • What does the function return when the list is empty?

    14:31

  • I'm not sure, my code crashes there.

    14:32

  • Let's start with the base case. What is the smallest input you can reason about?

    14:32
AI assessment of the conversation

Stuck with the problem across multiple attempts, asked the tutor probing follow-up questions, waited for tutor cues before each step, worked at a deliberate pace, did not converge on a working solution this attempt.

Character rubric

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

  • Grit86
  • Curiosity100
  • Initiative29
  • Speed22
  • Resilience76
  • Communication54

Academic rubric · this submission

  • Problem decomposition40
  • Algorithmic thinking38
  • Code quality50
  • Debugging discipline36
  • Communication with tutor48

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