LeetCode MEDIUM 279 Perfect Squares Summary
Generated by Codex with GPT-5
Quick facts
- Difficulty:
MEDIUM - Problem: Perfect Squares
- Topics:
Math,Dynamic Programming,Breadth-First Search
Problem gist
Given a positive integer n, the task is to return the fewest perfect square numbers whose sum is exactly n. A perfect square is a number such as 1, 4, 9, 16, and so on.