One-dimensional circular Conway's Game of Life
Here is an idea to speed things up, given that the input is only 15 numbers:


Since the numbers are binary, you could represent the board as a bitmask in an integer instead of an array (see wikipedia/masks).
There are only \$2^{15}\$ possible states. You could create a Map&lt;Integer, Integer&gt; from each state bitmask to the next. Then each iteration in your algorithm is gonna be a simple map lookup.


There are more optimizations you could to make it even faster, but this should be enough.