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.
  1. Prepare
  2. Tutorials
  3. 10 Days of Javascript
  4. Day 3: Arrays
  5. Discussions

Day 3: Arrays

  • slavynskyi_denys
     + 0 comments

    So, O(n) is the best we could expect here. 

    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;
}