add 4 new drafts

Author: rishabh1403

101-200/169-majority-element.js

@@ -0,0 +1,33 @@
+
+// sort and find middle
+var majorityElement = function (nums) {
+  nums.sort((a, b) => a - b);
+
+  const l = nums.length;
+
+  if (l % 2 === 0) {
+    return nums[l / 2]
+  } else {
+    return nums[(l - 1) / 2]
+  }
+};
+
+// Boyer–Moore majority vote algorithm
+// https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_majority_vote_algorithm
+var majorityElement = function (nums) {
+  let maj = 0, count = 1;
+
+  for (let i = 1; i < nums.length; i++) {
+    if (nums[i] === nums[maj]) {
+      count++
+    } else {
+      count--;
+    }
+
+    if (count === 0) {
+      maj = i;
+      count = 1;
+    }
+  }
+  return nums[maj]
+};

1201-1300/1252-cells-with-odd-values.js

@@ -0,0 +1,23 @@
+
+
+var oddCells = function (n, m, indices) {
+  const row = new Array(n).fill(0)
+  const col = new Array(m).fill(0)
+
+  for (let i = 0; i < indices.length; i++) {
+    row[indices[i][0]]++;
+    col[indices[i][1]]++;
+  }
+
+  let count = 0;
+
+  for (let i = 0; i < n; i++) {
+    for (let j = 0; j < m; j++) {
+      if ((row[i] + col[j]) % 2 !== 0) {
+        count++;
+      }
+    }
+  }
+
+  return count;
+};

1201-1300/1281-subtract-product-sum-of-digits.js

@@ -0,0 +1,15 @@
+
+
+var subtractProductAndSum = function (n) {
+  let product = 1, sum = 0;
+
+  while (n > 0) {
+    const digit = n % 10;
+    n = parseInt(n / 10);
+
+    product = product * digit;
+    sum += digit
+  }
+
+  return product - sum
+};

801-900/867-transpose-matrix.js

@@ -0,0 +1,16 @@
+
+
+var transpose = function (A) {
+
+  const result = [];
+
+  for (let i = 0; i < A[0].length; i++) {
+    const col = []
+    for (let j = 0; j < A.length; j++) {
+      col.push(A[j][i]);
+    }
+    result.push(col)
+  }
+
+  return result
+};