Remove all of the duplicate numbers in an array of numbers [duplicate]Get all unique values in a JavaScript array (remove duplicates)Get all non-unique values (i.e.: duplicate/more than one occurrence) in an arrayRemove occurrences of duplicate words in a stringremove all elements that occur more than once from arrayCreate ArrayList from arrayHow do I remove a property from a JavaScript object?How do I check if an array includes an object in JavaScript?How to append something to an array?How to replace all occurrences of a string in JavaScriptLoop through an array in JavaScriptHow to check if an object is an array?How do I remove a particular element from an array in JavaScript?Remove duplicate values from JS arrayFor-each over an array in JavaScript?
React - map array to child component
How could a planet have erratic days?
A social experiment. What is the worst that can happen?
Pre-mixing cryogenic fuels and using only one fuel tank
Bob has never been a M before
Has any country ever had 2 former presidents in jail simultaneously?
Can somebody explain the brexit thing in one or two child-proof sentences?
GraphicsGrid with a Label for each Column and Row
Is there a name for this algorithm to calculate the concentration of a mixture of two solutions containing the same solute?
Where did Heinlein say "Once you get to Earth orbit, you're halfway to anywhere in the Solar System"?
Can I sign legal documents with a smiley face?
Calculating Wattage for Resistor in High Frequency Application?
Could Intel SGX be dangerous under Linux?
Does a 'pending' US visa application constitute a denial?
Does an advisor owe his/her student anything? Will an advisor keep a PhD student only out of pity?
Do Legal Documents Require Signing In Standard Pen Colors?
Should I stop contributing to retirement accounts?
Why is so much work done on numerical verification of the Riemann Hypothesis?
Will the technology I first learn determine the direction of my future career?
Open a doc from terminal, but not by its name
Is a model fitted to data or is data fitted to a model?
Why did the EU agree to delay the Brexit deadline?
What spells are affected by the size of the caster?
Is the U.S. Code copyrighted by the Government?
Remove all of the duplicate numbers in an array of numbers [duplicate]
Get all unique values in a JavaScript array (remove duplicates)Get all non-unique values (i.e.: duplicate/more than one occurrence) in an arrayRemove occurrences of duplicate words in a stringremove all elements that occur more than once from arrayCreate ArrayList from arrayHow do I remove a property from a JavaScript object?How do I check if an array includes an object in JavaScript?How to append something to an array?How to replace all occurrences of a string in JavaScriptLoop through an array in JavaScriptHow to check if an object is an array?How do I remove a particular element from an array in JavaScript?Remove duplicate values from JS arrayFor-each over an array in JavaScript?
11
This question already has an answer here:
Get all unique values in a JavaScript array (remove duplicates)
66 answers
I received this question for practice and the wording confused me, as I see 2 results that it might want.
And either way, I'd like to see both solutions.
For example, if I have an array:
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
I'm taking this as wanting the final result as either:
let finalResult = [1, 2, 3, 4, 5, 8, 9, 10];
OR:
let finalResult = [1, 9, 10];
The difference between the two being, one just removes any duplicate numbers and leaves the rest and the second just wants any number that isn't a duplicate.
Either way, I'd like to write two functions that does one of each.
This, given by someone else gives my second solution.
let elems = ,
arr2 = arr.filter(function (e)
if (elems[e] === undefined)
elems[e] = true;
return true;
return false;
);
console.log(arr2);
I'm not sure about a function for the first one (remove all duplicates).
javascript arrays duplicates
edited Mar 20 at 17:43
pushkin
4,598112954
asked Mar 20 at 7:09
mph85mph85
1229
marked as duplicate by Jared Smith, pushkin, BlueRaja - Danny Pflughoeft, the_lotus, Moira Mar 20 at 18:58
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
add a comment |
11
This question already has an answer here:
Get all unique values in a JavaScript array (remove duplicates)
66 answers
I received this question for practice and the wording confused me, as I see 2 results that it might want.
And either way, I'd like to see both solutions.
For example, if I have an array:
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
I'm taking this as wanting the final result as either:
let finalResult = [1, 2, 3, 4, 5, 8, 9, 10];
OR:
let finalResult = [1, 9, 10];
The difference between the two being, one just removes any duplicate numbers and leaves the rest and the second just wants any number that isn't a duplicate.
Either way, I'd like to write two functions that does one of each.
This, given by someone else gives my second solution.
let elems = ,
arr2 = arr.filter(function (e)
if (elems[e] === undefined)
elems[e] = true;
return true;
return false;
);
console.log(arr2);
I'm not sure about a function for the first one (remove all duplicates).
javascript arrays duplicates
edited Mar 20 at 17:43
pushkin
4,598112954
asked Mar 20 at 7:09
mph85mph85
1229
marked as duplicate by Jared Smith, pushkin, BlueRaja - Danny Pflughoeft, the_lotus, Moira Mar 20 at 18:58
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
If you're using lodash, you can use_.uniq()
– BlueRaja - Danny Pflughoeft
Mar 20 at 9:29
1
Further, this is asking for the inverse of Get all non-unique values (i.e.: duplicate/more than one occurrence) in an array. Finally, this post is asking two separate questions and both have good answers elsewhere already.
– Søren D. Ptæus
Mar 20 at 9:51
To answer the question "which one is it" in a comment-answer: if you're asked to remove duplicates, I believe you should understand the first variant. The second variant removes all element that have duplicates, meaning the "original" value AND its duplicates.
– Pierre Arlaud
Mar 20 at 13:18
add a comment |
11
11
11
2
This question already has an answer here:
Get all unique values in a JavaScript array (remove duplicates)
66 answers
I received this question for practice and the wording confused me, as I see 2 results that it might want.
And either way, I'd like to see both solutions.
For example, if I have an array:
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
I'm taking this as wanting the final result as either:
let finalResult = [1, 2, 3, 4, 5, 8, 9, 10];
OR:
let finalResult = [1, 9, 10];
The difference between the two being, one just removes any duplicate numbers and leaves the rest and the second just wants any number that isn't a duplicate.
Either way, I'd like to write two functions that does one of each.
This, given by someone else gives my second solution.
let elems = ,
arr2 = arr.filter(function (e)
if (elems[e] === undefined)
elems[e] = true;
return true;
return false;
);
console.log(arr2);
I'm not sure about a function for the first one (remove all duplicates).
javascript arrays duplicates
edited Mar 20 at 17:43
pushkin
4,598112954
asked Mar 20 at 7:09
mph85mph85
1229
This question already has an answer here:
Get all unique values in a JavaScript array (remove duplicates)
66 answers
I received this question for practice and the wording confused me, as I see 2 results that it might want.
And either way, I'd like to see both solutions.
For example, if I have an array:
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
I'm taking this as wanting the final result as either:
let finalResult = [1, 2, 3, 4, 5, 8, 9, 10];
OR:
let finalResult = [1, 9, 10];
The difference between the two being, one just removes any duplicate numbers and leaves the rest and the second just wants any number that isn't a duplicate.
Either way, I'd like to write two functions that does one of each.
This, given by someone else gives my second solution.
let elems = ,
arr2 = arr.filter(function (e)
if (elems[e] === undefined)
elems[e] = true;
return true;
return false;
);
console.log(arr2);
I'm not sure about a function for the first one (remove all duplicates).
This question already has an answer here:
Get all unique values in a JavaScript array (remove duplicates)
66 answers
javascript arrays duplicates
javascript arrays duplicates
edited Mar 20 at 17:43
pushkin
4,598112954
asked Mar 20 at 7:09
mph85mph85
1229
edited Mar 20 at 17:43
pushkin
4,598112954
asked Mar 20 at 7:09
mph85mph85
1229
edited Mar 20 at 17:43
pushkin
4,598112954
edited Mar 20 at 17:43
pushkin
4,598112954
edited Mar 20 at 17:43
pushkin
4,598112954
4,598112954
asked Mar 20 at 7:09
mph85mph85
1229
asked Mar 20 at 7:09
mph85mph85
1229
asked Mar 20 at 7:09
mph85mph85
1229
1229
marked as duplicate by Jared Smith, pushkin, BlueRaja - Danny Pflughoeft, the_lotus, Moira Mar 20 at 18:58
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
marked as duplicate by Jared Smith, pushkin, BlueRaja - Danny Pflughoeft, the_lotus, Moira Mar 20 at 18:58
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
If you're using lodash, you can use_.uniq()
– BlueRaja - Danny Pflughoeft
Mar 20 at 9:29
1
Further, this is asking for the inverse of Get all non-unique values (i.e.: duplicate/more than one occurrence) in an array. Finally, this post is asking two separate questions and both have good answers elsewhere already.
– Søren D. Ptæus
Mar 20 at 9:51
To answer the question "which one is it" in a comment-answer: if you're asked to remove duplicates, I believe you should understand the first variant. The second variant removes all element that have duplicates, meaning the "original" value AND its duplicates.
– Pierre Arlaud
Mar 20 at 13:18
add a comment |
If you're using lodash, you can use_.uniq()
– BlueRaja - Danny Pflughoeft
Mar 20 at 9:29
1
Further, this is asking for the inverse of Get all non-unique values (i.e.: duplicate/more than one occurrence) in an array. Finally, this post is asking two separate questions and both have good answers elsewhere already.
– Søren D. Ptæus
Mar 20 at 9:51
To answer the question "which one is it" in a comment-answer: if you're asked to remove duplicates, I believe you should understand the first variant. The second variant removes all element that have duplicates, meaning the "original" value AND its duplicates.
– Pierre Arlaud
Mar 20 at 13:18
If you're using lodash, you can use
_.uniq()– BlueRaja - Danny Pflughoeft
Mar 20 at 9:29
If you're using lodash, you can use
_.uniq()– BlueRaja - Danny Pflughoeft
Mar 20 at 9:29
1
1
Further, this is asking for the inverse of Get all non-unique values (i.e.: duplicate/more than one occurrence) in an array. Finally, this post is asking two separate questions and both have good answers elsewhere already.
– Søren D. Ptæus
Mar 20 at 9:51
Further, this is asking for the inverse of Get all non-unique values (i.e.: duplicate/more than one occurrence) in an array. Finally, this post is asking two separate questions and both have good answers elsewhere already.
– Søren D. Ptæus
Mar 20 at 9:51
To answer the question "which one is it" in a comment-answer: if you're asked to remove duplicates, I believe you should understand the first variant. The second variant removes all element that have duplicates, meaning the "original" value AND its duplicates.
– Pierre Arlaud
Mar 20 at 13:18
To answer the question "which one is it" in a comment-answer: if you're asked to remove duplicates, I believe you should understand the first variant. The second variant removes all element that have duplicates, meaning the "original" value AND its duplicates.
– Pierre Arlaud
Mar 20 at 13:18
add a comment |
9 Answers
9
active
oldest
votes
20
Using Set and Array.from()
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
console.log(Array.from(new Set(arr)));Alternate using regex
regex explanation here
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let res = arr
.join(',')
.replace(/(b,w+b)(?=.*1)/ig, '')
.split(',')
.map(Number);
console.log(res);Alternate using objects
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let obj = arr.reduce((acc, val) => Object.assign(acc,
[val]: val
), );
console.log(Object.values(obj));answered Mar 20 at 7:11
Aswin KumarAswin Kumar
954115
add a comment |
14
Just use a simple array.filter one-liner:
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let finalResult = arr.filter((e, i, a) => a.indexOf(e) == i).sort(function(a, b)return a - b);
console.log(finalResult);You could use another filter statement if you wanted the second result:
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let finalResult = arr.filter((e, i, a) => a.filter(f => f == e).length == 1).sort(function(a, b)return a - b);
console.log(finalResult);edited Mar 20 at 7:20
Mukyuu
1,82431123
answered Mar 20 at 7:11
Jack BashfordJack Bashford
13k31847
You could also add.sort()to sort them by numerical order:.sort(function(a, b)return a - b)on finalresult
– Mukyuu
Mar 20 at 7:13
Yes @Mukyuu, that would also be useful
– Jack Bashford
Mar 20 at 7:16
5
Worth pointing out that the run time of this approach will be quadratic on the size of the input, which is probably not great unless the input arrays are known to be always fairly small.
– Joe Lee-Moyet
Mar 20 at 11:55
1
Most voted with multiple array#filter, array#sort and array#indexOf... That is not performant
– Yosvel Quintero
Mar 20 at 13:08
Do note that the.sort()is not necessary - the end result without the sort is still an array without any duplicate items, just in the same order as the original array. (It does make it exactly match thefinalResultvariable in the question though.)
– Florrie
Mar 20 at 14:53
add a comment |
10
For the first part you can use Set() and Spread Syntax to remove duplicates.
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let res = [...new Set(arr)]
console.log(res)For the second part you can use reduce()
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
//to get the object with count of each number in array.
let obj = arr.reduce((ac,a) =>
//check if number doesnot occur before then set its count to 1
if(!ac[a]) ac[a] = 1;
//if number is already in object increase its count
else ac[a]++;
return ac;
,)
//Using reduce on all the keys of object means all numbers.
let res = Object.keys(obj).reduce((ac,a) =>
//check if count of current number 'a' is `1` in the above object then add it into array
if(obj[a] === 1) ac.push(+a)
return ac;
,[])
console.log(res)answered Mar 20 at 7:18
Maheer AliMaheer Ali
7,111518
nice appreciate that, that 2nd one looks crazy. I'm assuming the time complexity for would be less than ideal compared to other results?
– mph85
Mar 20 at 7:24
@mph85 Yes its a little complex because it doesnot go through the array again and again instead it just store all the result obj and then filter it.Its better regarding performance
– Maheer Ali
Mar 20 at 7:26
could you remind me why we need thespread operator? what happens if we don't have it? @Maheer Ali
– mph85
Mar 20 at 7:28
Is it because if we don't have it, it'll just log an object?
– mph85
Mar 20 at 7:29
@mph85 No if we will not have it. We will have aSet()inside array. We use it convertSet()toArray
– Maheer Ali
Mar 20 at 7:30
|
show 1 more comment
5
You could sort the array before and filter the array by checking only one side for duplicates or both sides.
var array = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10],
result1,
result2;
array.sort((a, b) => a - b);
result1 = array.filter((v, i, a) => a[i - 1] !== v);
result2 = array.filter((v, i, a) => a[i - 1] !== v && a[i + 1] !== v);
console.log(...result1);
console.log(...result2)answered Mar 20 at 7:34
Nina ScholzNina Scholz
193k15105177
thank for that, for theresult1what is going on with thea[i - 1] !== v?
– mph85
Mar 20 at 22:01
ais the array,iis the actual index, andvis the actual value. it takes the value from the index before of the actual index and looks if the values are not equal.
– Nina Scholz
Mar 20 at 22:03
ah ok, and sorry, it takes thevalue from the index before of the actual index? Not sure what you mean by that
– mph85
Mar 20 at 22:10
for example if you have the value9of the array asv, then the value before is8.
– Nina Scholz
Mar 20 at 22:13
ah ok, thank you for that
– mph85
Mar 20 at 22:15
add a comment |
5
You can create both arrays in One Go
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let unique = new Set();
let repeated = Array.from(arr.reduce((acc, curr) =>
acc.has(curr) ? unique.delete(curr) : acc.add(curr) && unique.add(curr);
return acc;
, new Set()));
console.log(Array.from(unique))
console.log(repeated)answered Mar 20 at 7:35
AZ_AZ_
622210
1
Nice one mate +1
– Maheer Ali
Mar 20 at 7:47
I wonder if the ternary plus&&could be unclear though (x?y:z&&w)? It's not obvious to me how JS's order of operations would handle that, and I wonder if you could get across the same logic and reasoning by usingif/else?
– Florrie
Mar 20 at 14:56
add a comment |
5
You can use Array.prototype.reduce() create a hash object where the keys are the numbers in the array and the values are going to be the the repeated occurrence of numbers in the arr array variable..
Then using Object.keys():
- Remove all duplicates
Object.keys(hash) - Remove all duplicates but filtering with Array.prototype.filter() to get the numbers with only one occurrence
Code:
const arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const hash = arr.reduce((a, c) => (a[c] = (a[c] || 0) + 1, a), );
// [1, 2, 3, 4, 5, 8, 9, 10];
const finalResultOne = Object.keys(hash);
// [1, 9, 10];
const finalResultTwo = Object.keys(hash).filter(k => hash[k] === 1);
console.log('finalResultOne:', ...finalResultOne);
console.log('finalResultTwo:', ...finalResultTwo);answered Mar 20 at 7:47
Yosvel QuinteroYosvel Quintero
11.8k42531
add a comment |
4
You can use closure and Map
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const build = ar =>
const mapObj = ar.reduce((acc, e) =>
acc.has(e) ? acc.set(e, true) : acc.set(e, false)
return acc
, new Map())
return function(hasDup = true)
if(hasDup) return [...mapObj.keys()]
else return [...mapObj].filter(([key, val]) => !val).map(([k, v])=> k)
const getArr = build(arr)
console.log(getArr())
console.log(getArr(false))answered Mar 20 at 7:30
birdbird
997620
add a comment |
4
As many other have said, the first one is just [...new Set(arr)]
For the second, just filter out those that occur more than once:
const arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const count = (arr, e) => arr.filter(n => n == e).length
const unique = arr => arr.filter(e => count(arr, e) < 2)
console.log(unique(arr));answered Mar 20 at 11:37
JollyJokerJollyJoker
21115
add a comment |
2
var arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
var map = ;
var finalResult = [];
for (var i = 0; i < arr.length; i++)
if (!map.hasOwnProperty(arr[i]))
map[arr[i]] = true;
finalResult.push(arr[i]);
//if you need it sorted otherwise it will be in order
finalResult.sort(function(a, b)
return a - b
);
console.log(finalResult);edited yesterday
demo
2,38433984
answered Mar 20 at 13:54
JanspeedJanspeed
1,3381315
add a comment |
9 Answers
9
active
oldest
votes
9 Answers
9
active
oldest
votes
active
oldest
votes
active
oldest
votes
20
Using Set and Array.from()
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
console.log(Array.from(new Set(arr)));Alternate using regex
regex explanation here
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let res = arr
.join(',')
.replace(/(b,w+b)(?=.*1)/ig, '')
.split(',')
.map(Number);
console.log(res);Alternate using objects
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let obj = arr.reduce((acc, val) => Object.assign(acc,
[val]: val
), );
console.log(Object.values(obj));answered Mar 20 at 7:11
Aswin KumarAswin Kumar
954115
add a comment |
20
Using Set and Array.from()
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
console.log(Array.from(new Set(arr)));Alternate using regex
regex explanation here
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let res = arr
.join(',')
.replace(/(b,w+b)(?=.*1)/ig, '')
.split(',')
.map(Number);
console.log(res);Alternate using objects
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let obj = arr.reduce((acc, val) => Object.assign(acc,
[val]: val
), );
console.log(Object.values(obj));answered Mar 20 at 7:11
Aswin KumarAswin Kumar
954115
add a comment |
20
20
20
Using Set and Array.from()
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
console.log(Array.from(new Set(arr)));Alternate using regex
regex explanation here
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let res = arr
.join(',')
.replace(/(b,w+b)(?=.*1)/ig, '')
.split(',')
.map(Number);
console.log(res);Alternate using objects
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let obj = arr.reduce((acc, val) => Object.assign(acc,
[val]: val
), );
console.log(Object.values(obj));answered Mar 20 at 7:11
Aswin KumarAswin Kumar
954115
Using Set and Array.from()
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
console.log(Array.from(new Set(arr)));Alternate using regex
regex explanation here
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let res = arr
.join(',')
.replace(/(b,w+b)(?=.*1)/ig, '')
.split(',')
.map(Number);
console.log(res);Alternate using objects
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let obj = arr.reduce((acc, val) => Object.assign(acc,
[val]: val
), );
console.log(Object.values(obj));let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
console.log(Array.from(new Set(arr)));let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
console.log(Array.from(new Set(arr)));let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let res = arr
.join(',')
.replace(/(b,w+b)(?=.*1)/ig, '')
.split(',')
.map(Number);
console.log(res);let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let res = arr
.join(',')
.replace(/(b,w+b)(?=.*1)/ig, '')
.split(',')
.map(Number);
console.log(res);let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let obj = arr.reduce((acc, val) => Object.assign(acc,
[val]: val
), );
console.log(Object.values(obj));let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let obj = arr.reduce((acc, val) => Object.assign(acc,
[val]: val
), );
console.log(Object.values(obj));answered Mar 20 at 7:11
Aswin KumarAswin Kumar
954115
edited Mar 20 at 8:01
answered Mar 20 at 7:11
Aswin KumarAswin Kumar
954115
answered Mar 20 at 7:11
Aswin KumarAswin Kumar
954115
answered Mar 20 at 7:11
Aswin KumarAswin Kumar
954115
954115
add a comment |
add a comment |
14
Just use a simple array.filter one-liner:
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let finalResult = arr.filter((e, i, a) => a.indexOf(e) == i).sort(function(a, b)return a - b);
console.log(finalResult);You could use another filter statement if you wanted the second result:
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let finalResult = arr.filter((e, i, a) => a.filter(f => f == e).length == 1).sort(function(a, b)return a - b);
console.log(finalResult);edited Mar 20 at 7:20
Mukyuu
1,82431123
answered Mar 20 at 7:11
Jack BashfordJack Bashford
13k31847
You could also add.sort()to sort them by numerical order:.sort(function(a, b)return a - b)on finalresult
– Mukyuu
Mar 20 at 7:13
Yes @Mukyuu, that would also be useful
– Jack Bashford
Mar 20 at 7:16
5
Worth pointing out that the run time of this approach will be quadratic on the size of the input, which is probably not great unless the input arrays are known to be always fairly small.
– Joe Lee-Moyet
Mar 20 at 11:55
1
Most voted with multiple array#filter, array#sort and array#indexOf... That is not performant
– Yosvel Quintero
Mar 20 at 13:08
Do note that the.sort()is not necessary - the end result without the sort is still an array without any duplicate items, just in the same order as the original array. (It does make it exactly match thefinalResultvariable in the question though.)
– Florrie
Mar 20 at 14:53
add a comment |
14
Just use a simple array.filter one-liner:
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let finalResult = arr.filter((e, i, a) => a.indexOf(e) == i).sort(function(a, b)return a - b);
console.log(finalResult);You could use another filter statement if you wanted the second result:
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let finalResult = arr.filter((e, i, a) => a.filter(f => f == e).length == 1).sort(function(a, b)return a - b);
console.log(finalResult);edited Mar 20 at 7:20
Mukyuu
1,82431123
answered Mar 20 at 7:11
Jack BashfordJack Bashford
13k31847
You could also add.sort()to sort them by numerical order:.sort(function(a, b)return a - b)on finalresult
– Mukyuu
Mar 20 at 7:13
Yes @Mukyuu, that would also be useful
– Jack Bashford
Mar 20 at 7:16
5
Worth pointing out that the run time of this approach will be quadratic on the size of the input, which is probably not great unless the input arrays are known to be always fairly small.
– Joe Lee-Moyet
Mar 20 at 11:55
1
Most voted with multiple array#filter, array#sort and array#indexOf... That is not performant
– Yosvel Quintero
Mar 20 at 13:08
Do note that the.sort()is not necessary - the end result without the sort is still an array without any duplicate items, just in the same order as the original array. (It does make it exactly match thefinalResultvariable in the question though.)
– Florrie
Mar 20 at 14:53
add a comment |
14
14
14
Just use a simple array.filter one-liner:
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let finalResult = arr.filter((e, i, a) => a.indexOf(e) == i).sort(function(a, b)return a - b);
console.log(finalResult);You could use another filter statement if you wanted the second result:
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let finalResult = arr.filter((e, i, a) => a.filter(f => f == e).length == 1).sort(function(a, b)return a - b);
console.log(finalResult);edited Mar 20 at 7:20
Mukyuu
1,82431123
answered Mar 20 at 7:11
Jack BashfordJack Bashford
13k31847
Just use a simple array.filter one-liner:
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let finalResult = arr.filter((e, i, a) => a.indexOf(e) == i).sort(function(a, b)return a - b);
console.log(finalResult);You could use another filter statement if you wanted the second result:
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let finalResult = arr.filter((e, i, a) => a.filter(f => f == e).length == 1).sort(function(a, b)return a - b);
console.log(finalResult);let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let finalResult = arr.filter((e, i, a) => a.indexOf(e) == i).sort(function(a, b)return a - b);
console.log(finalResult);let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let finalResult = arr.filter((e, i, a) => a.indexOf(e) == i).sort(function(a, b)return a - b);
console.log(finalResult);let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let finalResult = arr.filter((e, i, a) => a.filter(f => f == e).length == 1).sort(function(a, b)return a - b);
console.log(finalResult);let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let finalResult = arr.filter((e, i, a) => a.filter(f => f == e).length == 1).sort(function(a, b)return a - b);
console.log(finalResult);edited Mar 20 at 7:20
Mukyuu
1,82431123
answered Mar 20 at 7:11
Jack BashfordJack Bashford
13k31847
edited Mar 20 at 7:20
Mukyuu
1,82431123
edited Mar 20 at 7:20
Mukyuu
1,82431123
edited Mar 20 at 7:20
Mukyuu
1,82431123
1,82431123
answered Mar 20 at 7:11
Jack BashfordJack Bashford
13k31847
answered Mar 20 at 7:11
Jack BashfordJack Bashford
13k31847
answered Mar 20 at 7:11
Jack BashfordJack Bashford
13k31847
13k31847
You could also add.sort()to sort them by numerical order:.sort(function(a, b)return a - b)on finalresult
– Mukyuu
Mar 20 at 7:13
Yes @Mukyuu, that would also be useful
– Jack Bashford
Mar 20 at 7:16
5
Worth pointing out that the run time of this approach will be quadratic on the size of the input, which is probably not great unless the input arrays are known to be always fairly small.
– Joe Lee-Moyet
Mar 20 at 11:55
1
Most voted with multiple array#filter, array#sort and array#indexOf... That is not performant
– Yosvel Quintero
Mar 20 at 13:08
Do note that the.sort()is not necessary - the end result without the sort is still an array without any duplicate items, just in the same order as the original array. (It does make it exactly match thefinalResultvariable in the question though.)
– Florrie
Mar 20 at 14:53
add a comment |
You could also add.sort()to sort them by numerical order:.sort(function(a, b)return a - b)on finalresult
– Mukyuu
Mar 20 at 7:13
Yes @Mukyuu, that would also be useful
– Jack Bashford
Mar 20 at 7:16
5
Worth pointing out that the run time of this approach will be quadratic on the size of the input, which is probably not great unless the input arrays are known to be always fairly small.
– Joe Lee-Moyet
Mar 20 at 11:55
1
Most voted with multiple array#filter, array#sort and array#indexOf... That is not performant
– Yosvel Quintero
Mar 20 at 13:08
Do note that the.sort()is not necessary - the end result without the sort is still an array without any duplicate items, just in the same order as the original array. (It does make it exactly match thefinalResultvariable in the question though.)
– Florrie
Mar 20 at 14:53
You could also add
.sort() to sort them by numerical order: .sort(function(a, b)return a - b) on finalresult– Mukyuu
Mar 20 at 7:13
You could also add
.sort() to sort them by numerical order: .sort(function(a, b)return a - b) on finalresult– Mukyuu
Mar 20 at 7:13
Yes @Mukyuu, that would also be useful
– Jack Bashford
Mar 20 at 7:16
Yes @Mukyuu, that would also be useful
– Jack Bashford
Mar 20 at 7:16
5
5
Worth pointing out that the run time of this approach will be quadratic on the size of the input, which is probably not great unless the input arrays are known to be always fairly small.
– Joe Lee-Moyet
Mar 20 at 11:55
Worth pointing out that the run time of this approach will be quadratic on the size of the input, which is probably not great unless the input arrays are known to be always fairly small.
– Joe Lee-Moyet
Mar 20 at 11:55
1
1
Most voted with multiple array#filter, array#sort and array#indexOf... That is not performant
– Yosvel Quintero
Mar 20 at 13:08
Most voted with multiple array#filter, array#sort and array#indexOf... That is not performant
– Yosvel Quintero
Mar 20 at 13:08
Do note that the
.sort() is not necessary - the end result without the sort is still an array without any duplicate items, just in the same order as the original array. (It does make it exactly match the finalResult variable in the question though.)– Florrie
Mar 20 at 14:53
Do note that the
.sort() is not necessary - the end result without the sort is still an array without any duplicate items, just in the same order as the original array. (It does make it exactly match the finalResult variable in the question though.)– Florrie
Mar 20 at 14:53
add a comment |
10
For the first part you can use Set() and Spread Syntax to remove duplicates.
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let res = [...new Set(arr)]
console.log(res)For the second part you can use reduce()
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
//to get the object with count of each number in array.
let obj = arr.reduce((ac,a) =>
//check if number doesnot occur before then set its count to 1
if(!ac[a]) ac[a] = 1;
//if number is already in object increase its count
else ac[a]++;
return ac;
,)
//Using reduce on all the keys of object means all numbers.
let res = Object.keys(obj).reduce((ac,a) =>
//check if count of current number 'a' is `1` in the above object then add it into array
if(obj[a] === 1) ac.push(+a)
return ac;
,[])
console.log(res)answered Mar 20 at 7:18
Maheer AliMaheer Ali
7,111518
nice appreciate that, that 2nd one looks crazy. I'm assuming the time complexity for would be less than ideal compared to other results?
– mph85
Mar 20 at 7:24
@mph85 Yes its a little complex because it doesnot go through the array again and again instead it just store all the result obj and then filter it.Its better regarding performance
– Maheer Ali
Mar 20 at 7:26
could you remind me why we need thespread operator? what happens if we don't have it? @Maheer Ali
– mph85
Mar 20 at 7:28
Is it because if we don't have it, it'll just log an object?
– mph85
Mar 20 at 7:29
@mph85 No if we will not have it. We will have aSet()inside array. We use it convertSet()toArray
– Maheer Ali
Mar 20 at 7:30
|
show 1 more comment
10
For the first part you can use Set() and Spread Syntax to remove duplicates.
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let res = [...new Set(arr)]
console.log(res)For the second part you can use reduce()
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
//to get the object with count of each number in array.
let obj = arr.reduce((ac,a) =>
//check if number doesnot occur before then set its count to 1
if(!ac[a]) ac[a] = 1;
//if number is already in object increase its count
else ac[a]++;
return ac;
,)
//Using reduce on all the keys of object means all numbers.
let res = Object.keys(obj).reduce((ac,a) =>
//check if count of current number 'a' is `1` in the above object then add it into array
if(obj[a] === 1) ac.push(+a)
return ac;
,[])
console.log(res)answered Mar 20 at 7:18
Maheer AliMaheer Ali
7,111518
nice appreciate that, that 2nd one looks crazy. I'm assuming the time complexity for would be less than ideal compared to other results?
– mph85
Mar 20 at 7:24
@mph85 Yes its a little complex because it doesnot go through the array again and again instead it just store all the result obj and then filter it.Its better regarding performance
– Maheer Ali
Mar 20 at 7:26
could you remind me why we need thespread operator? what happens if we don't have it? @Maheer Ali
– mph85
Mar 20 at 7:28
Is it because if we don't have it, it'll just log an object?
– mph85
Mar 20 at 7:29
@mph85 No if we will not have it. We will have aSet()inside array. We use it convertSet()toArray
– Maheer Ali
Mar 20 at 7:30
|
show 1 more comment
10
10
10
For the first part you can use Set() and Spread Syntax to remove duplicates.
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let res = [...new Set(arr)]
console.log(res)For the second part you can use reduce()
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
//to get the object with count of each number in array.
let obj = arr.reduce((ac,a) =>
//check if number doesnot occur before then set its count to 1
if(!ac[a]) ac[a] = 1;
//if number is already in object increase its count
else ac[a]++;
return ac;
,)
//Using reduce on all the keys of object means all numbers.
let res = Object.keys(obj).reduce((ac,a) =>
//check if count of current number 'a' is `1` in the above object then add it into array
if(obj[a] === 1) ac.push(+a)
return ac;
,[])
console.log(res)answered Mar 20 at 7:18
Maheer AliMaheer Ali
7,111518
For the first part you can use Set() and Spread Syntax to remove duplicates.
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let res = [...new Set(arr)]
console.log(res)For the second part you can use reduce()
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
//to get the object with count of each number in array.
let obj = arr.reduce((ac,a) =>
//check if number doesnot occur before then set its count to 1
if(!ac[a]) ac[a] = 1;
//if number is already in object increase its count
else ac[a]++;
return ac;
,)
//Using reduce on all the keys of object means all numbers.
let res = Object.keys(obj).reduce((ac,a) =>
//check if count of current number 'a' is `1` in the above object then add it into array
if(obj[a] === 1) ac.push(+a)
return ac;
,[])
console.log(res)let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let res = [...new Set(arr)]
console.log(res)let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let res = [...new Set(arr)]
console.log(res)let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
//to get the object with count of each number in array.
let obj = arr.reduce((ac,a) =>
//check if number doesnot occur before then set its count to 1
if(!ac[a]) ac[a] = 1;
//if number is already in object increase its count
else ac[a]++;
return ac;
,)
//Using reduce on all the keys of object means all numbers.
let res = Object.keys(obj).reduce((ac,a) =>
//check if count of current number 'a' is `1` in the above object then add it into array
if(obj[a] === 1) ac.push(+a)
return ac;
,[])
console.log(res)let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
//to get the object with count of each number in array.
let obj = arr.reduce((ac,a) =>
//check if number doesnot occur before then set its count to 1
if(!ac[a]) ac[a] = 1;
//if number is already in object increase its count
else ac[a]++;
return ac;
,)
//Using reduce on all the keys of object means all numbers.
let res = Object.keys(obj).reduce((ac,a) =>
//check if count of current number 'a' is `1` in the above object then add it into array
if(obj[a] === 1) ac.push(+a)
return ac;
,[])
console.log(res)answered Mar 20 at 7:18
Maheer AliMaheer Ali
7,111518
edited Mar 20 at 15:53
answered Mar 20 at 7:18
Maheer AliMaheer Ali
7,111518
answered Mar 20 at 7:18
Maheer AliMaheer Ali
7,111518
answered Mar 20 at 7:18
Maheer AliMaheer Ali
7,111518
7,111518
nice appreciate that, that 2nd one looks crazy. I'm assuming the time complexity for would be less than ideal compared to other results?
– mph85
Mar 20 at 7:24
@mph85 Yes its a little complex because it doesnot go through the array again and again instead it just store all the result obj and then filter it.Its better regarding performance
– Maheer Ali
Mar 20 at 7:26
could you remind me why we need thespread operator? what happens if we don't have it? @Maheer Ali
– mph85
Mar 20 at 7:28
Is it because if we don't have it, it'll just log an object?
– mph85
Mar 20 at 7:29
@mph85 No if we will not have it. We will have aSet()inside array. We use it convertSet()toArray
– Maheer Ali
Mar 20 at 7:30
|
show 1 more comment
nice appreciate that, that 2nd one looks crazy. I'm assuming the time complexity for would be less than ideal compared to other results?
– mph85
Mar 20 at 7:24
@mph85 Yes its a little complex because it doesnot go through the array again and again instead it just store all the result obj and then filter it.Its better regarding performance
– Maheer Ali
Mar 20 at 7:26
could you remind me why we need thespread operator? what happens if we don't have it? @Maheer Ali
– mph85
Mar 20 at 7:28
Is it because if we don't have it, it'll just log an object?
– mph85
Mar 20 at 7:29
@mph85 No if we will not have it. We will have aSet()inside array. We use it convertSet()toArray
– Maheer Ali
Mar 20 at 7:30
nice appreciate that, that 2nd one looks crazy. I'm assuming the time complexity for would be less than ideal compared to other results?
– mph85
Mar 20 at 7:24
nice appreciate that, that 2nd one looks crazy. I'm assuming the time complexity for would be less than ideal compared to other results?
– mph85
Mar 20 at 7:24
@mph85 Yes its a little complex because it doesnot go through the array again and again instead it just store all the result obj and then filter it.Its better regarding performance
– Maheer Ali
Mar 20 at 7:26
@mph85 Yes its a little complex because it doesnot go through the array again and again instead it just store all the result obj and then filter it.Its better regarding performance
– Maheer Ali
Mar 20 at 7:26
could you remind me why we need the
spread operator? what happens if we don't have it? @Maheer Ali– mph85
Mar 20 at 7:28
could you remind me why we need the
spread operator? what happens if we don't have it? @Maheer Ali– mph85
Mar 20 at 7:28
Is it because if we don't have it, it'll just log an object?
– mph85
Mar 20 at 7:29
Is it because if we don't have it, it'll just log an object?
– mph85
Mar 20 at 7:29
@mph85 No if we will not have it. We will have a
Set() inside array. We use it convert Set() to Array– Maheer Ali
Mar 20 at 7:30
@mph85 No if we will not have it. We will have a
Set() inside array. We use it convert Set() to Array– Maheer Ali
Mar 20 at 7:30
|
show 1 more comment
5
You could sort the array before and filter the array by checking only one side for duplicates or both sides.
var array = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10],
result1,
result2;
array.sort((a, b) => a - b);
result1 = array.filter((v, i, a) => a[i - 1] !== v);
result2 = array.filter((v, i, a) => a[i - 1] !== v && a[i + 1] !== v);
console.log(...result1);
console.log(...result2)answered Mar 20 at 7:34
Nina ScholzNina Scholz
193k15105177
thank for that, for theresult1what is going on with thea[i - 1] !== v?
– mph85
Mar 20 at 22:01
ais the array,iis the actual index, andvis the actual value. it takes the value from the index before of the actual index and looks if the values are not equal.
– Nina Scholz
Mar 20 at 22:03
ah ok, and sorry, it takes thevalue from the index before of the actual index? Not sure what you mean by that
– mph85
Mar 20 at 22:10
for example if you have the value9of the array asv, then the value before is8.
– Nina Scholz
Mar 20 at 22:13
ah ok, thank you for that
– mph85
Mar 20 at 22:15
add a comment |
5
You could sort the array before and filter the array by checking only one side for duplicates or both sides.
var array = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10],
result1,
result2;
array.sort((a, b) => a - b);
result1 = array.filter((v, i, a) => a[i - 1] !== v);
result2 = array.filter((v, i, a) => a[i - 1] !== v && a[i + 1] !== v);
console.log(...result1);
console.log(...result2)answered Mar 20 at 7:34
Nina ScholzNina Scholz
193k15105177
thank for that, for theresult1what is going on with thea[i - 1] !== v?
– mph85
Mar 20 at 22:01
ais the array,iis the actual index, andvis the actual value. it takes the value from the index before of the actual index and looks if the values are not equal.
– Nina Scholz
Mar 20 at 22:03
ah ok, and sorry, it takes thevalue from the index before of the actual index? Not sure what you mean by that
– mph85
Mar 20 at 22:10
for example if you have the value9of the array asv, then the value before is8.
– Nina Scholz
Mar 20 at 22:13
ah ok, thank you for that
– mph85
Mar 20 at 22:15
add a comment |
5
5
5
You could sort the array before and filter the array by checking only one side for duplicates or both sides.
var array = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10],
result1,
result2;
array.sort((a, b) => a - b);
result1 = array.filter((v, i, a) => a[i - 1] !== v);
result2 = array.filter((v, i, a) => a[i - 1] !== v && a[i + 1] !== v);
console.log(...result1);
console.log(...result2)answered Mar 20 at 7:34
Nina ScholzNina Scholz
193k15105177
You could sort the array before and filter the array by checking only one side for duplicates or both sides.
var array = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10],
result1,
result2;
array.sort((a, b) => a - b);
result1 = array.filter((v, i, a) => a[i - 1] !== v);
result2 = array.filter((v, i, a) => a[i - 1] !== v && a[i + 1] !== v);
console.log(...result1);
console.log(...result2)var array = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10],
result1,
result2;
array.sort((a, b) => a - b);
result1 = array.filter((v, i, a) => a[i - 1] !== v);
result2 = array.filter((v, i, a) => a[i - 1] !== v && a[i + 1] !== v);
console.log(...result1);
console.log(...result2)var array = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10],
result1,
result2;
array.sort((a, b) => a - b);
result1 = array.filter((v, i, a) => a[i - 1] !== v);
result2 = array.filter((v, i, a) => a[i - 1] !== v && a[i + 1] !== v);
console.log(...result1);
console.log(...result2)answered Mar 20 at 7:34
Nina ScholzNina Scholz
193k15105177
answered Mar 20 at 7:34
Nina ScholzNina Scholz
193k15105177
answered Mar 20 at 7:34
Nina ScholzNina Scholz
193k15105177
answered Mar 20 at 7:34
Nina ScholzNina Scholz
193k15105177
193k15105177
thank for that, for theresult1what is going on with thea[i - 1] !== v?
– mph85
Mar 20 at 22:01
ais the array,iis the actual index, andvis the actual value. it takes the value from the index before of the actual index and looks if the values are not equal.
– Nina Scholz
Mar 20 at 22:03
ah ok, and sorry, it takes thevalue from the index before of the actual index? Not sure what you mean by that
– mph85
Mar 20 at 22:10
for example if you have the value9of the array asv, then the value before is8.
– Nina Scholz
Mar 20 at 22:13
ah ok, thank you for that
– mph85
Mar 20 at 22:15
add a comment |
thank for that, for theresult1what is going on with thea[i - 1] !== v?
– mph85
Mar 20 at 22:01
ais the array,iis the actual index, andvis the actual value. it takes the value from the index before of the actual index and looks if the values are not equal.
– Nina Scholz
Mar 20 at 22:03
ah ok, and sorry, it takes thevalue from the index before of the actual index? Not sure what you mean by that
– mph85
Mar 20 at 22:10
for example if you have the value9of the array asv, then the value before is8.
– Nina Scholz
Mar 20 at 22:13
ah ok, thank you for that
– mph85
Mar 20 at 22:15
thank for that, for the
result1 what is going on with the a[i - 1] !== v?– mph85
Mar 20 at 22:01
thank for that, for the
result1 what is going on with the a[i - 1] !== v?– mph85
Mar 20 at 22:01
a is the array, i is the actual index, and v is the actual value. it takes the value from the index before of the actual index and looks if the values are not equal.– Nina Scholz
Mar 20 at 22:03
a is the array, i is the actual index, and v is the actual value. it takes the value from the index before of the actual index and looks if the values are not equal.– Nina Scholz
Mar 20 at 22:03
ah ok, and sorry, it takes the
value from the index before of the actual index? Not sure what you mean by that– mph85
Mar 20 at 22:10
ah ok, and sorry, it takes the
value from the index before of the actual index? Not sure what you mean by that– mph85
Mar 20 at 22:10
for example if you have the value
9 of the array as v, then the value before is 8.– Nina Scholz
Mar 20 at 22:13
for example if you have the value
9 of the array as v, then the value before is 8.– Nina Scholz
Mar 20 at 22:13
ah ok, thank you for that
– mph85
Mar 20 at 22:15
ah ok, thank you for that
– mph85
Mar 20 at 22:15
add a comment |
5
You can create both arrays in One Go
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let unique = new Set();
let repeated = Array.from(arr.reduce((acc, curr) =>
acc.has(curr) ? unique.delete(curr) : acc.add(curr) && unique.add(curr);
return acc;
, new Set()));
console.log(Array.from(unique))
console.log(repeated)answered Mar 20 at 7:35
AZ_AZ_
622210
1
Nice one mate +1
– Maheer Ali
Mar 20 at 7:47
I wonder if the ternary plus&&could be unclear though (x?y:z&&w)? It's not obvious to me how JS's order of operations would handle that, and I wonder if you could get across the same logic and reasoning by usingif/else?
– Florrie
Mar 20 at 14:56
add a comment |
5
You can create both arrays in One Go
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let unique = new Set();
let repeated = Array.from(arr.reduce((acc, curr) =>
acc.has(curr) ? unique.delete(curr) : acc.add(curr) && unique.add(curr);
return acc;
, new Set()));
console.log(Array.from(unique))
console.log(repeated)answered Mar 20 at 7:35
AZ_AZ_
622210
1
Nice one mate +1
– Maheer Ali
Mar 20 at 7:47
I wonder if the ternary plus&&could be unclear though (x?y:z&&w)? It's not obvious to me how JS's order of operations would handle that, and I wonder if you could get across the same logic and reasoning by usingif/else?
– Florrie
Mar 20 at 14:56
add a comment |
5
5
5
You can create both arrays in One Go
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let unique = new Set();
let repeated = Array.from(arr.reduce((acc, curr) =>
acc.has(curr) ? unique.delete(curr) : acc.add(curr) && unique.add(curr);
return acc;
, new Set()));
console.log(Array.from(unique))
console.log(repeated)answered Mar 20 at 7:35
AZ_AZ_
622210
You can create both arrays in One Go
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let unique = new Set();
let repeated = Array.from(arr.reduce((acc, curr) =>
acc.has(curr) ? unique.delete(curr) : acc.add(curr) && unique.add(curr);
return acc;
, new Set()));
console.log(Array.from(unique))
console.log(repeated)let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let unique = new Set();
let repeated = Array.from(arr.reduce((acc, curr) =>
acc.has(curr) ? unique.delete(curr) : acc.add(curr) && unique.add(curr);
return acc;
, new Set()));
console.log(Array.from(unique))
console.log(repeated)let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
let unique = new Set();
let repeated = Array.from(arr.reduce((acc, curr) =>
acc.has(curr) ? unique.delete(curr) : acc.add(curr) && unique.add(curr);
return acc;
, new Set()));
console.log(Array.from(unique))
console.log(repeated)answered Mar 20 at 7:35
AZ_AZ_
622210
answered Mar 20 at 7:35
AZ_AZ_
622210
answered Mar 20 at 7:35
AZ_AZ_
622210
answered Mar 20 at 7:35
AZ_AZ_
622210
622210
1
Nice one mate +1
– Maheer Ali
Mar 20 at 7:47
I wonder if the ternary plus&&could be unclear though (x?y:z&&w)? It's not obvious to me how JS's order of operations would handle that, and I wonder if you could get across the same logic and reasoning by usingif/else?
– Florrie
Mar 20 at 14:56
add a comment |
1
Nice one mate +1
– Maheer Ali
Mar 20 at 7:47
I wonder if the ternary plus&&could be unclear though (x?y:z&&w)? It's not obvious to me how JS's order of operations would handle that, and I wonder if you could get across the same logic and reasoning by usingif/else?
– Florrie
Mar 20 at 14:56
1
1
Nice one mate +1
– Maheer Ali
Mar 20 at 7:47
Nice one mate +1
– Maheer Ali
Mar 20 at 7:47
I wonder if the ternary plus
&& could be unclear though (x?y:z&&w)? It's not obvious to me how JS's order of operations would handle that, and I wonder if you could get across the same logic and reasoning by using if/else?– Florrie
Mar 20 at 14:56
I wonder if the ternary plus
&& could be unclear though (x?y:z&&w)? It's not obvious to me how JS's order of operations would handle that, and I wonder if you could get across the same logic and reasoning by using if/else?– Florrie
Mar 20 at 14:56
add a comment |
5
You can use Array.prototype.reduce() create a hash object where the keys are the numbers in the array and the values are going to be the the repeated occurrence of numbers in the arr array variable..
Then using Object.keys():
- Remove all duplicates
Object.keys(hash) - Remove all duplicates but filtering with Array.prototype.filter() to get the numbers with only one occurrence
Code:
const arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const hash = arr.reduce((a, c) => (a[c] = (a[c] || 0) + 1, a), );
// [1, 2, 3, 4, 5, 8, 9, 10];
const finalResultOne = Object.keys(hash);
// [1, 9, 10];
const finalResultTwo = Object.keys(hash).filter(k => hash[k] === 1);
console.log('finalResultOne:', ...finalResultOne);
console.log('finalResultTwo:', ...finalResultTwo);answered Mar 20 at 7:47
Yosvel QuinteroYosvel Quintero
11.8k42531
add a comment |
5
You can use Array.prototype.reduce() create a hash object where the keys are the numbers in the array and the values are going to be the the repeated occurrence of numbers in the arr array variable..
Then using Object.keys():
- Remove all duplicates
Object.keys(hash) - Remove all duplicates but filtering with Array.prototype.filter() to get the numbers with only one occurrence
Code:
const arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const hash = arr.reduce((a, c) => (a[c] = (a[c] || 0) + 1, a), );
// [1, 2, 3, 4, 5, 8, 9, 10];
const finalResultOne = Object.keys(hash);
// [1, 9, 10];
const finalResultTwo = Object.keys(hash).filter(k => hash[k] === 1);
console.log('finalResultOne:', ...finalResultOne);
console.log('finalResultTwo:', ...finalResultTwo);answered Mar 20 at 7:47
Yosvel QuinteroYosvel Quintero
11.8k42531
add a comment |
5
5
5
You can use Array.prototype.reduce() create a hash object where the keys are the numbers in the array and the values are going to be the the repeated occurrence of numbers in the arr array variable..
Then using Object.keys():
- Remove all duplicates
Object.keys(hash) - Remove all duplicates but filtering with Array.prototype.filter() to get the numbers with only one occurrence
Code:
const arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const hash = arr.reduce((a, c) => (a[c] = (a[c] || 0) + 1, a), );
// [1, 2, 3, 4, 5, 8, 9, 10];
const finalResultOne = Object.keys(hash);
// [1, 9, 10];
const finalResultTwo = Object.keys(hash).filter(k => hash[k] === 1);
console.log('finalResultOne:', ...finalResultOne);
console.log('finalResultTwo:', ...finalResultTwo);answered Mar 20 at 7:47
Yosvel QuinteroYosvel Quintero
11.8k42531
You can use Array.prototype.reduce() create a hash object where the keys are the numbers in the array and the values are going to be the the repeated occurrence of numbers in the arr array variable..
Then using Object.keys():
- Remove all duplicates
Object.keys(hash) - Remove all duplicates but filtering with Array.prototype.filter() to get the numbers with only one occurrence
Code:
const arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const hash = arr.reduce((a, c) => (a[c] = (a[c] || 0) + 1, a), );
// [1, 2, 3, 4, 5, 8, 9, 10];
const finalResultOne = Object.keys(hash);
// [1, 9, 10];
const finalResultTwo = Object.keys(hash).filter(k => hash[k] === 1);
console.log('finalResultOne:', ...finalResultOne);
console.log('finalResultTwo:', ...finalResultTwo);const arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const hash = arr.reduce((a, c) => (a[c] = (a[c] || 0) + 1, a), );
// [1, 2, 3, 4, 5, 8, 9, 10];
const finalResultOne = Object.keys(hash);
// [1, 9, 10];
const finalResultTwo = Object.keys(hash).filter(k => hash[k] === 1);
console.log('finalResultOne:', ...finalResultOne);
console.log('finalResultTwo:', ...finalResultTwo);const arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const hash = arr.reduce((a, c) => (a[c] = (a[c] || 0) + 1, a), );
// [1, 2, 3, 4, 5, 8, 9, 10];
const finalResultOne = Object.keys(hash);
// [1, 9, 10];
const finalResultTwo = Object.keys(hash).filter(k => hash[k] === 1);
console.log('finalResultOne:', ...finalResultOne);
console.log('finalResultTwo:', ...finalResultTwo);answered Mar 20 at 7:47
Yosvel QuinteroYosvel Quintero
11.8k42531
edited Mar 21 at 3:23
answered Mar 20 at 7:47
Yosvel QuinteroYosvel Quintero
11.8k42531
answered Mar 20 at 7:47
Yosvel QuinteroYosvel Quintero
11.8k42531
answered Mar 20 at 7:47
Yosvel QuinteroYosvel Quintero
11.8k42531
11.8k42531
add a comment |
add a comment |
4
You can use closure and Map
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const build = ar =>
const mapObj = ar.reduce((acc, e) =>
acc.has(e) ? acc.set(e, true) : acc.set(e, false)
return acc
, new Map())
return function(hasDup = true)
if(hasDup) return [...mapObj.keys()]
else return [...mapObj].filter(([key, val]) => !val).map(([k, v])=> k)
const getArr = build(arr)
console.log(getArr())
console.log(getArr(false))answered Mar 20 at 7:30
birdbird
997620
add a comment |
4
You can use closure and Map
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const build = ar =>
const mapObj = ar.reduce((acc, e) =>
acc.has(e) ? acc.set(e, true) : acc.set(e, false)
return acc
, new Map())
return function(hasDup = true)
if(hasDup) return [...mapObj.keys()]
else return [...mapObj].filter(([key, val]) => !val).map(([k, v])=> k)
const getArr = build(arr)
console.log(getArr())
console.log(getArr(false))answered Mar 20 at 7:30
birdbird
997620
add a comment |
4
4
4
You can use closure and Map
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const build = ar =>
const mapObj = ar.reduce((acc, e) =>
acc.has(e) ? acc.set(e, true) : acc.set(e, false)
return acc
, new Map())
return function(hasDup = true)
if(hasDup) return [...mapObj.keys()]
else return [...mapObj].filter(([key, val]) => !val).map(([k, v])=> k)
const getArr = build(arr)
console.log(getArr())
console.log(getArr(false))answered Mar 20 at 7:30
birdbird
997620
You can use closure and Map
let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const build = ar =>
const mapObj = ar.reduce((acc, e) =>
acc.has(e) ? acc.set(e, true) : acc.set(e, false)
return acc
, new Map())
return function(hasDup = true)
if(hasDup) return [...mapObj.keys()]
else return [...mapObj].filter(([key, val]) => !val).map(([k, v])=> k)
const getArr = build(arr)
console.log(getArr())
console.log(getArr(false))let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const build = ar =>
const mapObj = ar.reduce((acc, e) =>
acc.has(e) ? acc.set(e, true) : acc.set(e, false)
return acc
, new Map())
return function(hasDup = true)
if(hasDup) return [...mapObj.keys()]
else return [...mapObj].filter(([key, val]) => !val).map(([k, v])=> k)
const getArr = build(arr)
console.log(getArr())
console.log(getArr(false))let arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const build = ar =>
const mapObj = ar.reduce((acc, e) =>
acc.has(e) ? acc.set(e, true) : acc.set(e, false)
return acc
, new Map())
return function(hasDup = true)
if(hasDup) return [...mapObj.keys()]
else return [...mapObj].filter(([key, val]) => !val).map(([k, v])=> k)
const getArr = build(arr)
console.log(getArr())
console.log(getArr(false))answered Mar 20 at 7:30
birdbird
997620
answered Mar 20 at 7:30
birdbird
997620
answered Mar 20 at 7:30
birdbird
997620
answered Mar 20 at 7:30
birdbird
997620
997620
add a comment |
add a comment |
4
As many other have said, the first one is just [...new Set(arr)]
For the second, just filter out those that occur more than once:
const arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const count = (arr, e) => arr.filter(n => n == e).length
const unique = arr => arr.filter(e => count(arr, e) < 2)
console.log(unique(arr));answered Mar 20 at 11:37
JollyJokerJollyJoker
21115
add a comment |
4
As many other have said, the first one is just [...new Set(arr)]
For the second, just filter out those that occur more than once:
const arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const count = (arr, e) => arr.filter(n => n == e).length
const unique = arr => arr.filter(e => count(arr, e) < 2)
console.log(unique(arr));answered Mar 20 at 11:37
JollyJokerJollyJoker
21115
add a comment |
4
4
4
As many other have said, the first one is just [...new Set(arr)]
For the second, just filter out those that occur more than once:
const arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const count = (arr, e) => arr.filter(n => n == e).length
const unique = arr => arr.filter(e => count(arr, e) < 2)
console.log(unique(arr));answered Mar 20 at 11:37
JollyJokerJollyJoker
21115
As many other have said, the first one is just [...new Set(arr)]
For the second, just filter out those that occur more than once:
const arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const count = (arr, e) => arr.filter(n => n == e).length
const unique = arr => arr.filter(e => count(arr, e) < 2)
console.log(unique(arr));const arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const count = (arr, e) => arr.filter(n => n == e).length
const unique = arr => arr.filter(e => count(arr, e) < 2)
console.log(unique(arr));const arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
const count = (arr, e) => arr.filter(n => n == e).length
const unique = arr => arr.filter(e => count(arr, e) < 2)
console.log(unique(arr));answered Mar 20 at 11:37
JollyJokerJollyJoker
21115
answered Mar 20 at 11:37
JollyJokerJollyJoker
21115
answered Mar 20 at 11:37
JollyJokerJollyJoker
21115
answered Mar 20 at 11:37
JollyJokerJollyJoker
21115
21115
add a comment |
add a comment |
2
var arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
var map = ;
var finalResult = [];
for (var i = 0; i < arr.length; i++)
if (!map.hasOwnProperty(arr[i]))
map[arr[i]] = true;
finalResult.push(arr[i]);
//if you need it sorted otherwise it will be in order
finalResult.sort(function(a, b)
return a - b
);
console.log(finalResult);edited yesterday
demo
2,38433984
answered Mar 20 at 13:54
JanspeedJanspeed
1,3381315
add a comment |
2
var arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
var map = ;
var finalResult = [];
for (var i = 0; i < arr.length; i++)
if (!map.hasOwnProperty(arr[i]))
map[arr[i]] = true;
finalResult.push(arr[i]);
//if you need it sorted otherwise it will be in order
finalResult.sort(function(a, b)
return a - b
);
console.log(finalResult);edited yesterday
demo
2,38433984
answered Mar 20 at 13:54
JanspeedJanspeed
1,3381315
add a comment |
2
2
2
var arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
var map = ;
var finalResult = [];
for (var i = 0; i < arr.length; i++)
if (!map.hasOwnProperty(arr[i]))
map[arr[i]] = true;
finalResult.push(arr[i]);
//if you need it sorted otherwise it will be in order
finalResult.sort(function(a, b)
return a - b
);
console.log(finalResult);edited yesterday
demo
2,38433984
answered Mar 20 at 13:54
JanspeedJanspeed
1,3381315
var arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
var map = ;
var finalResult = [];
for (var i = 0; i < arr.length; i++)
if (!map.hasOwnProperty(arr[i]))
map[arr[i]] = true;
finalResult.push(arr[i]);
//if you need it sorted otherwise it will be in order
finalResult.sort(function(a, b)
return a - b
);
console.log(finalResult);var arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
var map = ;
var finalResult = [];
for (var i = 0; i < arr.length; i++)
if (!map.hasOwnProperty(arr[i]))
map[arr[i]] = true;
finalResult.push(arr[i]);
//if you need it sorted otherwise it will be in order
finalResult.sort(function(a, b)
return a - b
);
console.log(finalResult);var arr = [1, 2, 4, 2, 3, 3, 4, 5, 5, 5, 8, 8, 9, 10];
var map = ;
var finalResult = [];
for (var i = 0; i < arr.length; i++)
if (!map.hasOwnProperty(arr[i]))
map[arr[i]] = true;
finalResult.push(arr[i]);
//if you need it sorted otherwise it will be in order
finalResult.sort(function(a, b)
return a - b
);
console.log(finalResult);edited yesterday
demo
2,38433984
answered Mar 20 at 13:54
JanspeedJanspeed
1,3381315
edited yesterday
demo
2,38433984
edited yesterday
demo
2,38433984
edited yesterday
demo
2,38433984
2,38433984
answered Mar 20 at 13:54
JanspeedJanspeed
1,3381315
answered Mar 20 at 13:54
JanspeedJanspeed
1,3381315
answered Mar 20 at 13:54
JanspeedJanspeed
1,3381315
1,3381315
add a comment |
add a comment |
If you're using lodash, you can use
_.uniq()– BlueRaja - Danny Pflughoeft
Mar 20 at 9:29
1
Further, this is asking for the inverse of Get all non-unique values (i.e.: duplicate/more than one occurrence) in an array. Finally, this post is asking two separate questions and both have good answers elsewhere already.
– Søren D. Ptæus
Mar 20 at 9:51
To answer the question "which one is it" in a comment-answer: if you're asked to remove duplicates, I believe you should understand the first variant. The second variant removes all element that have duplicates, meaning the "original" value AND its duplicates.
– Pierre Arlaud
Mar 20 at 13:18