DEV Community

DPC
DPC

Posted on

5 1 1

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

Sentry image

Smarter debugging with Sentry MCP and Cursor

No more copying and pasting error messages, logs, or trying to describe your distributed tracing setup or stack traces in chat. MCP can investigate real issues, understand their impact, and suggest fixes based on the actual production context.

Read more →

Top comments (2)

Collapse
 
jamescurran profile image
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();


Enter fullscreen mode Exit fullscreen mode
Collapse
 
dpc profile image
DPC

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

Heroku

Tired of jumping between terminals, dashboards, and code?

Check out this demo showcasing how tools like Cursor can connect to Heroku through the MCP, letting you trigger actions like deployments, scaling, or provisioning—all without leaving your editor.

Learn More

👋 Kindness is contagious

Dive into this thoughtful piece, beloved in the supportive DEV Community. Coders of every background are invited to share and elevate our collective know-how.

A sincere "thank you" can brighten someone's day—leave your appreciation below!

On DEV, sharing knowledge smooths our journey and tightens our community bonds. Enjoyed this? A quick thank you to the author is hugely appreciated.

Okay