MINDTREE EXAM ANSWERS

 4/2/2022 MINDTREE EXAM ANSWERS








/>

/>

/>

/>

/>
import java.util.Scanner;
public class MinMaxPrimeDifference {
  public static boolean isPrime(int num) {
 for (int i = 2; i < num / 2; i++) {
   if (num % i == 0) {
  return false;
    }
 }
 return true;
  }
  public static int minmaxAbsoluteDifference(int[] arr) {
 int min = Integer.MAX_VALUE;
 int max = 0;
 int c = 0;
 for (int i = 0; i < arr.length; i++) {
  if (arr[i] >= 2) {
     if (isPrime(arr[i])) {
     if (arr[i] > max) max = arr[i];
     if (arr[i] <min) min = arr[i];
    c++;
     }
  }
 }
 if (c != 0) return (int)(Math.abs(max - min));
 else return 0; 
  }
  public static void main(String[] args) {
 Scanner sc = new Scanner(System .in);
 int n = sc.nextInt();
 int[] arr = new int[n];
 for (int i = 0; i < n; i++) {
  arr[i] = sc.nextInt();
 }
 System.out.println(minmaxAbsoluteDifference(arr));
  }
}
/>






/>




/>









/>
πŸ‘†πŸ‘†πŸ‘†πŸ‘†πŸ‘†πŸ‘†SALSA CODE



















/>



/>


/>

/>


/>

/>

/>

πŸ‘†πŸ‘†πŸ‘†πŸ‘†πŸ‘†πŸ‘†πŸ‘†Playing with arrays







/>

{
    int p=1,res=0;
    for (int i = 0; i < N; i++) 
    {
       int x=A[i]+1;
       p=A[i]*x;
       res+=p;
    }
    return res;
}
sum of there product code.

-------------------------------------------------------
{
int i=0,s=0;
for(i=0;i<n;i++)
{
s=s+A[i];
}
return (s*N);
}

consecutive product sum
Join
@freejobs77
@freejobs77
@freejobs77
@freejobs77
@freejobs77



/>













/>









/>


πŸ‘†πŸ‘†πŸ‘†πŸ‘†πŸ‘†πŸ‘†πŸ‘†
C++
Average of Triplets in an Array of Integers













In check ( vector<string> B) {

int n= B. Size () ;

int ans = 0;

for (int i = 0; I < n; i++){

if (B[i][0] == 'a' || B [i] [0] == 'A') 

ans +==1;
}
return ans;
}

A in the string

Language c++ 14
Join
@freejobs77
@freejobs77
@freejobs77
@freejobs77


































πŸ‘†πŸ‘†πŸ‘†πŸ‘†πŸ‘†πŸ‘†πŸ‘†Pre sorted

Post a Comment

1 Comments