Just thought this would be fun to share. The question is: “What is the sum of all 5 digit numbers formed using the digits 1,2,3,4 and 5 without repetition.” So numbers like 12345 and 32415 but not 11123. My solution was to generate all the permutations of [1,2,3,4,5], convert them to numbers, and …

Fun "interview" question solved easily in Julia

GunnarFarneback March 28, 2023, 6:09am 2

I went for sum(1:5) * 11111 * prod(1:4).

7 Likes

Topic		Replies	Views
Reduce number of allocations Performance memory-allocation	11	748	August 25, 2021
Julia vs. Python: Euler's sum of powers conjecture Performance performance , speed-optimization	16	843	June 24, 2022
Can you make this shorter, more elegant, and more julia-esque New to Julia question	4	426	August 13, 2020
Euler project - P 164 Performance question	30	2474	October 27, 2019
Compare permutaion of two numbers efficiently? Performance	32	844	August 4, 2020