We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
We should try to think the reverse solution. For eg. we have to get 89 using squares of numbers (1-9).
Obtain 89 using 1, 4, 9, 16, 25, 36, 49, 64, 81 once or more than once.
eg. 4+4+81=89 (the numbers are permutations of 2,9,2,0,0,0,0,0,0,0)
use recursion and count
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Project Euler #92: Square digit chains
You are viewing a single comment's thread. Return to all comments →
We should try to think the reverse solution. For eg. we have to get 89 using squares of numbers (1-9). Obtain 89 using 1, 4, 9, 16, 25, 36, 49, 64, 81 once or more than once. eg. 4+4+81=89 (the numbers are permutations of 2,9,2,0,0,0,0,0,0,0) use recursion and count