Practice: Happy Number

Problem: https://leetcode.com/problems/happy-number/

Recognition reminder: you replace n by the sum of the squares of its digits, repeatedly, and ask whether it settles or runs forever. A self-contained number routine that generates its own sequence is the math cue, and it should remind you of a Week 2 move.

Before you start (the five-beat rhythm)

  1. Your three Pattern Cards for this week are already written.
  2. Name the pattern aloud (which of the three, and why) 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

Fill these in yourself before you look at anyone else’s solution:

Target time complexity:  ____
Target space complexity: ____

Each step costs O(log n) to read the digits; the number of distinct values before a cycle is bounded, so the whole thing is effectively O(log n) work per step over a bounded number of steps. A seen set is O(1) values worth of space here; fast/slow pointers are O(1). Know both.

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) so you can check the given cases locally before you submit to LeetCode’s judge. 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?