Infosys Software Development Engineer SDE interview questions

You are given an array A of length N. The value of a subsegment is calculated by multiplying all the values in that subsegment, for example the value of (2, 3, 5) is 2 * 3 * 5 = 30. Find the total number of ways to partition the array A into consecutive subsegments that cover all elements such that the value of each subsegment is divisible by at least X factors. Since the number of ways can be large, return it modulo 10^9 + 7.

Object oriented programming basic question