The Lazy Squares
A easy Python interview practice problem on DataDriven. Write and execute real python code with instant grading.
- Domain
- Python
- Difficulty
- easy
- Seniority
- L4
Problem
Given a positive integer n, build the sequence 1^2, 2^2, ..., n^2 in order. Internally generate the squares lazily with a generator (one square at a time), but return them collected into a list. For example, squares_up_to(5) returns [1, 4, 9, 16, 25].
Summary
A sequence that never fully reveals itself.
Practice This Problem
Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.