Add longest_common_subsequence

Author: martwz

README.md

@@ -32,6 +32,7 @@ LeetCode is a website that has programming-related questions that are designed t
 | 452 | Minimum Number of Arrows to Burst Balloons | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/find_min_arrow_shots.rs) | [Leetcode](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/) | Medium |
 | 485 | Max Consecutive Ones | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/find_max_consecutive_ones.rs) | [Leetcode](https://leetcode.com/problems/max-consecutive-ones/) | Easy |
 | 495 | Teemo Attacking | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/find_poisoned_duration.rs) | [Leetcode](https://leetcode.com/problems/teemo-attacking/) | Easy |
+| 698 | Partition to K Equal Sum Subsets | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/can_partition_k_subsets.rs) | [Leetcode](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/) | Medium |
 | 713 | Subarray Product Less Than K | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/num_subarray_product_less_than_k.rs) | [Leetcode](https://leetcode.com/problems/subarray-product-less-than-k/) | Medium |
 | 725 | Split Linked List in Parts | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/split_list_to_parts.rs) | [Leetcode](https://leetcode.com/problems/split-linked-list-in-parts/) | Medium |
 | 774 | Minimize Max Distance to Gas Station | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/minmax_gas_dist.rs) | [Leetcode](https://leetcode.com/problems/minimize-max-distance-to-gas-station/) | Medium |
@@ -41,6 +42,7 @@ LeetCode is a website that has programming-related questions that are designed t
 | 1035 | Uncrossed Lines | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/max_uncrossed_lines.rs) | [Leetcode](https://leetcode.com/problems/uncrossed-lines/) | Medium |
 | 1134 | Armstrong Number | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/is_good_array.rs) | [Leetcode](https://leetcode.com/problems/armstrong-number/) | Easy |
 | 1137 | N-th Tribonacci Number | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/tribonacci.rs) | [Leetcode](https://leetcode.com/problems/n-th-tribonacci-number/) | Easy |
+| 1143 | Longest Common Subsequence | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/longest_common_subsequence.rs) | [Leetcode](https://leetcode.com/problems/longest-common-subsequence/) | Medium |
 | 1239 | Maximum Length of a Concatenated String with Unique Characters | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/max_length.rs) | [Leetcode](https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/) | Medium |
 | 1275 | Find Winner on a Tic Tac Toe Game | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/tictactoe.rs) | [Leetcode](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/) | Easy |
 | 1293 | Shortest Path in a Grid with Obstacles Elimination | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/shortest_path.rs) | [Leetcode](https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/) | Hard |

src/leetcode/challenge/longest_common_subsequence.rs

@@ -0,0 +1,47 @@
+// 1143. Longest Common Subsequence, Medium
+// https://leetcode.com/problems/longest-common-subsequence/
+impl Solution {
+    pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
+        let [n, m] = [text1.len(), text2.len()];
+        let mut dp = vec![vec![0; n + 1]; m + 1];
+        
+        for i in 0..n {
+            for j in 0..m {
+                if text1.chars().nth(i).unwrap() == text2.chars().nth(j).unwrap() {
+                    dp[j + 1][i + 1] = dp[j][i] + 1;
+                } else {
+                  dp[j + 1][i + 1] = dp[j + 1][i].max(dp[j][i + 1]);
+                }
+            }
+        }
+
+        *dp.last().unwrap().last().unwrap()
+    }
+}
+
+struct Solution {}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_longest_common_subsequence() {
+        assert_eq!(Solution::longest_common_subsequence("abcde".to_string(), "ace".to_string()), 3);
+    }
+
+    #[test]
+    fn test_longest_common_subsequence2() {
+        assert_eq!(Solution::longest_common_subsequence("abc".to_string(), "abc".to_string()), 3);
+    }
+
+    #[test]
+    fn test_longest_common_subsequence3() {
+        assert_eq!(Solution::longest_common_subsequence("abc".to_string(), "def".to_string()), 0);
+    }
+
+    #[test]
+    fn test_longest_common_subsequence4() {
+        assert_eq!(Solution::longest_common_subsequence("abc".to_string(), "".to_string()), 0);
+    }
+}

src/leetcode/challenge/mod.rs

@@ -2,6 +2,7 @@ mod break_palindrome;
 mod can_partition_k_subsets;
 mod find_max_consecutive_ones;
 mod intersect;
+mod longest_common_subsequence;
 mod max_length;
 mod max_sub_array_len;
 mod minmax_gas_dist;