Find the array element having equal count of Prime Numbers on its left and right

  #include using namespace std;  int findIndex(int arr[], int N){            int maxValue = INT_MIN;          for (int i = 0; i < N; i++) {        maxValue = max(maxValue, arr[i]);    }          map St;          for (int i = 1; i