Last active
January 29, 2019 10:47
-
-
Save mobileappconsultant/7e5c953b60be3c92ecabf57b133509de to your computer and use it in GitHub Desktop.
Simple demo of library that arranges all characters of a string in max number of possible ways
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import itertools | |
| count =0; | |
| stringInput = input(("Enter a string: ")) | |
| for p in itertools.permutations(stringInput): | |
| count = count +1 | |
| print("{},{}".format(count,p)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment