diff --git a/solution/1900-1999/1980.Find Unique Binary String/README.md b/solution/1900-1999/1980.Find Unique Binary String/README.md
index 999e51b5a4c92..18ccda6ac4e4b 100644
--- a/solution/1900-1999/1980.Find Unique Binary String/README.md	
+++ b/solution/1900-1999/1980.Find Unique Binary String/README.md	
@@ -192,4 +192,84 @@ public class Solution {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### 方法二
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function findDifferentBinaryString(nums: string[]): string {
+    const set = new Set(nums.map(x => Number.parseInt(x, 2)));
+    let res = 0;
+
+    while (set.has(res)) {
+        res++;
+    }
+
+    return res.toString(2).padStart(nums[0].length, '0');
+}
+```
+
+#### JavaScript
+
+```js
+function findDifferentBinaryString(nums) {
+    const set = new Set(nums.map(x => Number.parseInt(x, 2)));
+    let res = 0;
+
+    while (set.has(res)) {
+        res++;
+    }
+
+    return res.toString(2).padStart(nums[0].length, '0');
+}
+```
+
+<!-- solution:end -->
+
+<!-- tabs:end -->
+
+<!-- solution:start -->
+
+### 方法三
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function findDifferentBinaryString(nums: string[]): string {
+    const res: string[] = [];
+
+    for (let i = 0; i < nums.length; i++) {
+        const x = nums[i][i];
+        res.push(x === '0' ? '1' : '0');
+    }
+
+    return res.join('');
+}
+```
+
+#### JavaScript
+
+```js
+function findDifferentBinaryString(nums) {
+    const res = [];
+
+    for (let i = 0; i < nums.length; i++) {
+        const x = nums[i][i];
+        res.push(x === '0' ? '1' : '0');
+    }
+
+    return res.join('');
+}
+```
+
+<!-- solution:end -->
+
+<!-- tabs:end -->
+
 <!-- problem:end -->
diff --git a/solution/1900-1999/1980.Find Unique Binary String/README_EN.md b/solution/1900-1999/1980.Find Unique Binary String/README_EN.md
index bbef5ad0084a6..d81284ee1c248 100644
--- a/solution/1900-1999/1980.Find Unique Binary String/README_EN.md	
+++ b/solution/1900-1999/1980.Find Unique Binary String/README_EN.md	
@@ -191,4 +191,84 @@ public class Solution {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function findDifferentBinaryString(nums: string[]): string {
+    const set = new Set(nums.map(x => Number.parseInt(x, 2)));
+    let res = 0;
+
+    while (set.has(res)) {
+        res++;
+    }
+
+    return res.toString(2).padStart(nums[0].length, '0');
+}
+```
+
+#### JavaScript
+
+```js
+function findDifferentBinaryString(nums) {
+    const set = new Set(nums.map(x => Number.parseInt(x, 2)));
+    let res = 0;
+
+    while (set.has(res)) {
+        res++;
+    }
+
+    return res.toString(2).padStart(nums[0].length, '0');
+}
+```
+
+<!-- solution:end -->
+
+<!-- tabs:end -->
+
+<!-- solution:start -->
+
+### Solution 3
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function findDifferentBinaryString(nums: string[]): string {
+    const res: string[] = [];
+
+    for (let i = 0; i < nums.length; i++) {
+        const x = nums[i][i];
+        res.push(x === '0' ? '1' : '0');
+    }
+
+    return res.join('');
+}
+```
+
+#### JavaScript
+
+```js
+function findDifferentBinaryString(nums) {
+    const res = [];
+
+    for (let i = 0; i < nums.length; i++) {
+        const x = nums[i][i];
+        res.push(x === '0' ? '1' : '0');
+    }
+
+    return res.join('');
+}
+```
+
+<!-- solution:end -->
+
+<!-- tabs:end -->
+
 <!-- problem:end -->
diff --git a/solution/1900-1999/1980.Find Unique Binary String/Solution2.js b/solution/1900-1999/1980.Find Unique Binary String/Solution2.js
new file mode 100644
index 0000000000000..7960954a7ccd5
--- /dev/null
+++ b/solution/1900-1999/1980.Find Unique Binary String/Solution2.js	
@@ -0,0 +1,10 @@
+function findDifferentBinaryString(nums) {
+    const set = new Set(nums.map(x => Number.parseInt(x, 2)));
+    let res = 0;
+
+    while (set.has(res)) {
+        res++;
+    }
+
+    return res.toString(2).padStart(nums[0].length, '0');
+}
diff --git a/solution/1900-1999/1980.Find Unique Binary String/Solution2.ts b/solution/1900-1999/1980.Find Unique Binary String/Solution2.ts
new file mode 100644
index 0000000000000..9887a360428b9
--- /dev/null
+++ b/solution/1900-1999/1980.Find Unique Binary String/Solution2.ts	
@@ -0,0 +1,10 @@
+function findDifferentBinaryString(nums: string[]): string {
+    const set = new Set(nums.map(x => Number.parseInt(x, 2)));
+    let res = 0;
+
+    while (set.has(res)) {
+        res++;
+    }
+
+    return res.toString(2).padStart(nums[0].length, '0');
+}
diff --git a/solution/1900-1999/1980.Find Unique Binary String/Solution3.js b/solution/1900-1999/1980.Find Unique Binary String/Solution3.js
new file mode 100644
index 0000000000000..3f211f7a466a1
--- /dev/null
+++ b/solution/1900-1999/1980.Find Unique Binary String/Solution3.js	
@@ -0,0 +1,10 @@
+function findDifferentBinaryString(nums) {
+    const res = [];
+
+    for (let i = 0; i < nums.length; i++) {
+        const x = nums[i][i];
+        res.push(x === '0' ? '1' : '0');
+    }
+
+    return res.join('');
+}
diff --git a/solution/1900-1999/1980.Find Unique Binary String/Solution3.ts b/solution/1900-1999/1980.Find Unique Binary String/Solution3.ts
new file mode 100644
index 0000000000000..fbeeb873fb100
--- /dev/null
+++ b/solution/1900-1999/1980.Find Unique Binary String/Solution3.ts	
@@ -0,0 +1,10 @@
+function findDifferentBinaryString(nums: string[]): string {
+    const res: string[] = [];
+
+    for (let i = 0; i < nums.length; i++) {
+        const x = nums[i][i];
+        res.push(x === '0' ? '1' : '0');
+    }
+
+    return res.join('');
+}