public static int findSecondLargest(int n, int[] arr) {

    for(int i =0; i<arr.length-1; i++){

        for(int j =i+1; j< arr.length-1;j++){

            if(arr[i]<arr[j]){

                arr[i]= arr[j];

                arr[j]= arr[i];

            }

        }

    }   

    for(int i : arr){

        if(arr[i]>arr[i+1]){

            return arr[i+1];

        }

    }

    return -1;

    }

}

 I think my solutions is accurate , i just had implemented distinct approach as i first sorted the array big  number to small ones, and then applied again for getting the required answer.