• goldenratio161commented on "Conway's Game of Life - Unlimited Edition" python solution

I feel like this is the epitome of python programming - extremely consise but unreadable, however demonstrates elite levels of knowledge in the language. Beautiful solution.

Approved

• saudiGuycreated a suggestion for "Last digit of the squared sum of Fibonacci numbers" kata

python new test framework is required. updated in this fork

• SirSamiboicommented on "Simple Fun #159: Middle Permutation" python solution

This is so clever but I'm not even going to begin trying to understand what's going on here :p

• BentarSegaracommented on "Last digit of the squared sum of Fibonacci numbers" kata

Can't complete the solution with more than 10 lines of code, the code always times out :(

• deverwcommented on "Fastest Code : Equal to 24" python solution

Perfect iterators!
I think four conditions should cover everything.
In order not to miss anything, shouldn't the exceptions be caught around each condition separately?

• dfhwzecommented on "Last digit of the squared sum of Fibonacci numbers" kata

has been updated some time ago.

• Pavel Vasilevcommented on "Factorial tail" python solution

Very well! :)

• nbc1973commented on "Last digit of the squared sum of Fibonacci numbers" kata

This comment is hidden because it contains spoiler information about the solution

Edited.

• RealKenshirocommented on "Last digit of the squared sum of Fibonacci numbers" kata

The following statement is a little misleading

you will compute the sum of squares of Fibonacci numbers

I suggest :

Consider the sum : S_n = F_0^2 + F_1^2 + ... + F_n^2, where F_0 = 0, F_1 = 1 and F_{i+2} = F_{i} + F_{i+1} for i >= 0 , you must compute the last digit of S_n

• Just4FunCodercreated an issue for "Last digit of the squared sum of Fibonacci numbers" kata

10 random tests are not enough. Consider increasing the number of random test to 100 to ensure good test coverage.

.