mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 15:39:42 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
26 lines
734 B
JavaScript
26 lines
734 B
JavaScript
/*
|
|
* 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 = -Number.MAX_VALUE
|
|
|
|
for (let i = 0; i < array.length; i++) {
|
|
if (element < array[i] && array[i] !== largestElement) {
|
|
element = array[i]
|
|
}
|
|
}
|
|
|
|
return element
|
|
}
|
|
|
|
export { secondLargestElement }
|