Add 2 solutions

Author: martwz

README.md

@@ -10,7 +10,9 @@ LeetCode is a website that has programming-related questions that are designed t
 | 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 |
+| 2 | Add Two Numbers | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/top_interview/linked_list/add_two_numbers.rs) | [Leetcode](https://leetcode.com/problems/add-two-numbers/) | Medium |
 | 3 | Longest Substring Without Repeating Characters | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/top_interview/array_and_string/length_of_longest_substring.rs) | [Leetcode](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium |
+| 5 | Longest Palindromic Substring | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/top_interview/array_and_string/longest_palindrome.rs) | [Leetcode](https://leetcode.com/problems/longest-palindromic-substring/) | Medium |
 | 49 | Group Anagrams | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/top_interview/array_and_string/group_anagrams.rs) | [Leetcode](https://leetcode.com/problems/group-anagrams/) | Medium |
 | 54 | Spiral Matrix | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/spiral_order.rs) | [Leetcode](https://leetcode.com/problems/spiral-matrix/) | Medium |
 | 55 | Jump Game | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/top_interview/dynamic_programming/can_jump.rs) | [Leetcode](https://leetcode.com/problems/jump-game/) | Medium |
@@ -32,6 +34,7 @@ LeetCode is a website that has programming-related questions that are designed t
 | 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 |
 | 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 |
 | 875 | Koko Eating Bananas | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/min_eating_speed.rs) | [Leetcode](https://leetcode.com/problems/koko-eating-bananas/) | Medium |
+| 922 | Sort Array By Parity II | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/sort_array_by_parity_ii.rs) | [Leetcode](https://leetcode.com/problems/sort-array-by-parity-ii/) | Easy |
 | 929 | Unique Email Addresses | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/num_unique_emails.rs) | [Leetcode](https://leetcode.com/problems/unique-email-addresses/) | Easy |
 | 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 |

src/leetcode/challenge/mod.rs

@@ -8,6 +8,7 @@ mod num_distinct;
 mod num_unique_emails;
 mod shortest_distance;
 mod shortest_path;
+mod sort_array_by_parity_ii;
 mod spiral_order;
 mod tictactoe;
 mod tribonacci;

src/leetcode/challenge/sort_array_by_parity_ii.rs

@@ -0,0 +1,48 @@
+use std::collections::VecDeque;
+
+// 922. Sort Array By Parity II, Easy
+// https://leetcode.com/problems/sort-array-by-parity-ii/
+impl Solution {
+    pub fn sort_array_by_parity_ii(nums: Vec<i32>) -> Vec<i32> {
+        let n = nums.len();
+        let mut ans: Vec<i32> = Vec::new();
+
+        let mut p1: VecDeque<i32> = VecDeque::new();
+        let mut p2: VecDeque<i32> = VecDeque::new();
+
+        for num in nums {
+            if num % 2 == 0 {
+                p1.push_back(num);
+            } else {
+                p2.push_back(num);
+            }
+        }
+
+        for i in 0..n {
+            if i % 2 == 0 {
+                ans.push(p1.pop_front().unwrap());
+            } else {
+                ans.push(p2.pop_front().unwrap());
+            }
+        }
+
+        return ans;
+    }
+}
+
+struct Solution {}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_sort_array_by_parity_ii() {
+        assert_eq!(Solution::sort_array_by_parity_ii(vec![4, 2, 5, 7]).len(), 4);
+    }
+
+    #[test]
+    fn test_sort_array_by_parity_ii2() {
+        assert_eq!(Solution::sort_array_by_parity_ii(vec![2, 3]), vec![2, 3]);
+    }
+}

src/leetcode/top_interview/linked_list/add_two_numbers.rs

@@ -0,0 +1,55 @@
+// Definition for singly-linked list.
+#[derive(PartialEq, Eq, Clone, Debug)]
+pub struct ListNode {
+    pub val: i32,
+    pub next: Option<Box<ListNode>>,
+}
+
+impl ListNode {
+    #[inline]
+    fn new(val: i32) -> Self {
+        ListNode { next: None, val }
+    }
+}
+
+pub trait ListMaker {
+    fn link(val: i32, next: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+        Some(Box::new(ListNode { val, next }))
+    }
+}
+
+impl ListMaker for Option<Box<ListNode>> {}
+
+// 2. Add Two Numbers, Medium
+// https://leetcode.com/problems/add-two-numbers/
+impl Solution {
+    pub fn add_two_numbers(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
+        let mut sum: Option<Box<ListNode>> = None;
+
+        let mut p1 = &l1;
+        let mut p2 = &l2;
+        let mut p3 = &mut sum;
+        let mut carry = 0;
+
+        while p1.is_some() || p2.is_some() || carry != 0 {
+            let mut val = carry;
+
+            if let Some(n1) = p1.as_ref() {
+                val += n1.val;
+                p1 = &n1.next;
+            }
+
+            if let Some(n2) = p2.as_ref() {
+                val += n2.val;
+                p2 = &n2.next;
+            }
+
+            carry = val / 10;
+            *p3 = Option::<Box<ListNode>>::link(val % 10, None);
+            p3 = &mut p3.as_mut().unwrap().next;
+        }
+        sum
+    }
+}
+
+struct Solution {}

src/leetcode/top_interview/linked_list/mod.rs

@@ -0,0 +1 @@
+mod add_two_numbers;

src/leetcode/top_interview/mod.rs

@@ -1,4 +1,5 @@
 mod array_and_string;
 mod dynamic_programming;
+mod linked_list;
 mod others;
 mod sorting;