Project Euler 24 Lexicographic Permutations in Python
https://projecteuler.net/problem=24
Python allows for a remarkably compact solution to this one. First call permutations on a string of the 0-9 digits. Then join them all to a string, which we ultimately map the int function onto. Then we return the millionth element of the sorted list.
from itertools import permutations
def problem24():
vals = list(permutations('0123456789'))
vals = ["".join(x) for x in vals]
vals = list(map(int, vals))
final = sorted(vals)
return final[1000000]
2783915604
On this page of the site you can watch the video online Project Euler 24 Lexicographic Permutations in Python with a duration of hours minute second in good quality, which was uploaded by the user Jeffrey James 03 February 2018, share the link with friends and acquaintances, this video has already been watched 1,996 times on youtube and it was liked by 10 viewers. Enjoy your viewing!
