Add solution #521

Author: JoshCrozier

0521-longest-uncommon-subsequence-i.js

@@ -0,0 +1,20 @@
+/**
+ * 521. Longest Uncommon Subsequence I
+ * https://leetcode.com/problems/longest-uncommon-subsequence-i/
+ * Difficulty: Easy
+ *
+ * Given two strings a and b, return the length of the longest uncommon subsequence between
+ * a and b. If no such uncommon subsequence exists, return -1.
+ *
+ * An uncommon subsequence between two strings is a string that is a subsequence of exactly
+ * one of them.
+ */
+
+/**
+ * @param {string} a
+ * @param {string} b
+ * @return {number}
+ */
+var findLUSlength = function(a, b) {
+  return a === b ? -1 : Math.max(a.length, b.length);
+};

README.md

@@ -227,6 +227,7 @@
 507|[Perfect Number](./0507-perfect-number.js)|Easy|
 509|[Fibonacci Number](./0509-fibonacci-number.js)|Easy|
 520|[Detect Capital](./0520-detect-capital.js)|Easy|
+521|[Longest Uncommon Subsequence I](./0521-longest-uncommon-subsequence-i.js)|Easy|
 541|[Reverse String II](./0541-reverse-string-ii.js)|Easy|
 542|[01 Matrix](./0542-01-matrix.js)|Medium|
 547|[Number of Provinces](./0547-number-of-provinces.js)|Medium|