The question gave me as input an array a that had a permutations of the first n natural numbers and a number k. You have a series of plants, at the beginning all the plants are not in bloom. At the ith iteration the plant at the location of the array that had the value i was going to bloom. If a plant bloomed it stayed bloomed forever. We define a group as the number of adjacent bloomed plants. Find the last iteration that had a group of size k. E.g. Given a = [ 1 3 2 4] plants: 0 0 0 0 1 0 0 0 (1 group of size 1) 1 0 1 0 (2 groups of size 1) 1 1 1 0 (1 group of size 3) 1 1 1 1 (1 group of size 4)
