Add more solutions

Author: martwz

README.md

@@ -13,10 +13,12 @@ LeetCode is a website that has programming-related questions that are designed t
 | 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 |
 | 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/array_and_string/can_jump.rs) | [Leetcode](https://leetcode.com/problems/jump-game/) | 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 |
 | 72 | Edit Distance | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/problem/min_distance.rs) | [Leetcode](https://leetcode.com/problems/edit-distance/) | Hard |
 | 73 | Set Matrix Zeroes | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/top_interview/array_and_string/set_zeroes.rs) | [Leetcode](https://leetcode.com/problems/set-matrix-zeroes/submissions/) | Medium |
+| 75 | Sort Colors | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/top_interview/sorting/sort_colors.rs) | [Leetcode](https://leetcode.com/problems/sort-colors/) | Medium |
 | 115 | Distinct Subsequences | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/challenge/num_distinct.rs) | [Leetcode](https://leetcode.com/problems/distinct-subsequences/) | Hard |
+| 169 | Majority Element | [Rust](https://github.com/martinxxd/leetcode-rust/tree/master/./src/leetcode/top_interview/others/majority_element.rs) | [Leetcode](https://leetcode.com/problems/majority-element/solution/) | Easy |
 | 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 |

src/leetcode/top_interview/array_and_string/mod.rs

@@ -1,4 +1,3 @@
-mod can_jump;
 mod group_anagrams;
 mod increasing_triplet;
 mod length_of_longest_substring;

src/leetcode/top_interview/array_and_string/can_jump.rs renamed to src/leetcode/top_interview/dynamic_programming/can_jump.rs

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

src/leetcode/top_interview/dynamic_programming/mod.rs

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

src/leetcode/top_interview/mod.rs

@@ -0,0 +1,45 @@
+use std::collections::VecDeque;
+
+// 169. Majority Element, Easy
+// https://leetcode.com/problems/majority-element/solution/
+impl Solution {
+    pub fn majority_element(nums: Vec<i32>) -> i32 {
+        let mut count = 0;
+        let mut cand: Option<i32> = None;
+
+        for num in nums {
+            if cand.is_none() || count == 0 {
+                cand = Some(num);
+                count = 1;
+            } else if cand.unwrap() == num {
+                count += 1;
+            } else if count > 0 {
+                count -= 1;
+            }
+        }
+
+        return cand.unwrap();
+    }
+}
+
+struct Solution {}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_majority_element() {
+        assert_eq!(Solution::majority_element(vec![3, 2, 3]), 3);
+    }
+
+    #[test]
+    fn test_majority_element2() {
+        assert_eq!(Solution::majority_element(vec![2, 2, 1, 1, 1, 2, 2]), 2);
+    }
+
+    #[test]
+    fn test_majority_element3() {
+        assert_eq!(Solution::majority_element(vec![3, 3, 4]), 3);
+    }
+}

src/leetcode/top_interview/others/majority_element.rs

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

src/leetcode/top_interview/others/mod.rs

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

src/leetcode/top_interview/sorting/mod.rs

@@ -0,0 +1,59 @@
+// 75. Sort Colors, Medium
+// https://leetcode.com/problems/sort-colors/
+impl Solution {
+    pub fn sort_colors(nums: &mut Vec<i32>) {
+        let n = nums.len();
+        if n <= 1 {
+            return;
+        }
+
+        let mut swapped = true;
+
+        while swapped {
+            swapped = false;
+            for i in 0..n - 1 {
+                if nums[i] > nums[i + 1] {
+                    nums.swap(i, i + 1);
+                    swapped = true;
+                    break;
+                }
+            }
+        }
+    }
+}
+
+struct Solution {}
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+    use crate::{vec_string, vec_vec_i32, vec_vec_string};
+
+    #[test]
+    fn test_sort_colors() {
+        let mut colors = vec![2, 0, 2, 1, 1, 0];
+        Solution::sort_colors(&mut colors);
+        assert_eq!(colors, vec![0, 0, 1, 1, 2, 2]);
+    }
+
+    #[test]
+    fn test_sort_colors2() {
+        let mut colors = vec![2, 0, 1];
+        Solution::sort_colors(&mut colors);
+        assert_eq!(colors, vec![0, 1, 2]);
+    }
+
+    #[test]
+    fn test_sort_colors3() {
+        let mut colors = vec![0];
+        Solution::sort_colors(&mut colors);
+        assert_eq!(colors, vec![0]);
+    }
+
+    #[test]
+    fn test_sort_colors4() {
+        let mut colors = vec![1];
+        Solution::sort_colors(&mut colors);
+        assert_eq!(colors, vec![1]);
+    }
+}