There is an array with some numbers. All numbers are equal except for one. Try to find it! findUniq([ 1, 1, 1, 2, 1, 1 ]) === 2 findUniq([ 0, 0, 0.55, 0, 0 ]) === 0.55 if(window.hljsLoader && !document.currentScript.parentNode.hasAttribute('data-s9e-livepreview-onupdate')) { window.hljsLoader.highlightBlocks(document.currentScript.parentNode); } It’s guaranteed that array contains at least 3 numbers. The tests contain some very huge arrays, so think about performance.

Find the unique number

dhtml

There is an array with some numbers. All numbers are equal except for one. Try to find it!

findUniq([ 1, 1, 1, 2, 1, 1 ]) === 2
findUniq([ 0, 0, 0.55, 0, 0 ]) === 0.55

It’s guaranteed that array contains at least 3 numbers.

The tests contain some very huge arrays, so think about performance.

blessedtechie

The first step uses conditional checks to identify which of the first three elements is the common number.
The second step iterates through the array and returns the first element that does not match the common number.
This method is efficient because it uses a fixed number of checks to determine the common number and then a linear scan to find the unique number, ensuring it performs well even with large arrays.

dhtml

blessedtechie this looks interesting, I need to study this closely