MukulLatiyan

//Java Code for geeksforgeeks problem named Multiply Array in array section school level.
import java.util.*;
import java.lang.*;
import java.io.*;
class GFG
 {
	public static void main (String[] args)
	 {
	    Scanner s = new Scanner(System.in);
	    int ntest = s.nextInt();

MukulLatiyan

//Java Code for geeksforgeeks solution of Reverse array in groups problem given on gfg array school section.
import java.util.*;
import java.lang.*;
import java.io.*;
class GFG
 {
	public static void main (String[] args)
	 {
	    Scanner s = new Scanner(System.in);
	    int ntest = s.nextInt();

MukulLatiyan

//Java Code for Reversal Algorithm problem solution given on geeksforgeeks array school section.
import java.util.*;
import java.lang.*;
import java.io.*;

class GFG {
	public static void main(String[] args) {
	Scanner sc= new Scanner(System.in);
	
		int n = sc.nextInt();

MukulLatiyan

//Java code for eual to product problem given on geeksforgeeks array school section.
import java.util.*;
import java.lang.*;
import java.io.*;

class GFG {
	public static void main (String[] args) {
		Scanner scan = new Scanner(System.in);
		int ntest = scan.nextInt();
		outer:

MukulLatiyan

//Java Code for array checking problem given on school level on geeksforgeeks array school section.
import java.util.*;
import java.lang.*;
import java.io.*;
class GFG
 {
	public static void main (String[] args)
	 {
	    Scanner s = new Scanner(System.in);
	    int ntest = s.nextInt();

MukulLatiyan

//Java Code SOlution of Average named problem in geeksforgeeks school array section
import java.util.*;
import java.lang.*;
import java.io.*;
class GFG {
	public static void main (String[] args) {
		Scanner in = new Scanner(System.in);
		int t = in.nextInt();
		while (t-- > 0){
		    int n = in.nextInt();

MukulLatiyan

//Java Code smaller and larger problem asked in school array section at geeksforgeeks.
import java.util.*;
import java.lang.*;
import java.io.*;
class GFG {
	public static void main (String[] args) {
		//code
		Scanner in = new Scanner(System.in);
		int t = in.nextInt();
		while (t-- > 0){

MukulLatiyan

//Java Code for printing the second largest Element present in the array(Geeksforgeeks-array School problem)
import java.util.*;
import java.lang.*;
import java.io.*;

class GFG {
    public static void SecondMinimum(int[] a,int n)
    {
        int first,second;
        first=second=Integer.MIN_VALUE;

MukulLatiyan

//Java code for Binary Array Sorting problem on geeksforgeeks(School problem-array Section).
import java.util.*;
import java.lang.*;
import java.io.*;

class GFG 
{
	public static void main (String[] args) 
	{
		Scanner sc=new Scanner(System.in);

MukulLatiyan

//Java code for immediate smaller problem on geeksforgeeks(School problem-array Section).
import java.util.*;
import java.lang.*;
import java.io.*;

class GFG 
{
	public static void main (String[] args) 
	{
		Scanner sc=new Scanner(System.in);