[INFO] cloning repository https://github.com/0xFloop/leet_rs
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/0xFloop/leet_rs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2F0xFloop%2Fleet_rs", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2F0xFloop%2Fleet_rs'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 63f511195568b5e725f1f1e4a234bf1254c143c5
[INFO] checking 0xFloop/leet_rs/63f511195568b5e725f1f1e4a234bf1254c143c5 against master#ab869e094a907cc5d19b4080f22eccaf347f1f95 for pr-129604
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2F0xFloop%2Fleet_rs" "/workspace/builds/worker-6-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-6-tc1/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/0xFloop/leet_rs on toolchain ab869e094a907cc5d19b4080f22eccaf347f1f95
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/0xFloop/leet_rs
[INFO] finished tweaking git repo https://github.com/0xFloop/leet_rs
[INFO] tweaked toml for git repo https://github.com/0xFloop/leet_rs written to /workspace/builds/worker-6-tc1/source/Cargo.toml
[INFO] crate git repo https://github.com/0xFloop/leet_rs already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] a3f2aa3026144cc5f12eb09210f0b72df3edcf35d6582719b68aab0b5201586c
[INFO] running `Command { std: "docker" "start" "-a" "a3f2aa3026144cc5f12eb09210f0b72df3edcf35d6582719b68aab0b5201586c", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "a3f2aa3026144cc5f12eb09210f0b72df3edcf35d6582719b68aab0b5201586c", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "a3f2aa3026144cc5f12eb09210f0b72df3edcf35d6582719b68aab0b5201586c", kill_on_drop: false }`
[INFO] [stdout] a3f2aa3026144cc5f12eb09210f0b72df3edcf35d6582719b68aab0b5201586c
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+ab869e094a907cc5d19b4080f22eccaf347f1f95" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] f5ac7cf250fa8e372aa044284487b560c600064544f420b0eaac339473394a7e
[INFO] running `Command { std: "docker" "start" "-a" "f5ac7cf250fa8e372aa044284487b560c600064544f420b0eaac339473394a7e", kill_on_drop: false }`
[INFO] [stderr]     Checking leetcode-rs v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `slice::ChunksMut`
[INFO] [stdout]  --> src/problems/easy/inorder_traversal.rs:1:34
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{cell::RefCell, rc::Rc, slice::ChunksMut};
[INFO] [stdout]   |                                  ^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Borrow`
[INFO] [stdout]   --> src/problems/easy/invert_binary_tree.rs:19:19
[INFO] [stdout]    |
[INFO] [stdout] 19 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]    |                   ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]  --> src/problems/easy/majority_element.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::HashMap;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]  --> src/problems/easy/remove_elements.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::Borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/problems/easy/search_insert_position.rs:23:20
[INFO] [stdout]    |
[INFO] [stdout] 23 |         let left = (curr.is_none() || curr.unwrap() <= &target);
[INFO] [stdout]    |                    ^                                          ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 23 -         let left = (curr.is_none() || curr.unwrap() <= &target);
[INFO] [stdout] 23 +         let left = curr.is_none() || curr.unwrap() <= &target;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/problems/easy/search_insert_position.rs:24:21
[INFO] [stdout]    |
[INFO] [stdout] 24 |         let right = (next.is_none() || next.unwrap() >= &target);
[INFO] [stdout]    |                     ^                                          ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 24 -         let right = (next.is_none() || next.unwrap() >= &target);
[INFO] [stdout] 24 +         let right = next.is_none() || next.unwrap() >= &target;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::panic`
[INFO] [stdout]  --> src/problems/medium/add_two_numbers.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::panic;
[INFO] [stdout]   |     ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Add`
[INFO] [stdout]  --> src/problems/medium/add_two_numbers.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::ops::Add;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]  --> src/problems/medium/longest_substring.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::HashMap;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `HashMap`
[INFO] [stdout]  --> src/problems/medium/three_sum.rs:1:24
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::{HashMap, HashSet};
[INFO] [stdout]   |                        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `HashMap` and `HashSet`
[INFO] [stdout]  --> src/problems/medium/three_sum_closest.rs:1:24
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::{HashMap, HashSet};
[INFO] [stdout]   |                        ^^^^^^^  ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `slice::ChunksMut`
[INFO] [stdout]  --> src/problems/easy/inorder_traversal.rs:1:34
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{cell::RefCell, rc::Rc, slice::ChunksMut};
[INFO] [stdout]   |                                  ^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Borrow`
[INFO] [stdout]   --> src/problems/easy/invert_binary_tree.rs:19:19
[INFO] [stdout]    |
[INFO] [stdout] 19 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]    |                   ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]  --> src/problems/easy/majority_element.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::HashMap;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]  --> src/problems/easy/remove_elements.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::Borrow;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/problems/easy/search_insert_position.rs:23:20
[INFO] [stdout]    |
[INFO] [stdout] 23 |         let left = (curr.is_none() || curr.unwrap() <= &target);
[INFO] [stdout]    |                    ^                                          ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 23 -         let left = (curr.is_none() || curr.unwrap() <= &target);
[INFO] [stdout] 23 +         let left = curr.is_none() || curr.unwrap() <= &target;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/problems/easy/search_insert_position.rs:24:21
[INFO] [stdout]    |
[INFO] [stdout] 24 |         let right = (next.is_none() || next.unwrap() >= &target);
[INFO] [stdout]    |                     ^                                          ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 24 -         let right = (next.is_none() || next.unwrap() >= &target);
[INFO] [stdout] 24 +         let right = next.is_none() || next.unwrap() >= &target;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `core::panic`
[INFO] [stdout]  --> src/problems/medium/add_two_numbers.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::panic;
[INFO] [stdout]   |     ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Add`
[INFO] [stdout]  --> src/problems/medium/add_two_numbers.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::ops::Add;
[INFO] [stdout]   |     ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]  --> src/problems/medium/longest_substring.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::HashMap;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `HashMap`
[INFO] [stdout]  --> src/problems/medium/three_sum.rs:1:24
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::{HashMap, HashSet};
[INFO] [stdout]   |                        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `HashMap` and `HashSet`
[INFO] [stdout]  --> src/problems/medium/three_sum_closest.rs:1:24
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::{HashMap, HashSet};
[INFO] [stdout]   |                        ^^^^^^^  ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]   --> src/problems/easy/balanced_binary_tree.rs:19:5
[INFO] [stdout]    |
[INFO] [stdout] 19 | use std::borrow::Borrow;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]   --> src/problems/easy/count_nodes.rs:19:5
[INFO] [stdout]    |
[INFO] [stdout] 19 | use std::borrow::Borrow;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BorrowMut`
[INFO] [stdout]   --> src/problems/easy/invert_binary_tree.rs:19:27
[INFO] [stdout]    |
[INFO] [stdout] 19 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]    |                           ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]   --> src/problems/easy/is_same_tree.rs:22:5
[INFO] [stdout]    |
[INFO] [stdout] 22 | use std::borrow::Borrow;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]   --> src/problems/easy/is_symetric.rs:21:5
[INFO] [stdout]    |
[INFO] [stdout] 21 | use std::borrow::Borrow;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]   --> src/problems/easy/max_depth.rs:21:5
[INFO] [stdout]    |
[INFO] [stdout] 21 | use std::borrow::Borrow;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]   --> src/problems/easy/minimum_depth_of_binary_tree.rs:20:5
[INFO] [stdout]    |
[INFO] [stdout] 20 | use std::borrow::Borrow;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]   --> src/problems/easy/path_sum.rs:20:5
[INFO] [stdout]    |
[INFO] [stdout] 20 | use std::borrow::Borrow;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `root_2`
[INFO] [stdout]   --> src/problems/easy/balanced_binary_tree.rs:25:9
[INFO] [stdout]    |
[INFO] [stdout] 25 |     let root_2 = Some(Rc::new(RefCell::new(TreeNode {
[INFO] [stdout]    |         ^^^^^^ help: if this is intentional, prefix it with an underscore: `_root_2`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/problems/easy/convert_to_title.rs:2:9
[INFO] [stdout]   |
[INFO] [stdout] 2 |     let mut column_number = 2147483647;
[INFO] [stdout]   |         ----^^^^^^^^^^^^^
[INFO] [stdout]   |         |
[INFO] [stdout]   |         help: remove this `mut`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]   --> src/problems/easy/balanced_binary_tree.rs:19:5
[INFO] [stdout]    |
[INFO] [stdout] 19 | use std::borrow::Borrow;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]   --> src/problems/easy/count_nodes.rs:19:5
[INFO] [stdout]    |
[INFO] [stdout] 19 | use std::borrow::Borrow;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BorrowMut`
[INFO] [stdout]   --> src/problems/easy/invert_binary_tree.rs:19:27
[INFO] [stdout]    |
[INFO] [stdout] 19 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]    |                           ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]   --> src/problems/easy/is_same_tree.rs:22:5
[INFO] [stdout]    |
[INFO] [stdout] 22 | use std::borrow::Borrow;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]   --> src/problems/easy/is_symetric.rs:21:5
[INFO] [stdout]    |
[INFO] [stdout] 21 | use std::borrow::Borrow;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]   --> src/problems/easy/max_depth.rs:21:5
[INFO] [stdout]    |
[INFO] [stdout] 21 | use std::borrow::Borrow;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]   --> src/problems/easy/minimum_depth_of_binary_tree.rs:20:5
[INFO] [stdout]    |
[INFO] [stdout] 20 | use std::borrow::Borrow;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::Borrow`
[INFO] [stdout]   --> src/problems/easy/path_sum.rs:20:5
[INFO] [stdout]    |
[INFO] [stdout] 20 | use std::borrow::Borrow;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `root_2`
[INFO] [stdout]   --> src/problems/easy/balanced_binary_tree.rs:25:9
[INFO] [stdout]    |
[INFO] [stdout] 25 |     let root_2 = Some(Rc::new(RefCell::new(TreeNode {
[INFO] [stdout]    |         ^^^^^^ help: if this is intentional, prefix it with an underscore: `_root_2`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `c`
[INFO] [stdout]   --> src/problems/easy/longest_common_prefix.rs:12:50
[INFO] [stdout]    |
[INFO] [stdout] 12 |     first_word.chars().enumerate().find_map(|(i, c)| {
[INFO] [stdout]    |                                                  ^ help: if this is intentional, prefix it with an underscore: `_c`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/problems/easy/merge_sorted_arr.rs:5:9
[INFO] [stdout]   |
[INFO] [stdout] 5 |     let n = 5;
[INFO] [stdout]   |         ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/problems/easy/convert_to_title.rs:2:9
[INFO] [stdout]   |
[INFO] [stdout] 2 |     let mut column_number = 2147483647;
[INFO] [stdout]   |         ----^^^^^^^^^^^^^
[INFO] [stdout]   |         |
[INFO] [stdout]   |         help: remove this `mut`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `c`
[INFO] [stdout]   --> src/problems/easy/longest_common_prefix.rs:12:50
[INFO] [stdout]    |
[INFO] [stdout] 12 |     first_word.chars().enumerate().find_map(|(i, c)| {
[INFO] [stdout]    |                                                  ^ help: if this is intentional, prefix it with an underscore: `_c`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/problems/easy/merge_sorted_arr.rs:5:9
[INFO] [stdout]   |
[INFO] [stdout] 5 |     let n = 5;
[INFO] [stdout]   |         ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]  --> src/problems/easy/plus_one.rs:6:10
[INFO] [stdout]   |
[INFO] [stdout] 6 |     for (i, digit) in digits.iter_mut().rev().enumerate() {
[INFO] [stdout]   |          ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]  --> src/problems/easy/plus_one.rs:6:10
[INFO] [stdout]   |
[INFO] [stdout] 6 |     for (i, digit) in digits.iter_mut().rev().enumerate() {
[INFO] [stdout]   |          ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/problems/easy/title_to_number.rs:2:9
[INFO] [stdout]   |
[INFO] [stdout] 2 |     let mut column_title = String::from("FXSHRXW");
[INFO] [stdout]   |         ----^^^^^^^^^^^^
[INFO] [stdout]   |         |
[INFO] [stdout]   |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/problems/easy/title_to_number.rs:2:9
[INFO] [stdout]   |
[INFO] [stdout] 2 |     let mut column_title = String::from("FXSHRXW");
[INFO] [stdout]   |         ----^^^^^^^^^^^^
[INFO] [stdout]   |         |
[INFO] [stdout]   |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/add_binary.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> String {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/balanced_binary_tree.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/balanced_binary_tree.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn solve() -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_height` is never used
[INFO] [stdout]   --> src/problems/easy/balanced_binary_tree.rs:90:4
[INFO] [stdout]    |
[INFO] [stdout] 90 | fn get_height(curr_node: &Option<Rc<RefCell<TreeNode>>>) -> Result<i32, &str> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/buy_and_sell_stocks.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/climbing_stairs.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `climb` is never used
[INFO] [stdout]  --> src/problems/easy/climbing_stairs.rs:8:4
[INFO] [stdout]   |
[INFO] [stdout] 8 | fn climb(steps_left: i32, memo: &mut HashMap<i32, i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/contains_duplicates.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> bool {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/contains_nearby_duplicates.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> bool {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/convert_to_title.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> String {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse` is never used
[INFO] [stdout]   --> src/problems/easy/convert_to_title.rs:11:4
[INFO] [stdout]    |
[INFO] [stdout] 11 | fn recurse(val: u32, s: &mut String) {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/count_nodes.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/count_nodes.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn solve() -> i32 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_missing` is never used
[INFO] [stdout]   --> src/problems/easy/count_nodes.rs:66:4
[INFO] [stdout]    |
[INFO] [stdout] 66 | fn count_missing(
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_height` is never used
[INFO] [stdout]   --> src/problems/easy/count_nodes.rs:87:4
[INFO] [stdout]    |
[INFO] [stdout] 87 | fn get_height(node: &Option<Rc<RefCell<TreeNode>>>, height: &mut i32) {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/delete_duplicates.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 9  |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/delete_duplicates.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn solve() -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `naive_solve` is never used
[INFO] [stdout]   --> src/problems/easy/delete_duplicates.rs:43:8
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn naive_solve() -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/hamming_weight.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/inorder_traversal.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/inorder_traversal.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn solve() -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_node` is never used
[INFO] [stdout]   --> src/problems/easy/inorder_traversal.rs:46:4
[INFO] [stdout]    |
[INFO] [stdout] 46 | fn search_node(curr_node: &Rc<RefCell<TreeNode>>, tracker_vec: &mut Vec<i32>) {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/invert_binary_tree.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/invert_binary_tree.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn solve() -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse_reverse` is never used
[INFO] [stdout]   --> src/problems/easy/invert_binary_tree.rs:59:4
[INFO] [stdout]    |
[INFO] [stdout] 59 | fn recurse_reverse(node: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/is_happy.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> bool {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/is_isomorphic.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> bool {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/is_same_tree.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `WrappedTreeNode` is never used
[INFO] [stdout]   --> src/problems/easy/is_same_tree.rs:20:6
[INFO] [stdout]    |
[INFO] [stdout] 20 | type WrappedTreeNode = Option<Rc<RefCell<TreeNode>>>;
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/is_same_tree.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn solve() -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `compare_trees` is never used
[INFO] [stdout]   --> src/problems/easy/is_same_tree.rs:48:4
[INFO] [stdout]    |
[INFO] [stdout] 48 | fn compare_trees(p: &WrappedTreeNode, q: &WrappedTreeNode) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/is_symetric.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `WrappedTreeNode` is never used
[INFO] [stdout]   --> src/problems/easy/is_symetric.rs:20:6
[INFO] [stdout]    |
[INFO] [stdout] 20 | type WrappedTreeNode = Option<Rc<RefCell<TreeNode>>>;
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/is_symetric.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn solve() -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cmp_nodes` is never used
[INFO] [stdout]   --> src/problems/easy/is_symetric.rs:60:4
[INFO] [stdout]    |
[INFO] [stdout] 60 | fn cmp_nodes(l_node: &WrappedTreeNode, r_node: &WrappedTreeNode) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/kata_machine.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> [i32; 10] {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/length_of_the_last_word.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/longest_common_prefix.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> String {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/majority_element.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/max_depth.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `WrappedTreeNode` is never used
[INFO] [stdout]   --> src/problems/easy/max_depth.rs:20:6
[INFO] [stdout]    |
[INFO] [stdout] 20 | type WrappedTreeNode = Option<Rc<RefCell<TreeNode>>>;
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/max_depth.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn solve() -> i32 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search` is never used
[INFO] [stdout]   --> src/problems/easy/max_depth.rs:69:4
[INFO] [stdout]    |
[INFO] [stdout] 69 | fn search(node: &WrappedTreeNode) -> i32 {
[INFO] [stdout]    |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/merge_sorted_arr.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/merge_two_sorted_lists.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 9  |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/merge_two_sorted_lists.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn solve() -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/minimum_depth_of_binary_tree.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/minimum_depth_of_binary_tree.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | pub fn solve() -> i32 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse` is never used
[INFO] [stdout]   --> src/problems/easy/minimum_depth_of_binary_tree.rs:54:4
[INFO] [stdout]    |
[INFO] [stdout] 54 | fn recurse(curr_node: &Option<Rc<RefCell<TreeNode>>>, curr_depth: &mut i32, shortest: &mut i32) {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/my_sqrt.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `naive_solve` is never used
[INFO] [stdout]   --> src/problems/easy/my_sqrt.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn naive_solve() -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyStack` is never constructed
[INFO] [stdout]  --> src/problems/easy/my_stack.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct MyStack {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `empty` are never used
[INFO] [stdout]   --> src/problems/easy/my_stack.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl MyStack {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout] 10 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn push(&mut self, x: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/my_stack.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn solve() {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/add_binary.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> String {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/palindrome_number.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> bool {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/pascals_trianble_2.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/pascals_triangle.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/path_sum.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/path_sum.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn solve() -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse` is never used
[INFO] [stdout]   --> src/problems/easy/path_sum.rs:71:4
[INFO] [stdout]    |
[INFO] [stdout] 71 | fn recurse(curr_node: &Option<Rc<RefCell<TreeNode>>>, curr_sum: &mut i32, target: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/plus_one.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/postorder_traversal.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/postorder_traversal.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn solve() -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse` is never used
[INFO] [stdout]   --> src/problems/easy/postorder_traversal.rs:41:4
[INFO] [stdout]    |
[INFO] [stdout] 41 | fn recurse(node: &Option<Rc<RefCell<TreeNode>>>, order: &mut Vec<i32>) {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/preorder_traversal.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/preorder_traversal.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn solve() -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse` is never used
[INFO] [stdout]   --> src/problems/easy/preorder_traversal.rs:41:4
[INFO] [stdout]    |
[INFO] [stdout] 41 | fn recurse(node: &Option<Rc<RefCell<TreeNode>>>, order: &mut Vec<i32>) {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/remove_duplicates.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/remove_element.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/remove_elements.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/remove_elements.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn solve() -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/reverse_bits.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> u32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/reverse_list.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 9  |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/reverse_list.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn solve() -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/roman_to_integer.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/search_insert_position.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/single_number.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/sorted_array_to_bst.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/sorted_array_to_bst.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn solve() -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse` is never used
[INFO] [stdout]   --> src/problems/easy/sorted_array_to_bst.rs:27:4
[INFO] [stdout]    |
[INFO] [stdout] 27 | fn recurse(nums: &[i32]) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/str_in_str.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/title_to_number.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/two_sum.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/valid_palindrome.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> bool {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/valid_parentheses.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> bool {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse` is never used
[INFO] [stdout]   --> src/problems/easy/valid_parentheses.rs:29:4
[INFO] [stdout]    |
[INFO] [stdout] 29 | fn reverse(c: char) -> char {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/hard/find_median_sorted_arrays.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> f64 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/medium/add_two_numbers.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     fn new(val: i32, next: Option<Box<ListNode>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/medium/add_two_numbers.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub fn solve() -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/int_to_roman.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> String {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/letter_combinations.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> Vec<String> {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse` is never used
[INFO] [stdout]   --> src/problems/medium/letter_combinations.rs:14:4
[INFO] [stdout]    |
[INFO] [stdout] 14 | fn recurse(
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_letters` is never used
[INFO] [stdout]   --> src/problems/medium/letter_combinations.rs:35:4
[INFO] [stdout]    |
[INFO] [stdout] 35 | fn get_letters(digit: char) -> String {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/longest_palindrome.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> String {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `palindrome_odd` is never used
[INFO] [stdout]   --> src/problems/medium/longest_palindrome.rs:13:4
[INFO] [stdout]    |
[INFO] [stdout] 13 | fn palindrome_odd(s: &str, curr_longest: &mut VecDeque<char>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `palindrome_even` is never used
[INFO] [stdout]   --> src/problems/medium/longest_palindrome.rs:46:4
[INFO] [stdout]    |
[INFO] [stdout] 46 | fn palindrome_even(s: &str, curr_longest: &mut VecDeque<char>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/longest_substring.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/max_area.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/my_atoi.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/medium/remove_nth_node_from_end.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 9  |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/medium/remove_nth_node_from_end.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn solve() -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/reverse_integer.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/three_sum.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/three_sum_closest.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/zigzag_conversion.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> String {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/balanced_binary_tree.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/balanced_binary_tree.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn solve() -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_height` is never used
[INFO] [stdout]   --> src/problems/easy/balanced_binary_tree.rs:90:4
[INFO] [stdout]    |
[INFO] [stdout] 90 | fn get_height(curr_node: &Option<Rc<RefCell<TreeNode>>>) -> Result<i32, &str> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/buy_and_sell_stocks.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/climbing_stairs.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `climb` is never used
[INFO] [stdout]  --> src/problems/easy/climbing_stairs.rs:8:4
[INFO] [stdout]   |
[INFO] [stdout] 8 | fn climb(steps_left: i32, memo: &mut HashMap<i32, i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/contains_duplicates.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> bool {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/contains_nearby_duplicates.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> bool {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/convert_to_title.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> String {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse` is never used
[INFO] [stdout]   --> src/problems/easy/convert_to_title.rs:11:4
[INFO] [stdout]    |
[INFO] [stdout] 11 | fn recurse(val: u32, s: &mut String) {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/count_nodes.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/count_nodes.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn solve() -> i32 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_missing` is never used
[INFO] [stdout]   --> src/problems/easy/count_nodes.rs:66:4
[INFO] [stdout]    |
[INFO] [stdout] 66 | fn count_missing(
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_height` is never used
[INFO] [stdout]   --> src/problems/easy/count_nodes.rs:87:4
[INFO] [stdout]    |
[INFO] [stdout] 87 | fn get_height(node: &Option<Rc<RefCell<TreeNode>>>, height: &mut i32) {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/delete_duplicates.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 9  |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/delete_duplicates.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn solve() -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `naive_solve` is never used
[INFO] [stdout]   --> src/problems/easy/delete_duplicates.rs:43:8
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn naive_solve() -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/hamming_weight.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/inorder_traversal.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/inorder_traversal.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn solve() -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_node` is never used
[INFO] [stdout]   --> src/problems/easy/inorder_traversal.rs:46:4
[INFO] [stdout]    |
[INFO] [stdout] 46 | fn search_node(curr_node: &Rc<RefCell<TreeNode>>, tracker_vec: &mut Vec<i32>) {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/invert_binary_tree.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/invert_binary_tree.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn solve() -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse_reverse` is never used
[INFO] [stdout]   --> src/problems/easy/invert_binary_tree.rs:59:4
[INFO] [stdout]    |
[INFO] [stdout] 59 | fn recurse_reverse(node: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/is_happy.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> bool {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/is_isomorphic.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> bool {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/is_same_tree.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `WrappedTreeNode` is never used
[INFO] [stdout]   --> src/problems/easy/is_same_tree.rs:20:6
[INFO] [stdout]    |
[INFO] [stdout] 20 | type WrappedTreeNode = Option<Rc<RefCell<TreeNode>>>;
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/is_same_tree.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn solve() -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `compare_trees` is never used
[INFO] [stdout]   --> src/problems/easy/is_same_tree.rs:48:4
[INFO] [stdout]    |
[INFO] [stdout] 48 | fn compare_trees(p: &WrappedTreeNode, q: &WrappedTreeNode) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/is_symetric.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `WrappedTreeNode` is never used
[INFO] [stdout]   --> src/problems/easy/is_symetric.rs:20:6
[INFO] [stdout]    |
[INFO] [stdout] 20 | type WrappedTreeNode = Option<Rc<RefCell<TreeNode>>>;
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/is_symetric.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn solve() -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `cmp_nodes` is never used
[INFO] [stdout]   --> src/problems/easy/is_symetric.rs:60:4
[INFO] [stdout]    |
[INFO] [stdout] 60 | fn cmp_nodes(l_node: &WrappedTreeNode, r_node: &WrappedTreeNode) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/kata_machine.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> [i32; 10] {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/length_of_the_last_word.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/longest_common_prefix.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> String {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/majority_element.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/max_depth.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `WrappedTreeNode` is never used
[INFO] [stdout]   --> src/problems/easy/max_depth.rs:20:6
[INFO] [stdout]    |
[INFO] [stdout] 20 | type WrappedTreeNode = Option<Rc<RefCell<TreeNode>>>;
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/max_depth.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn solve() -> i32 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search` is never used
[INFO] [stdout]   --> src/problems/easy/max_depth.rs:69:4
[INFO] [stdout]    |
[INFO] [stdout] 69 | fn search(node: &WrappedTreeNode) -> i32 {
[INFO] [stdout]    |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 130 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/merge_sorted_arr.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/merge_two_sorted_lists.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 9  |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/merge_two_sorted_lists.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn solve() -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/minimum_depth_of_binary_tree.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/minimum_depth_of_binary_tree.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | pub fn solve() -> i32 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse` is never used
[INFO] [stdout]   --> src/problems/easy/minimum_depth_of_binary_tree.rs:54:4
[INFO] [stdout]    |
[INFO] [stdout] 54 | fn recurse(curr_node: &Option<Rc<RefCell<TreeNode>>>, curr_depth: &mut i32, shortest: &mut i32) {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/my_sqrt.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `naive_solve` is never used
[INFO] [stdout]   --> src/problems/easy/my_sqrt.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn naive_solve() -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyStack` is never constructed
[INFO] [stdout]  --> src/problems/easy/my_stack.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct MyStack {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `empty` are never used
[INFO] [stdout]   --> src/problems/easy/my_stack.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl MyStack {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout] 10 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn push(&mut self, x: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/my_stack.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn solve() {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/palindrome_number.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> bool {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/pascals_trianble_2.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/pascals_triangle.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/path_sum.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/path_sum.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn solve() -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse` is never used
[INFO] [stdout]   --> src/problems/easy/path_sum.rs:71:4
[INFO] [stdout]    |
[INFO] [stdout] 71 | fn recurse(curr_node: &Option<Rc<RefCell<TreeNode>>>, curr_sum: &mut i32, target: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/plus_one.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/postorder_traversal.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/postorder_traversal.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn solve() -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse` is never used
[INFO] [stdout]   --> src/problems/easy/postorder_traversal.rs:41:4
[INFO] [stdout]    |
[INFO] [stdout] 41 | fn recurse(node: &Option<Rc<RefCell<TreeNode>>>, order: &mut Vec<i32>) {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/preorder_traversal.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/preorder_traversal.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn solve() -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse` is never used
[INFO] [stdout]   --> src/problems/easy/preorder_traversal.rs:41:4
[INFO] [stdout]    |
[INFO] [stdout] 41 | fn recurse(node: &Option<Rc<RefCell<TreeNode>>>, order: &mut Vec<i32>) {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/remove_duplicates.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/remove_element.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/remove_elements.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/remove_elements.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn solve() -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/reverse_bits.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> u32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/reverse_list.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 9  |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/reverse_list.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn solve() -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/roman_to_integer.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/search_insert_position.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/single_number.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/easy/sorted_array_to_bst.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/easy/sorted_array_to_bst.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn solve() -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse` is never used
[INFO] [stdout]   --> src/problems/easy/sorted_array_to_bst.rs:27:4
[INFO] [stdout]    |
[INFO] [stdout] 27 | fn recurse(nums: &[i32]) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/str_in_str.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/title_to_number.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/two_sum.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/valid_palindrome.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> bool {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/easy/valid_parentheses.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> bool {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse` is never used
[INFO] [stdout]   --> src/problems/easy/valid_parentheses.rs:29:4
[INFO] [stdout]    |
[INFO] [stdout] 29 | fn reverse(c: char) -> char {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/hard/find_median_sorted_arrays.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> f64 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/medium/add_two_numbers.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     fn new(val: i32, next: Option<Box<ListNode>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/medium/add_two_numbers.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub fn solve() -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/int_to_roman.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> String {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/letter_combinations.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> Vec<String> {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recurse` is never used
[INFO] [stdout]   --> src/problems/medium/letter_combinations.rs:14:4
[INFO] [stdout]    |
[INFO] [stdout] 14 | fn recurse(
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_letters` is never used
[INFO] [stdout]   --> src/problems/medium/letter_combinations.rs:35:4
[INFO] [stdout]    |
[INFO] [stdout] 35 | fn get_letters(digit: char) -> String {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/longest_palindrome.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> String {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `palindrome_odd` is never used
[INFO] [stdout]   --> src/problems/medium/longest_palindrome.rs:13:4
[INFO] [stdout]    |
[INFO] [stdout] 13 | fn palindrome_odd(s: &str, curr_longest: &mut VecDeque<char>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `palindrome_even` is never used
[INFO] [stdout]   --> src/problems/medium/longest_palindrome.rs:46:4
[INFO] [stdout]    |
[INFO] [stdout] 46 | fn palindrome_even(s: &str, curr_longest: &mut VecDeque<char>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/longest_substring.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/max_area.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/my_atoi.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problems/medium/remove_nth_node_from_end.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 9  |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]   --> src/problems/medium/remove_nth_node_from_end.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn solve() -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/reverse_integer.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/three_sum.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/three_sum_closest.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn solve() -> i32 {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `solve` is never used
[INFO] [stdout]  --> src/problems/medium/zigzag_conversion.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn solve() -> String {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 130 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.50s
[INFO] running `Command { std: "docker" "inspect" "f5ac7cf250fa8e372aa044284487b560c600064544f420b0eaac339473394a7e", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "f5ac7cf250fa8e372aa044284487b560c600064544f420b0eaac339473394a7e", kill_on_drop: false }`
[INFO] [stdout] f5ac7cf250fa8e372aa044284487b560c600064544f420b0eaac339473394a7e