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.
With a bit of math (modular arithmetic), you can restrict solutions only to some particular values of n, and with a limited range for the variables, so you can check all solutions (for uniqueness) within the required boundary range in a reasonable time.
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 #136: Singleton difference
You are viewing a single comment's thread. Return to all comments →
With a bit of math (modular arithmetic), you can restrict solutions only to some particular values of n, and with a limited range for the variables, so you can check all solutions (for uniqueness) within the required boundary range in a reasonable time.