update

Author: Sushant2435

Pattern_Question/Number_pattern.js/1st.js

@@ -0,0 +1,43 @@
+// pattern 1 
+
+// 1
+// 1 2
+// 1 2 3
+// 1 2 3 4
+// 1 2 3 4 5
+
+const n = 5;
+for (let i = 1; i <= n; i++) {
+    let str = ""
+    for (let j = 1; j <= i; j++) {
+        str += j + " ";
+    }
+    console.log(str.trim())
+}
+
+// A
+// A B
+// A B C
+// A B C D
+// A B C D E
+
+for (let i = 1; i <= n; i++) {
+    let str = ""
+    for (let j = 1; j <= i; j++) {
+        str += String.fromCharCode(64 + j) + " ";
+    }
+    console.log(str.trim())
+}
+
+// *
+// * *
+// * * *
+// * * * *
+// * * * * *
+for (let i = 1; i <= n; i++) {
+    let str = ""
+    for (let j = 1; j <= i; j++) {
+        str += "* ";
+    }
+    console.log(str.trim())
+}

Pattern_Question/Number_pattern.js/2nd.js

@@ -0,0 +1,29 @@
+// pattern 2
+// 5 4 3 2 1
+// 5 4 3 2
+// 5 4 3
+// 5 4
+// 5
+
+const n = 5;
+for (let i = 1; i <= n; i++) {
+    let str = " "
+    for (let j = n; j >= i; j--) {
+        str = str + j + " "
+    }
+    console.log(str.trim())
+}
+// .....................Star...... ... .. . . . . . . .. .
+
+// * * * * *
+// * * * *
+// * * *
+// * *
+// *
+for (let i = 1; i <= n; i++) {
+    let str = " "
+    for (let j = n; j >= i; j--) {
+        str += "* "
+    }
+    console.log(str.trim())
+}

Pattern_Question/Number_pattern.js/3rd.js

@@ -0,0 +1,32 @@
+
+// pattern 3
+
+// 1 2 3 4 5
+// 2 3 4 5
+// 3 4 5
+// 4 5
+// 5
+
+const n = 5;
+for (let i = 1; i <= n; i++) {
+    let str = "";
+    for (let j = i; j <= n; j++) {
+        str += j + " ";
+    }
+    console.log(str.trim());
+}
+
+// .....................Star...... ... .. . . . . . . .. .
+
+// * * * * *
+// * * * *
+// * * *
+// * *
+// *
+for (let i = 1; i <= n; i++) {
+    let str = "";
+    for (let j = i; j <= n; j++) {
+        str += "* ";
+    }
+    console.log(str.trim());
+}

Pattern_Question/Number_pattern.js/4th.js

@@ -0,0 +1,41 @@
+// pattern 4
+
+//     1
+//    12
+//   123
+//  1234
+
+const n = 5;
+for (let i = 1; i <= n; i++) {
+    let str = '';
+
+    for (let j = 1; j <= (n - i); j++) {
+        str += " ";
+    }
+
+    for (let k = 1; k <= i; k++) {
+        str += k;
+    }
+
+    console.log(str);
+}
+
+// *
+// **
+// ***
+// ****
+// *****
+
+for (let i = 1; i <= n; i++) {
+    let str = '';
+
+    for (let j = 1; j <= (n - i); j++) {
+        str += " ";
+    }
+
+    for (let k = 1; k <= i; k++) {
+        str += "*";
+    }
+
+    console.log(str);
+}

Pattern_Question/Number_pattern.js/5th.js

@@ -0,0 +1,40 @@
+// pattern with start
+//     *
+//    ***
+//   *****
+//  *******
+// *********
+let n = 5;
+for (let i = 1; i <= n; i++) {
+    let str = "";
+    for (let j = 1; j <= n + 4; j++) {
+        if (j >= (6 - i) && j <= (4 + i)) {
+            str += "*";
+        } else {
+            str += " ";
+        }
+    }
+    console.log(str);
+}
+
+
+// pattern with number 
+
+//     1
+//    123
+//   12345
+//  1234567
+// 123456789
+
+for (let i = 1; i <= n; i++) {
+    let str = "";
+    for (let j = 1; j <= n + 4; j++) {
+        if (j >= (6 - i) && j <= (4 + i)) {
+            str += (j - (n - i));
+        } else {
+            str += " ";
+        }
+    }
+    console.log(str);
+}
+

Pattern_Question/Number_pattern.js/6th.js

@@ -0,0 +1 @@
+// pattern

Pattern_Question/Number_pattern.js/tempCodeRunnerFile.js

@@ -0,0 +1 @@
+"*";

coding_series/22.union_arr.js

@@ -1,18 +1,30 @@
 // 22. Write a JavaScript program to compute the union of two arrays.
-// Sample Data :
-function unionArr(arr1, arr2) {
-    let unionArr = []
-    for (let i = 0; i < arr1.length; i++) {
-        for (let j = 0; j < arr2.length; j++) {
-            if (arr1[i] === arr2[j]) {
-                unionArr.push(arr1[i])
-            }
-        }
-    }
-    return (unionArr)
+function union(arr1, arr2) {
+    const newArr = ([...arr1, ...arr2])
+    const uniqueArr = ([...new Set(newArr)])
+    return (uniqueArr)
+}
+
+console.log("Union of two Array is : ", union([1, 2, 3], [100, 2, 1, 10]));
 
+// another method
+
+function union1(arr1, arr2) {
+    const result = [];
+    const map = {}
+    arr1.forEach(element => {
+        if (!map[element]) {
+            map[element] = true;
+            result.push(element);
+        }
+    });
+    arr2.map((element) => {
+        if (!map[element]) {
+            map[element] = true;
+            result.push(element);
+        }
+    })
+    return result;
 }
 
-const array1 = [1, 2, 3];
-const array2 = [100, 2, 1, 10];
-console.log(unionArr(array1, array2))
+console.log("Union of two arrays is: ", union1([1, 2, 3], [100, 2, 1, 10]));

coding_series/23_difference_Arr.js

@@ -1,7 +0,0 @@
-// 23. Write a JavaScript function to find the difference between two arrays.
-
-function differenceArr(arr1, arr2) {
-
-}
-const array1 = [1, 2, 3];
-const array2 = [100, 2, 1, 10];

coding_series/single_ele.js

@@ -0,0 +1,36 @@
+
+// Using inbuilt Methods
+
+const arr = [1, 1, 2, 3, 3, 4, 4, 6, 7, 7, 2, 9];
+
+const uniqueElement = arr.filter((item) => arr.indexOf(item) === arr.lastIndexOf(item))
+
+console.log(`Unique element: ${uniqueElement}`);
+
+const findUniqueElements = (arr) => {
+    const elementCount = {};
+
+    // Step 1: Count the occurrences of each element in the array
+    for (let i = 0; i < arr.length; i++) {
+        if (elementCount[arr[i]]) {
+            elementCount[arr[i]]++;
+        } else {
+            elementCount[arr[i]] = 1;
+        }
+    }
+
+    // Step 2: Collect all elements that appear only once
+    const uniqueElements = [];
+    for (let i = 0; i < arr.length; i++) {
+        if (elementCount[arr[i]] === 1) {
+            uniqueElements.push(arr[i]);
+        }
+    }
+
+    return uniqueElements;  // Return an array of all unique elements
+};
+
+const uniqueElements = findUniqueElements(arr);
+console.log(`Unique elements: ${uniqueElements}`);
+
+