The most comprehensive explanation of the algorithm i've seen so far. Thanks a lot Sean!
The space complexity can indeed be further improved (end of this video: https://www.youtube.com/watch?v=XSdr_O-XVRQ&ab_channel=NickWhite)
const findFirstDuplicate = list => {
for (let i = 0; i < list.length; i++) {
if (list[Math.abs(list[i]) - 1] < 0) {
return Math.abs(list[i]);
} else {
list[Math.abs(list[i]) - 1] = -list[Math.abs(list[i]) - 1];
}
}
return -1;
};
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
The most comprehensive explanation of the algorithm i've seen so far. Thanks a lot Sean!
The space complexity can indeed be further improved (end of this video: https://www.youtube.com/watch?v=XSdr_O-XVRQ&ab_channel=NickWhite)
const findFirstDuplicate = list => {
for (let i = 0; i < list.length; i++) {
if (list[Math.abs(list[i]) - 1] < 0) {
return Math.abs(list[i]);
} else {
list[Math.abs(list[i]) - 1] = -list[Math.abs(list[i]) - 1];
}
}
return -1;
};