Given an array of positive integers and a integer p. Find the length of the minimum subarray upon deleting which the sum of remaining element will be divisible by p;
Follow up 1: find the number of subarray (need not be minimum) deleting which will result the sum to be divisible by p
Follow up 2: For each index find the number of times it is included in any subarray upon deleting which the remaining sum will be divisible by p