Add solution #1072

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,112 LeetCode solutions in JavaScript
+# 1,113 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -852,6 +852,7 @@
 1047|[Remove All Adjacent Duplicates In String](./solutions/1047-remove-all-adjacent-duplicates-in-string.js)|Easy|
 1051|[Height Checker](./solutions/1051-height-checker.js)|Easy|
 1071|[Greatest Common Divisor of Strings](./solutions/1071-greatest-common-divisor-of-strings.js)|Easy|
+1072|[Flip Columns For Maximum Number of Equal Rows](./solutions/1072-flip-columns-for-maximum-number-of-equal-rows.js)|Medium|
 1079|[Letter Tile Possibilities](./solutions/1079-letter-tile-possibilities.js)|Medium|
 1081|[Smallest Subsequence of Distinct Characters](./solutions/1081-smallest-subsequence-of-distinct-characters.js)|Medium|
 1092|[Shortest Common Supersequence](./solutions/1092-shortest-common-supersequence.js)|Hard|

solutions/1072-flip-columns-for-maximum-number-of-equal-rows.js

@@ -0,0 +1,40 @@
+/**
+ * 1072. Flip Columns For Maximum Number of Equal Rows
+ * https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows/
+ * Difficulty: Medium
+ *
+ * You are given an m x n binary matrix matrix.
+ *
+ * You can choose any number of columns in the matrix and flip every cell in that column
+ * (i.e., Change the value of the cell from 0 to 1 or vice versa).
+ *
+ * Return the maximum number of rows that have all values equal after some number of flips.
+ */
+
+/**
+ * @param {number[][]} matrix
+ * @return {number}
+ */
+var maxEqualRowsAfterFlips = function(matrix) {
+  const rowPatterns = new Map();
+  const rows = matrix.length;
+  const cols = matrix[0].length;
+
+  for (let i = 0; i < rows; i++) {
+    let pattern = '';
+    let flippedPattern = '';
+    for (let j = 0; j < cols; j++) {
+      pattern += matrix[i][j];
+      flippedPattern += 1 - matrix[i][j];
+    }
+    rowPatterns.set(pattern, (rowPatterns.get(pattern) || 0) + 1);
+    rowPatterns.set(flippedPattern, (rowPatterns.get(flippedPattern) || 0) + 1);
+  }
+
+  let result = 0;
+  for (const count of rowPatterns.values()) {
+    result = Math.max(result, count);
+  }
+
+  return result;
+};