Add solution #1886

Author: JoshCrozier

README.md

@@ -217,6 +217,7 @@
 1672|[Richest Customer Wealth](./1672-richest-customer-wealth.js)|Easy|
 1780|[Check if Number is a Sum of Powers of Three](./1780-check-if-number-is-a-sum-of-powers-of-three.js)|Medium|
 1880|[Check if Word Equals Summation of Two Words](./1880-check-if-word-equals-summation-of-two-words.js)|Easy|
+1886|[Determine Whether Matrix Can Be Obtained By Rotation](./1886-determine-whether-matrix-can-be-obtained-by-rotation.js)|Easy|
 1920|[Build Array from Permutation](./1920-build-array-from-permutation.js)|Easy|
 1929|[Concatenation of Array](./1929-concatenation-of-array.js)|Easy|
 1935|[Maximum Number of Words You Can Type](./1935-maximum-number-of-words-you-can-type.js)|Easy|

solutions/1886-determine-whether-matrix-can-be-obtained-by-rotation.js

@@ -0,0 +1,35 @@
+/**
+ * 1886. Determine Whether Matrix Can Be Obtained By Rotation
+ * https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation/
+ * Difficulty: Easy
+ *
+ * Given two n x n binary matrices mat and target, return true if it is possible to make mat
+ * equal to target by rotating mat in 90-degree increments, or false otherwise.
+ */
+
+/**
+ * @param {number[][]} mat
+ * @param {number[][]} target
+ * @return {boolean}
+ */
+var findRotation = function(mat, target) {
+  const goal = JSON.stringify(target);
+  for (let i = 0; i < 4; i++) {
+    if (JSON.stringify(rotate(mat)) === goal) {
+      return true;
+    }
+  }
+  return false;
+};
+
+function rotate(matrix) {
+  matrix = matrix.reverse();
+
+  for (let i = 0; i < matrix.length; i++) {
+    for (let j = 0; j < i; j++) {
+      [matrix[i][j], matrix[j][i]] = [matrix[j][i], matrix[i][j]];
+    }
+  }
+
+  return matrix;
+}