All your solutions seem exceedingly complex. I would solve this problem with the following O(n) algorithm:
Create a set with the numbers 1 - N and a second set from the digits in the number given, if both sets are egal then the number is pandigital.
You're right! I just added this solution to the Github; it looks much cleaner. We might cover sets in a future article. Thank you, sir!
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
All your solutions seem exceedingly complex. I would solve this problem with the following O(n) algorithm:
Create a set with the numbers 1 - N and a second set from the digits in the number given, if both sets are egal then the number is pandigital.
You're right! I just added this solution to the Github; it looks much cleaner. We might cover sets in a future article. Thank you, sir!