function getSecondLargest(nums) {
    // Complete the function
    let largest = nums[0];
    let secondLargest= nums[0];
    let n= nums.length ;
    
    for(let i=0; i<n; i++){
        if(nums[i]>largest){
            secondLargest=largest;
            largest= nums[i];
        }else if(nums[i]>secondLargest && nums[i]!= largest){
            secondLargest= nums[i];
        }
    }
    return secondLargest;
}

function getSecondLargest(nums) {
    // Complete the function
    let max = -Infinity, sndMax = -Infinity;
    for (let num of nums) {
        if (num > max) {
            sndMax = max;
            max = num;
        } else if (num > sndMax && num !== max) {
            sndMax = num;
        }
    }
    return sndMax;
}

    let lastIndex = nums.length - 1;
    let sortedNums = quickSort(nums, 0, lastIndex);
    let largest = sortedNums[lastIndex];
    let secondLargest;
    for(let x = lastIndex; x >= 0; x--) {
        if (largest === sortedNums[x])
            continue;
        else {
            secondLargest = sortedNums[x];
            break;
        }         
    }
    return secondLargest;
}
function partition(arr, low, high) {
        let pivot = arr[high];
        let i = low - 1; 
        for(let j = low; j <= high-1; j++){
            if(pivot > arr[j]){              
                i++;                
                swap(arr, i, j);   
            }
        }
        
        swap(arr, i+1, high); 
        return i+1; 
}
function quickSort(arr, low, high) {
        if (high > low) {
            let pi = partition(arr, low, high);
            quickSort(arr, low, pi - 1); 
            quickSort(arr, pi+1, high); 
        } 
        return arr;
}   
function swap(arr, i, j) {
        let temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
}

function getSecondLargest(nums) {
    const uniqueNums = nums.filter((value, idx, self)=> self.indexOf(value) === idx);
    return uniqueNums.sort((a,b)=>b-a)[1];
}