Add two solutions

Author: martwz

README.md

@@ -6,7 +6,7 @@
 
 LeetCode is a website that has programming-related questions that are designed to be solved in a limited amount of time. This repository is a collection of some of my solutions written in [Rust](https://www.rust-lang.org/).
 
-## Solutions (80) 
+## Solutions (82) 
 | No. | Title | Solution | Problem | Difficulty |
 |:---:|:------|:--------:|:-------:|:----------:|
 | 1 | Two Sum | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/two_sum.rs) | [Leetcode](https://leetcode.com/problems/two-sum/) | Easy |
@@ -49,6 +49,7 @@ LeetCode is a website that has programming-related questions that are designed t
 | 463 | Island Perimeter | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/island_perimeter.rs) | [Leetcode](https://leetcode.com/problems/island-perimeter/) | Easy |
 | 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 |
+| 516 | Longest Palindromic Subsequence | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/longest_palindrome_subseq.rs) | [Leetcode](https://leetcode.com/problems/longest-palindromic-subsequence/) | Medium |
 | 547 | Number of Provinces | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/interview/amazon/find_circle_num.rs) | [Leetcode](https://leetcode.com/problems/number-of-provinces/) | Medium |
 | 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 |
@@ -70,6 +71,7 @@ LeetCode is a website that has programming-related questions that are designed t
 | 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 |
 | 1161 | Maximum Level Sum of a Binary Tree | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/max_level_sum.rs) | [Leetcode](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/) | Medium |
 | 1167 | Minimum Cost to Connect Sticks | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/interview/amazon/connect_sticks.rs) | [Leetcode](https://leetcode.com/problems/minimum-cost-to-connect-sticks/) | Medium |
+| 1216 | Valid Palindrome III | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/is_valid_palindrome.rs) | [Leetcode](https://leetcode.com/problems/valid-palindrome-iii/) | Hard |
 | 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 |
 | 1268 | Search Suggestions System | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/interview/amazon/suggested_products.rs) | [Leetcode](https://leetcode.com/problems/search-suggestions-system/) | 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 |

src/leetcode/challenge/is_valid_palindrome.rs

@@ -0,0 +1,45 @@
+// 1216. Valid Palindrome III, Hard
+// https://leetcode.com/problems/valid-palindrome-iii/
+impl Solution {
+    pub fn is_valid_palindrome(s: String, k: i32) -> bool {
+        let n = s.len();
+        let mut dp = vec![vec![0; n]; n];
+
+        let chars = s.chars().collect::<Vec<char>>();
+
+        for i in 0..n {
+            dp[i][i] = 1;
+        }
+
+        for i in 1..n {
+            for j in 0..n - i {
+                let i = j + i;
+                if chars[j] == chars[i] {
+                    dp[j][i] = 2 + dp[j + 1][i - 1];
+                } else {
+                    dp[j][i] = i32::max(dp[j + 1][i], dp[j][i - 1]);
+                }
+            }
+        }
+
+        dp[0][n - 1] >= n as i32 - k
+    }
+}
+
+struct Solution {}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+    use crate::{vec_vec_char, vec_vec_i32};
+
+    #[test]
+    fn test_is_valid_palindrome() {
+        assert_eq!(Solution::is_valid_palindrome("abcdeca".to_string(), 2), true);
+    }
+
+    #[test]
+    fn test_is_valid_palindrome2() {
+        assert_eq!(Solution::is_valid_palindrome("abbababa".to_string(), 1), true);
+    }
+}

src/leetcode/challenge/mod.rs

@@ -1,20 +1 @@
-mod break_palindrome;
-mod calculate_minimum_hp;
-mod can_partition_k_subsets;
-mod cherry_pickup;
-mod find_max_consecutive_ones;
-mod intersect;
-mod longest_common_subsequence;
-mod max_length;
-mod max_sub_array_len;
-mod minmax_gas_dist;
-mod moves_to_chessboard;
-mod num_distinct;
-mod num_unique_emails;
-mod shortest_distance;
-mod shortest_path;
-mod sort_array_by_parity_ii;
-mod spiral_order;
-mod split_list_to_parts;
-mod tictactoe;
-mod tribonacci;
+automod::dir!("src/leetcode/challenge");

src/leetcode/problem/longest_palindrome_subseq.rs

@@ -0,0 +1,50 @@
+// 516. Longest Palindromic Subsequence, Medium
+// https://leetcode.com/problems/longest-palindromic-subsequence/
+impl Solution {
+    pub fn longest_palindrome_subseq(s: String) -> i32 {
+        let n = s.len();
+        let mut dp = vec![vec![0; n]; n];
+
+        let chars = s.chars().collect::<Vec<char>>();
+
+        for i in 0..n {
+            dp[i][i] = 1;
+        }
+
+        for i in 1..n {
+            for j in 0..s.len() - i {
+                let i = j + i;
+                if chars[j] == chars[i] {
+                    dp[j][i] = 2 + dp[j + 1][i - 1];
+                } else {
+                    dp[j][i] = i32::max(dp[j + 1][i], dp[j][i - 1]);
+                }
+            }
+        }
+
+        dp[0][n - 1]
+    }
+}
+
+struct Solution {}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+    use crate::{vec_vec_char, vec_vec_i32};
+
+    #[test]
+    fn test_longest_palindrome_subseq() {
+        assert_eq!(Solution::longest_palindrome_subseq("bbbab".to_string()), 4);
+    }
+
+    #[test]
+    fn test_longest_palindrome_subseq2() {
+        assert_eq!(Solution::longest_palindrome_subseq("cbbd".to_string()), 2);
+    }
+
+    #[test]
+    fn test_longest_palindrome_subseq3() {
+        assert_eq!(Solution::longest_palindrome_subseq("cbbd".to_string()), 2);
+    }
+}