Solutions

Your actual code lives here. One file per problem. Commit each one — the commit history is your streak.

Structure

solutions/
  step01-basics/
    count-digits.py
    armstrong-number.py
  step03-arrays/
    kadane.py
    merge-intervals.py
  step15-graphs/
    dijkstra.py
  ...

Use stepNN-shortname/ folders matching the tracker steps. Pick any language you like (the examples use .py, but your home turf is fine).

Every solution file starts with a header

# Problem: Maximum subarray sum (Kadane's algorithm)
# Link:    https://leetcode.com/problems/maximum-subarray/
# Pattern: running sum, reset on negative  (THIS is the line to remember)
# Time:    O(n)   Space: O(1)
# Date:    2026-06-19

def max_subarray(nums):
    ...

The Pattern line is the most important thing in the file. When you make your Anki card, that one line is the front of the card. Code is cheap to re-derive; the trigger is what you're actually training.

The rep, end to end

1. Read the problem. Try it yourself first (struggle is the point).
2. Stuck >20–30 min? Watch the Striver video for that step, then re-implement without looking.
3. Save the file with its header.
4. git add + commit with a message like step03: kadane.
5. One line in the daily log.