code formatting

Author: sanjaydeveloper15

.DS_Store

@@ -3,22 +3,20 @@
 // 4 5 6
 // 9 8 9
 
-let arr = [[1,2,3],[4,5,6],[9,8,9]];
+let arr = [[1, 2, 3], [4, 5, 6], [9, 8, 9]];
 
 const getDiagonalSums = (matrixArr) => {
  let sum1 = 0;
  let sum2 = 0;
- for(let i=0; i<matrixArr.length; i++)
- {
+ for (let i = 0; i < matrixArr.length; i++) {
  //let firstIndex = 0;
- let lastIndex = matrixArr[i].length-1;
- for(let j=0; j<matrixArr[i].length; j++)
- {
+ let lastIndex = matrixArr[i].length - 1;
+ for (let j = 0; j < matrixArr[i].length; j++) {
  sum1 += matrixArr[j][j];
- sum2 += matrixArr[j][lastIndex-j];
+ sum2 += matrixArr[j][lastIndex - j];
  }
  break;
  }
- return [sum1,sum2];
+ return [sum1, sum2];
 }
 console.log(getDiagonalSums(arr))

Arrays-Questions/diagonal-array-sum.js

@@ -1,15 +1,14 @@
-let arr = [1,2,1,3,2,1,2,3,4,5];
+let arr = [1, 2, 1, 3, 2, 1, 2, 3, 4, 5];
 
 const getDuplicateFromArr = (inputArr) => {
  let resultArr = [];
  let obj = {};
- for(let i=0; i<inputArr.length; i++)
- {
- if(obj[inputArr[i]]){
- if(!resultArr.includes(inputArr[i])){
+ for (let i = 0; i < inputArr.length; i++) {
+ if (obj[inputArr[i]]) {
+ if (!resultArr.includes(inputArr[i])) {
  resultArr.push(inputArr[i]);
  }
- }else{
+ } else {
  obj[inputArr[i]] = 1;
  }
  }

Arrays-Questions/duplicate-from-array.js

@@ -1,8 +1,7 @@
 // Write a program to prints factorial of any number ?
 const getFactorial = (inputNum) => {
  let result = 1;
- for(let i=1; i<=inputNum; i++)
- {
+ for (let i = 1; i <= inputNum; i++) {
  result *= i;
  }
  return result;

Arrays-Questions/factorial-of-num.js

@@ -1,35 +1,33 @@
 //Write a program to flat Matrix array [1,[2,3],[4,5,6,[7,8]]] = [1,2,3,4,5,6,7,8]
 
-const flatArray = (matrixArray,innerArray=[],startFrom=0,resultArr=[]) => {
+const flatArray = (matrixArray, innerArray = [], startFrom = 0, resultArr = []) => {
  let count = 0;
  let loopArray = (innerArray.length === 0) ? matrixArray : innerArray;
  let tempStartFrom = startFrom;
  startFrom = (innerArray.length === 0) ? tempStartFrom : 0;
- for(let i=startFrom; i<loopArray.length; i++)
- {
- if(Array.isArray(loopArray[i])){
- return flatArray(matrixArray,matrixArray[i],i,resultArr);
+ for (let i = startFrom; i < loopArray.length; i++) {
+ if (Array.isArray(loopArray[i])) {
+ return flatArray(matrixArray, matrixArray[i], i, resultArr);
  }
- else{
+ else {
  resultArr.push(loopArray[i]);
  }
  }
 
 
  count++;
 
- if(count == 3) return false;
+ if (count == 3) return false;
 
- if(tempStartFrom != 0 && tempStartFrom < matrixArray.length-1)
- {
- console.log(matrixArray,[],tempStartFrom,resultArr)
- return flatArray(matrixArray,[],tempStartFrom,resultArr);
+ if (tempStartFrom != 0 && tempStartFrom < matrixArray.length - 1) {
+ console.log(matrixArray, [], tempStartFrom, resultArr)
+ return flatArray(matrixArray, [], tempStartFrom, resultArr);
  }
 
 
  return resultArr;
 }
 
-let inputArr = [1,[2,3],[4,5,6,[7,8]]];
+let inputArr = [1, [2, 3], [4, 5, 6, [7, 8]]];
 
 console.log(flatArray(inputArr));

Arrays-Questions/flatten-array.js

@@ -1,11 +1,10 @@
 // Write a program for check number is prime or not ?
 const isPrime = (inputNum) => {
  let result = true;
- for(let i=2; i<inputNum; i++)
- {
- if(inputNum%i === 0)
+ for (let i = 2; i < inputNum; i++) {
+ if (inputNum % i === 0)
  result = false;
-  break;
+ break;
  }
  return result;
 }

Arrays-Questions/is-prime-number.js

@@ -1,27 +1,24 @@
 //Write a program to Multiply two numbers without using * sign.
-const multiplyTwoNums = (x,y) => {
+const multiplyTwoNums = (x, y) => {
  //Theory: Multiply is nothing but equal to SUM
  x = parseFloat(x);
  y = parseFloat(y);
  let result = 0;
- for(let i=0; i<y; i++)
- {
+ for (let i = 0; i < y; i++) {
  result += x;
  }
  return result;
 }
 
 let x = process.argv[2];
 let y = process.argv[3];
-if(x == '' || x == null)
-{
+if (x == '' || x == null) {
  console.error('x value is required');
  return false;
 }
-if(y == '' || y == null)
-{
+if (y == '' || y == null) {
  console.error('y value is required');
  return false;
 }
-console.log('Result:',multiplyTwoNums(x,y));
+console.log('Result:', multiplyTwoNums(x, y));
 

Arrays-Questions/multiply-without-asteric.js

@@ -1,4 +1,5 @@
-// Given 2 strings, write a function to determine if the second string is an anagram of the first. An anagram is a word, phrase, or name formed by rearranging the letters of another, such as cinema, formed from iceman.
+// Given 2 strings, write a function to determine if the second string is an anagram of the first. An anagram is a word, 
+// phrase, or name formed by rearranging the letters of another, such as cinema, formed from iceman.
 
 const validAnagram = (str1, str2) => {
  let result = true

Frequency-Counter/anagram-frequency-check.js

@@ -1,4 +1,5 @@
-// Write a function called the same. Which accepts 2 arrays. The function should return true if every value in the array has its corresponding value squared in the second array. The frequency of values must be the same.
+// Write a function called the same. Which accepts 2 arrays. The function should return true if every value in the array
+// has its corresponding value squared in the second array. The frequency of values must be the same.
 
 const arr1 = [1, 2, 3] // Frequency {"1":1, "2":1, "3":1}
 const arr2 = [1, 9, 4] // Frequency {"1":1, "9":1, "4":1}

Frequency-Counter/compare-two-arrays-optimized.js

@@ -1,4 +1,5 @@
-// Write a function called the same. Which accepts 2 arrays. The function should return true if every value in the array has its corresponding value squared in the second array. The frequency of values must be the same.
+// Write a function called the same. Which accepts 2 arrays. The function should return true if every value in the array
+// has its corresponding value squared in the second array. The frequency of values must be the same.
 
 const arr1 = [1, 2, 3]
 const arr2 = [1, 9, 4]