Skip to content

Conversation

Hyftar
Copy link
Contributor

@Hyftar Hyftar commented Oct 2, 2019

This PR adds the solution to the Project Euler's Problem 32

@@ -0,0 +1,56 @@
"""
We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once; for example, the 5-digit number, 15234, is 1 through 5 pandigital.
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Wrap to 88 max

filter(
lambda combination: isCombinationValid(combination),
itertools.permutations('123456789')
)
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Comprehension(s) instead?

@cclauss cclauss merged commit 6e69208 into TheAlgorithms:master Oct 3, 2019
@Hyftar Hyftar deleted the problem32 branch October 3, 2019 20:51
stokhos pushed a commit to stokhos/Python that referenced this pull request Jan 3, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants