Practice: Product of Array Except Self

Problem: https://leetcode.com/problems/product-of-array-except-self/

Recognition reminder: every output position needs an aggregate of “everything except me.” When a precomputed prefix (and suffix) pass can answer that in one sweep instead of recomputing per index, that is the prefix-accumulation family.

Before you start (the five-beat rhythm)

  1. Your Pattern Card for this week is already written.
  2. Name the pattern aloud and write your approach as a plain-English comment before any code.
  3. Struggle floor: 25 minutes unaided. No hints, no AI, no Discuss tab.
  4. If stuck past the floor, ask the tutor for a hint. Six rungs, one per ask.
  5. Debrief in your commit message before moving to the next problem.

Your target 

Target time complexity:  ____
Target space complexity: ____

The naive answer recomputes a full product for every index (O(n^2)), and the problem forbids division. A two-sweep accumulation beats both. Know what each sweep carries.

Where your code goes

Write your solution in your own work repo (see getting-started.md), not in this folder. This folder ships only the problem spec and a provided-example test (tests/test_provided.py). The judge is the oracle; the tutor will not confirm your answer by reading it.

Debrief (paste into your commit message) 

1. What pattern did this turn out to be?
2. What was the trigger phrase or input shape that should have made me reach for it?
3. What was the time and space complexity, and what would dominate at scale?
4. What edge case would have broken my first attempt?
5. What would I do differently in three days when I see this cold?