new stuff

Author: shaurya019

CodingInterviewQuestions/Calculator.js

@@ -0,0 +1,25 @@
+function calculator(operation, num1, num2) {
+    switch (operation) {
+        case 'add':
+            return num1 + num2;
+        case 'subtract':
+            return num1 - num2;
+        case 'multiply':
+            return num1 * num2;
+        case 'divide':
+            if (num2 === 0) {
+                return 'Error: Division by zero';
+            }
+            return num1 / num2;
+        default:
+            return 'Error: Invalid operation';
+    }
+}
+
+// Usage
+console.log(calculator('add', 5, 3));        // Output: 8
+console.log(calculator('subtract', 5, 3));   // Output: 2
+console.log(calculator('multiply', 5, 3));   // Output: 15
+console.log(calculator('divide', 5, 3));     // Output: 1.6666666666666667
+console.log(calculator('divide', 5, 0));     // Output: Error: Division by zero
+console.log(calculator('unknown', 5, 3));    // Output: Error: Invalid operation

CodingInterviewQuestions/CompareArr.js

@@ -0,0 +1,19 @@
+const arr1 = [1, 2, 3];
+const arr2 = [1, 2, 3];
+const arr3 = [1, 2, 4];
+
+function arraysEqual(arr1, arr2) {
+  if (arr1.length !== arr2.length) {
+    return false;
+  }
+  for (let i = 0; i < arr1.length; i++) {
+    if (arr1[i] !== arr2[i]) {
+      return false;
+    }
+  }
+  return true;
+}
+
+function arraysEqual(arr1, arr2) {
+  return JSON.stringify(arr1) === JSON.stringify(arr2);
+}

CodingInterviewQuestions/CompareEqualValue.js

@@ -0,0 +1,2 @@
+// "==" check for value
+// "===" check for value and type

CodingInterviewQuestions/DeleteLargestElement.js

@@ -0,0 +1,7 @@
+const arr = [1, 4, 5, 3];
+const value = (arr) => {
+    findLarge = Math.max(...arr);
+    index = arr.indexOf(findLarge);
+    arr.splice(index, 1);
+    return arr;
+}

CodingInterviewQuestions/DuplicateNumber.js

@@ -0,0 +1,3 @@
+const arr = [1, 2, 3, 4, 1, 2, 5];
+const ans = arr.filter((ele, idx, arr) => arr.indexOf(ele) !== idx);
+console.log(ans);

CodingInterviewQuestions/FilterMethod.js

@@ -0,0 +1,12 @@
+// filter: Creates a new array with all elements that pass the test implemented by the provided function.
+
+const people = [
+  { name: "John", age: 24 },
+  { name: "Jane", age: 30 },
+  { name: "Mike", age: 27 },
+  { name: "Sarah", age: 22 },
+];
+
+const olderThan25 = people.filter(x => x.age > 25);
+
+console.log(olderThan25);

CodingInterviewQuestions/FindEven.js

@@ -0,0 +1,4 @@
+const arr = [1, 122, 31, 44, 78];
+const evenNumbers = arr.filter(x => x%2==0);
+
+console.log(evenNumbers);

CodingInterviewQuestions/FindFactorial.js

@@ -0,0 +1,5 @@
+const input = prompt("Please enter")
+var fact = 1;
+for (let i = 1; i <= input; i++){
+    fact = fact * i;
+}

CodingInterviewQuestions/FindMethod.js

@@ -0,0 +1,10 @@
+const people = [
+    { name: "John", age: 24 },
+    { name: "Jane", age: 30 },
+    { name: "Mike", age: 27 },
+    { name: "Sarah", age: 22 },
+  ];
+  
+  const firstOlderThan25 = people.find(x => x.age > 25);
+  
+  console.log(firstOlderThan25);

CodingInterviewQuestions/FindMissingNumbers.js

@@ -0,0 +1,13 @@
+const arr = [1, 2, 19, 0, 4, 7];
+const miss = [];
+
+const missing = (arr) => {
+    const missMin = Math.min(...arr);
+    const missMax = Math.max(...arr);
+    for (let i = missMin; i < missMax; i++){
+        if (arr.indexOf(i) < 0) {
+            miss.push(i);
+        }
+    }
+    return miss;
+}

CodingInterviewQuestions/FindOccurence.js

@@ -0,0 +1,14 @@
+function countCharacterOccurrences(str) {
+  const map = new Map();
+  for (const x of str) {
+    if (map.has(x)) {
+      map.set(x, map.get(x) + 1);
+    } else {
+      map.set(x, 1);
+    }
+  }
+  return map;
+}
+const str = "hello world";
+const occurrences = countCharacterOccurrences(str);
+console.log(occurrences);

CodingInterviewQuestions/FindPalindrome.js

@@ -0,0 +1,6 @@
+const str1 = "olleh";
+const str2 = "hello";
+const reversedStr = str2.split('').reverse().join('');
+
+if (str1 === reversedStr) console.log('YEs');
+

CodingInterviewQuestions/FindPrimeNumbers.js

@@ -0,0 +1,12 @@
+const input = prompt("Please enter")
+var fact = 1;
+var flag = 0;
+for (let i = 2; i < input; i++){
+    if (input % i == 0) {
+        flag = 1;
+        break;
+    }
+}
+if (flag === 0) {
+    console.log('Not Prime');
+}

CodingInterviewQuestions/FindSecondLargeValue.js

@@ -0,0 +1,4 @@
+const arr = [10, 5, 40, 25];
+arr.sort((a, b) => b - a); // Sort the array in descending order
+let x = arr[1]; // Get the second largest element
+console.log(x); // Output: 25

CodingInterviewQuestions/FindUnion.js

@@ -0,0 +1,14 @@
+const arr1 = [1, 2, 3];
+const arr2 = [3, 4, 5];
+
+function arraysUnion(arr1, arr2) {
+    const combined = [...arr1, ...arr2];
+    
+    // Create a Set from the combined array to remove duplicates
+    const uniqueSet = new Set(combined);
+    
+    // Convert the Set back to an array using Array.from
+    return Array.from(uniqueSet);
+}
+const union = arraysUnion(arr1, arr2);
+console.log(union);

CodingInterviewQuestions/FindVowels.js

@@ -0,0 +1,11 @@
+var string = prompt("enter");
+const vowels = ['a', 'e', 'i', 'o', 'u'];
+const countVowel = (str) => {
+    var c = 0;
+    for (let i of str.toLowerCase()) {
+        if (vowels.includes(i)) {
+            c++;
+        }
+    }
+    return c;
+}

CodingInterviewQuestions/FirstLetterUpperCase.js

@@ -0,0 +1,8 @@
+function capitalizeFirstLetter(str) {
+    if (str.length === 0) return str; // Return the original string if it's empty
+
+    return str.charAt(0).toUpperCase() + str.slice(1);
+}
+
+// Usage
+const result = capitalizeFirstLetter('hello');

CodingInterviewQuestions/IntersectionOfArrays.js

@@ -0,0 +1,21 @@
+const arr1 = [1, 2, 3];
+const arr2 = [11, 12, 3];
+
+function arraysIntersects(arr1, arr2) {
+  let x = Math.max(arr1.length, arr2.lengt);
+  for (let i = 0; i < x; i++) {
+    if (arr1[i] === arr2[i]) {
+      return arr1[i];
+    }
+  }
+  return -1;
+}
+
+
+function arraysIntersection(arr1, arr2) {
+    // Create a Set from the second array for fast lookup
+    const set2 = new Set(arr2);
+
+    // Filter the first array to include only elements that are also in set2
+    return arr1.filter(value => set2.has(value));
+}

CodingInterviewQuestions/MaxAndMin.js

@@ -0,0 +1,9 @@
+const arr = [1, 122, 31, 44, 78];
+const maxFunction = (arr) => {
+    if (!Array.isArray(arr) || arr.length === 0) {
+        throw new Error("The input must be a non-empty array.");
+    }
+    return arr.reduce((prev, curr) => prev > curr ? prev : curr, -Infinity);
+}
+
+console.log(maxFunction(arr));

CodingInterviewQuestions/MergeTwoArr.js

@@ -0,0 +1,4 @@
+const arr1 = [1, 2, 3];
+const arr2 = [11, 12, 13];
+
+const res = [...arr1, ...arr2];

CodingInterviewQuestions/ReverseString.js

@@ -0,0 +1,23 @@
+const str1 = "hello";
+let reversedStr1 = "";
+
+for (let i = str1.length - 1; i >= 0; i--) {
+    reversedStr1 += str[i];
+}
+
+console.log(reversedStr); 
+
+
+const str2 = "hello";
+const reversedStr2 = str2.split('').reverse().join('');
+console.log(reversedStr2); // Output: "olleh"
+// Explanation:
+// str.split(''): Converts the string into an array of characters.
+
+// Example: "hello" becomes ['h', 'e', 'l', 'l', 'o'].
+// reverse(): Reverses the order of the elements in the array.
+
+// Example: ['h', 'e', 'l', 'l', 'o'] becomes ['o', 'l', 'l', 'e', 'h'].
+// join(''): Joins the elements of the array back into a single string.
+
+// Example: ['o', 'l', 'l', 'e', 'h'] becomes "olleh".

CodingInterviewQuestions/SumofElements.js

@@ -0,0 +1,7 @@
+const arr = [1, 122, 31, 44, 78];
+const sum = arr.reduce(
+  (accumulator, currentValue) => accumulator + currentValue,
+  0
+);
+
+console.log(sum);

CodingInterviewQuestions/Swap.js

@@ -0,0 +1,7 @@
+let a = 5;
+let b = 10;
+
+[a, b] = [b, a];
+
+console.log(a); // Output: 10
+console.log(b)