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.
functiongetSecondLargest(nums){// Complete the functionletlargest=nums[0];letsecondLargest=nums[0];letn=nums.length;for(leti=0;i<n;i++){if(nums[i]>largest){secondLargest=largest;largest=nums[i];}elseif(nums[i]>secondLargest&&nums[i]!=largest){secondLargest=nums[i];}}returnsecondLargest;}
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 →
Simple solution in single loop