[INFO] cloning repository https://github.com/Raina3266/leetcode
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/Raina3266/leetcode" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FRaina3266%2Fleetcode", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FRaina3266%2Fleetcode'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 3ebae25ef71b2384016b2c9df98945aef51c18e5
[INFO] checking Raina3266/leetcode against master#c720f49c46ec3e70bbc2bbb3e0dd1fe7fc0a47f2 for pr-142712
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FRaina3266%2Fleetcode" "/workspace/builds/worker-1-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-1-tc1/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/Raina3266/leetcode
[INFO] finished tweaking git repo https://github.com/Raina3266/leetcode
[INFO] tweaked toml for git repo https://github.com/Raina3266/leetcode written to /workspace/builds/worker-1-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/Raina3266/leetcode on toolchain c720f49c46ec3e70bbc2bbb3e0dd1fe7fc0a47f2
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+c720f49c46ec3e70bbc2bbb3e0dd1fe7fc0a47f2" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/Raina3266/leetcode 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" "+c720f49c46ec3e70bbc2bbb3e0dd1fe7fc0a47f2" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+c720f49c46ec3e70bbc2bbb3e0dd1fe7fc0a47f2" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 49d8d37501999823ded263b14d4c8e49bf89ef14dcca4cb5e3f6d7824c538e94
[INFO] running `Command { std: "docker" "start" "-a" "49d8d37501999823ded263b14d4c8e49bf89ef14dcca4cb5e3f6d7824c538e94", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "49d8d37501999823ded263b14d4c8e49bf89ef14dcca4cb5e3f6d7824c538e94", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "49d8d37501999823ded263b14d4c8e49bf89ef14dcca4cb5e3f6d7824c538e94", kill_on_drop: false }`
[INFO] [stdout] 49d8d37501999823ded263b14d4c8e49bf89ef14dcca4cb5e3f6d7824c538e94
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+c720f49c46ec3e70bbc2bbb3e0dd1fe7fc0a47f2" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 1a8afb8bb03ac79381eac97525b10c61dcf031c185447c9d6d94dd60860f1275
[INFO] running `Command { std: "docker" "start" "-a" "1a8afb8bb03ac79381eac97525b10c61dcf031c185447c9d6d94dd60860f1275", kill_on_drop: false }`
[INFO] [stderr]    Compiling libc v0.2.153
[INFO] [stderr]     Checking cfg-if v1.0.0
[INFO] [stderr]    Compiling proc-macro2 v1.0.79
[INFO] [stderr]    Compiling unicode-ident v1.0.12
[INFO] [stderr]    Compiling rustix v0.38.31
[INFO] [stderr]     Checking bitflags v2.4.2
[INFO] [stderr]    Compiling libm v0.2.8
[INFO] [stderr]     Checking linux-raw-sys v0.4.13
[INFO] [stderr]    Compiling autocfg v1.1.0
[INFO] [stderr]     Checking ppv-lite86 v0.2.17
[INFO] [stderr]     Checking fastrand v2.0.1
[INFO] [stderr]     Checking fnv v1.0.7
[INFO] [stderr]     Checking quick-error v1.2.3
[INFO] [stderr]     Checking bit-vec v0.6.3
[INFO] [stderr]     Checking unarray v0.1.4
[INFO] [stderr]     Checking lazy_static v1.4.0
[INFO] [stderr]     Checking regex-syntax v0.8.2
[INFO] [stderr]     Checking bit-set v0.5.3
[INFO] [stderr]    Compiling num-traits v0.2.18
[INFO] [stderr]    Compiling quote v1.0.35
[INFO] [stderr]     Checking getrandom v0.2.12
[INFO] [stderr]     Checking wait-timeout v0.2.0
[INFO] [stderr]    Compiling syn v2.0.52
[INFO] [stderr]     Checking rand_core v0.6.4
[INFO] [stderr]     Checking rand_chacha v0.3.1
[INFO] [stderr]     Checking rand_xorshift v0.3.0
[INFO] [stderr]     Checking rand v0.8.5
[INFO] [stderr]     Checking tempfile v3.10.1
[INFO] [stderr]     Checking rusty-fork v0.3.0
[INFO] [stderr]     Checking proptest v1.4.0
[INFO] [stderr]    Compiling structmeta-derive v0.2.0
[INFO] [stderr]    Compiling structmeta v0.2.0
[INFO] [stderr]    Compiling test-strategy v0.3.1
[INFO] [stderr]     Checking leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `crate::Tree`
[INFO] [stdout]  --> src/question112.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::Tree;
[INFO] [stdout]   |     ^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::Tree`
[INFO] [stdout]  --> src/question112.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::Tree;
[INFO] [stdout]   |     ^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable expression
[INFO] [stdout]   --> src/question46.rs:61:5
[INFO] [stdout]    |
[INFO] [stdout] 53 | /     match json {
[INFO] [stdout] 54 | |         Json::Null => return 1,
[INFO] [stdout] 55 | |         Json::Bool(_) => return 1,
[INFO] [stdout] 56 | |         Json::Number(_) => return 8,
[INFO] [stdout] ...  |
[INFO] [stdout] 59 | |         Json::Map(hash_map) => return memory_usage_for_hashmap(hash_map),
[INFO] [stdout] 60 | |     }
[INFO] [stdout]    | |_____- any code following this `match` expression is unreachable, as all arms diverge
[INFO] [stdout] 61 |       todo!()
[INFO] [stdout]    |       ^^^^^^^ unreachable expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unreachable_code)]` on by default
[INFO] [stdout]    = note: this warning originates in the macro `todo` (in Nightly builds, run with -Z macro-backtrace for more info)
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/question509.rs:15:9
[INFO] [stdout]    |
[INFO] [stdout] 15 |     let mut map: HashMap<i32, i32> = HashMap::new();
[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: unreachable expression
[INFO] [stdout]   --> src/question46.rs:61:5
[INFO] [stdout]    |
[INFO] [stdout] 53 | /     match json {
[INFO] [stdout] 54 | |         Json::Null => return 1,
[INFO] [stdout] 55 | |         Json::Bool(_) => return 1,
[INFO] [stdout] 56 | |         Json::Number(_) => return 8,
[INFO] [stdout] ...  |
[INFO] [stdout] 59 | |         Json::Map(hash_map) => return memory_usage_for_hashmap(hash_map),
[INFO] [stdout] 60 | |     }
[INFO] [stdout]    | |_____- any code following this `match` expression is unreachable, as all arms diverge
[INFO] [stdout] 61 |       todo!()
[INFO] [stdout]    |       ^^^^^^^ unreachable expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unreachable_code)]` on by default
[INFO] [stdout]    = note: this warning originates in the macro `todo` (in Nightly builds, run with -Z macro-backtrace for more info)
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `root`
[INFO] [stdout]  --> src/question543.rs:3:32
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn diameter_of_binary_tree(root: &Tree<i32>) -> i32 {
[INFO] [stdout]   |                                ^^^^ help: if this is intentional, prefix it with an underscore: `_root`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head`
[INFO] [stdout]  --> src/question24.rs:4:18
[INFO] [stdout]   |
[INFO] [stdout] 4 |     let Some(mut head) = head else{
[INFO] [stdout]   |                  ^^^^ help: if this is intentional, prefix it with an underscore: `_head`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/question24.rs:4:14
[INFO] [stdout]   |
[INFO] [stdout] 4 |     let Some(mut head) = head else{
[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/question509.rs:15:9
[INFO] [stdout]    |
[INFO] [stdout] 15 |     let mut map: HashMap<i32, i32> = HashMap::new();
[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: `pointer`
[INFO] [stdout]  --> src/question83.rs:4:13
[INFO] [stdout]   |
[INFO] [stdout] 4 |     let mut pointer = head;
[INFO] [stdout]   |             ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_pointer`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/question83.rs:4:9
[INFO] [stdout]   |
[INFO] [stdout] 4 |     let mut pointer = head;
[INFO] [stdout]   |         ----^^^^^^^
[INFO] [stdout]   |         |
[INFO] [stdout]   |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `remain` is never read
[INFO] [stdout]  --> src/question1962.rs:8:17
[INFO] [stdout]   |
[INFO] [stdout] 8 |         let mut remain = 0;
[INFO] [stdout]   |                 ^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = help: maybe it is overwritten before being read?
[INFO] [stdout]   = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head`
[INFO] [stdout]   --> src/question77.rs:27:10
[INFO] [stdout]    |
[INFO] [stdout] 27 |     let (head, tail) = list.split_first().unwrap();
[INFO] [stdout]    |          ^^^^ help: if this is intentional, prefix it with an underscore: `_head`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/question77.rs:16:9
[INFO] [stdout]    |
[INFO] [stdout] 16 |     let mut list = list;
[INFO] [stdout]    |         ----^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `m`
[INFO] [stdout]  --> src/question63.rs:8:9
[INFO] [stdout]   |
[INFO] [stdout] 8 |     let m = obstacle_grid.len();
[INFO] [stdout]   |         ^ help: if this is intentional, prefix it with an underscore: `_m`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/question63.rs:9:9
[INFO] [stdout]   |
[INFO] [stdout] 9 |     let n = obstacle_grid[0].len();
[INFO] [stdout]   |         ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head1`
[INFO] [stdout]   --> src/question63.rs:31:10
[INFO] [stdout]    |
[INFO] [stdout] 31 |     let (head1, tail1) = obstacle_grid.split_first().unwrap();
[INFO] [stdout]    |          ^^^^^ help: if this is intentional, prefix it with an underscore: `_head1`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `grid`
[INFO] [stdout]  --> src/question64.rs:1:21
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn min_path_sum(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |                     ^^^^ help: if this is intentional, prefix it with an underscore: `_grid`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `small_nums` is never read
[INFO] [stdout]  --> src/question62.rs:3:13
[INFO] [stdout]   |
[INFO] [stdout] 3 |     let mut small_nums = vec![];
[INFO] [stdout]   |             ^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `f`
[INFO] [stdout]  --> src/question1971.rs:9:25
[INFO] [stdout]   |
[INFO] [stdout] 9 |     fn can_reach(&self, f: impl Fn() -> bool) {
[INFO] [stdout]   |                         ^ help: if this is intentional, prefix it with an underscore: `_f`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/question1971.rs:14:19
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn valid_path(n: i32, edges: Vec<Vec<i32>>, source: i32, destination: i32) -> bool {
[INFO] [stdout]    |                   ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/question1466.rs:3:20
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn min_reorder(n: i32, connections: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |                    ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/question2368.rs:3:24
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn reachable_nodes(n: i32, edges: Vec<Vec<i32>>, restricted: Vec<i32>) -> i32 {
[INFO] [stdout]   |                        ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `directions`
[INFO] [stdout]   --> src/question1091.rs:10:9
[INFO] [stdout]    |
[INFO] [stdout] 10 |     let directions = [
[INFO] [stdout]    |         ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_directions`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]    --> src/main.rs:165:8
[INFO] [stdout]     |
[INFO] [stdout] 163 | impl ListNode {
[INFO] [stdout]     | ------------- associated function in this implementation
[INFO] [stdout] 164 |     #[inline]
[INFO] [stdout] 165 |     fn new(val: i32) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]   --> src/question1.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn two_sum(nums: &[i32], target: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum_in_hashmap` is never used
[INFO] [stdout]   --> src/question1.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn two_sum_in_hashmap(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_subsequence` is never used
[INFO] [stdout]  --> src/question392.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn is_subsequence(little: String, big: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_string` is never used
[INFO] [stdout]  --> src/question344.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn reverse_string(s: &mut Vec<char>) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sorted_squares` is never used
[INFO] [stdout]  --> src/question977.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn sorted_squares(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_subarray_product_less_than_k` is never used
[INFO] [stdout]  --> src/question713.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn num_subarray_product_less_than_k(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/question100.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/question100.rs:11:10
[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 `is_same_tree` is never used
[INFO] [stdout]   --> src/question100.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn is_same_tree(p: Option<Rc<RefCell<TreeNode>>>, q: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `biggest_average` is never used
[INFO] [stdout]  --> src/question643.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn biggest_average(nums: Vec<i32>, k: i32) -> f64 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `biggest_average_better` is never used
[INFO] [stdout]   --> src/question643.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn biggest_average_better(nums: &[i32], k: usize) -> f64 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_elements` is never used
[INFO] [stdout]  --> src/question1426.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn count_elements(arr: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fib` is never used
[INFO] [stdout]   --> src/question509.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn fib(n: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fib_impl` is never used
[INFO] [stdout]   --> src/question509.rs:20:4
[INFO] [stdout]    |
[INFO] [stdout] 20 | fn fib_impl(n: i32, mut map: HashMap<i32, i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fib_fast` is never used
[INFO] [stdout]   --> src/question509.rs:35:4
[INFO] [stdout]    |
[INFO] [stdout] 35 | fn fib_fast(n: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `k_distinct_char` is never used
[INFO] [stdout]  --> src/k_distinct_char.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn k_distinct_char(k: usize, s: String) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_longest_substring` is never used
[INFO] [stdout]  --> src/question3.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn length_of_longest_substring(s: &str) -> usize {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_ones` is never used
[INFO] [stdout]  --> src/question1004.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn longest_ones(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `missing_number` is never used
[INFO] [stdout]  --> src/question268.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn missing_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `group_anagrams` is never used
[INFO] [stdout]  --> src/questin49.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]   --> src/question104.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub struct TreeNode {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/question104.rs:26:10
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |   #[inline]
[INFO] [stdout] 26 |   pub fn new(val: i32) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/question104.rs:36:8
[INFO] [stdout]    |
[INFO] [stdout] 36 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_depth` is never used
[INFO] [stdout]   --> src/question104.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 37 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 38 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_duplicates` is never used
[INFO] [stdout]  --> src/question1047.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn remove_duplicates(s: String) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `largest_unique_number` is never used
[INFO] [stdout]  --> src/question1133.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn largest_unique_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `foo` is never used
[INFO] [stdout]   --> src/question1133.rs:12:4
[INFO] [stdout]    |
[INFO] [stdout] 12 | fn foo() {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_number_of_balloons` is never used
[INFO] [stdout]  --> src/question1189.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn max_number_of_balloons(text: String) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `number_of_subarrays` is never used
[INFO] [stdout]  --> src/question1248.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn number_of_subarrays(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]  --> src/question125.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn is_palindrome(s: String) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_common_prefix` is never used
[INFO] [stdout]  --> src/question14.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn longest_common_prefix(strs: Vec<String>) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `all_start_with` is never used
[INFO] [stdout]   --> src/question14.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn all_start_with(prefix: &str, strs: &[String]) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/question111.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/question111.rs:11:10
[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 `min_depth` is never used
[INFO] [stdout]   --> src/question111.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn min_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_subarray` is never used
[INFO] [stdout]  --> src/question1438.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn longest_subarray(nums: Vec<i32>, limit: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `make_good` is never used
[INFO] [stdout]  --> src/question1544.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn make_good(s: String) -> String {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `are_occurrences_equal` is never used
[INFO] [stdout]  --> src/question1941.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn are_occurrences_equal(s: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid` is never used
[INFO] [stdout]  --> src/question20.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn is_valid(s: String) -> bool { 
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `diameter_of_binary_tree` is never used
[INFO] [stdout]  --> src/question543.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn diameter_of_binary_tree(root: &Tree<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_list` is never used
[INFO] [stdout]  --> src/question206.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_winners` is never used
[INFO] [stdout]  --> src/question2225.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn find_winners(matches: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `intersection` is never used
[INFO] [stdout]  --> src/question2248.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn intersection(nums: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `minimum_card_pickup` is never used
[INFO] [stdout]  --> src/question2260.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn minimum_card_pickup(cards: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `ways_to_split_array` is never used
[INFO] [stdout]  --> src/question2270.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn ways_to_split_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_power_of_two` is never used
[INFO] [stdout]  --> src/question231.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn is_power_of_two(n: u32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `maximum_sum` is never used
[INFO] [stdout]  --> src/question2342.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn maximum_sum(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `repeated_character` is never used
[INFO] [stdout]  --> src/question2351.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn repeated_character(s: String) -> char {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `equal_pairs` is never used
[INFO] [stdout]  --> src/question2352.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn equal_pairs(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sliding_window` is never used
[INFO] [stdout]  --> src/question239.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn max_sliding_window(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/question1448.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/question1448.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 `good_nodes` is never used
[INFO] [stdout]   --> src/question1448.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn good_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `good_nodes_inner` is never used
[INFO] [stdout]   --> src/question1448.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn good_nodes_inner(root: Option<Rc<RefCell<TreeNode>>>, mut max_ancestor: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `check_single_node` is never used
[INFO] [stdout]   --> src/question1448.rs:45:8
[INFO] [stdout]    |
[INFO] [stdout] 45 | pub fn check_single_node(root: &TreeNode, max_ancestor: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap_pairs` is never used
[INFO] [stdout]  --> src/question24.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn swap_pairs(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_duplicates` is never used
[INFO] [stdout]  --> src/question26.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_element` is never used
[INFO] [stdout]  --> src/question27.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `str_str` is never used
[INFO] [stdout]  --> src/question28.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn str_str(haystack: String, needle: String) -> i32 {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `str_str_2` is never used
[INFO] [stdout]   --> src/question28.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub fn str_str_2(haystack: String, needle: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MovingAverage` is never constructed
[INFO] [stdout]  --> src/question346.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct MovingAverage {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `next` are never used
[INFO] [stdout]   --> src/question346.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl MovingAverage {
[INFO] [stdout]    | ------------------ associated items in this implementation
[INFO] [stdout] 9  |     fn new(size: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn next(&mut self, val: i32) -> f64 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `can_construct` is never used
[INFO] [stdout]  --> src/question383.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn can_construct(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `group_anagrams` is never used
[INFO] [stdout]  --> src/question49.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `next_greater_element` is never used
[INFO] [stdout]  --> src/question496.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn next_greater_element(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_max_length` is never used
[INFO] [stdout]  --> src/question525.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn find_max_length(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `subarray_sum` is never used
[INFO] [stdout]  --> src/question560.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn subarray_sum(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/question66.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `plus_one` is never used
[INFO] [stdout]  --> src/question66.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 7 |     pub fn plus_one(digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `simplify_path` is never used
[INFO] [stdout]  --> src/question71.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn simplify_path(path: String) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `daily_temperatures` is never used
[INFO] [stdout]  --> src/question739.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn daily_temperatures(temperatures: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_jewels_in_stones` is never used
[INFO] [stdout]  --> src/question771.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn num_jewels_in_stones(jewels: String, stones: String) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `delete_duplicates` is never used
[INFO] [stdout]  --> src/question83.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_next` is never used
[INFO] [stdout]   --> src/question83.rs:16:4
[INFO] [stdout]    |
[INFO] [stdout] 16 | fn remove_next(node: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `backspace_compare` is never used
[INFO] [stdout]  --> src/question844.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn backspace_compare(s: String, t: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `middle_node` is never used
[INFO] [stdout]  --> src/question876.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn middle_node(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `advance` is never used
[INFO] [stdout]   --> src/question876.rs:14:4
[INFO] [stdout]    |
[INFO] [stdout] 14 | fn advance(node: Option<&Box<ListNode>>) -> Option<&Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `palindrome` is never used
[INFO] [stdout]  --> src/question9.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn palindrome(x: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `check_if_palindrome` is never used
[INFO] [stdout]  --> src/question9.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn check_if_palindrome(s: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `StockSpanner` is never constructed
[INFO] [stdout]  --> src/question901.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct StockSpanner {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `next` are never used
[INFO] [stdout]   --> src/question901.rs:7:8
[INFO] [stdout]    |
[INFO] [stdout] 6  | impl StockSpanner {
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 7  |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 11 |     fn next(&mut self, price: i32) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `RecentCounter` is never constructed
[INFO] [stdout]  --> src/question933.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct RecentCounter {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `ping` are never used
[INFO] [stdout]   --> src/question933.rs:8:8
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl RecentCounter {
[INFO] [stdout]    | ------------------ associated items in this implementation
[INFO] [stdout] 8  |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn ping(&mut self, t: i32) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_start_value` is never used
[INFO] [stdout]  --> src/question1413.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn min_start_value(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `check_if_pangram` is never used
[INFO] [stdout]  --> src/question1832.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn check_if_pangram(sentence: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_averages` is never used
[INFO] [stdout]  --> src/question2090.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn get_averages(nums: Vec<i32>, k: usize) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `running_sum` is never used
[INFO] [stdout]  --> src/question1480.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn running_sum(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/question112.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/question112.rs:12:10
[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 `has_path_sum` is never used
[INFO] [stdout]   --> src/question112.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lowest_common_ancestor` is never used
[INFO] [stdout]  --> src/question236.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn lowest_common_ancestor(root: &Tree<i32>, p: i32, q: i32) -> &Tree<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `in_left_side` is never used
[INFO] [stdout]   --> src/question236.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn in_left_side(tree: &Tree<i32>, target: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `tree_contains` is never used
[INFO] [stdout]   --> src/question236.rs:26:4
[INFO] [stdout]    |
[INFO] [stdout] 26 | fn tree_contains(tree: &Tree<i32>, target: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `root`
[INFO] [stdout]  --> src/question543.rs:3:32
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn diameter_of_binary_tree(root: &Tree<i32>) -> i32 {
[INFO] [stdout]   |                                ^^^^ help: if this is intentional, prefix it with an underscore: `_root`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_ancestor_diff` is never used
[INFO] [stdout]  --> src/question1026.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn max_ancestor_diff(root: TreeNode) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `last_stone_weight` is never used
[INFO] [stdout]  --> src/question1046.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn last_stone_weight(stones: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `F64Ord` is never constructed
[INFO] [stdout]  --> src/question2208.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct F64Ord(f64);
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `halve_array` is never used
[INFO] [stdout]   --> src/question2208.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 33 | pub fn halve_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `median_sliding_window` is never used
[INFO] [stdout]  --> src/question480.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn median_sliding_window(nums: Vec<i32>, k: i32) -> Vec<f64> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `balance_two_heaps` is never used
[INFO] [stdout]   --> src/question480.rs:45:4
[INFO] [stdout]    |
[INFO] [stdout] 45 | fn balance_two_heaps(max_heap: &mut BinaryHeap<i32>, min_heap: &mut BinaryHeap<Reverse<i32>>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_one_element_max` is never used
[INFO] [stdout]   --> src/question480.rs:54:4
[INFO] [stdout]    |
[INFO] [stdout] 54 | fn remove_one_element_max(heap: &mut BinaryHeap<i32>, remove: i32) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_one_element_min` is never used
[INFO] [stdout]   --> src/question480.rs:68:4
[INFO] [stdout]    |
[INFO] [stdout] 68 | fn remove_one_element_min(heap: &mut BinaryHeap<Reverse<i32>>, remove: i32) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `calculate_the_median` is never used
[INFO] [stdout]   --> src/question480.rs:83:4
[INFO] [stdout]    |
[INFO] [stdout] 83 | fn calculate_the_median(max_heap: &BinaryHeap<i32>, min_heap: &BinaryHeap<Reverse<i32>>) -> f64 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_stone_sum` is never used
[INFO] [stdout]  --> src/question1962.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn min_stone_sum(piles: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `connect_sticks` is never used
[INFO] [stdout]  --> src/question1167.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn connect_sticks(sticks: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `top_k_frequent` is never used
[INFO] [stdout]  --> src/question347.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_closest_elements` is never used
[INFO] [stdout]  --> src/question658.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn find_closest_elements(arr: Vec<i32>, k: i32, x: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_closest_elements_middle` is never used
[INFO] [stdout]   --> src/question658.rs:24:4
[INFO] [stdout]    |
[INFO] [stdout] 24 | fn find_closest_elements_middle(arr: Vec<i32>, k: i32, x: i32) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_kth_largest` is never used
[INFO] [stdout]  --> src/question215.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `KthLargest` is never constructed
[INFO] [stdout]  --> src/question703.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct KthLargest {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `add` are never used
[INFO] [stdout]   --> src/question703.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl KthLargest {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 11 |     fn new(k: i32, nums: Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn add(&mut self, val: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `k_closest` is never used
[INFO] [stdout]  --> src/question973.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn k_closest(points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `asteroids_destroyed` is never used
[INFO] [stdout]  --> src/question2126.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn asteroids_destroyed(mass: i32, asteroids: Vec<i32>) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `partition_array` is never used
[INFO] [stdout]  --> src/question2294.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn partition_array(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `return_index` is never used
[INFO] [stdout]   --> src/question2294.rs:16:4
[INFO] [stdout]    |
[INFO] [stdout] 16 | fn return_index(nums: &[i32], max: i32) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `maximum69_number` is never used
[INFO] [stdout]  --> src/question1323.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn maximum69_number(num: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `turn_nums_into_num` is never used
[INFO] [stdout]   --> src/question1323.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn turn_nums_into_num(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `maximum_units` is never used
[INFO] [stdout]  --> src/question1710.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn maximum_units(box_types: Vec<Vec<i32>>, truck_size: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_number_of_apples` is never used
[INFO] [stdout]  --> src/question1196.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn max_number_of_apples(weight: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_set_size` is never used
[INFO] [stdout]  --> src/question1338.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn min_set_size(arr: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_least_num_of_unique_ints` is never used
[INFO] [stdout]  --> src/question1481.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn find_least_num_of_unique_ints(arr: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_rescue_boats` is never used
[INFO] [stdout]  --> src/question881.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn num_rescue_boats(people: Vec<i32>, limit: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search` is never used
[INFO] [stdout]  --> src/question704.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `answer_queries` is never used
[INFO] [stdout]  --> src/question2389.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn answer_queries(nums: Vec<i32>, queries: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `check_one_query` is never used
[INFO] [stdout]   --> src/question2389.rs:11:4
[INFO] [stdout]    |
[INFO] [stdout] 11 | fn check_one_query(nums: &[i32], query: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_matrix` is never used
[INFO] [stdout]  --> src/question74.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_insert` is never used
[INFO] [stdout]   --> src/question74.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | pub fn search_insert(nums: &[i32], target: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `successful_pairs` is never used
[INFO] [stdout]  --> src/question2300.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn successful_pairs(spells: Vec<i32>, potions: Vec<i32>, success: i64) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `one_spell_for_potions` is never used
[INFO] [stdout]   --> src/question2300.rs:13:4
[INFO] [stdout]    |
[INFO] [stdout] 13 | fn one_spell_for_potions(spell: i32, potions: &[i32], success: i64) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_eating_speed` is never used
[INFO] [stdout]  --> src/question875.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn min_eating_speed(piles: Vec<i32>, h: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `calculate_hours_for_one_speed` is never used
[INFO] [stdout]   --> src/question875.rs:38:4
[INFO] [stdout]    |
[INFO] [stdout] 38 | fn calculate_hours_for_one_speed(piles: &[i32], speed: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `smallest_divisor` is never used
[INFO] [stdout]  --> src/question1283.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn smallest_divisor(nums: Vec<i32>, threshold: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `calculate_sum_for_one_divisor` is never used
[INFO] [stdout]   --> src/question1283.rs:37:4
[INFO] [stdout]    |
[INFO] [stdout] 37 | fn calculate_sum_for_one_divisor(nums: &[i32], divisor: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `minimum_effort_path` is never used
[INFO] [stdout]  --> src/question1631.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn minimum_effort_path(heights: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `permute` is never used
[INFO] [stdout]  --> src/question46.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insert_head` is never used
[INFO] [stdout]   --> src/question46.rs:16:4
[INFO] [stdout]    |
[INFO] [stdout] 16 | fn insert_head(head: i32, tail: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `Json` is never used
[INFO] [stdout]   --> src/question46.rs:43:6
[INFO] [stdout]    |
[INFO] [stdout] 43 | enum Json {
[INFO] [stdout]    |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `total_memory_usage` is never used
[INFO] [stdout]   --> src/question46.rs:52:4
[INFO] [stdout]    |
[INFO] [stdout] 52 | fn total_memory_usage(json: &Json) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `memory_usage_for_array` is never used
[INFO] [stdout]   --> src/question46.rs:64:4
[INFO] [stdout]    |
[INFO] [stdout] 64 | fn memory_usage_for_array(list: &[Json]) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `memory_usage_for_hashmap` is never used
[INFO] [stdout]   --> src/question46.rs:72:4
[INFO] [stdout]    |
[INFO] [stdout] 72 | fn memory_usage_for_hashmap(map: &HashMap<String, Json>) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `combine` is never used
[INFO] [stdout]  --> src/question77.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fix_length_combine` is never used
[INFO] [stdout]   --> src/question77.rs:14:4
[INFO] [stdout]    |
[INFO] [stdout] 14 | fn fix_length_combine(list: Vec<i32>, nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `subsets` is never used
[INFO] [stdout]  --> src/question78.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `split` is never used
[INFO] [stdout]   --> src/question78.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn split(nums: Vec<i32>, i: usize) -> (i32, Vec<i32>) {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `letter_combinations` is never used
[INFO] [stdout]  --> src/question17.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `combine` is never used
[INFO] [stdout]   --> src/question17.rs:40:4
[INFO] [stdout]    |
[INFO] [stdout] 40 | fn combine(nums: Vec<Vec<char>>) -> Vec<Vec<char>> {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `unique_paths_with_obstacles` is never used
[INFO] [stdout]  --> src/question63.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn unique_paths_with_obstacles(obstacle_grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_path_sum` is never used
[INFO] [stdout]  --> src/question64.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn min_path_sum(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rob` is never used
[INFO] [stdout]  --> src/question198.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `unique_paths` is never used
[INFO] [stdout]  --> src/question62.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn unique_paths(m: i32, n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `change_big_nums` is never used
[INFO] [stdout]   --> src/question62.rs:30:4
[INFO] [stdout]    |
[INFO] [stdout] 30 | fn change_big_nums(big_nums: &mut Vec<i32>, num: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `unique_path_two` is never used
[INFO] [stdout]   --> src/question62.rs:40:8
[INFO] [stdout]    |
[INFO] [stdout] 40 | pub fn unique_path_two(m: i32, n: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_cost_climbing_stairs` is never used
[INFO] [stdout]  --> src/question746.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn min_cost_climbing_stairs(cost: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_lis` is never used
[INFO] [stdout]  --> src/question300.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn length_of_lis(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `climb_stairs` is never used
[INFO] [stdout]  --> src/question70.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `climb_stairs_recur` is never used
[INFO] [stdout]  --> src/question70.rs:8:4
[INFO] [stdout]   |
[INFO] [stdout] 8 | fn climb_stairs_recur(memory: &mut HashMap<i32, i32>, n: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `coin_change` is never used
[INFO] [stdout]  --> src/question322.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `coin_change_2` is never used
[INFO] [stdout]   --> src/question322.rs:10:4
[INFO] [stdout]    |
[INFO] [stdout] 10 | fn coin_change_2(coins: &[i32], amount: i32, map: &mut HashMap<i32, Option<i32>>) -> Option<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_circle_num` is never used
[INFO] [stdout]  --> src/question547.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn find_circle_num(is_connected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `has_seen` is never used
[INFO] [stdout]   --> src/question547.rs:30:4
[INFO] [stdout]    |
[INFO] [stdout] 30 | fn has_seen(
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Grid` is never constructed
[INFO] [stdout]  --> src/question200.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Grid {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `visit` are never used
[INFO] [stdout]   --> src/question200.rs:8:8
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl Grid {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 8  |     fn new(input: Vec<Vec<char>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn visit(&mut self, x: isize, y: isize) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_islands` is never used
[INFO] [stdout]   --> src/question200.rs:45:8
[INFO] [stdout]    |
[INFO] [stdout] 45 | pub fn num_islands(grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Graph` is never constructed
[INFO] [stdout]  --> src/question1971.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Graph {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `can_reach` is never used
[INFO] [stdout]  --> src/question1971.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Graph {
[INFO] [stdout]   | ---------- method in this implementation
[INFO] [stdout] 9 |     fn can_reach(&self, f: impl Fn() -> bool) {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `valid_path` is never used
[INFO] [stdout]   --> src/question1971.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn valid_path(n: i32, edges: Vec<Vec<i32>>, source: i32, destination: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `check_pass` is never used
[INFO] [stdout]   --> src/question1971.rs:32:4
[INFO] [stdout]    |
[INFO] [stdout] 32 | fn check_pass(
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_components` is never used
[INFO] [stdout]  --> src/question323.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn count_components(n: i32, edges: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `all_edges_from_one_node` is never used
[INFO] [stdout]   --> src/question323.rs:25:4
[INFO] [stdout]    |
[INFO] [stdout] 25 | fn all_edges_from_one_node(map: &HashMap<i32, Vec<i32>>, sett: &mut HashSet<i32>, node: i32) -> HashSet<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Grid` is never constructed
[INFO] [stdout]  --> src/question695.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Grid {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `visit` are never used
[INFO] [stdout]   --> src/question695.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl Grid {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 10 |     fn new(input: Vec<Vec<i32>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn visit(
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_area_of_island` is never used
[INFO] [stdout]   --> src/question695.rs:54:8
[INFO] [stdout]    |
[INFO] [stdout] 54 | pub fn max_area_of_island(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_reorder` is never used
[INFO] [stdout]  --> src/question1466.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn min_reorder(n: i32, connections: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `all_connections_away_zero` is never used
[INFO] [stdout]   --> src/question1466.rs:26:4
[INFO] [stdout]    |
[INFO] [stdout] 26 | fn all_connections_away_zero(
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reachable_nodes` is never used
[INFO] [stdout]  --> src/question2368.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn reachable_nodes(n: i32, edges: Vec<Vec<i32>>, restricted: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `all_connections_away_zero` is never used
[INFO] [stdout]   --> src/question2368.rs:19:4
[INFO] [stdout]    |
[INFO] [stdout] 19 | fn all_connections_away_zero(
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `all_paths_source_target` is never used
[INFO] [stdout]  --> src/question797.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn all_paths_source_target(graph: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `split` is never used
[INFO] [stdout]   --> src/question797.rs:20:4
[INFO] [stdout]    |
[INFO] [stdout] 20 | fn split(map: &HashMap<usize, Vec<i32>>, edges: &[i32], results: &mut Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `start_to_end` is never used
[INFO] [stdout]   --> src/question797.rs:33:4
[INFO] [stdout]    |
[INFO] [stdout] 33 | fn start_to_end(
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `shortest_path_binary_matrix` is never used
[INFO] [stdout]  --> src/question1091.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn shortest_path_binary_matrix(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array` is never used
[INFO] [stdout]  --> src/question53.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn max_sub_array(nums: &[i32]) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_profit` is never used
[INFO] [stdout]  --> src/question121.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn max_profit(prices: &[i32]) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `contains_duplicate` is never used
[INFO] [stdout]  --> src/question217.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn contains_duplicate(nums: &[i32]) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `product_except_self` is never used
[INFO] [stdout]  --> src/question238.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn product_except_self(nums: &[i32]) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_anagram` is never used
[INFO] [stdout]  --> src/question242.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn is_anagram(s: &str, t: &str) -> bool { 
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `calculate_char_counts` is never used
[INFO] [stdout]  --> src/question242.rs:9:4
[INFO] [stdout]   |
[INFO] [stdout] 9 | fn calculate_char_counts(string: &str) -> HashMap<char, usize> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]  --> src/palindrome.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn is_palindrome(x: u32) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome_2` is never used
[INFO] [stdout]   --> src/palindrome.rs:32:4
[INFO] [stdout]    |
[INFO] [stdout] 32 | fn is_palindrome_2(mut x: u32) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `Json` is never used
[INFO] [stdout]   --> src/palindrome.rs:45:6
[INFO] [stdout]    |
[INFO] [stdout] 45 | enum Json {
[INFO] [stdout]    |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/tree_practice.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct TreeNode {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `visit`, `sum`, `product`, `max`, and `min` are never used
[INFO] [stdout]   --> src/tree_practice.rs:8:8
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl TreeNode {
[INFO] [stdout]    | ------------- methods in this implementation
[INFO] [stdout] 8  |     fn visit(&self, mut f: impl FnMut(&i32)) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn sum(&self)-> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     fn product(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn max(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn min(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_even` is never used
[INFO] [stdout]   --> src/recursion_practice.rs:10:4
[INFO] [stdout]    |
[INFO] [stdout] 10 | fn is_even(x: u64) -> bool {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `list_length` is never used
[INFO] [stdout]   --> src/recursion_practice.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn list_length(list: &[i32]) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `list_max` is never used
[INFO] [stdout]   --> src/recursion_practice.rs:29:4
[INFO] [stdout]    |
[INFO] [stdout] 29 | fn list_max(list: &[i32]) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fibonacci` is never used
[INFO] [stdout]   --> src/recursion_practice.rs:38:4
[INFO] [stdout]    |
[INFO] [stdout] 38 | fn fibonacci(n: u32) -> u32 {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search` is never used
[INFO] [stdout]   --> src/recursion_practice.rs:48:4
[INFO] [stdout]    |
[INFO] [stdout] 48 | fn binary_search(sorted_list: &[i32], target: i32) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sort` is never used
[INFO] [stdout]   --> src/recursion_practice.rs:73:4
[INFO] [stdout]    |
[INFO] [stdout] 73 | fn sort(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_two_lists` is never used
[INFO] [stdout]   --> src/recursion_practice.rs:84:4
[INFO] [stdout]    |
[INFO] [stdout] 84 | fn merge_two_lists(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sort_two_list` is never used
[INFO] [stdout]  --> src/two_lists.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn sort_two_list(nums1: &[i32], nums2: &[i32]) -> Vec<i32>{
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sort_two_list_bad` is never used
[INFO] [stdout]   --> src/two_lists.rs:40:4
[INFO] [stdout]    |
[INFO] [stdout] 40 | fn sort_two_list_bad(nums1: &[i32], nums2: &[i32]) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `three_sum` is never used
[INFO] [stdout]  --> src/question15.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum_i` is never used
[INFO] [stdout]   --> src/question15.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn two_sum_i(nums: &[i32], target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `four_sum` is never used
[INFO] [stdout]  --> src/question18.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn four_sum(nums: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyCircularQueue` is never constructed
[INFO] [stdout]  --> src/question622.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct MyCircularQueue {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/question622.rs:6:8
[INFO] [stdout]    |
[INFO] [stdout] 5  | impl MyCircularQueue {
[INFO] [stdout]    | -------------------- associated items in this implementation
[INFO] [stdout] 6  |     fn new(k: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 10 |     fn en_queue(&mut self, value: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn de_queue(&mut self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn front(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn rear(&self) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn is_empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn is_full(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Grid` is never constructed
[INFO] [stdout]  --> src/question289.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Grid {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `live_neighbors` are never used
[INFO] [stdout]   --> src/question289.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Grid {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 13 |     fn new(data: Vec<Vec<i32>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     fn live_neighbors(&self, (x, y): (usize, usize)) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `game_of_life` is never used
[INFO] [stdout]   --> src/question289.rs:60:8
[INFO] [stdout]    |
[INFO] [stdout] 60 | pub fn game_of_life(board: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `CustomStack` is never constructed
[INFO] [stdout]  --> src/question1381.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct CustomStack {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, and `increment` are never used
[INFO] [stdout]   --> src/question1381.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl CustomStack {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 8  |
[INFO] [stdout] 9  |     fn new(maxSize: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn push(&mut self, x: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn increment(&mut self, k: i32, val: i32) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `maxSize` should have a snake case name
[INFO] [stdout]  --> src/question1381.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 9 |     fn new(maxSize: i32) -> Self {
[INFO] [stdout]   |            ^^^^^^^ help: convert the identifier to snake case: `max_size`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head`
[INFO] [stdout]  --> src/question24.rs:4:18
[INFO] [stdout]   |
[INFO] [stdout] 4 |     let Some(mut head) = head else{
[INFO] [stdout]   |                  ^^^^ help: if this is intentional, prefix it with an underscore: `_head`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/question24.rs:4:14
[INFO] [stdout]   |
[INFO] [stdout] 4 |     let Some(mut head) = head else{
[INFO] [stdout]   |              ----^^^^
[INFO] [stdout]   |              |
[INFO] [stdout]   |              help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `pointer`
[INFO] [stdout]  --> src/question83.rs:4:13
[INFO] [stdout]   |
[INFO] [stdout] 4 |     let mut pointer = head;
[INFO] [stdout]   |             ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_pointer`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/question83.rs:4:9
[INFO] [stdout]   |
[INFO] [stdout] 4 |     let mut pointer = head;
[INFO] [stdout]   |         ----^^^^^^^
[INFO] [stdout]   |         |
[INFO] [stdout]   |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `remain` is never read
[INFO] [stdout]  --> src/question1962.rs:8:17
[INFO] [stdout]   |
[INFO] [stdout] 8 |         let mut remain = 0;
[INFO] [stdout]   |                 ^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = help: maybe it is overwritten before being read?
[INFO] [stdout]   = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head`
[INFO] [stdout]   --> src/question77.rs:27:10
[INFO] [stdout]    |
[INFO] [stdout] 27 |     let (head, tail) = list.split_first().unwrap();
[INFO] [stdout]    |          ^^^^ help: if this is intentional, prefix it with an underscore: `_head`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/question77.rs:16:9
[INFO] [stdout]    |
[INFO] [stdout] 16 |     let mut list = list;
[INFO] [stdout]    |         ----^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `m`
[INFO] [stdout]  --> src/question63.rs:8:9
[INFO] [stdout]   |
[INFO] [stdout] 8 |     let m = obstacle_grid.len();
[INFO] [stdout]   |         ^ help: if this is intentional, prefix it with an underscore: `_m`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/question63.rs:9:9
[INFO] [stdout]   |
[INFO] [stdout] 9 |     let n = obstacle_grid[0].len();
[INFO] [stdout]   |         ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head1`
[INFO] [stdout]   --> src/question63.rs:31:10
[INFO] [stdout]    |
[INFO] [stdout] 31 |     let (head1, tail1) = obstacle_grid.split_first().unwrap();
[INFO] [stdout]    |          ^^^^^ help: if this is intentional, prefix it with an underscore: `_head1`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `grid`
[INFO] [stdout]  --> src/question64.rs:1:21
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn min_path_sum(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |                     ^^^^ help: if this is intentional, prefix it with an underscore: `_grid`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `small_nums` is never read
[INFO] [stdout]  --> src/question62.rs:3:13
[INFO] [stdout]   |
[INFO] [stdout] 3 |     let mut small_nums = vec![];
[INFO] [stdout]   |             ^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `print`
[INFO] [stdout]   --> src/question547.rs:58:9
[INFO] [stdout]    |
[INFO] [stdout] 58 |     let print: Vec<&i32> = result.iter().collect();
[INFO] [stdout]    |         ^^^^^ help: if this is intentional, prefix it with an underscore: `_print`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `f`
[INFO] [stdout]  --> src/question1971.rs:9:25
[INFO] [stdout]   |
[INFO] [stdout] 9 |     fn can_reach(&self, f: impl Fn() -> bool) {
[INFO] [stdout]   |                         ^ help: if this is intentional, prefix it with an underscore: `_f`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/question1971.rs:14:19
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn valid_path(n: i32, edges: Vec<Vec<i32>>, source: i32, destination: i32) -> bool {
[INFO] [stdout]    |                   ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/question1466.rs:3:20
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn min_reorder(n: i32, connections: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |                    ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/question2368.rs:3:24
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn reachable_nodes(n: i32, edges: Vec<Vec<i32>>, restricted: Vec<i32>) -> i32 {
[INFO] [stdout]   |                        ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `directions`
[INFO] [stdout]   --> src/question1091.rs:10:9
[INFO] [stdout]    |
[INFO] [stdout] 10 |     let directions = [
[INFO] [stdout]    |         ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_directions`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]    --> src/main.rs:165:8
[INFO] [stdout]     |
[INFO] [stdout] 163 | impl ListNode {
[INFO] [stdout]     | ------------- associated function in this implementation
[INFO] [stdout] 164 |     #[inline]
[INFO] [stdout] 165 |     fn new(val: i32) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum_in_hashmap` is never used
[INFO] [stdout]   --> src/question1.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn two_sum_in_hashmap(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_subsequence` is never used
[INFO] [stdout]  --> src/question392.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn is_subsequence(little: String, big: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_subarray_product_less_than_k` is never used
[INFO] [stdout]  --> src/question713.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn num_subarray_product_less_than_k(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/question100.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/question100.rs:11:10
[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 `is_same_tree` is never used
[INFO] [stdout]   --> src/question100.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn is_same_tree(p: Option<Rc<RefCell<TreeNode>>>, q: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `biggest_average` is never used
[INFO] [stdout]  --> src/question643.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn biggest_average(nums: Vec<i32>, k: i32) -> f64 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `biggest_average_better` is never used
[INFO] [stdout]   --> src/question643.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn biggest_average_better(nums: &[i32], k: usize) -> f64 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_elements` is never used
[INFO] [stdout]  --> src/question1426.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn count_elements(arr: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fib` is never used
[INFO] [stdout]   --> src/question509.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn fib(n: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fib_impl` is never used
[INFO] [stdout]   --> src/question509.rs:20:4
[INFO] [stdout]    |
[INFO] [stdout] 20 | fn fib_impl(n: i32, mut map: HashMap<i32, i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fib_fast` is never used
[INFO] [stdout]   --> src/question509.rs:35:4
[INFO] [stdout]    |
[INFO] [stdout] 35 | fn fib_fast(n: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `k_distinct_char` is never used
[INFO] [stdout]  --> src/k_distinct_char.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn k_distinct_char(k: usize, s: String) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_longest_substring` is never used
[INFO] [stdout]  --> src/question3.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn length_of_longest_substring(s: &str) -> usize {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_ones` is never used
[INFO] [stdout]  --> src/question1004.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn longest_ones(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `missing_number` is never used
[INFO] [stdout]  --> src/question268.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn missing_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `group_anagrams` is never used
[INFO] [stdout]  --> src/questin49.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]   --> src/question104.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub struct TreeNode {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/question104.rs:26:10
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |   #[inline]
[INFO] [stdout] 26 |   pub fn new(val: i32) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/question104.rs:36:8
[INFO] [stdout]    |
[INFO] [stdout] 36 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_depth` is never used
[INFO] [stdout]   --> src/question104.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 37 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 38 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_duplicates` is never used
[INFO] [stdout]  --> src/question1047.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn remove_duplicates(s: String) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `largest_unique_number` is never used
[INFO] [stdout]  --> src/question1133.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn largest_unique_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `foo` is never used
[INFO] [stdout]   --> src/question1133.rs:12:4
[INFO] [stdout]    |
[INFO] [stdout] 12 | fn foo() {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_number_of_balloons` is never used
[INFO] [stdout]  --> src/question1189.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn max_number_of_balloons(text: String) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `number_of_subarrays` is never used
[INFO] [stdout]  --> src/question1248.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn number_of_subarrays(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_common_prefix` is never used
[INFO] [stdout]  --> src/question14.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn longest_common_prefix(strs: Vec<String>) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `all_start_with` is never used
[INFO] [stdout]   --> src/question14.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn all_start_with(prefix: &str, strs: &[String]) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/question111.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/question111.rs:11:10
[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 `min_depth` is never used
[INFO] [stdout]   --> src/question111.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn min_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_subarray` is never used
[INFO] [stdout]  --> src/question1438.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn longest_subarray(nums: Vec<i32>, limit: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `make_good` is never used
[INFO] [stdout]  --> src/question1544.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn make_good(s: String) -> String {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `are_occurrences_equal` is never used
[INFO] [stdout]  --> src/question1941.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn are_occurrences_equal(s: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid` is never used
[INFO] [stdout]  --> src/question20.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn is_valid(s: String) -> bool { 
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `diameter_of_binary_tree` is never used
[INFO] [stdout]  --> src/question543.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn diameter_of_binary_tree(root: &Tree<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_list` is never used
[INFO] [stdout]  --> src/question206.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_winners` is never used
[INFO] [stdout]  --> src/question2225.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn find_winners(matches: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `intersection` is never used
[INFO] [stdout]  --> src/question2248.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn intersection(nums: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `minimum_card_pickup` is never used
[INFO] [stdout]  --> src/question2260.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn minimum_card_pickup(cards: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `ways_to_split_array` is never used
[INFO] [stdout]  --> src/question2270.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn ways_to_split_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `maximum_sum` is never used
[INFO] [stdout]  --> src/question2342.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn maximum_sum(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `repeated_character` is never used
[INFO] [stdout]  --> src/question2351.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn repeated_character(s: String) -> char {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `equal_pairs` is never used
[INFO] [stdout]  --> src/question2352.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn equal_pairs(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sliding_window` is never used
[INFO] [stdout]  --> src/question239.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn max_sliding_window(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/question1448.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/question1448.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 `good_nodes` is never used
[INFO] [stdout]   --> src/question1448.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn good_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `good_nodes_inner` is never used
[INFO] [stdout]   --> src/question1448.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn good_nodes_inner(root: Option<Rc<RefCell<TreeNode>>>, mut max_ancestor: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `check_single_node` is never used
[INFO] [stdout]   --> src/question1448.rs:45:8
[INFO] [stdout]    |
[INFO] [stdout] 45 | pub fn check_single_node(root: &TreeNode, max_ancestor: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap_pairs` is never used
[INFO] [stdout]  --> src/question24.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn swap_pairs(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `str_str` is never used
[INFO] [stdout]  --> src/question28.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn str_str(haystack: String, needle: String) -> i32 {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `str_str_2` is never used
[INFO] [stdout]   --> src/question28.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub fn str_str_2(haystack: String, needle: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MovingAverage` is never constructed
[INFO] [stdout]  --> src/question346.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct MovingAverage {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `next` are never used
[INFO] [stdout]   --> src/question346.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl MovingAverage {
[INFO] [stdout]    | ------------------ associated items in this implementation
[INFO] [stdout] 9  |     fn new(size: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn next(&mut self, val: i32) -> f64 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `can_construct` is never used
[INFO] [stdout]  --> src/question383.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn can_construct(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `group_anagrams` is never used
[INFO] [stdout]  --> src/question49.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `next_greater_element` is never used
[INFO] [stdout]  --> src/question496.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn next_greater_element(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_max_length` is never used
[INFO] [stdout]  --> src/question525.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn find_max_length(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `subarray_sum` is never used
[INFO] [stdout]  --> src/question560.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn subarray_sum(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `simplify_path` is never used
[INFO] [stdout]  --> src/question71.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn simplify_path(path: String) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `daily_temperatures` is never used
[INFO] [stdout]  --> src/question739.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn daily_temperatures(temperatures: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_jewels_in_stones` is never used
[INFO] [stdout]  --> src/question771.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn num_jewels_in_stones(jewels: String, stones: String) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `delete_duplicates` is never used
[INFO] [stdout]  --> src/question83.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_next` is never used
[INFO] [stdout]   --> src/question83.rs:16:4
[INFO] [stdout]    |
[INFO] [stdout] 16 | fn remove_next(node: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `backspace_compare` is never used
[INFO] [stdout]  --> src/question844.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn backspace_compare(s: String, t: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `middle_node` is never used
[INFO] [stdout]  --> src/question876.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn middle_node(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `advance` is never used
[INFO] [stdout]   --> src/question876.rs:14:4
[INFO] [stdout]    |
[INFO] [stdout] 14 | fn advance(node: Option<&Box<ListNode>>) -> Option<&Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `palindrome` is never used
[INFO] [stdout]  --> src/question9.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn palindrome(x: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `StockSpanner` is never constructed
[INFO] [stdout]  --> src/question901.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct StockSpanner {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `next` are never used
[INFO] [stdout]   --> src/question901.rs:7:8
[INFO] [stdout]    |
[INFO] [stdout] 6  | impl StockSpanner {
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 7  |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 11 |     fn next(&mut self, price: i32) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `RecentCounter` is never constructed
[INFO] [stdout]  --> src/question933.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct RecentCounter {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `ping` are never used
[INFO] [stdout]   --> src/question933.rs:8:8
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl RecentCounter {
[INFO] [stdout]    | ------------------ associated items in this implementation
[INFO] [stdout] 8  |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn ping(&mut self, t: i32) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `check_if_pangram` is never used
[INFO] [stdout]  --> src/question1832.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn check_if_pangram(sentence: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_averages` is never used
[INFO] [stdout]  --> src/question2090.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn get_averages(nums: Vec<i32>, k: usize) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `running_sum` is never used
[INFO] [stdout]  --> src/question1480.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn running_sum(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/question112.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/question112.rs:12:10
[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 `has_path_sum` is never used
[INFO] [stdout]   --> src/question112.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lowest_common_ancestor` is never used
[INFO] [stdout]  --> src/question236.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn lowest_common_ancestor(root: &Tree<i32>, p: i32, q: i32) -> &Tree<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `in_left_side` is never used
[INFO] [stdout]   --> src/question236.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn in_left_side(tree: &Tree<i32>, target: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `tree_contains` is never used
[INFO] [stdout]   --> src/question236.rs:26:4
[INFO] [stdout]    |
[INFO] [stdout] 26 | fn tree_contains(tree: &Tree<i32>, target: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_ancestor_diff` is never used
[INFO] [stdout]  --> src/question1026.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn max_ancestor_diff(root: TreeNode) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `last_stone_weight` is never used
[INFO] [stdout]  --> src/question1046.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn last_stone_weight(stones: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `F64Ord` is never constructed
[INFO] [stdout]  --> src/question2208.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct F64Ord(f64);
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `halve_array` is never used
[INFO] [stdout]   --> src/question2208.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 33 | pub fn halve_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `median_sliding_window` is never used
[INFO] [stdout]  --> src/question480.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn median_sliding_window(nums: Vec<i32>, k: i32) -> Vec<f64> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `balance_two_heaps` is never used
[INFO] [stdout]   --> src/question480.rs:45:4
[INFO] [stdout]    |
[INFO] [stdout] 45 | fn balance_two_heaps(max_heap: &mut BinaryHeap<i32>, min_heap: &mut BinaryHeap<Reverse<i32>>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_one_element_max` is never used
[INFO] [stdout]   --> src/question480.rs:54:4
[INFO] [stdout]    |
[INFO] [stdout] 54 | fn remove_one_element_max(heap: &mut BinaryHeap<i32>, remove: i32) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_one_element_min` is never used
[INFO] [stdout]   --> src/question480.rs:68:4
[INFO] [stdout]    |
[INFO] [stdout] 68 | fn remove_one_element_min(heap: &mut BinaryHeap<Reverse<i32>>, remove: i32) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `calculate_the_median` is never used
[INFO] [stdout]   --> src/question480.rs:83:4
[INFO] [stdout]    |
[INFO] [stdout] 83 | fn calculate_the_median(max_heap: &BinaryHeap<i32>, min_heap: &BinaryHeap<Reverse<i32>>) -> f64 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_stone_sum` is never used
[INFO] [stdout]  --> src/question1962.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn min_stone_sum(piles: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `connect_sticks` is never used
[INFO] [stdout]  --> src/question1167.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn connect_sticks(sticks: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `top_k_frequent` is never used
[INFO] [stdout]  --> src/question347.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_kth_largest` is never used
[INFO] [stdout]  --> src/question215.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `KthLargest` is never constructed
[INFO] [stdout]  --> src/question703.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct KthLargest {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `add` are never used
[INFO] [stdout]   --> src/question703.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl KthLargest {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 11 |     fn new(k: i32, nums: Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn add(&mut self, val: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `k_closest` is never used
[INFO] [stdout]  --> src/question973.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn k_closest(points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `partition_array` is never used
[INFO] [stdout]  --> src/question2294.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn partition_array(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_number_of_apples` is never used
[INFO] [stdout]  --> src/question1196.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn max_number_of_apples(weight: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_set_size` is never used
[INFO] [stdout]  --> src/question1338.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn min_set_size(arr: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_least_num_of_unique_ints` is never used
[INFO] [stdout]  --> src/question1481.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn find_least_num_of_unique_ints(arr: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_rescue_boats` is never used
[INFO] [stdout]  --> src/question881.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn num_rescue_boats(people: Vec<i32>, limit: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `answer_queries` is never used
[INFO] [stdout]  --> src/question2389.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn answer_queries(nums: Vec<i32>, queries: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `check_one_query` is never used
[INFO] [stdout]   --> src/question2389.rs:11:4
[INFO] [stdout]    |
[INFO] [stdout] 11 | fn check_one_query(nums: &[i32], query: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_matrix` is never used
[INFO] [stdout]  --> src/question74.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_insert` is never used
[INFO] [stdout]   --> src/question74.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | pub fn search_insert(nums: &[i32], target: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `successful_pairs` is never used
[INFO] [stdout]  --> src/question2300.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn successful_pairs(spells: Vec<i32>, potions: Vec<i32>, success: i64) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `smallest_divisor` is never used
[INFO] [stdout]  --> src/question1283.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn smallest_divisor(nums: Vec<i32>, threshold: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `calculate_sum_for_one_divisor` is never used
[INFO] [stdout]   --> src/question1283.rs:37:4
[INFO] [stdout]    |
[INFO] [stdout] 37 | fn calculate_sum_for_one_divisor(nums: &[i32], divisor: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `permute` is never used
[INFO] [stdout]  --> src/question46.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `Json` is never used
[INFO] [stdout]   --> src/question46.rs:43:6
[INFO] [stdout]    |
[INFO] [stdout] 43 | enum Json {
[INFO] [stdout]    |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `total_memory_usage` is never used
[INFO] [stdout]   --> src/question46.rs:52:4
[INFO] [stdout]    |
[INFO] [stdout] 52 | fn total_memory_usage(json: &Json) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `memory_usage_for_array` is never used
[INFO] [stdout]   --> src/question46.rs:64:4
[INFO] [stdout]    |
[INFO] [stdout] 64 | fn memory_usage_for_array(list: &[Json]) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `memory_usage_for_hashmap` is never used
[INFO] [stdout]   --> src/question46.rs:72:4
[INFO] [stdout]    |
[INFO] [stdout] 72 | fn memory_usage_for_hashmap(map: &HashMap<String, Json>) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `subsets` is never used
[INFO] [stdout]  --> src/question78.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `split` is never used
[INFO] [stdout]   --> src/question78.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn split(nums: Vec<i32>, i: usize) -> (i32, Vec<i32>) {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `letter_combinations` is never used
[INFO] [stdout]  --> src/question17.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `unique_paths_with_obstacles` is never used
[INFO] [stdout]  --> src/question63.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn unique_paths_with_obstacles(obstacle_grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_path_sum` is never used
[INFO] [stdout]  --> src/question64.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn min_path_sum(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rob` is never used
[INFO] [stdout]  --> src/question198.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `unique_paths` is never used
[INFO] [stdout]  --> src/question62.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn unique_paths(m: i32, n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `change_big_nums` is never used
[INFO] [stdout]   --> src/question62.rs:30:4
[INFO] [stdout]    |
[INFO] [stdout] 30 | fn change_big_nums(big_nums: &mut Vec<i32>, num: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_cost_climbing_stairs` is never used
[INFO] [stdout]  --> src/question746.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn min_cost_climbing_stairs(cost: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_lis` is never used
[INFO] [stdout]  --> src/question300.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn length_of_lis(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `climb_stairs` is never used
[INFO] [stdout]  --> src/question70.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `climb_stairs_recur` is never used
[INFO] [stdout]  --> src/question70.rs:8:4
[INFO] [stdout]   |
[INFO] [stdout] 8 | fn climb_stairs_recur(memory: &mut HashMap<i32, i32>, n: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_circle_num` is never used
[INFO] [stdout]  --> src/question547.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn find_circle_num(is_connected: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Grid` is never constructed
[INFO] [stdout]  --> src/question200.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Grid {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `visit` are never used
[INFO] [stdout]   --> src/question200.rs:8:8
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl Grid {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 8  |     fn new(input: Vec<Vec<char>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn visit(&mut self, x: isize, y: isize) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_islands` is never used
[INFO] [stdout]   --> src/question200.rs:45:8
[INFO] [stdout]    |
[INFO] [stdout] 45 | pub fn num_islands(grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Graph` is never constructed
[INFO] [stdout]  --> src/question1971.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Graph {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `can_reach` is never used
[INFO] [stdout]  --> src/question1971.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Graph {
[INFO] [stdout]   | ---------- method in this implementation
[INFO] [stdout] 9 |     fn can_reach(&self, f: impl Fn() -> bool) {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_components` is never used
[INFO] [stdout]  --> src/question323.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn count_components(n: i32, edges: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `all_edges_from_one_node` is never used
[INFO] [stdout]   --> src/question323.rs:25:4
[INFO] [stdout]    |
[INFO] [stdout] 25 | fn all_edges_from_one_node(map: &HashMap<i32, Vec<i32>>, sett: &mut HashSet<i32>, node: i32) -> HashSet<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `shortest_path_binary_matrix` is never used
[INFO] [stdout]  --> src/question1091.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn shortest_path_binary_matrix(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_profit` is never used
[INFO] [stdout]  --> src/question121.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn max_profit(prices: &[i32]) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `contains_duplicate` is never used
[INFO] [stdout]  --> src/question217.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn contains_duplicate(nums: &[i32]) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `product_except_self` is never used
[INFO] [stdout]  --> src/question238.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn product_except_self(nums: &[i32]) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_anagram` is never used
[INFO] [stdout]  --> src/question242.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn is_anagram(s: &str, t: &str) -> bool { 
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `calculate_char_counts` is never used
[INFO] [stdout]  --> src/question242.rs:9:4
[INFO] [stdout]   |
[INFO] [stdout] 9 | fn calculate_char_counts(string: &str) -> HashMap<char, usize> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]  --> src/palindrome.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn is_palindrome(x: u32) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome_2` is never used
[INFO] [stdout]   --> src/palindrome.rs:32:4
[INFO] [stdout]    |
[INFO] [stdout] 32 | fn is_palindrome_2(mut x: u32) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `Json` is never used
[INFO] [stdout]   --> src/palindrome.rs:45:6
[INFO] [stdout]    |
[INFO] [stdout] 45 | enum Json {
[INFO] [stdout]    |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/tree_practice.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct TreeNode {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `visit`, `sum`, `product`, `max`, and `min` are never used
[INFO] [stdout]   --> src/tree_practice.rs:8:8
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl TreeNode {
[INFO] [stdout]    | ------------- methods in this implementation
[INFO] [stdout] 8  |     fn visit(&self, mut f: impl FnMut(&i32)) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn sum(&self)-> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     fn product(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn max(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn min(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_even` is never used
[INFO] [stdout]   --> src/recursion_practice.rs:10:4
[INFO] [stdout]    |
[INFO] [stdout] 10 | fn is_even(x: u64) -> bool {
[INFO] [stdout]    |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `list_length` is never used
[INFO] [stdout]   --> src/recursion_practice.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn list_length(list: &[i32]) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `list_max` is never used
[INFO] [stdout]   --> src/recursion_practice.rs:29:4
[INFO] [stdout]    |
[INFO] [stdout] 29 | fn list_max(list: &[i32]) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fibonacci` is never used
[INFO] [stdout]   --> src/recursion_practice.rs:38:4
[INFO] [stdout]    |
[INFO] [stdout] 38 | fn fibonacci(n: u32) -> u32 {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyCircularQueue` is never constructed
[INFO] [stdout]  --> src/question622.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct MyCircularQueue {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/question622.rs:6:8
[INFO] [stdout]    |
[INFO] [stdout] 5  | impl MyCircularQueue {
[INFO] [stdout]    | -------------------- associated items in this implementation
[INFO] [stdout] 6  |     fn new(k: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 10 |     fn en_queue(&mut self, value: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn de_queue(&mut self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn front(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn rear(&self) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn is_empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn is_full(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Grid` is never constructed
[INFO] [stdout]  --> src/question289.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Grid {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `live_neighbors` are never used
[INFO] [stdout]   --> src/question289.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Grid {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 13 |     fn new(data: Vec<Vec<i32>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     fn live_neighbors(&self, (x, y): (usize, usize)) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `game_of_life` is never used
[INFO] [stdout]   --> src/question289.rs:60:8
[INFO] [stdout]    |
[INFO] [stdout] 60 | pub fn game_of_life(board: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `CustomStack` is never constructed
[INFO] [stdout]  --> src/question1381.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct CustomStack {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, and `increment` are never used
[INFO] [stdout]   --> src/question1381.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl CustomStack {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 8  |
[INFO] [stdout] 9  |     fn new(maxSize: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn push(&mut self, x: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn increment(&mut self, k: i32, val: i32) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `maxSize` should have a snake case name
[INFO] [stdout]  --> src/question1381.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 9 |     fn new(maxSize: i32) -> Self {
[INFO] [stdout]   |            ^^^^^^^ help: convert the identifier to snake case: `max_size`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 12.79s
[INFO] running `Command { std: "docker" "inspect" "1a8afb8bb03ac79381eac97525b10c61dcf031c185447c9d6d94dd60860f1275", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "1a8afb8bb03ac79381eac97525b10c61dcf031c185447c9d6d94dd60860f1275", kill_on_drop: false }`
[INFO] [stdout] 1a8afb8bb03ac79381eac97525b10c61dcf031c185447c9d6d94dd60860f1275