# Check whether the product of every subsequence is a perfect square or not

Given an array arr[] consisting of N positive integers, the task is to check if the product of elements of every subsequence of the given array arr[] is a perfect square or not. If found to be true, then print Yes. Otherwise, print No.Examples:Input: arr[] = {1, 4, 100}Output: YesExplanation:Following are the subsequences of the given array arr[]:{1}, the product is equal to 1, and is a perfect square.{1, 4}, the product is equal to 4, and is a perfect square.{1, 100}, the product is equal to 100 and is a perfect square.{1, 4, 100}, the product is equal to 400 and is a perfect square.{4}, the product is equal to 4 and is a perfect square.{4, 100}, the product is equal to 400 and is a perfect square.{100}, the product is equal to 100 and is a perfect square.Therefore, print “Yes”.Input: arr[] = {1, 3}Output: No  Naive Approach: The simplest approach to solve the given problem is to generate all possible subsequences of the given array and if the product elements of every subsequence is a perfect square, then print Yes. Otherwise, print No.Time Complexity: O(N*2N)Auxiliary Space: O(1)Efficient Approach: The above approach can also be optimized using the fact that the product of two perfect square numbers will also be a perfect square. Therefore, to check if the individual product of elements of all subsequences is a perfect square or not, the idea is to check if all the array elements are perfect squares or not. If found to be true, then print Yes. Otherwise, print No.Below is the implementation of the above approach:C++  #include using namespace std;  string perfectSquare(int arr[], int N){        for (int i = 0; i < N; i++) {                          int p = sqrt(arr[i]);          if (p * p != arr[i]) {            return "No";        }    }          return "Yes";}  int main(){    int arr[] = { 1, 4, 100 };    int N = sizeof(arr) / sizeof(arr);    cout 