Problem Statement

1. Given A = [1, 2, 2, 2, 4, 4, 5], your function should return 3. The largest square that can be found in the sequence is marked in blue in the picture below. 2. Given A = [1, 2, 2, 4, 5], your function should return 2. 3. Given A = [10, 10, 10, 10], your function should return 4. Write an efficient algorithm for the following