Daily JavaScript Challenge #JS-98: Find the Second Largest Number in an Array

Daily JavaScript Challenge: Find the Second Largest Number in an Array

Hey fellow developers! 👋 Welcome to today's JavaScript coding challenge. Let's keep those programming skills sharp!

The Challenge

Difficulty: Medium

Topic: Array Manipulation

Description

Write a JavaScript function that takes an array of numbers and returns the second largest number in the array. If the array has less than two distinct numbers, return null.

Ready to Begin?

https://www.dpcdev.com/

1. Fork this challenge
2. Write your solution
3. Test it against the provided test cases
4. Share your approach in the comments below!

Want to Learn More?

Check out the documentation about this topic here: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set

Join the Discussion!

• How did you approach this problem?
• Did you find any interesting edge cases?
• What was your biggest learning from this challenge?

Let's learn together! Drop your thoughts and questions in the comments below. 👇

---

This is part of our Daily JavaScript Challenge series. Follow me for daily programming challenges and let's grow together! 🚀

javascript #programming #coding #dailycodingchallenge #webdev

Comments

[James Curran]

In C#:

    int[] array = new int[] { 1, 3, 5, 7, 9, 1, 2, 11, 3, 11, 4, 8, 7, 6, 5 };
//  int[] array = new int[] { 2, 2, 2,2,2,2,};


    (int? Max, int? Snd) tuple = (null, null);

    array.Aggregate(tuple, 
                   (t, n) => (n == t.Max.GetValueOrDefault()) ? t   // deal with repeated highest
                    : (n > t.Max.GetValueOrDefault()) ? (n, t.Max) // new highest
                    : (n > t.Snd.GetValueOrDefault()) ? (t.Max, n) // new 2nd highest
                    : t)
        .Snd.Dump();

[DPC]

Thank you for the solutions! Soon we will add the possibility of solving the challenges on different languages, including C#