Add solution #1790

Author: JoshCrozier

README.md

@@ -462,6 +462,7 @@
 1765|[Map of Highest Peak](./1765-map-of-highest-peak.js)|Medium|
 1768|[Merge Strings Alternately](./1768-merge-strings-alternately.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|
+1790|[Check if One String Swap Can Make Strings Equal](./1790-check-if-one-string-swap-can-make-strings-equal.js)|Easy|
 1791|[Find Center of Star Graph](./1791-find-center-of-star-graph.js)|Easy|
 1812|[Determine Color of a Chessboard Square](./1812-determine-color-of-a-chessboard-square.js)|Easy|
 1817|[Finding the Users Active Minutes](./1817-finding-the-users-active-minutes.js)|Medium|

solutions/1790-check-if-one-string-swap-can-make-strings-equal.js

@@ -0,0 +1,25 @@
+/**
+ * 1790. Check if One String Swap Can Make Strings Equal
+ * https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/
+ * Difficulty: Easy
+ *
+ * You are given two strings s1 and s2 of equal length. A string swap is an operation where
+ * you choose two indices in a string (not necessarily different) and swap the characters
+ * at these indices.
+ *
+ * Return true if it is possible to make both strings equal by performing at most one string
+ * swap on exactly one of the strings. Otherwise, return false.
+ */
+
+/**
+ * @param {string} s1
+ * @param {string} s2
+ * @return {boolean}
+ */
+var areAlmostEqual = function(s1, s2) {
+  const indices = [];
+  for (const i in s1) {
+    if (s1[i] !== s2[i] && indices.push(i) > 2) return false;
+  }
+  return s1[indices[0]] === s2[indices[1]] && s1[indices[1]] === s2[indices[0]];
+};