Write a function: class Solution { public int solution(int[] A); } that, given an array A of N integers, returns the length of the longest consistent fragment of A in which all elements can be generat 2 answers