diff --git "a/leetcode3/\354\240\225\354\247\204\354\230\201/26. Remove Duplicates from Sorted Array" "b/leetcode3/\354\240\225\354\247\204\354\230\201/26. Remove Duplicates from Sorted Array"
new file mode 100644
index 00000000..5a2c4a86
--- /dev/null
+++ "b/leetcode3/\354\240\225\354\247\204\354\230\201/26. Remove Duplicates from Sorted Array"	
@@ -0,0 +1,16 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var removeDuplicates = function(nums) {
+    let k = 1;
+
+    for (let i = 1; i<nums.length; i++){
+        if (nums[i-1] !== nums[i]){
+            nums[k] = nums[i];
+            k++;
+        }
+    }
+
+    return k;
+};
diff --git "a/leetcode3/\354\240\225\354\247\204\354\230\201/522. Longest Uncommon Subsequence II" "b/leetcode3/\354\240\225\354\247\204\354\230\201/522. Longest Uncommon Subsequence II"
new file mode 100644
index 00000000..93ee55e8
--- /dev/null
+++ "b/leetcode3/\354\240\225\354\247\204\354\230\201/522. Longest Uncommon Subsequence II"	
@@ -0,0 +1,39 @@
+/**
+ * @param {string[]} strs
+ * @return {number}
+ */
+var findLUSlength = function(strs) {
+    let ans = -1;
+
+    function isSubsequence(a, b) {
+        let i = 0;
+
+        for (let j = 0; j < b.length; j++) {
+            if (a[i] === b[j]) {
+                i++;
+            }
+        }
+
+        return i === a.length;
+    }
+
+    for (let i = 0; i < strs.length; i++) {
+        let uncommon = true;
+
+        for (let j = 0; j < strs.length; j++) {
+            if (i === j) continue;
+
+            // strs[i]가 다른 문자열의 부분수열이면 탈락
+            if (isSubsequence(strs[i], strs[j])) {
+                uncommon = false;
+                break;
+            }
+        }
+
+        if (uncommon) {
+            ans = Math.max(ans, strs[i].length);
+        }
+    }
+
+    return ans;
+};