Temu / PinduoduoCoding·60 minMembers
Perfect Squares — Return the Shortest Decomposition
Members only
A twist on LeetCode 279 Perfect Squares: instead of returning the minimum count of perfect squares summing to n, output the actual shortest sequence of squares.
SWE
dp
bfs
shortest-path
medium
Frequency
Low
Last asked
2026-07-17
Stage
phone-screen
Log in to continue reading the full content
Comments
Sign in to join the discussion
Loading...
