We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
function getSecondLargest(nums) {
// Complete the function
nums.sort((a, b) => a - b);
let Largest = nums[nums.length-1] ;
for(let i=0 ; i <=nums.length-1 ; i++){
if(nums[i] == (Largest)-1){
return nums[i];
}
}
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Day 3: Arrays
You are viewing a single comment's thread. Return to all comments →
function getSecondLargest(nums) { // Complete the function
}