diff --git a/solution/0200-0299/0210.Course Schedule II/README.md b/solution/0200-0299/0210.Course Schedule II/README.md
index b3b0f2d77f059..256e0b852fc8a 100644
--- a/solution/0200-0299/0210.Course Schedule II/README.md	
+++ b/solution/0200-0299/0210.Course Schedule II/README.md	
@@ -206,7 +206,7 @@ func findOrder(numCourses int, prerequisites [][]int) []int {
 
 ```ts
 function findOrder(numCourses: number, prerequisites: number[][]): number[] {
-    const g: number[][] = new Array(numCourses).fill(0).map(() => []);
+    const g: number[][] = Array.from({ length: numCourses }, () => []);
     const indeg: number[] = new Array(numCourses).fill(0);
     for (const [a, b] of prerequisites) {
         g[b].push(a);
@@ -214,7 +214,7 @@ function findOrder(numCourses: number, prerequisites: number[][]): number[] {
     }
     const q: number[] = [];
     for (let i = 0; i < numCourses; ++i) {
-        if (indeg[i] == 0) {
+        if (indeg[i] === 0) {
             q.push(i);
         }
     }
@@ -223,7 +223,7 @@ function findOrder(numCourses: number, prerequisites: number[][]): number[] {
         const i = q.shift()!;
         ans.push(i);
         for (const j of g[i]) {
-            if (--indeg[j] == 0) {
+            if (--indeg[j] === 0) {
                 q.push(j);
             }
         }
diff --git a/solution/0200-0299/0210.Course Schedule II/README_EN.md b/solution/0200-0299/0210.Course Schedule II/README_EN.md
index 21cc874d00480..c9eb7e1b9fd38 100644
--- a/solution/0200-0299/0210.Course Schedule II/README_EN.md	
+++ b/solution/0200-0299/0210.Course Schedule II/README_EN.md	
@@ -185,7 +185,7 @@ func findOrder(numCourses int, prerequisites [][]int) []int {
 
 ```ts
 function findOrder(numCourses: number, prerequisites: number[][]): number[] {
-    const g: number[][] = new Array(numCourses).fill(0).map(() => []);
+    const g: number[][] = Array.from({ length: numCourses }, () => []);
     const indeg: number[] = new Array(numCourses).fill(0);
     for (const [a, b] of prerequisites) {
         g[b].push(a);
@@ -193,7 +193,7 @@ function findOrder(numCourses: number, prerequisites: number[][]): number[] {
     }
     const q: number[] = [];
     for (let i = 0; i < numCourses; ++i) {
-        if (indeg[i] == 0) {
+        if (indeg[i] === 0) {
             q.push(i);
         }
     }
@@ -202,7 +202,7 @@ function findOrder(numCourses: number, prerequisites: number[][]): number[] {
         const i = q.shift()!;
         ans.push(i);
         for (const j of g[i]) {
-            if (--indeg[j] == 0) {
+            if (--indeg[j] === 0) {
                 q.push(j);
             }
         }
diff --git a/solution/0200-0299/0210.Course Schedule II/Solution.ts b/solution/0200-0299/0210.Course Schedule II/Solution.ts
index 71d560e8cb77e..7a2502a396290 100644
--- a/solution/0200-0299/0210.Course Schedule II/Solution.ts	
+++ b/solution/0200-0299/0210.Course Schedule II/Solution.ts	
@@ -1,5 +1,5 @@
 function findOrder(numCourses: number, prerequisites: number[][]): number[] {
-    const g: number[][] = new Array(numCourses).fill(0).map(() => []);
+    const g: number[][] = Array.from({ length: numCourses }, () => []);
     const indeg: number[] = new Array(numCourses).fill(0);
     for (const [a, b] of prerequisites) {
         g[b].push(a);
@@ -7,7 +7,7 @@ function findOrder(numCourses: number, prerequisites: number[][]): number[] {
     }
     const q: number[] = [];
     for (let i = 0; i < numCourses; ++i) {
-        if (indeg[i] == 0) {
+        if (indeg[i] === 0) {
             q.push(i);
         }
     }
@@ -16,7 +16,7 @@ function findOrder(numCourses: number, prerequisites: number[][]): number[] {
         const i = q.shift()!;
         ans.push(i);
         for (const j of g[i]) {
-            if (--indeg[j] == 0) {
+            if (--indeg[j] === 0) {
                 q.push(j);
             }
         }