Special Numbers Sum | Dataford Interview Questions

Given n, find the sum of squares of the 'special' numbers in 1..n, where a number is special if the digits of its square can be partitioned into contiguous parts summing to the number (e.g. 9->81 (8+1), 10->100 (10+0), 36->1296 (1+29+6)). n=10 -> 181; n=37 -> 1477; 1<=n<=10^5.

Asked in the online assessment stage.

Implement special_square_sum(n), which returns an integer. A partition must contain at least two nonempty contiguous parts, and a part may contain leading zeroes. For example, 100 can be split as 100 + 00. Return 0 when no special number exists.

Constraints

1 <= n <= 10^5
Each partition contains at least two nonempty contiguous parts
Partition parts are interpreted as decimal integers, so leading zeroes are allowed
Return the sum as an integer

Function Signature

def special_square_sum(n):

Your question is Special Numbers Sum. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Asked in the online assessment stage.

Constraints

1 <= n <= 10^5
Each partition contains at least two nonempty contiguous parts
Partition parts are interpreted as decimal integers, so leading zeroes are allowed
Return the sum as an integer

Function Signature

def special_square_sum(n):

Your question is Special Numbers Sum. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.