1. Don't forget to add spoiler flag for comments that contain information on how to solve the kata (all non-spoiler-marked comments are visible on Codewars's homepage).
2. Yes, it is indeed slower (since you iterate twice over the array instead of once).

nice!

fsum is for floating point numbers, hence the precision issue. When dealing with integers, sum is the function to use.

I'm new to python to. I search in math package and found math.fsum function, thinking as it to be more accurate but it just failed the test for large numbers. Maybe there is some precision issue

Gotta love floating points.

twoDecimalPlaces(1.005);

• will turn 1 and we expect 1.01

Had this equation but was missing the / 2 at the end, wrote it out the long way and waayyy over complicated it in my brain

i guess your writing style is as good as that solution you were talking about lol

It's quite simple - you check all the paths until a & b || c & d returns true. Sometimes there are two possible ways - such as in the banana case. For this reason there is the || in our solution for both recursive paths

impostor syndrome is hitting real hard after seeing this lmfao. great job though!!!

good