100 Days of JavaScript Coding Challenges || Day #12

Welcome, on a 100-day JavaScript journey with me! Join me as I tackle a new coding challenge every day, exclusively using JavaScript. Let's level up our skills together, one problem at a time.

-------------------------------------------------------
📢 Checkout our world best JavaScript Course Part 1 & 2 👇

--------------------------------------------------------
Before Learning JavaScript, Don't forget to watch 👇

-----------------------------------------------------
✌️ Become Member, get access to perks, free Source code, & more..

-----------------------------------------------------

⌚ TIMELINE ⌚
0:00 Introduction to JS in 100 Days
0:25 Understanding the Question: Remove Duplicates from Array
2:05 Pause the Video and Try It Yourself
2:28 Let's Solve It Together
5:50 Outro

[Hiralshah-zxhq]

const remove_Arr=(arr)=>{
return arr.filter((index, item)=>arr.indexOf(index)===item).sort((a, b)=>{
return a-b
})
}


output=[ 1, 2, 3, 5, 6, 7 ]

[MyCodingDiary]

You have a gift for teaching. Truly remarkable!

[gamersingh]

function checkarr(array){
let myset = new Set(array);
let unique_array = [...myset]; console.log(unique_array);

};

const arr1 = [1, 2, 3, 4, 2, 4]; checkarr(arr1);

[shrawankumar]

return arr.filter((value, index, self)=> self.indexOf(value) === index);

[tinku-kivz]

1:30)
function removeDuplicates(arr) {
let newArr = [...new Set(arr)];
return newArr;
}
console.log(removeDuplicates([1, 2, 3, 2, 1, 4]));
console.log(removeDuplicates([5, 6, 7, 7, 8, 8, 9]));
console.log(removeDuplicates([1, 2, 3, 4]));

[ranatariq]

Always great and always some unique thank you so much

[cricketblitz]

function removeDuplicates(arr) {
// 1st method -- in built method
// return (newArr = [...new Set(arr)]);

// second method
if (arr.length > 0) {
let ouput = [arr[0]];
for (let char of arr) {
if (ouput.includes(char)) {
continue;
}
ouput.push(char);
}
return ouput;
}
return (ouput = []);
}

[MDTalha-vtbi]

function removeDuplicates(arr) {
const newArr = [];
for (let i = 0; i < arr.length; i++) {
const element = arr[i];

if (!newArr.includes(element)) {
newArr.push(element);
}
}
return newArr.sort((a, b) => a - b);
}

console.log(removeDuplicates([5, 6, 9, 7, 7, 8, 8]));

[dikshagupta]

function removeDup(arr) {
let myset = new Set(arr);
let arr1 = [];
myset.forEach((v) => {
arr1.push(v);
})
console.log(arr1);
}
removeDup([1, 2, 3, 2, 4, 5, 1]);

[rohitkumarshaw]

Sir please check it is not there and upload the event and local storage folder in World js course

[amitchopra]

const removeDuplicate = (arr) => {
return arr.filter((value, index) => arr.indexOf(value) == index);
}

console.log(removeDuplicate([1, 2, 4, 1, 2, ]));

[geetambinani]

const arr = [];

function removeDuplicates(arr) {
arr = arr.sort();

let count = 0;
let reducedLength = false;
for (let i = 0; i < arr.length - 1; i++) {
if (arr[i] !== arr[i + 1]) {
arr[count] = arr[i];
count++;
} else {
reducedLength = true;
}
}
arr[count] = arr[arr.length - 1];
if (reducedLength) {
arr.length = count + 1;
}
return arr;
}

console.log(removeDuplicates([1, 1, 4, 2, 3]));

[BhagatBhutale..]

JavaScript Challenge 100/12 days is Completed ✅👍

[Sunny-ccmw]

let RemoveDuplicate=(arr)=>{
let data= [...new Set(arr)];
console.log(data)
}

[MdSahil-gxf]

const removedup = arr=>[...new Set(arr)]
console.log(removedup([23, 34, 45, 23, 45, 45, 5656, 7823])) #mysolution

[binodkumar-emub]

Another approach that can work without javascript is the build method.

[become.webdev]

function removeDuplicates(arr){
let newArray = [];
for(let num of arr){
if(!newArray.includes(num)){
newArray.push(num);
}
}
return newArray;
}
const result = removeDuplicates([1, 2, 3, 2, 1, 4]);
console.log(result); //Output: [1, 2, 3, 4]

function removeDuplicates(arr){
let newArray = new Set(arr);
return Array.from(newArray);
}
const result1 = removeDuplicates([1, 2, 3, 2, 1, 4]);
console.log(result1);

[Yu-music-bj]

set. can remove element automatically

[Chirag]

let arr = [1, 2, 3, 2, 1, 4];
let result = removeDuplicate(arr);
console.log(`${result}`);

function removeDuplicate(arr) {
let i = 0;
let newArr = [];
while (i < arr.length) {
if (newArr.indexOf(arr[i]) == -1) {
newArr.push(arr[i]);
}
i++;
}
return newArr;
}

[kawsarfiroz]

let arr = [2, 3, 2, 3, 1, 4, 5]
const uniqueArray = (arr) => {
let unique = []
for (let i = 0; i < arr.length; i++) {
let element = arr[i]
if (!unique.includes(element)) {
unique.push(element)
}
}
return unique;
}




// using class
class UniqueArr {
constructor(arr) {
this.arr = arr;
}
//
getUniqueArr() {
let unique = [];
for (let i = 0; i < this.arr.length; i++) {
let element = this.arr[i];
if (!unique.includes(element)) {
unique.push(element)
}
}
return unique;
}
}


const newClass = new UniqueArr(arr);