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.
Some key observations:
- generate all pandigitals numbers
- Multiplications greater than 2 can be represented as 2 multiplications
- There is an upper bound for factors a
- Generate all pandigital concatenated products and use binary search
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #170: Find the largest 0 to 9 pandigital that can be formed by concatenating products.
You are viewing a single comment's thread. Return to all comments →
Some key observations: - generate all pandigitals numbers - Multiplications greater than 2 can be represented as 2 multiplications - There is an upper bound for factors a - Generate all pandigital concatenated products and use binary search