refactor: basically everything to be found

src/bin/consecutive_prime_sum.rs

@@ -1,9 +1,7 @@
 fn check_prime(x: u32) -> bool {
     let mut check = true;
-    for j in 2..=(x as u32).isqrt() {
-        if x % 2 == 0 {
-            check = false;
-        } else if x % j == 0 {
+    for j in 2..=x.isqrt() {
+        if x % j == 0 {
             check = false;
         }
     }

src/bin/even_fibonacci_numbers.rs

@@ -2,8 +2,8 @@ fn main() {
     let mut sequence: Vec<i32> = vec![1, 2];
     while sequence[sequence.len() - 1] <= 4000000 {
         let mut last = sequence[sequence.len() - 1];
-        let mut secondlast = sequence[sequence.len() - 2];
-        (secondlast, last) = (last, secondlast + last);
+        let secondlast = sequence[sequence.len() - 2];
+        (_, last) = (last, secondlast+last);
         sequence.push(last);
     }
     for i in sequence.clone() {

src/bin/factorial_digit_sum.rs

@@ -1,11 +1,11 @@
 use num_bigint::BigUint;
 
 fn factorial(x: u64) -> BigUint {
-    let mut product = BigUint::from(1 as u64);
+    let mut product = BigUint::from(1_u64);
     for i in 2..=x {
         product *= BigUint::from(i);
     }
-    product.into()
+    product
 }
 
 fn main() {

src/bin/multiples_of_3_or_5.rs

@@ -1,9 +1,7 @@
 fn main() {
     let mut multiples: Vec<i32> = vec![];
     for num in 0..1000 {
-        if num % 3 == 0 {
-            multiples.push(num);
-        } else if num % 5 == 0 {
+        if num % 3 == 0 || num % 5 == 0 {
             multiples.push(num);
         }
     }

src/bin/number_letter_counts.rs

@@ -39,9 +39,9 @@ fn translate(number: u64) -> String {
 
     match number {
         number if number < 20 => { result = GENERIC[(number) as usize].to_string(); },
-        number if number >= 20 && number < 100 => {
+        number if (20..100).contains(&number) => {
             let number_string = number.to_string();
-            let tens = number_string.chars().nth(0).unwrap().to_digit(10).unwrap();
+            let tens = number_string.chars().next().unwrap().to_digit(10).unwrap();
             let ones = number_string.chars().nth(1).unwrap().to_digit(10).unwrap();
 
             result = SPECIAL[tens as usize].to_owned()+GENERIC[(ones) as usize];
@@ -49,7 +49,7 @@ fn translate(number: u64) -> String {
         100 => { result = "onehundred".to_string(); }
         number if number > 100 && number < 1000 => {
             let number_string = number.to_string();
-            let hundreds = number_string.chars().nth(0).unwrap().to_digit(10).unwrap();
+            let hundreds = number_string.chars().next().unwrap().to_digit(10).unwrap();
             let tens = number_string.chars().nth(1).unwrap().to_digit(10).unwrap();
             let ones = number_string.chars().nth(2).unwrap().to_digit(10).unwrap();
 

src/bin/pandigital_prime.rs

@@ -17,7 +17,7 @@ fn is_prime(num: u64) -> bool {
     }
 }
 
-fn permutations(input: &Vec<u64>) -> Vec<u64> {
+fn permutations(input: &[u64]) -> Vec<u64> {
     let mut permutations = vec![];
     for permutation in input.iter().permutations(input.len()).unique() {
         let result: u64 = permutation.iter().fold(0, |acc, &x| acc * 10u64.pow(x.to_string().len() as u32) + x);

src/bin/power_digit_sum.rs

@@ -1,13 +1,13 @@
 use num_bigint::BigUint;
 
 fn main() {
-    let mut number: BigUint = BigUint::from(2 as u32);
+    let mut number: BigUint = BigUint::from(2_u32);
     number = number.pow(1000);
 
     let number_list: Vec<u32> = number
         .to_string()
         .chars()
-        .filter_map(|c| c.to_digit(10).map(|d| d as u32))
+        .filter_map(|c| c.to_digit(10))
         .collect();
     let sum: u32 = number_list.iter().sum();
 

src/bin/prime_permutations.rs

@@ -17,7 +17,7 @@ fn is_prime(num: u64) -> bool {
     }
 }
 
-fn permutations(input: &Vec<u64>) -> Vec<u64> {
+fn permutations(input: &[u64]) -> Vec<u64> {
     let mut permutations = vec![];
     for permutation in input.iter().permutations(input.len()).unique() {
         let result: u64 = permutation.iter().fold(0, |acc, &x| acc * 10u64.pow(x.to_string().len() as u32) + x);
@@ -58,7 +58,7 @@ fn main() {
 
             for k in prime_permutations.clone().into_iter().filter(|x| *x != *j).collect::<Vec<u64>>() {
                 if (*j as i64-i as i64).abs() == (k as i64-i as i64).abs() {
-                    let difference = (*j as i64-i as i64).abs() as u64;
+                    let difference = (*j as i64 - i as i64).unsigned_abs();
                     let final_vector: Vec<u64> = vec![i-difference, i, i+difference];
 
                     let concat = final_vector.into_iter().map(|s| s.to_string()).collect::<String>();

src/bin/special_pythagorean_triplet.rs

@@ -4,8 +4,7 @@ fn main() {
             for j in 1..1000 {
                 for k in 1..1000 {
                     let pythagoras: f64 = (i as f64).powf(2.) + (j as f64).powf(2.);
-                    if pythagoras == (k as f64).powf(2.) {
-                        if i + j + k == 1000 {
+                    if pythagoras == (k as f64).powf(2.) && i + j + k == 1000 {
                         println!("{}", i * j * k);
                         break 'algorithm;
                     }
@@ -14,4 +13,3 @@ fn main() {
         }
     }
 }
-}