Anatomy of a problem

lcpy gen -n 1

leetcode/two_sum/
├── README.md           # problem statement, difficulty, topics, tags
├── solution.py         # your code; the only file you edit
├── test_solution.py    # 10+ parametrized cases, ready to run
├── helpers.py          # run_/assert_ pair for readable test output
├── playground.py       # percent-format scratchpad notebook
└── __init__.py

class Solution:
    # Time: O(n)
    # Space: O(n)
    def two_sum(self, nums: list[int], target: int) -> list[int]:
        ...

def run_two_sum(solution_class: type, nums: list[int], target: int):
    implementation = solution_class()
    return implementation.two_sum(nums, target)


def assert_two_sum(result: list[int], expected: list[int]) -> bool:
    assert sorted(result) == sorted(expected)
    return True