Don't give free hints please. Users are supposed to solve the katas by themselves.

wtf is this? :-)

one more step: for a given n what is the largest m in 1:n with exactly 2 prime factors (that is you have to find the appropriate p1,p2 )

it fails (despite that each test passed) w/ julia 1.5, got some gmp overflow error...

nice. but the condition used does not exclude
border case 'n'-s (to get unique representation)
n=70,sys=[2,5,7]

same as christmas tree (w/o join)

nice and simple!

too weak data set: take "abc" as anagram and ["bbb"] as the dictionary...

seems the best practice is using O(n^2) instead of O(n) - leaving room for the future development :-)

julia: how is it possible that I see ∉ in the solutions, despite that it is introduced only by 1.6 (i tested it w/ 1.0,1,6,1,7)?

in julia [1 2 3] is not a list in a traditional sense but a 1x3 matrix/2d array...

the second part could be: ( omnival == val ) == true and ( val == omnival ) == true for all possible val types...