Added tasks 207-226

Author: ThanhNIT

README.md

@@ -493,6 +493,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0064 |[Minimum Path Sum](src/main/js/g0001_0100/s0064_minimum_path_sum/solution.js)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 3 | 83.07
+| 0221 |[Maximal Square](src/main/js/g0201_0300/s0221_maximal_square/solution.js)| Medium | Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 12 | 87.32
 
 #### Day 17
 
@@ -936,6 +937,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0226 |[Invert Binary Tree](src/main/js/g0201_0300/s0226_invert_binary_tree/solution.js)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
 
 #### Day 7 Tree
 
@@ -994,6 +996,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0155 |[Min Stack](src/main/js/g0101_0200/s0155_min_stack/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 6 | 99.32
+| 0208 |[Implement Trie (Prefix Tree)](src/main/js/g0201_0300/s0208_implement_trie_prefix_tree/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 39 | 93.97
 
 #### Day 17 Interval
 
@@ -1104,6 +1107,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
 |-|-|-|-|-|-
 | 0094 |[Binary Tree Inorder Traversal](src/main/js/g0001_0100/s0094_binary_tree_inorder_traversal/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
 | 0102 |[Binary Tree Level Order Traversal](src/main/js/g0101_0200/s0102_binary_tree_level_order_traversal/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 1 | 87.97
+| 0226 |[Invert Binary Tree](src/main/js/g0201_0300/s0226_invert_binary_tree/solution.js)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
 | 0104 |[Maximum Depth of Binary Tree](src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00
 | 0124 |[Binary Tree Maximum Path Sum](src/main/js/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.js)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 1 | 98.34
 | 0098 |[Validate Binary Search Tree](src/main/js/g0001_0100/s0098_validate_binary_search_tree/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00
@@ -1112,6 +1116,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0208 |[Implement Trie (Prefix Tree)](src/main/js/g0201_0300/s0208_implement_trie_prefix_tree/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 39 | 93.97
 
 #### Udemy Graph
 
@@ -1225,6 +1230,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0226 |[Invert Binary Tree](src/main/js/g0201_0300/s0226_invert_binary_tree/solution.js)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
 
 #### Day 13 Tree
 
@@ -1353,6 +1359,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0215 |[Kth Largest Element in an Array](src/main/js/g0201_0300/s0215_kth_largest_element_in_an_array/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 9 | 97.67
 
 #### Day 21 Heap Priority Queue
 
@@ -1363,6 +1370,11 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
 
 | #    |      Title     | Difficulty  | Tag         | Time, ms | Time, %
 |------|----------------|-------------|-------------|----------|---------
+| 0226 |[Invert Binary Tree](src/main/js/g0201_0300/s0226_invert_binary_tree/solution.js)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree, Level_2_Day_6_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
+| 0221 |[Maximal Square](src/main/js/g0201_0300/s0221_maximal_square/solution.js)| Medium | Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Big_O_Time_O(m\*n)_Space_O(m\*n) | 12 | 87.32
+| 0215 |[Kth Largest Element in an Array](src/main/js/g0201_0300/s0215_kth_largest_element_in_an_array/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Data_Structure_II_Day_20_Heap_Priority_Queue, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 9 | 97.67
+| 0208 |[Implement Trie (Prefix Tree)](src/main/js/g0201_0300/s0208_implement_trie_prefix_tree/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Level_2_Day_16_Design, Udemy_Trie_and_Heap, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 39 | 93.97
+| 0207 |[Course Schedule](src/main/js/g0201_0300/s0207_course_schedule/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Big_O_Time_O(N)_Space_O(N) | 6 | 95.35
 | 0206 |[Reverse Linked List](src/main/js/g0201_0300/s0206_reverse_linked_list/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_8_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00
 | 0200 |[Number of Islands](src/main/js/g0101_0200/s0200_number_of_islands/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS, Udemy_Graph, Big_O_Time_O(M\*N)_Space_O(M\*N) | 62 | 90.80
 | 0198 |[House Robber](src/main/js/g0101_0200/s0198_house_robber/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3, Level_2_Day_12_Dynamic_Programming, Udemy_Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00

src/main/js/g0101_0200/s0169_majority_element/solution.js

@@ -7,8 +7,8 @@
  * @return {number}
  */
 var majorityElement = function(arr) {
-    let count = 1;
-    let majority = arr[0];
+    let count = 1
+    let majority = arr[0]
 
     // For Potential Majority Element
     for (let i = 1; i < arr.length; i++) {
@@ -22,17 +22,17 @@ var majorityElement = function(arr) {
     }
 
     // For Confirmation
-    count = 0;
+    count = 0
     for (const num of arr) {
         if (num === majority) {
-            count++;
+            count++
         }
     }
 
     if (count >= Math.floor(arr.length / 2) + 1) {
-        return majority;
+        return majority
     } else {
-        return -1;
+        return -1
     }
 };
 

src/main/js/g0101_0200/s0189_rotate_array/solution.js

@@ -9,20 +9,20 @@
  */
 var reverse = function(nums, l, r) {
     while (l <= r) {
-        let temp = nums[l];
-        nums[l] = nums[r];
-        nums[r] = temp;
-        l++;
-        r--;
+        let temp = nums[l]
+        nums[l] = nums[r]
+        nums[r] = temp
+        l++
+        r--
     }
 };
 
 const rotate = function(nums, k) {
-    const n = nums.length;
-    const t = n - (k % n);
-    reverse(nums, 0, t - 1);
-    reverse(nums, t, n - 1);
-    reverse(nums, 0, n - 1);
+    const n = nums.length
+    const t = n - (k % n)
+    reverse(nums, 0, t - 1)
+    reverse(nums, t, n - 1)
+    reverse(nums, 0, n - 1)
 };
 
 export { rotate }

src/main/js/g0101_0200/s0198_house_robber/solution.js

@@ -9,24 +9,24 @@
  */
 var rob = function(nums) {
     if (nums.length === 0) {
-        return 0;
+        return 0
     }
     if (nums.length === 1) {
-        return nums[0];
+        return nums[0]
     }
     if (nums.length === 2) {
-        return Math.max(nums[0], nums[1]);
+        return Math.max(nums[0], nums[1])
     }
 
-    const profit = new Array(nums.length);
-    profit[0] = nums[0];
-    profit[1] = Math.max(nums[0], nums[1]);
+    const profit = new Array(nums.length)
+    profit[0] = nums[0]
+    profit[1] = Math.max(nums[0], nums[1])
 
     for (let i = 2; i < nums.length; i++) {
-        profit[i] = Math.max(profit[i - 1], nums[i] + profit[i - 2]);
+        profit[i] = Math.max(profit[i - 1], nums[i] + profit[i - 2])
     }
 
-    return profit[nums.length - 1];
+    return profit[nums.length - 1]
 };
 
 export { rob }

src/main/js/g0101_0200/s0200_number_of_islands/solution.js

@@ -9,21 +9,21 @@
  * @return {number}
  */
 var numIslands = function(grid) {
-    let islands = 0;
+    let islands = 0
 
     if (grid && grid.length > 0 && grid[0].length > 0) {
         for (let i = 0; i < grid.length; i++) {
             for (let j = 0; j < grid[0].length; j++) {
                 if (grid[i][j] === '1') {
-                    dfs(grid, i, j);
-                    islands++;
+                    dfs(grid, i, j)
+                    islands++
                 }
             }
         }
     }
 
-    return islands;
-}
+    return islands
+};
 
 const dfs = function(grid, x, y) {
     if (
@@ -33,15 +33,15 @@ const dfs = function(grid, x, y) {
         y >= grid[0].length ||
         grid[x][y] !== '1'
     ) {
-        return;
+        return
     }
 
-    grid[x][y] = 'x'; // Mark as visited
+    grid[x][y] = 'x' // Mark as visited
 
-    dfs(grid, x + 1, y); // Down
-    dfs(grid, x - 1, y); // Up
-    dfs(grid, x, y + 1); // Right
-    dfs(grid, x, y - 1); // Left
-}
+    dfs(grid, x + 1, y) // Down
+    dfs(grid, x - 1, y) // Up
+    dfs(grid, x, y + 1) // Right
+    dfs(grid, x, y - 1) // Left
+};
 
 export { numIslands }

src/main/js/g0201_0300/s0206_reverse_linked_list/solution.js

@@ -15,17 +15,17 @@
  * @return {ListNode}
  */
 var reverseList = function(head) {
-    let prev = null;
-    let curr = head;
+    let prev = null
+    let curr = head
 
     while (curr !== null) {
-        let next = curr.next;
-        curr.next = prev;
-        prev = curr;
-        curr = next;
+        let next = curr.next
+        curr.next = prev
+        prev = curr
+        curr = next
     }
 
-    return prev;
+    return prev
 };
 
 export { reverseList }

src/main/js/g0201_0300/s0207_course_schedule/readme.md

@@ -0,0 +1,33 @@
+207\. Course Schedule
+
+Medium
+
+There are a total of `numCourses` courses you have to take, labeled from `0` to `numCourses - 1`. You are given an array `prerequisites` where <code>prerequisites[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that you **must** take course <code>b<sub>i</sub></code> first if you want to take course <code>a<sub>i</sub></code>.
+
+*   For example, the pair `[0, 1]`, indicates that to take course `0` you have to first take course `1`.
+
+Return `true` if you can finish all courses. Otherwise, return `false`.
+
+**Example 1:**
+
+**Input:** numCourses = 2, prerequisites = [[1,0]]
+
+**Output:** true
+
+**Explanation:** There are a total of 2 courses to take. To take course 1 you should have finished course 0. So it is possible.
+
+**Example 2:**
+
+**Input:** numCourses = 2, prerequisites = [[1,0],[0,1]]
+
+**Output:** false
+
+**Explanation:** There are a total of 2 courses to take. To take course 1 you should have finished course 0, and to take course 0 you should also have finished course 1. So it is impossible.
+
+**Constraints:**
+
+*   `1 <= numCourses <= 2000`
+*   `0 <= prerequisites.length <= 5000`
+*   `prerequisites[i].length == 2`
+*   <code>0 <= a<sub>i</sub>, b<sub>i</sub> < numCourses</code>
+*   All the pairs prerequisites[i] are **unique**.

src/main/js/g0201_0300/s0207_course_schedule/solution.js

@@ -0,0 +1,48 @@
+// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search
+// #Breadth_First_Search #Graph #Topological_Sort #Big_O_Time_O(N)_Space_O(N)
+// #2024_12_17_Time_6_ms_(95.35%)_Space_57_MB_(39.46%)
+
+/**
+ * @param {number} numCourses
+ * @param {number[][]} prerequisites
+ * @return {boolean}
+ */
+const WHITE = 0;
+const GRAY = 1;
+const BLACK = 2;
+
+var canFinish = function(numCourses, prerequisites) {
+    const adj = Array.from({ length: numCourses }, () => []);
+
+    for (const [course, prerequisite] of prerequisites) {
+        adj[prerequisite].push(course);
+    }
+
+    const colors = new Array(numCourses).fill(WHITE);
+
+    for (let i = 0; i < numCourses; i++) {
+        if (colors[i] === WHITE && adj[i].length > 0 && hasCycle(adj, i, colors)) {
+            return false;
+        }
+    }
+
+    return true;
+};
+
+var hasCycle = function(adj, node, colors) {
+    colors[node] = GRAY;
+
+    for (const neighbor of adj[node]) {
+        if (colors[neighbor] === GRAY) {
+            return true;
+        }
+        if (colors[neighbor] === WHITE && hasCycle(adj, neighbor, colors)) {
+            return true;
+        }
+    }
+
+    colors[node] = BLACK;
+    return false;
+};
+
+export { canFinish }

src/main/js/g0201_0300/s0208_implement_trie_prefix_tree/readme.md

@@ -0,0 +1,40 @@
+208\. Implement Trie (Prefix Tree)
+
+Medium
+
+A [**trie**](https://en.wikipedia.org/wiki/Trie) (pronounced as "try") or **prefix tree** is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker.
+
+Implement the Trie class:
+
+*   `Trie()` Initializes the trie object.
+*   `void insert(String word)` Inserts the string `word` into the trie.
+*   `boolean search(String word)` Returns `true` if the string `word` is in the trie (i.e., was inserted before), and `false` otherwise.
+*   `boolean startsWith(String prefix)` Returns `true` if there is a previously inserted string `word` that has the prefix `prefix`, and `false` otherwise.
+
+**Example 1:**
+
+**Input** ["Trie", "insert", "search", "search", "startsWith", "insert", "search"] [[], ["apple"], ["apple"], ["app"], ["app"], ["app"], ["app"]]
+
+**Output:** [null, null, true, false, true, null, true]
+
+**Explanation:** 
+
+Trie trie = new Trie(); 
+
+trie.insert("apple"); 
+
+trie.search("apple"); // return True 
+
+trie.search("app"); // return False 
+
+trie.startsWith("app"); // return True 
+
+trie.insert("app"); 
+
+trie.search("app"); // return True
+
+**Constraints:**
+
+*   `1 <= word.length, prefix.length <= 2000`
+*   `word` and `prefix` consist only of lowercase English letters.
+*   At most <code>3 * 10<sup>4</sup></code> calls **in total** will be made to `insert`, `search`, and `startsWith`.