Added tasks 543-1143

Author: ThanhNIT

README.md

@@ -111,7 +111,7 @@ Rust-based LeetCode algorithm problem solutions, regularly updated.
 |-|-|-|-|-|-
 | 0094 |[Binary Tree Inorder Traversal](src/main/rust/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.rs)| 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/rust/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.rs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 1 | 80.61
-| 0543 |[Diameter of Binary Tree](src/main/rust/g0501_0600/s0543_diameter_of_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 1 | 65.86
+| 0543 |[Diameter of Binary Tree](src/main/rust/g0501_0600/s0543_diameter_of_binary_tree/Solution.rs)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
 | 0226 |[Invert Binary Tree](src/main/rust/g0201_0300/s0226_invert_binary_tree/Solution.rs)| 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/rust/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.rs)| 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) | 1 | 80.46
 | 0124 |[Binary Tree Maximum Path Sum](src/main/rust/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.rs)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00
@@ -140,6 +140,7 @@ Rust-based LeetCode algorithm problem solutions, regularly updated.
 | 0070 |[Climbing Stairs](src/main/rust/g0001_0100/s0070_climbing_stairs/Solution.rs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
 | 0064 |[Minimum Path Sum](src/main/rust/g0001_0100/s0064_minimum_path_sum/Solution.rs)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00
 | 0300 |[Longest Increasing Subsequence](src/main/rust/g0201_0300/s0300_longest_increasing_subsequence/Solution.rs)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 0 | 100.00
+| 1143 |[Longest Common Subsequence](src/main/rust/g1101_1200/s1143_longest_common_subsequence/Solution.rs)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 4 | 78.99
 | 0072 |[Edit Distance](src/main/rust/g0001_0100/s0072_edit_distance/Solution.rs)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 0 | 100.00
 | 0010 |[Regular Expression Matching](src/main/rust/g0001_0100/s0010_regular_expression_matching/Solution.rs)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00
 
@@ -284,6 +285,7 @@ Rust-based LeetCode algorithm problem solutions, regularly updated.
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0238 |[Product of Array Except Self](src/main/rust/g0201_0300/s0238_product_of_array_except_self/Solution.rs)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 8 | 87.13
+| 0560 |[Subarray Sum Equals K](src/main/rust/g0501_0600/s0560_subarray_sum_equals_k/Solution.rs)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Big_O_Time_O(n)_Space_O(n) | 7 | 96.88
 
 #### Day 6 String
 
@@ -294,6 +296,7 @@ Rust-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0763 |[Partition Labels](src/main/rust/g0701_0800/s0763_partition_labels/Solution.rs)| Medium | String, Hash_Table, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 1 | 97.06
 
 #### Day 8 String
 
@@ -564,6 +567,7 @@ Rust-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 1143 |[Longest Common Subsequence](src/main/rust/g1101_1200/s1143_longest_common_subsequence/Solution.rs)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 4 | 78.99
 
 #### Day 18 Dynamic Programming
 
@@ -870,6 +874,7 @@ Rust-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 1143 |[Longest Common Subsequence](src/main/rust/g1101_1200/s1143_longest_common_subsequence/Solution.rs)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 4 | 78.99
 | 0072 |[Edit Distance](src/main/rust/g0001_0100/s0072_edit_distance/Solution.rs)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 0 | 100.00
 
 #### Day 20
@@ -978,6 +983,7 @@ Rust-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0739 |[Daily Temperatures](src/main/rust/g0701_0800/s0739_daily_temperatures/Solution.rs)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(n) | 33 | 91.80
 
 #### Day 7
 
@@ -1307,7 +1313,7 @@ Rust-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0543 |[Diameter of Binary Tree](src/main/rust/g0501_0600/s0543_diameter_of_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 1 | 65.86
+| 0543 |[Diameter of Binary Tree](src/main/rust/g0501_0600/s0543_diameter_of_binary_tree/Solution.rs)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
 | 0437 |[Path Sum III](src/main/rust/g0401_0500/s0437_path_sum_iii/Solution.rs)| Medium | Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
 
 #### Day 8 Binary Search
@@ -1394,7 +1400,12 @@ Rust-based LeetCode algorithm problem solutions, regularly updated.
 
 | #    |      Title     | Difficulty  | Tag         | Time, ms | Time, %
 |------|----------------|-------------|-------------|----------|---------
-| 0543 |[Diameter of Binary Tree](src/main/rust/g0501_0600/s0543_diameter_of_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 1 | 65.86
+| 1143 |[Longest Common Subsequence](src/main/rust/g1101_1200/s1143_longest_common_subsequence/Solution.rs)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Algorithm_II_Day_17_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 4 | 78.99
+| 0763 |[Partition Labels](src/main/rust/g0701_0800/s0763_partition_labels/Solution.rs)| Medium | String, Hash_Table, Greedy, Two_Pointers, Data_Structure_II_Day_7_String, Big_O_Time_O(n)_Space_O(1) | 1 | 97.06
+| 0739 |[Daily Temperatures](src/main/rust/g0701_0800/s0739_daily_temperatures/Solution.rs)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, Programming_Skills_II_Day_6, Big_O_Time_O(n)_Space_O(n) | 33 | 91.80
+| 0647 |[Palindromic Substrings](src/main/rust/g0601_0700/s0647_palindromic_substrings/Solution.rs)| Medium | String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n) | 0 | 100.00
+| 0560 |[Subarray Sum Equals K](src/main/rust/g0501_0600/s0560_subarray_sum_equals_k/Solution.rs)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Data_Structure_II_Day_5_Array, Big_O_Time_O(n)_Space_O(n) | 7 | 96.88
+| 0543 |[Diameter of Binary Tree](src/main/rust/g0501_0600/s0543_diameter_of_binary_tree/Solution.rs)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
 | 0494 |[Target Sum](src/main/rust/g0401_0500/s0494_target_sum/Solution.rs)| Medium | Array, Dynamic_Programming, Backtracking, Big_O_Time_O(n\*(sum+s))_Space_O(n\*(sum+s)) | 3 | 83.33
 | 0438 |[Find All Anagrams in a String](src/main/rust/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.rs)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Programming_Skills_II_Day_12, Level_1_Day_12_Sliding_Window/Two_Pointer, Big_O_Time_O(n+m)_Space_O(1) | 2 | 89.29
 | 0437 |[Path Sum III](src/main/rust/g0401_0500/s0437_path_sum_iii/Solution.rs)| Medium | Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00

src/main/rust/g0501_0600/s0543_diameter_of_binary_tree/Solution.rs

@@ -0,0 +1,51 @@
+// #Easy #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree
+// #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
+// #2024_09_13_Time_0_ms_(100.00%)_Space_3.9_MB_(13.76%)
+
+// Definition for a binary tree node.
+// #[derive(Debug, PartialEq, Eq)]
+// pub struct TreeNode {
+//   pub val: i32,
+//   pub left: Option<Rc<RefCell<TreeNode>>>,
+//   pub right: Option<Rc<RefCell<TreeNode>>>,
+// }
+// 
+// impl TreeNode {
+//   #[inline]
+//   pub fn new(val: i32) -> Self {
+//     TreeNode {
+//       val,
+//       left: None,
+//       right: None
+//     }
+//   }
+// }
+use std::rc::Rc;
+use std::cell::RefCell;
+use std::cmp::max;
+impl Solution {
+    pub fn diameter_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
+        let mut diameter = 0;
+
+        fn helper(root: Option<Rc<RefCell<TreeNode>>>, diameter: &mut i32) -> (i32, i32) {
+            if let Some(root) = root {
+                let (l1, l2) = helper(root.borrow().left.clone(), diameter);
+                let (r1, r2) = helper(root.borrow().right.clone(), diameter);
+
+                *diameter = max(*diameter, l1 + l2);
+                *diameter = max(*diameter, r1 + r2);
+
+                let l = l1.max(l2) + 1;
+                let r = r1.max(r2) + 1;
+                return (l, r);
+            }
+
+            // (depth, diameter that doesn't pass through )
+            (-1, -1)
+        }
+
+        let (l, r) = helper(root, &mut diameter);
+        diameter = max(diameter, l + r);
+        diameter
+    }
+}

src/main/rust/g0501_0600/s0543_diameter_of_binary_tree/readme.md

@@ -0,0 +1,30 @@
+543\. Diameter of Binary Tree
+
+Easy
+
+Given the `root` of a binary tree, return _the length of the **diameter** of the tree_.
+
+The **diameter** of a binary tree is the **length** of the longest path between any two nodes in a tree. This path may or may not pass through the `root`.
+
+The **length** of a path between two nodes is represented by the number of edges between them.
+
+**Example 1:**
+
+![](https://assets.leetcode.com/uploads/2021/03/06/diamtree.jpg)
+
+**Input:** root = [1,2,3,4,5]
+
+**Output:** 3
+
+**Explanation:** 3 is the length of the path [4,2,1,3] or [5,2,1,3].
+
+**Example 2:**
+
+**Input:** root = [1,2]
+
+**Output:** 1
+
+**Constraints:**
+
+*   The number of nodes in the tree is in the range <code>[1, 10<sup>4</sup>]</code>.
+*   `-100 <= Node.val <= 100`

src/main/rust/g0501_0600/s0560_subarray_sum_equals_k/Solution.rs

@@ -0,0 +1,24 @@
+// #Medium #Top_100_Liked_Questions #Array #Hash_Table #Prefix_Sum #Data_Structure_II_Day_5_Array
+// #Big_O_Time_O(n)_Space_O(n) #2024_09_13_Time_7_ms_(96.88%)_Space_2.8_MB_(25.00%)
+
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn subarray_sum(nums: Vec<i32>, k: i32) -> i32 {
+        let mut temp_sum = 0;
+        let mut ret = 0;
+        let mut sum_count: HashMap<i32, i32> = HashMap::new();
+        sum_count.insert(0, 1);
+        
+        for &num in nums.iter() {
+            temp_sum += num;
+            if let Some(&count) = sum_count.get(&(temp_sum - k)) {
+                ret += count;
+            }
+            let entry = sum_count.entry(temp_sum).or_insert(0);
+            *entry += 1;
+        }
+        
+        ret
+    }
+}

src/main/rust/g0501_0600/s0560_subarray_sum_equals_k/readme.md

@@ -0,0 +1,25 @@
+560\. Subarray Sum Equals K
+
+Medium
+
+Given an array of integers `nums` and an integer `k`, return _the total number of subarrays whose sum equals to_ `k`.
+
+A subarray is a contiguous **non-empty** sequence of elements within an array.
+
+**Example 1:**
+
+**Input:** nums = [1,1,1], k = 2
+
+**Output:** 2
+
+**Example 2:**
+
+**Input:** nums = [1,2,3], k = 3
+
+**Output:** 2
+
+**Constraints:**
+
+*   <code>1 <= nums.length <= 2 * 10<sup>4</sup></code>
+*   `-1000 <= nums[i] <= 1000`
+*   <code>-10<sup>7</sup> <= k <= 10<sup>7</sup></code>

src/main/rust/g0601_0700/s0647_palindromic_substrings/Solution.rs

@@ -0,0 +1,26 @@
+// #Medium #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n)
+// #2024_09_13_Time_0_ms_(100.00%)_Space_2.2_MB_(38.46%)
+
+impl Solution {
+    fn expand(s: &[char], mut l: i32, mut r: i32, res: &mut i32) {
+        while l >= 0 && (r as usize) < s.len() {
+            if s[l as usize] != s[r as usize] {
+                return;
+            } else {
+                *res += 1;
+                l -= 1;
+                r += 1;
+            }
+        }
+    }
+
+    pub fn count_substrings(s: String) -> i32 {
+        let a: Vec<char> = s.chars().collect();
+        let mut res = 0;
+        for i in 0..a.len() {
+            Solution::expand(&a, i as i32, i as i32, &mut res);       // Odd length palindromes
+            Solution::expand(&a, i as i32, (i + 1) as i32, &mut res); // Even length palindromes
+        }
+        res
+    }
+}

src/main/rust/g0601_0700/s0647_palindromic_substrings/readme.md

@@ -0,0 +1,30 @@
+647\. Palindromic Substrings
+
+Medium
+
+Given a string `s`, return _the number of **palindromic substrings** in it_.
+
+A string is a **palindrome** when it reads the same backward as forward.
+
+A **substring** is a contiguous sequence of characters within the string.
+
+**Example 1:**
+
+**Input:** s = "abc"
+
+**Output:** 3
+
+**Explanation:** Three palindromic strings: "a", "b", "c".
+
+**Example 2:**
+
+**Input:** s = "aaa"
+
+**Output:** 6
+
+**Explanation:** Six palindromic strings: "a", "a", "a", "aa", "aa", "aaa".
+
+**Constraints:**
+
+*   `1 <= s.length <= 1000`
+*   `s` consists of lowercase English letters.

src/main/rust/g0701_0800/s0739_daily_temperatures/Solution.rs

@@ -0,0 +1,21 @@
+// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6
+// #Big_O_Time_O(n)_Space_O(n) #2024_09_13_Time_33_ms_(91.80%)_Space_3.4_MB_(99.45%)
+
+impl Solution {
+    pub fn daily_temperatures(temperatures: Vec<i32>) -> Vec<i32> {
+        let mut sol = vec![0; temperatures.len()];
+        for i in (0..temperatures.len() - 1).rev() {
+            let mut j = i + 1;
+            while j < temperatures.len() {
+                if temperatures[i] < temperatures[j] {
+                    sol[i] = (j - i) as i32;
+                    break;
+                } else if sol[j] == 0 {
+                    break;
+                }
+                j += sol[j] as usize;
+            }
+        }
+        sol
+    }
+}

src/main/rust/g0701_0800/s0739_daily_temperatures/readme.md

@@ -0,0 +1,28 @@
+739\. Daily Temperatures
+
+Medium
+
+Given an array of integers `temperatures` represents the daily temperatures, return _an array_ `answer` _such that_ `answer[i]` _is the number of days you have to wait after the_ <code>i<sup>th</sup></code> _day to get a warmer temperature_. If there is no future day for which this is possible, keep `answer[i] == 0` instead.
+
+**Example 1:**
+
+**Input:** temperatures = [73,74,75,71,69,72,76,73]
+
+**Output:** [1,1,4,2,1,1,0,0]
+
+**Example 2:**
+
+**Input:** temperatures = [30,40,50,60]
+
+**Output:** [1,1,1,0]
+
+**Example 3:**
+
+**Input:** temperatures = [30,60,90]
+
+**Output:** [1,1,0]
+
+**Constraints:**
+
+*   <code>1 <= temperatures.length <= 10<sup>5</sup></code>
+*   `30 <= temperatures[i] <= 100`

src/main/rust/g0701_0800/s0763_partition_labels/Solution.rs

@@ -0,0 +1,36 @@
+// #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String
+// #Big_O_Time_O(n)_Space_O(1) #2024_09_13_Time_1_ms_(97.06%)_Space_2.1_MB_(41.18%)
+
+impl Solution {
+    pub fn partition_labels(s: String) -> Vec<i32> {
+        let letters: Vec<char> = s.chars().collect();
+        let mut result = Vec::new();
+        let mut position = vec![0; 26];
+
+        // Store the last occurrence of each letter in the string
+        for (i, &ch) in letters.iter().enumerate() {
+            position[(ch as usize) - ('a' as usize)] = i;
+        }
+
+        let mut i = 0;
+        let mut prev = -1;
+        let mut max = 0;
+
+        // Iterate over the string to find partitions
+        while i < letters.len() {
+            let ch_pos = position[(letters[i] as usize) - ('a' as usize)];
+            if ch_pos > max {
+                max = ch_pos;
+            }
+
+            if i == max {
+                result.push((i as i32) - (prev as i32));
+                prev = i as i32;
+            }
+
+            i += 1;
+        }
+
+        result
+    }
+}

src/main/rust/g0701_0800/s0763_partition_labels/readme.md

@@ -0,0 +1,28 @@
+763\. Partition Labels
+
+Medium
+
+You are given a string `s`. We want to partition the string into as many parts as possible so that each letter appears in at most one part.
+
+Note that the partition is done so that after concatenating all the parts in order, the resultant string should be `s`.
+
+Return _a list of integers representing the size of these parts_.
+
+**Example 1:**
+
+**Input:** s = "ababcbacadefegdehijhklij"
+
+**Output:** [9,7,8]
+
+**Explanation:** The partition is "ababcbaca", "defegde", "hijhklij". This is a partition so that each letter appears in at most one part. A partition like "ababcbacadefegde", "hijhklij" is incorrect, because it splits s into less parts.
+
+**Example 2:**
+
+**Input:** s = "eccbbbbdec"
+
+**Output:** [10]
+
+**Constraints:**
+
+*   `1 <= s.length <= 500`
+*   `s` consists of lowercase English letters.