Oh, yes!

a smart solution. As for me, it's just delicious

the direction was to write the factorial function not to import the existing one

Super!

watching this little game evolve was quite nice, I love that someone added a num gen. That made this fizzbuzz worth looking at.

Goodwork.

Nice one

What is 3628800?

bruh.. import factorial, genius! lol

If you want to define methods in just one line including def keyword,
how about just using lambda?

And I think it's worth paying attention to using class 'Boggle' game,
not just defining related functions as I did.

Add the following test, to verify if it works with bigger numbers:

a = [1200000000, 150000000000,313456445]
b = [[2, 151200000000], [3, 151200000000], [5, 151513456445], [62691289, 313456445]]
test.assert_equals(sum_for_list(a),b)

Este caso no funciona para Numeros Muy Grandes.

a = [1200000000, 150000000000,313456445]
test.assert_equals(sum_for_list(a), [[2, 151200000000], [3, 151200000000], [5, 151513456445], [62691289, 313456445]])

Revisar mi Solucion

Ok

Me parece que El algortimo optimo de este ejercicio debe de ser de Orden N^2.
En mi solucion trate de que ello se cumpliera.
Muy Buena Kata.