mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-08 03:45:23 +08:00
Add FindSecondLargestSort (#523)
* 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:
25
Sorts/FindSecondLargestElement.js
Normal file
25
Sorts/FindSecondLargestElement.js
Normal 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 }
|
Reference in New Issue
Block a user