algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-06 17:50:39 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add FindSecondLargestSort (#523)

Browse Source 
* Add FindSecondLargestSort

* Add FindSecondLargestSort

* Add FindSecondLargestSort

* Add FindSecondLargestSort

* Add FindSecondLargestSort

* Add FindSecondLargestSort

* Update and rename FindSecondLargestSort.js to FindSecondLargestElement.js

* Update FindSecondLargestElement.js

* Update FindSecondLargestElement.js

Co-authored-by: MacBookPro <macbookpro@MacBookPros-MBP.attlocal.net>
Co-authored-by: vinayak <itssvinayak@gmail.com>
This commit is contained in:
Matthew Palmer
2021-04-03 09:29:58 -05:00
committed by GitHub
parent b7ef904b5e
commit d43de686c5
1 changed files with 25 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
Sorts/FindSecondLargestElement.js Normal file
View File

@ -0,0 +1,25 @@
/*
* Find Second Largest is a real technical interview question.
* Chances are you will be asked to find the second largest value
* inside of an array of numbers. You must also be able to filter
* out duplicate values. It's important to know how to do this with
* clean code that is also easy to explain.
*
* Resources:
* https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set
*/
const secondLargestElement = (array) => {
const largestElement = Math.max(...array)
let element = 0
for (let i = 0; i < array.length; i++) {
if (element < array[i] && array[i] !== largestElement) {
element = array[i]
}
}
return element
}
export { secondLargestElement }