AS
Aarav Sharma

Coin change — min coins

DP · submitted 2d ago

FAILED
Attempts
5
Time
38 min
Tutor turns
11
Communication
64/100

Tutor conversation

4 turns

  • What changes as the window slides one step right?

    10:22

  • One element leaves on the left, one enters on the right.

    10:23

  • Exactly. So what's the cheapest update?

    10:23

  • Subtract leaving, add entering. O(1) per step.

    10:24
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.

  • Grit78
  • Curiosity89
  • Initiative41
  • Speed42
  • Resilience70
  • Communication70

Academic rubric · this submission

  • Problem decomposition60
  • Algorithmic thinking58
  • Code quality70
  • Debugging discipline52
  • Communication with tutor64

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