the method name in java should be in camelCase

1. solution setup doesn't compile
2. your random tests are in reverse order. This:

Expect(expected).To(Equal(AmIAfraid(day, n)))

should instead be:

Expect(AmIAfraid(day, n)).To(Equal(expected))

Do you now see the bug in your solution?

It worked on the first try

Go solution

LGTM. Approved

How often did you have to submit before you passed the random tests?

Visually constructed: excluding the corner square that is unchallenged, remove the squares from the row, column, and diagonal

Clojure Translation

This has diverged from the main kata. Please update the translation and I can approve.

Clojure Translation

I could only determine an analytical solution to the problem:

The initial sequence has two odd numbers at indices 1 and 2. Therefore, these combine to an even number and the next two
terms will be even. The first 7 terms are:

[0, 1, 1, 2, 4, 8, 16]

This changes at index 7 because the first odd number slides out of the window to generate a new odd number at the tail:

[...,1, 2, 4, 8, 16, 31]

At index 8 the second odd number slides out the window to generate a new odd number at the tail:

[...,2, 4, 8, 16, 31, 63]

Therefore, every sextet of terms will be four even numbers and two odd numbers, with odd numbers at positions 1-2, 7-8,
13-14, etc. The solution generates the required offsets in the cycle with integer division: (n - 2) / 6 and
(n - 1) / 6.

The additional constant combines the duplicate 1s at indexes 1 & 2, which are ignored in the calculation ◻

So much shade for the top dog. All the stakeholders I have worked with give perfect requirements that don't require clarifying questions ¯_( ͡° ͜ʖ ͡°)_/¯

Keep them coming g964, we'll figure it out in the end.

Clojure translation

Clojure Translation