public int findRecursive(int[] array) {
    validateInput(array);
    return findRecursiveInner(array, 1, 0, 0);
  }
Tail recursive solution for this algorithm. The complexity order of this algorithm is similar
to the previous implementation, O(N) in time terms and O(1) in space terms.
src/main/java/com/github/pedrovgs/problem31/FindLongestConsecutiveSequence.java