Add 2 problems

Author: martwz

README.md

@@ -24,6 +24,7 @@ LeetCode is a website that has programming-related questions that are designed t
 | 242 | Valid Anagram | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/is_anagram.rs) | [Leetcode](https://leetcode.com/problems/valid-anagram/) | Easy |
 | 282 | Expression Add Operators | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/add_operators.rs) | [Leetcode](https://leetcode.com/problems/expression-add-operators/) | Hard |
 | 317 | Shortest Distance from All Buildings | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/shortest_distance.rs) | [Leetcode](https://leetcode.com/problems/shortest-distance-from-all-buildings/) | Hard |
+| 325 | Maximum Size Subarray Sum Equals k | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/max_sub_array_len.rs) | [Leetcode](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/solution/) | Medium |
 | 334 | Increasing Triplet Subsequence | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/top_interview/array_and_string/increasing_triplet.rs) | [Leetcode](https://leetcode.com/problems/increasing-triplet-subsequence/) | Medium |
 | 350 | Intersection of Two Arrays II | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/intersect.rs) | [Leetcode](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | Easy |
 | 368 | Largest Divisible Subset | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/largest_divisible_subset.rs) | [Leetcode](https://leetcode.com/problems/largest-divisible-subset/) | Medium |
@@ -32,6 +33,7 @@ LeetCode is a website that has programming-related questions that are designed t
 | 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 |
 | 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 |
 | 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 |

src/leetcode/challenge/max_sub_array_len.rs

@@ -0,0 +1,44 @@
+use std::collections::HashMap;
+
+// 325. Maximum Size Subarray Sum Equals k, Medium
+// https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/solution/
+impl Solution {
+    pub fn max_sub_array_len(nums: Vec<i32>, k: i32) -> i32 {
+        let mut max_length = 0;
+
+        let mut curr_sum = 0;
+        let mut sum_to_index_mapping = HashMap::new();
+        for i in 0..nums.len() {
+            curr_sum += nums[i];
+
+            if curr_sum == k {
+                max_length = max_length.max(i + 1);
+            } else if let Some(j) = sum_to_index_mapping.get(&(curr_sum - k)) {
+                max_length = max_length.max(i - j);
+            }
+
+            if !sum_to_index_mapping.contains_key(&curr_sum) {
+                sum_to_index_mapping.insert(curr_sum, i);
+            }
+        }
+
+        return max_length as i32;
+    }
+}
+
+struct Solution {}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_max_sub_array_len() {
+        assert_eq!(Solution::max_sub_array_len(vec![1, -1, 5, -2, 3], 3), 4);
+    }
+
+    #[test]
+    fn test_max_sub_array_len2() {
+        assert_eq!(Solution::max_sub_array_len(vec![-2, -1, 2, 1], 1), 2);
+    }
+}

src/leetcode/challenge/mod.rs

@@ -2,6 +2,7 @@ mod break_palindrome;
 mod find_max_consecutive_ones;
 mod intersect;
 mod max_length;
+mod max_sub_array_len;
 mod minmax_gas_dist;
 mod moves_to_chessboard;
 mod num_distinct;
@@ -10,5 +11,6 @@ mod shortest_distance;
 mod shortest_path;
 mod sort_array_by_parity_ii;
 mod spiral_order;
+mod split_list_to_parts;
 mod tictactoe;
 mod tribonacci;

src/leetcode/challenge/split_list_to_parts.rs

@@ -0,0 +1,44 @@
+// 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 }
+    }
+}
+
+// 725. Split Linked List in Parts, Medium
+// https://leetcode.com/problems/split-linked-list-in-parts/
+impl Solution {
+    pub fn split_list_to_parts(head: Option<Box<ListNode>>, k: i32) -> Vec<Option<Box<ListNode>>> {
+        let mut len = 0;
+        let mut node = &head;
+        
+        while let Some(n) = node {
+            len += 1;
+            node = &n.next;
+        }
+        
+        let mut head = head;
+        let mut answer = Vec::with_capacity(k as usize);
+
+        for i in 0..k as usize {
+            answer.push(head);
+            let mut node = &mut answer[i];
+            for _ in 0..len / k + if i < (len % k) as usize { 1 } else { 0 } {
+                if let Some(n) = node {
+                    node = &mut n.next;
+                }
+            }
+            head = node.take();
+        }
+        answer
+    }
+}
+
+struct Solution {}