[INFO] cloning repository https://github.com/jackfiled/leetcode-rust
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/jackfiled/leetcode-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fjackfiled%2Fleetcode-rust", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fjackfiled%2Fleetcode-rust'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] e6a52152ac1504a2a2320b6cc7e48f489c1bdcd8
[INFO] checking jackfiled/leetcode-rust against c397dae808f70caebab1fc4e11b3edf7e59f58c7 for pr-158759-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fjackfiled%2Fleetcode-rust" "/workspace/builds/worker-7-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-7-tc1/source'...
[INFO] [stderr] done.
[INFO] removed /workspace/builds/worker-7-tc1/source/.cargo/config.toml
[INFO] started tweaking git repo https://github.com/jackfiled/leetcode-rust
[INFO] finished tweaking git repo https://github.com/jackfiled/leetcode-rust
[INFO] tweaked toml for git repo https://github.com/jackfiled/leetcode-rust written to /workspace/builds/worker-7-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/jackfiled/leetcode-rust on toolchain c397dae808f70caebab1fc4e11b3edf7e59f58c7
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+c397dae808f70caebab1fc4e11b3edf7e59f58c7" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/jackfiled/leetcode-rust 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" "+c397dae808f70caebab1fc4e11b3edf7e59f58c7" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Updating crates.io index
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded proc-macro2 v1.0.87
[INFO] [stderr]   Downloaded socket2 v0.5.7
[INFO] [stderr]   Downloaded futures-sink-preview v0.3.0-alpha.19
[INFO] [stderr]   Downloaded futures-io-preview v0.3.0-alpha.19
[INFO] [stderr]   Downloaded serde_urlencoded v0.6.1
[INFO] [stderr]   Downloaded sluice v0.4.2
[INFO] [stderr]   Downloaded futures-executor-preview v0.3.0-alpha.19
[INFO] [stderr]   Downloaded futures-core-preview v0.3.0-alpha.19
[INFO] [stderr]   Downloaded wasm-bindgen-futures v0.4.43
[INFO] [stderr]   Downloaded fastrand v2.1.1
[INFO] [stderr]   Downloaded iovec v0.1.4
[INFO] [stderr]   Downloaded wasm-bindgen-futures v0.3.27
[INFO] [stderr]   Downloaded wasm-bindgen-macro v0.2.93
[INFO] [stderr]   Downloaded wasm-bindgen-shared v0.2.93
[INFO] [stderr]   Downloaded itoa v0.4.8
[INFO] [stderr]   Downloaded dtoa v0.4.8
[INFO] [stderr]   Downloaded futures-channel-preview v0.3.0-alpha.19
[INFO] [stderr]   Downloaded pin-project-lite v0.2.14
[INFO] [stderr]   Downloaded unicase v2.7.0
[INFO] [stderr]   Downloaded wasm-bindgen-backend v0.2.93
[INFO] [stderr]   Downloaded security-framework-sys v2.12.0
[INFO] [stderr]   Downloaded wasm-bindgen-macro-support v0.2.93
[INFO] [stderr]   Downloaded tokio-io v0.1.13
[INFO] [stderr]   Downloaded wasm-bindgen v0.2.93
[INFO] [stderr]   Downloaded surf v1.0.3
[INFO] [stderr]   Downloaded futures-preview v0.3.0-alpha.19
[INFO] [stderr]   Downloaded tempfile v3.13.0
[INFO] [stderr]   Downloaded schannel v0.1.26
[INFO] [stderr]   Downloaded value-bag v1.9.0
[INFO] [stderr]   Downloaded anyhow v1.0.95
[INFO] [stderr]   Downloaded bytes v1.7.2
[INFO] [stderr]   Downloaded js-sys v0.3.70
[INFO] [stderr]   Downloaded url v2.5.2
[INFO] [stderr]   Downloaded serde v1.0.210
[INFO] [stderr]   Downloaded serde_derive v1.0.210
[INFO] [stderr]   Downloaded openssl-sys v0.9.103
[INFO] [stderr]   Downloaded cc v1.1.28
[INFO] [stderr]   Downloaded curl v0.4.47
[INFO] [stderr]   Downloaded crossbeam-channel v0.3.9
[INFO] [stderr]   Downloaded tokio-util v0.7.12
[INFO] [stderr]   Downloaded http v0.1.21
[INFO] [stderr]   Downloaded mio v1.0.2
[INFO] [stderr]   Downloaded futures-util-preview v0.3.0-alpha.19
[INFO] [stderr]   Downloaded serde_json v1.0.128
[INFO] [stderr]   Downloaded hashbrown v0.15.0
[INFO] [stderr]   Downloaded futures v0.1.31
[INFO] [stderr]   Downloaded syn v2.0.79
[INFO] [stderr]   Downloaded hyper v0.14.30
[INFO] [stderr]   Downloaded isahc v0.7.6
[INFO] [stderr]   Downloaded openssl v0.10.66
[INFO] [stderr]   Downloaded regex v1.11.0
[INFO] [stderr]   Downloaded rustix v0.38.37
[INFO] [stderr]   Downloaded regex-automata v0.4.8
[INFO] [stderr]   Downloaded web-sys v0.3.70
[INFO] [stderr]   Downloaded libc v0.2.159
[INFO] [stderr]   Downloaded tokio v1.40.0
[INFO] [stderr]   Downloaded libz-sys v1.1.20
[INFO] [stderr]   Downloaded encoding_rs v0.8.34
[INFO] [stderr]   Downloaded curl-sys v0.4.77+curl-8.10.1
[INFO] [stderr]   Downloaded libnghttp2-sys v0.1.10+1.61.0
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,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" "-m" "1610612736" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:3d5ced03c013a94a2f102a4510f48a6e9184255caf5fd8244f58017bde7f5210" "sleep" "infinity", kill_on_drop: false }`
[INFO] [stdout] 2bdc0fddc9090500e8d6af12e04c40bb840580230e3f077460d9833049cc0ce3
[INFO] running `Command { std: "docker" "start" "2bdc0fddc9090500e8d6af12e04c40bb840580230e3f077460d9833049cc0ce3", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "2bdc0fddc9090500e8d6af12e04c40bb840580230e3f077460d9833049cc0ce3", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-w" "/opt/rustwide/workdir" "--user" "0:0" "2bdc0fddc9090500e8d6af12e04c40bb840580230e3f077460d9833049cc0ce3" "/opt/rustwide/cargo-home/bin/cargo" "+c397dae808f70caebab1fc4e11b3edf7e59f58c7" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "2bdc0fddc9090500e8d6af12e04c40bb840580230e3f077460d9833049cc0ce3", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-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" "-w" "/opt/rustwide/workdir" "--user" "0:0" "2bdc0fddc9090500e8d6af12e04c40bb840580230e3f077460d9833049cc0ce3" "/opt/rustwide/cargo-home/bin/cargo" "+c397dae808f70caebab1fc4e11b3edf7e59f58c7" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stderr]    Compiling libc v0.2.159
[INFO] [stderr]    Compiling proc-macro2 v1.0.87
[INFO] [stderr]    Compiling unicode-ident v1.0.13
[INFO] [stderr]     Checking value-bag v1.9.0
[INFO] [stderr]     Checking pin-project-lite v0.2.14
[INFO] [stderr]     Checking itoa v1.0.11
[INFO] [stderr]     Checking bytes v1.7.2
[INFO] [stderr]    Compiling cc v1.1.28
[INFO] [stderr]    Compiling serde v1.0.210
[INFO] [stderr]     Checking futures-sink-preview v0.3.0-alpha.19
[INFO] [stderr]     Checking openssl-probe v0.1.5
[INFO] [stderr]    Compiling unicase v2.7.0
[INFO] [stderr]     Checking futures-core-preview v0.3.0-alpha.19
[INFO] [stderr]     Checking futures-io-preview v0.3.0-alpha.19
[INFO] [stderr]     Checking futures v0.1.31
[INFO] [stderr]    Compiling openssl v0.10.66
[INFO] [stderr]     Checking unicode-normalization v0.1.24
[INFO] [stderr]     Checking tracing-core v0.1.32
[INFO] [stderr]     Checking futures-task v0.3.31
[INFO] [stderr]     Checking unicode-bidi v0.3.17
[INFO] [stderr]     Checking hashbrown v0.15.0
[INFO] [stderr]    Compiling curl v0.4.47
[INFO] [stderr]     Checking futures-channel-preview v0.3.0-alpha.19
[INFO] [stderr]     Checking futures-util v0.3.31
[INFO] [stderr]    Compiling serde_json v1.0.128
[INFO] [stderr]     Checking log v0.4.22
[INFO] [stderr]     Checking cfg-if v0.1.10
[INFO] [stderr]     Checking itoa v0.4.8
[INFO] [stderr]     Checking crossbeam-utils v0.6.6
[INFO] [stderr]     Checking futures-channel v0.3.31
[INFO] [stderr]    Compiling mime_guess v2.0.5
[INFO] [stderr]    Compiling isahc v0.7.6
[INFO] [stderr]     Checking tracing v0.1.40
[INFO] [stderr]     Checking sluice v0.4.2
[INFO] [stderr]    Compiling quote v1.0.37
[INFO] [stderr]     Checking crossbeam-channel v0.3.9
[INFO] [stderr]     Checking http v0.2.12
[INFO] [stderr]     Checking indexmap v2.6.0
[INFO] [stderr]     Checking idna v0.5.0
[INFO] [stderr]     Checking dtoa v0.4.8
[INFO] [stderr]    Compiling anyhow v1.0.95
[INFO] [stderr]    Compiling syn v2.0.79
[INFO] [stderr]     Checking regex-automata v0.4.8
[INFO] [stderr]     Checking encoding_rs v0.8.34
[INFO] [stderr]     Checking ipnet v2.10.1
[INFO] [stderr]     Checking sync_wrapper v0.1.2
[INFO] [stderr]     Checking url v2.5.2
[INFO] [stderr]     Checking socket2 v0.5.7
[INFO] [stderr]     Checking iovec v0.1.4
[INFO] [stderr]     Checking mio v1.0.2
[INFO] [stderr]     Checking num_cpus v1.16.0
[INFO] [stderr]     Checking getrandom v0.2.15
[INFO] [stderr]     Checking bytes v0.4.12
[INFO] [stderr]     Checking rand_core v0.6.4
[INFO] [stderr]    Compiling openssl-sys v0.9.103
[INFO] [stderr]    Compiling libnghttp2-sys v0.1.10+1.61.0
[INFO] [stderr]    Compiling libz-sys v1.1.20
[INFO] [stderr]    Compiling curl-sys v0.4.77+curl-8.10.1
[INFO] [stderr]     Checking http-body v0.4.6
[INFO] [stderr]     Checking tokio-io v0.1.13
[INFO] [stderr]     Checking http v0.1.21
[INFO] [stderr]     Checking futures-util-preview v0.3.0-alpha.19
[INFO] [stderr]    Compiling native-tls v0.2.12
[INFO] [stderr]     Checking serde_urlencoded v0.7.1
[INFO] [stderr]     Checking serde_urlencoded v0.6.1
[INFO] [stderr]     Checking regex v1.11.0
[INFO] [stderr]     Checking futures-executor-preview v0.3.0-alpha.19
[INFO] [stderr]     Checking futures-preview v0.3.0-alpha.19
[INFO] [stderr]    Compiling tokio-macros v2.4.0
[INFO] [stderr]    Compiling openssl-macros v0.1.1
[INFO] [stderr]    Compiling zerocopy-derive v0.7.35
[INFO] [stderr]    Compiling serde_derive v1.0.210
[INFO] [stderr]     Checking tokio v1.40.0
[INFO] [stderr]     Checking zerocopy v0.7.35
[INFO] [stderr]     Checking surf v1.0.3
[INFO] [stderr]     Checking ppv-lite86 v0.2.20
[INFO] [stderr]     Checking rand_chacha v0.3.1
[INFO] [stderr]     Checking rand v0.8.5
[INFO] [stderr]     Checking tokio-util v0.7.12
[INFO] [stderr]     Checking tokio-native-tls v0.3.1
[INFO] [stderr]     Checking h2 v0.3.26
[INFO] [stderr]     Checking hyper v0.14.30
[INFO] [stderr]     Checking hyper-tls v0.5.0
[INFO] [stderr]     Checking reqwest v0.11.27
[INFO] [stderr]     Checking leetcode-rust v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p100_same_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p101_symmetric_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p102_binary_tree_level_order_traversal.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p103_binary_tree_zigzag_level_order_traversal.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p104_maximum_depth_of_binary_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `surf::middleware::logger::new`
[INFO] [stdout]  --> src/problem/p105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use surf::middleware::logger::new;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:8:25
[INFO] [stdout]   |
[INFO] [stdout] 8 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p107_binary_tree_level_order_traversal_ii.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p108_convert_sorted_array_to_binary_search_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p112_path_sum.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 32 |         if (root.borrow().left.is_none() && root.borrow().right.is_none()) {
[INFO] [stdout]    |            ^                                                             ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 32 -         if (root.borrow().left.is_none() && root.borrow().right.is_none()) {
[INFO] [stdout] 32 +         if root.borrow().left.is_none() && root.borrow().right.is_none() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p124_binary_tree_maximum_path_sum.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p1261_find_elements_in_a_contaminated_binary_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p129_sum_root_to_leaf_numbers.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p144_binary_tree_preorder_traversal.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p145_binary_tree_postorder_traversal.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `tokio::time::error::Elapsed`
[INFO] [stdout]  --> src/problem/p173_binary_search_tree_iterator.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use tokio::time::error::Elapsed;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p173_binary_search_tree_iterator.rs:8:25
[INFO] [stdout]   |
[INFO] [stdout] 8 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p199_binary_tree_right_side_view.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/problem/p219_contains_duplicate_ii.rs:15:37
[INFO] [stdout]    |
[INFO] [stdout] 15 |                 let distance: i32 = (*last_pos - i as i32);
[INFO] [stdout]    |                                     ^                    ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 15 -                 let distance: i32 = (*last_pos - i as i32);
[INFO] [stdout] 15 +                 let distance: i32 = *last_pos - i as i32;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BorrowMut` and `Borrow`
[INFO] [stdout]  --> src/problem/p21_merge_two_sorted_lists.rs:6:19
[INFO] [stdout]   |
[INFO] [stdout] 6 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]   |                   ^^^^^^  ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_list`
[INFO] [stdout]  --> src/problem/p21_merge_two_sorted_lists.rs:8:32
[INFO] [stdout]   |
[INFO] [stdout] 8 | use crate::util::linked_list::{to_list, ListNode};
[INFO] [stdout]   |                                ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p222_count_complete_tree_nodes.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p226_invert_binary_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p230_kth_smallest_element_in_a_bst.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:44:23
[INFO] [stdout]    |
[INFO] [stdout] 44 |             } else if (p.borrow().val > ancestor.borrow().val
[INFO] [stdout]    |                       ^
[INFO] [stdout] 45 |                 && q.borrow().val > ancestor.borrow().val)
[INFO] [stdout]    |                                                          ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 44 ~             } else if p.borrow().val > ancestor.borrow().val
[INFO] [stdout] 45 ~                 && q.borrow().val > ancestor.borrow().val
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `surf::url::UrlQuery`
[INFO] [stdout]  --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use surf::url::UrlQuery;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:8:25
[INFO] [stdout]   |
[INFO] [stdout] 8 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p2641_cousins_in_binary_tree_ii.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem/p2867_count_valid_paths_in_a_tree.rs:63:20
[INFO] [stdout]    |
[INFO] [stdout] 63 |                 if (primes[i]) {
[INFO] [stdout]    |                    ^         ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 63 -                 if (primes[i]) {
[INFO] [stdout] 63 +                 if primes[i] {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_list`
[INFO] [stdout]   --> src/problem/p2_add_two_numbers.rs:32:32
[INFO] [stdout]    |
[INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode};
[INFO] [stdout]    |                                ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem/p331_verify_preorder_serialization_of_a_binary_tree.rs:18:16
[INFO] [stdout]    |
[INFO] [stdout] 18 |             if (c == ',') {
[INFO] [stdout]    |                ^        ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 18 -             if (c == ',') {
[INFO] [stdout] 18 +             if c == ',' {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem/p331_verify_preorder_serialization_of_a_binary_tree.rs:22:16
[INFO] [stdout]    |
[INFO] [stdout] 22 |             if (c == '#') {
[INFO] [stdout]    |                ^        ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 22 -             if (c == '#') {
[INFO] [stdout] 22 +             if c == '#' {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression
[INFO] [stdout]   --> src/problem/p42_trapping_rain_water.rs:14:18
[INFO] [stdout]    |
[INFO] [stdout] 14 |         for i in (1..length) {
[INFO] [stdout]    |                  ^         ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 14 -         for i in (1..length) {
[INFO] [stdout] 14 +         for i in 1..length {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression
[INFO] [stdout]   --> src/problem/p48_rotate_image.rs:13:18
[INFO] [stdout]    |
[INFO] [stdout] 13 |         for i in (0..n / 2) {
[INFO] [stdout]    |                  ^        ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 13 -         for i in (0..n / 2) {
[INFO] [stdout] 13 +         for i in 0..n / 2 {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression
[INFO] [stdout]   --> src/problem/p48_rotate_image.rs:22:18
[INFO] [stdout]    |
[INFO] [stdout] 22 |         for i in (0..n) {
[INFO] [stdout]    |                  ^    ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 22 -         for i in (0..n) {
[INFO] [stdout] 22 +         for i in 0..n {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression
[INFO] [stdout]   --> src/problem/p48_rotate_image.rs:23:22
[INFO] [stdout]    |
[INFO] [stdout] 23 |             for j in (0..i) {
[INFO] [stdout]    |                      ^    ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 23 -             for j in (0..i) {
[INFO] [stdout] 23 +             for j in 0..i {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p530_minimum_absolute_difference_in_bst.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem/p54_spiral_matrix.rs:40:24
[INFO] [stdout]    |
[INFO] [stdout] 40 |                     if (matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX) {
[INFO] [stdout]    |                        ^                                                            ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 40 -                     if (matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX) {
[INFO] [stdout] 40 +                     if matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p637_average_of_levels_in_binary_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression
[INFO] [stdout]   --> src/problem/p73_set_matrix_zeroes.rs:37:18
[INFO] [stdout]    |
[INFO] [stdout] 37 |         for i in (1..n) {
[INFO] [stdout]    |                  ^    ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 37 -         for i in (1..n) {
[INFO] [stdout] 37 +         for i in 1..n {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_list`
[INFO] [stdout]  --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:6:32
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::linked_list::{to_list, ListNode};
[INFO] [stdout]   |                                ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_list`
[INFO] [stdout]  --> src/problem/p83_remove_duplicates_from_sorted_list.rs:6:32
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::linked_list::{to_list, ListNode};
[INFO] [stdout]   |                                ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `tokio::time::error::Elapsed`
[INFO] [stdout]  --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use tokio::time::error::Elapsed;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:8:25
[INFO] [stdout]   |
[INFO] [stdout] 8 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary trailing semicolon
[INFO] [stdout]   --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:84:10
[INFO] [stdout]    |
[INFO] [stdout] 84 |         };
[INFO] [stdout]    |          ^ help: remove this semicolon
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(redundant_semicolons)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p938_range_sum_of_bst.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p94_binary_tree_inorder_traversal.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p98_validate_binary_search_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p993_cousins_in_binary_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_list`
[INFO] [stdout]  --> src/problem/p2181_merge_nodes_in_between_zeros.rs:6:32
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::linked_list::{to_list, ListNode};
[INFO] [stdout]   |                                ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/problem/p2848_points_that_intersect_with_cars.rs:21:27
[INFO] [stdout]    |
[INFO] [stdout] 21 |                 result += (end - last_end);
[INFO] [stdout]    |                           ^              ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 21 -                 result += (end - last_end);
[INFO] [stdout] 21 +                 result += end - last_end;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_list`
[INFO] [stdout]  --> src/problem/p1367_linked_list_in_binary_tree.rs:6:32
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::linked_list::{to_list, ListNode};
[INFO] [stdout]   |                                ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p1367_linked_list_in_binary_tree.rs:7:25
[INFO] [stdout]   |
[INFO] [stdout] 7 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::thread::available_parallelism`
[INFO] [stdout]  --> src/problem/p624_maximum_distance_in_arrays.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::thread::available_parallelism;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ffi::FromVecWithNulError`
[INFO] [stdout]  --> src/problem/p2209_minimum_white_tiles_after_covering_with_carpets.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::ffi::FromVecWithNulError;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p1123_lowest_common_ancestor_of_deepest_leaves.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::str::FromStr`
[INFO] [stdout]  --> src/problem/p2999_count_the_number_of_powerful_integers.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 7 | use std::str::FromStr;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::thread::current`
[INFO] [stdout]  --> src/problem/p1287_element_appearing_more_than_25_in_sorted_array.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::thread::current;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/week_385/problem3.rs:30:33
[INFO] [stdout]    |
[INFO] [stdout] 30 |                         let x = (i + d.0 * step);
[INFO] [stdout]    |                                 ^              ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 30 -                         let x = (i + d.0 * step);
[INFO] [stdout] 30 +                         let x = i + d.0 * step;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/week_385/problem3.rs:31:33
[INFO] [stdout]    |
[INFO] [stdout] 31 |                         let y = (j + d.1 * step);
[INFO] [stdout]    |                                 ^              ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 31 -                         let y = (j + d.1 * step);
[INFO] [stdout] 31 +                         let y = j + d.1 * step;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/week_385/problem3.rs:78:9
[INFO] [stdout]    |
[INFO] [stdout] 78 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p100_same_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p100_same_tree.rs:93:9
[INFO] [stdout]    |
[INFO] [stdout] 93 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p104_maximum_depth_of_binary_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p104_maximum_depth_of_binary_tree.rs:66:9
[INFO] [stdout]    |
[INFO] [stdout] 66 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `surf::middleware::logger::new`
[INFO] [stdout]  --> src/problem/p105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use surf::middleware::logger::new;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p108_convert_sorted_array_to_binary_search_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p108_convert_sorted_array_to_binary_search_tree.rs:65:9
[INFO] [stdout]    |
[INFO] [stdout] 65 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p112_path_sum.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p112_path_sum.rs:65:9
[INFO] [stdout]    |
[INFO] [stdout] 65 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 32 |         if (root.borrow().left.is_none() && root.borrow().right.is_none()) {
[INFO] [stdout]    |            ^                                                             ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 32 -         if (root.borrow().left.is_none() && root.borrow().right.is_none()) {
[INFO] [stdout] 32 +         if root.borrow().left.is_none() && root.borrow().right.is_none() {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:73:9
[INFO] [stdout]    |
[INFO] [stdout] 73 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p124_binary_tree_maximum_path_sum.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p124_binary_tree_maximum_path_sum.rs:72:9
[INFO] [stdout]    |
[INFO] [stdout] 72 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p1261_find_elements_in_a_contaminated_binary_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p1261_find_elements_in_a_contaminated_binary_tree.rs:80:9
[INFO] [stdout]    |
[INFO] [stdout] 80 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p129_sum_root_to_leaf_numbers.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p129_sum_root_to_leaf_numbers.rs:60:9
[INFO] [stdout]    |
[INFO] [stdout] 60 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p130_surrounded_regions.rs:68:9
[INFO] [stdout]    |
[INFO] [stdout] 68 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p149_max_points_on_a_line.rs:84:9
[INFO] [stdout]    |
[INFO] [stdout] 84 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p153_find_minimum_in_rotated_sorted_array.rs:31:9
[INFO] [stdout]    |
[INFO] [stdout] 31 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p155_min_stack.rs:61:9
[INFO] [stdout]    |
[INFO] [stdout] 61 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p172_factorial_trailing_zeroes.rs:26:9
[INFO] [stdout]    |
[INFO] [stdout] 26 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `tokio::time::error::Elapsed`
[INFO] [stdout]  --> src/problem/p173_binary_search_tree_iterator.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use tokio::time::error::Elapsed;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p173_binary_search_tree_iterator.rs:8:25
[INFO] [stdout]   |
[INFO] [stdout] 8 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]    --> src/problem/p173_binary_search_tree_iterator.rs:106:9
[INFO] [stdout]     |
[INFO] [stdout] 106 |     use super::*;
[INFO] [stdout]     |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p17_letter_combinations_of_a_phone_number.rs:53:9
[INFO] [stdout]    |
[INFO] [stdout] 53 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p190_reverse_bits.rs:18:9
[INFO] [stdout]    |
[INFO] [stdout] 18 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p1976_number_of_ways_to_arrive_at_destination.rs:83:9
[INFO] [stdout]    |
[INFO] [stdout] 83 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p1997_first_day_where_you_have_been_in_all_the_rooms.rs:33:9
[INFO] [stdout]    |
[INFO] [stdout] 33 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p199_binary_tree_right_side_view.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p199_binary_tree_right_side_view.rs:68:9
[INFO] [stdout]    |
[INFO] [stdout] 68 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p200_number_of_islands.rs:55:9
[INFO] [stdout]    |
[INFO] [stdout] 55 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p205_isomorphic_strings.rs:36:9
[INFO] [stdout]    |
[INFO] [stdout] 36 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p207_course_schedule.rs:50:9
[INFO] [stdout]    |
[INFO] [stdout] 50 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p2085_count_common_words_with_one_occurrence.rs:82:9
[INFO] [stdout]    |
[INFO] [stdout] 82 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p209_minimum_size_subarray_sum.rs:40:9
[INFO] [stdout]    |
[INFO] [stdout] 40 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p210_course_schedule_ii.rs:57:9
[INFO] [stdout]    |
[INFO] [stdout] 57 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p215_kth_largest_element_in_an_array.rs:32:9
[INFO] [stdout]    |
[INFO] [stdout] 32 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/problem/p219_contains_duplicate_ii.rs:15:37
[INFO] [stdout]    |
[INFO] [stdout] 15 |                 let distance: i32 = (*last_pos - i as i32);
[INFO] [stdout]    |                                     ^                    ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 15 -                 let distance: i32 = (*last_pos - i as i32);
[INFO] [stdout] 15 +                 let distance: i32 = *last_pos - i as i32;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BorrowMut` and `Borrow`
[INFO] [stdout]  --> src/problem/p21_merge_two_sorted_lists.rs:6:19
[INFO] [stdout]   |
[INFO] [stdout] 6 | use std::borrow::{Borrow, BorrowMut};
[INFO] [stdout]   |                   ^^^^^^  ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_list`
[INFO] [stdout]  --> src/problem/p21_merge_two_sorted_lists.rs:8:32
[INFO] [stdout]   |
[INFO] [stdout] 8 | use crate::util::linked_list::{to_list, ListNode};
[INFO] [stdout]   |                                ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p21_merge_two_sorted_lists.rs:65:9
[INFO] [stdout]    |
[INFO] [stdout] 65 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p222_count_complete_tree_nodes.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p222_count_complete_tree_nodes.rs:62:9
[INFO] [stdout]    |
[INFO] [stdout] 62 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p228_summary_ranges.rs:48:9
[INFO] [stdout]    |
[INFO] [stdout] 48 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p22_generate_parentheses.rs:44:9
[INFO] [stdout]    |
[INFO] [stdout] 44 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p230_kth_smallest_element_in_a_bst.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p230_kth_smallest_element_in_a_bst.rs:67:9
[INFO] [stdout]    |
[INFO] [stdout] 67 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p2312_selling_pieces_of_wood.rs:63:9
[INFO] [stdout]    |
[INFO] [stdout] 63 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:44:23
[INFO] [stdout]    |
[INFO] [stdout] 44 |             } else if (p.borrow().val > ancestor.borrow().val
[INFO] [stdout]    |                       ^
[INFO] [stdout] 45 |                 && q.borrow().val > ancestor.borrow().val)
[INFO] [stdout]    |                                                          ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 44 ~             } else if p.borrow().val > ancestor.borrow().val
[INFO] [stdout] 45 ~                 && q.borrow().val > ancestor.borrow().val
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:61:9
[INFO] [stdout]    |
[INFO] [stdout] 61 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p2368_reachable_nodes_with_restrictions.rs:57:9
[INFO] [stdout]    |
[INFO] [stdout] 57 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:68:9
[INFO] [stdout]    |
[INFO] [stdout] 68 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `surf::url::UrlQuery`
[INFO] [stdout]  --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use surf::url::UrlQuery;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:8:25
[INFO] [stdout]   |
[INFO] [stdout] 8 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:79:9
[INFO] [stdout]    |
[INFO] [stdout] 79 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p2549_count_distinct_numbers_on_board.rs:18:9
[INFO] [stdout]    |
[INFO] [stdout] 18 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:75:9
[INFO] [stdout]    |
[INFO] [stdout] 75 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p2617_minimum_number_of_visited_cells_in_a_grid.rs:62:9
[INFO] [stdout]    |
[INFO] [stdout] 62 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p2642_design_graph_with_shortest_path_calculator.rs:77:9
[INFO] [stdout]    |
[INFO] [stdout] 77 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p26_remove_duplicates_from_sorted_array.rs:27:9
[INFO] [stdout]    |
[INFO] [stdout] 27 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p2744_find_maximum_number_of_string_pairs.rs:30:9
[INFO] [stdout]    |
[INFO] [stdout] 30 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p2788_split_strings_by_separator.rs:32:9
[INFO] [stdout]    |
[INFO] [stdout] 32 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem/p2867_count_valid_paths_in_a_tree.rs:63:20
[INFO] [stdout]    |
[INFO] [stdout] 63 |                 if (primes[i]) {
[INFO] [stdout]    |                    ^         ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 63 -                 if (primes[i]) {
[INFO] [stdout] 63 +                 if primes[i] {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p289_game_of_life.rs:76:9
[INFO] [stdout]    |
[INFO] [stdout] 76 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p28_find_the_index_of_the_first_occurrence_in_a_string.rs:21:9
[INFO] [stdout]    |
[INFO] [stdout] 21 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p300_longest_increasing_subsequence.rs:48:9
[INFO] [stdout]    |
[INFO] [stdout] 48 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p303_range_sum_query_immutable.rs:53:9
[INFO] [stdout]    |
[INFO] [stdout] 53 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem/p331_verify_preorder_serialization_of_a_binary_tree.rs:18:16
[INFO] [stdout]    |
[INFO] [stdout] 18 |             if (c == ',') {
[INFO] [stdout]    |                ^        ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 18 -             if (c == ',') {
[INFO] [stdout] 18 +             if c == ',' {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem/p331_verify_preorder_serialization_of_a_binary_tree.rs:22:16
[INFO] [stdout]    |
[INFO] [stdout] 22 |             if (c == '#') {
[INFO] [stdout]    |                ^        ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 22 -             if (c == '#') {
[INFO] [stdout] 22 +             if c == '#' {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p33_search_in_rotated_sorted_array.rs:48:9
[INFO] [stdout]    |
[INFO] [stdout] 48 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p35_search_insert_position.rs:36:9
[INFO] [stdout]    |
[INFO] [stdout] 36 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p36_valid_sudoku.rs:73:9
[INFO] [stdout]    |
[INFO] [stdout] 73 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p383_ransom_note.rs:42:9
[INFO] [stdout]    |
[INFO] [stdout] 42 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression
[INFO] [stdout]   --> src/problem/p42_trapping_rain_water.rs:14:18
[INFO] [stdout]    |
[INFO] [stdout] 14 |         for i in (1..length) {
[INFO] [stdout]    |                  ^         ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 14 -         for i in (1..length) {
[INFO] [stdout] 14 +         for i in 1..length {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p447_number_of_boomerangs.rs:73:9
[INFO] [stdout]    |
[INFO] [stdout] 73 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p452_minimum_number_of_arrows_to_burst_balloons.rs:36:9
[INFO] [stdout]    |
[INFO] [stdout] 36 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p46_permutations.rs:42:9
[INFO] [stdout]    |
[INFO] [stdout] 42 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression
[INFO] [stdout]   --> src/problem/p48_rotate_image.rs:13:18
[INFO] [stdout]    |
[INFO] [stdout] 13 |         for i in (0..n / 2) {
[INFO] [stdout]    |                  ^        ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 13 -         for i in (0..n / 2) {
[INFO] [stdout] 13 +         for i in 0..n / 2 {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression
[INFO] [stdout]   --> src/problem/p48_rotate_image.rs:22:18
[INFO] [stdout]    |
[INFO] [stdout] 22 |         for i in (0..n) {
[INFO] [stdout]    |                  ^    ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 22 -         for i in (0..n) {
[INFO] [stdout] 22 +         for i in 0..n {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression
[INFO] [stdout]   --> src/problem/p48_rotate_image.rs:23:22
[INFO] [stdout]    |
[INFO] [stdout] 23 |             for j in (0..i) {
[INFO] [stdout]    |                      ^    ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 23 -             for j in (0..i) {
[INFO] [stdout] 23 +             for j in 0..i {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p48_rotate_image.rs:36:9
[INFO] [stdout]    |
[INFO] [stdout] 36 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p502_ipo.rs:45:9
[INFO] [stdout]    |
[INFO] [stdout] 45 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p50_powx_n.rs:35:9
[INFO] [stdout]    |
[INFO] [stdout] 35 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p530_minimum_absolute_difference_in_bst.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p530_minimum_absolute_difference_in_bst.rs:64:9
[INFO] [stdout]    |
[INFO] [stdout] 64 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p53_maximum_subarray.rs:26:9
[INFO] [stdout]    |
[INFO] [stdout] 26 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `if` condition
[INFO] [stdout]   --> src/problem/p54_spiral_matrix.rs:40:24
[INFO] [stdout]    |
[INFO] [stdout] 40 |                     if (matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX) {
[INFO] [stdout]    |                        ^                                                            ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 40 -                     if (matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX) {
[INFO] [stdout] 40 +                     if matrix[next_pos.0 as usize][next_pos.1 as usize] == i32::MAX {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p551_student_attendance_record_i.rs:45:9
[INFO] [stdout]    |
[INFO] [stdout] 45 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p57_insert_interval.rs:43:9
[INFO] [stdout]    |
[INFO] [stdout] 43 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p637_average_of_levels_in_binary_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p637_average_of_levels_in_binary_tree.rs:70:9
[INFO] [stdout]    |
[INFO] [stdout] 70 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression
[INFO] [stdout]   --> src/problem/p73_set_matrix_zeroes.rs:37:18
[INFO] [stdout]    |
[INFO] [stdout] 37 |         for i in (1..n) {
[INFO] [stdout]    |                  ^    ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 37 -         for i in (1..n) {
[INFO] [stdout] 37 +         for i in 1..n {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p73_set_matrix_zeroes.rs:71:9
[INFO] [stdout]    |
[INFO] [stdout] 71 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p77_combinations.rs:39:9
[INFO] [stdout]    |
[INFO] [stdout] 39 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p79_word_search.rs:80:9
[INFO] [stdout]    |
[INFO] [stdout] 80 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_list`
[INFO] [stdout]  --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:6:32
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::linked_list::{to_list, ListNode};
[INFO] [stdout]   |                                ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:58:9
[INFO] [stdout]    |
[INFO] [stdout] 58 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_list`
[INFO] [stdout]  --> src/problem/p83_remove_duplicates_from_sorted_list.rs:6:32
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::linked_list::{to_list, ListNode};
[INFO] [stdout]   |                                ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p83_remove_duplicates_from_sorted_list.rs:51:9
[INFO] [stdout]    |
[INFO] [stdout] 51 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `tokio::time::error::Elapsed`
[INFO] [stdout]  --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:6:5
[INFO] [stdout]   |
[INFO] [stdout] 6 | use tokio::time::error::Elapsed;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:8:25
[INFO] [stdout]   |
[INFO] [stdout] 8 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary trailing semicolon
[INFO] [stdout]   --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:84:10
[INFO] [stdout]    |
[INFO] [stdout] 84 |         };
[INFO] [stdout]    |          ^ help: remove this semicolon
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(redundant_semicolons)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:95:9
[INFO] [stdout]    |
[INFO] [stdout] 95 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p918_maximum_sum_circular_subarray.rs:40:9
[INFO] [stdout]    |
[INFO] [stdout] 40 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p94_binary_tree_inorder_traversal.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p94_binary_tree_inorder_traversal.rs:57:9
[INFO] [stdout]    |
[INFO] [stdout] 57 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_tree`
[INFO] [stdout]  --> src/problem/p98_validate_binary_search_tree.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::util::tree::{to_tree, TreeNode};
[INFO] [stdout]   |                         ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p98_validate_binary_search_tree.rs:62:9
[INFO] [stdout]    |
[INFO] [stdout] 62 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p1928_minimum_cost_to_reach_destination_in_time.rs:47:9
[INFO] [stdout]    |
[INFO] [stdout] 47 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/problem/p2848_points_that_intersect_with_cars.rs:21:27
[INFO] [stdout]    |
[INFO] [stdout] 21 |                 result += (end - last_end);
[INFO] [stdout]    |                           ^              ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 21 -                 result += (end - last_end);
[INFO] [stdout] 21 +                 result += end - last_end;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p3127_make_a_square_with_the_same_color.rs:39:9
[INFO] [stdout]    |
[INFO] [stdout] 39 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/problem/p3177_find_the_maximum_length_of_a_good_subsequence_ii.rs:33:9
[INFO] [stdout]    |
[INFO] [stdout] 33 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::thread::available_parallelism`
[INFO] [stdout]  --> src/problem/p624_maximum_distance_in_arrays.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::thread::available_parallelism;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ffi::FromVecWithNulError`
[INFO] [stdout]  --> src/problem/p2209_minimum_white_tiles_after_covering_with_carpets.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::ffi::FromVecWithNulError;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::str::FromStr`
[INFO] [stdout]  --> src/problem/p2999_count_the_number_of_powerful_integers.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 7 | use std::str::FromStr;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::thread::current`
[INFO] [stdout]  --> src/problem/p1287_element_appearing_more_than_25_in_sorted_array.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::thread::current;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/week_385/problem2.rs:41:9
[INFO] [stdout]    |
[INFO] [stdout] 41 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/week_385/problem3.rs:30:33
[INFO] [stdout]    |
[INFO] [stdout] 30 |                         let x = (i + d.0 * step);
[INFO] [stdout]    |                                 ^              ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 30 -                         let x = (i + d.0 * step);
[INFO] [stdout] 30 +                         let x = i + d.0 * step;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/week_385/problem3.rs:31:33
[INFO] [stdout]    |
[INFO] [stdout] 31 |                         let y = (j + d.1 * step);
[INFO] [stdout]    |                                 ^              ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 31 -                         let y = (j + d.1 * step);
[INFO] [stdout] 31 +                         let y = j + d.1 * step;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/double_week_125/problem3.rs:20:13
[INFO] [stdout]    |
[INFO] [stdout] 20 |         let mut connection = vec![(0, 0); n];
[INFO] [stdout]    |             ----^^^^^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/double_week_125/problem3.rs:23:13
[INFO] [stdout]    |
[INFO] [stdout] 23 |         let mut result = Vec::with_capacity(n);
[INFO] [stdout]    |             ----^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `signal_speed`
[INFO] [stdout]  --> src/double_week_125/problem3.rs:9:13
[INFO] [stdout]   |
[INFO] [stdout] 9 |         let signal_speed = signal_speed as i64;
[INFO] [stdout]   |             ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_signal_speed`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `connection`
[INFO] [stdout]   --> src/double_week_125/problem3.rs:20:13
[INFO] [stdout]    |
[INFO] [stdout] 20 |         let mut connection = vec![(0, 0); n];
[INFO] [stdout]    |             ^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_connection`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `next`
[INFO] [stdout]   --> src/double_week_125/problem3.rs:21:13
[INFO] [stdout]    |
[INFO] [stdout] 21 |         for next in &graph[0] {}
[INFO] [stdout]    |             ^^^^ help: if this is intentional, prefix it with an underscore: `_next`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/problem/p104_maximum_depth_of_binary_tree.rs:45:17
[INFO] [stdout]    |
[INFO] [stdout] 45 |             for i in 0..level {
[INFO] [stdout]    |                 ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/problem/p139_word_break.rs:25:13
[INFO] [stdout]    |
[INFO] [stdout] 25 |         let mut root = Trie::new(false);
[INFO] [stdout]    |             ----^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `height`
[INFO] [stdout]   --> src/problem/p2617_minimum_number_of_visited_cells_in_a_grid.rs:11:13
[INFO] [stdout]    |
[INFO] [stdout] 11 |         let height = grid.len();
[INFO] [stdout]    |             ^^^^^^ help: if this is intentional, prefix it with an underscore: `_height`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/problem/p2671_frequency_tracker.rs:27:13
[INFO] [stdout]    |
[INFO] [stdout] 27 |         let mut entry = self.number_map.entry(number).or_insert(0);
[INFO] [stdout]    |             ----^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `last_begin`
[INFO] [stdout]   --> src/problem/p56_merge_intervals.rs:19:18
[INFO] [stdout]    |
[INFO] [stdout] 19 |             let (last_begin, last_end) = result[last];
[INFO] [stdout]    |                  ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_last_begin`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/problem/p68_text_justification.rs:23:25
[INFO] [stdout]    |
[INFO] [stdout] 23 |                     for i in 0..(max_width - lines[0].len()) {
[INFO] [stdout]    |                         ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `j`
[INFO] [stdout]   --> src/problem/p68_text_justification.rs:48:29
[INFO] [stdout]    |
[INFO] [stdout] 48 |                         for j in 0..space_length {
[INFO] [stdout]    |                             ^ help: if this is intentional, prefix it with an underscore: `_j`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `j`
[INFO] [stdout]   --> src/problem/p68_text_justification.rs:76:17
[INFO] [stdout]    |
[INFO] [stdout] 76 |             for j in 0..(max_width - line.len()) {
[INFO] [stdout]    |                 ^ help: if this is intentional, prefix it with an underscore: `_j`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/problem/p70_climbing_stairs.rs:19:13
[INFO] [stdout]    |
[INFO] [stdout] 19 |         for i in 3..=n {
[INFO] [stdout]    |             ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:91:25
[INFO] [stdout]    |
[INFO] [stdout] 91 |                     let mut array: &mut Vec<i32> = &mut result[pos];
[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/problem/p2332_the_latest_time_to_catch_a_bus.rs:51:17
[INFO] [stdout]    |
[INFO] [stdout] 51 |             let mut result = passengers[down_passenger] - 1;
[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/problem/p910_smallest_range_ii.rs:13:13
[INFO] [stdout]    |
[INFO] [stdout] 13 |         let mut min = *nums.first().unwrap();
[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/problem/p910_smallest_range_ii.rs:14:13
[INFO] [stdout]    |
[INFO] [stdout] 14 |         let mut max = *nums.last().unwrap();
[INFO] [stdout]    |             ----^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `y`
[INFO] [stdout]   --> src/problem/p661_image_smoother.rs:20:24
[INFO] [stdout]    |
[INFO] [stdout] 20 |             |x: usize, y: usize| 1 + if x + 1 < m { 1 } else { 0 } + if x > 0 { 1 } else { 0 };
[INFO] [stdout]    |                        ^ help: if this is intentional, prefix it with an underscore: `_y`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/problem/p3238_find_the_number_of_winning_players.rs:17:17
[INFO] [stdout]    |
[INFO] [stdout] 17 |             let mut entry = player[p].entry(b).or_insert(0);
[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/problem/p632_smallest_range_covering_elements_from_k_lists.rs:55:13
[INFO] [stdout]    |
[INFO] [stdout] 55 |         let mut pointers = Rc::new(RefCell::new(vec![0; n]));
[INFO] [stdout]    |             ----^^^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `end`
[INFO] [stdout]   --> src/problem/p729_my_calendar_i.rs:26:23
[INFO] [stdout]    |
[INFO] [stdout] 26 |         if let Some((&end, &start)) = self.end_time_map.range(start_time + 1..).next() {
[INFO] [stdout]    |                       ^^^ help: if this is intentional, prefix it with an underscore: `_end`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/problem/p1728_cat_and_mouse_ii.rs:86:13
[INFO] [stdout]    |
[INFO] [stdout] 86 |         let mut results = vec![vec![vec![Result::new(); 2]; total]; total];
[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/problem/p1206_design_skiplist.rs:123:24
[INFO] [stdout]     |
[INFO] [stdout] 123 |         while let Some(mut real_node) = node {
[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/problem/p2234_maximum_total_beauty_of_the_gardens.rs:10:9
[INFO] [stdout]    |
[INFO] [stdout] 10 |         mut flowers: Vec<i32>,
[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/problem/p2612_minimum_reverse_operations.rs:13:13
[INFO] [stdout]    |
[INFO] [stdout] 13 |         let mut ban_pos: HashSet<usize> =
[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/problem/p3396_minimum_number_of_operations_to_make_elements_in_array_distinct.rs:14:17
[INFO] [stdout]    |
[INFO] [stdout] 14 |             let mut entry = map.entry(i).or_insert(0);
[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/problem/p2364_count_number_of_bad_pairs.rs:16:17
[INFO] [stdout]    |
[INFO] [stdout] 16 |             let mut entry = map.entry(delta).or_insert(0);
[INFO] [stdout]    |                 ----^^^^^
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `t`
[INFO] [stdout]   --> src/problem/p1007_minimum_domino_rotations_for_equal_row.rs:35:43
[INFO] [stdout]    |
[INFO] [stdout] 35 |             .min(sequence.iter().filter(|(t, b)| *b != value).count()) as i32
[INFO] [stdout]    |                                           ^ help: if this is intentional, prefix it with an underscore: `_t`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `b`
[INFO] [stdout]   --> src/problem/p1007_minimum_domino_rotations_for_equal_row.rs:33:26
[INFO] [stdout]    |
[INFO] [stdout] 33 |             .filter(|(t, b)| *t != value)
[INFO] [stdout]    |                          ^ help: if this is intentional, prefix it with an underscore: `_b`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/problem/p2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros.rs:11:13
[INFO] [stdout]    |
[INFO] [stdout] 11 |         let mut nums1_sum: i64 = nums1.iter().map(|x| *x as i64).sum();
[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/problem/p2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros.rs:12:13
[INFO] [stdout]    |
[INFO] [stdout] 12 |         let mut nums2_sum: i64 = nums2.iter().map(|x| *x as i64).sum();
[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/problem/p1931_painting_a_grid_with_three_different_colors.rs:13:13
[INFO] [stdout]    |
[INFO] [stdout] 13 |         let mut mask_count = 3_usize.pow(m as u32);
[INFO] [stdout]    |             ----^^^^^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `pos`
[INFO] [stdout]   --> src/problem/p2359_find_closest_node_to_given_two_nodes.rs:27:26
[INFO] [stdout]    |
[INFO] [stdout] 27 |             if let Some((pos, d)) = result {
[INFO] [stdout]    |                          ^^^ help: if this is intentional, prefix it with an underscore: `_pos`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `end`
[INFO] [stdout]   --> src/problem/p3403_find_the_lexicographically_largest_string_from_the_box_i.rs:20:17
[INFO] [stdout]    |
[INFO] [stdout] 20 |             let end = (i + length).min(word.len());
[INFO] [stdout]    |                 ^^^ help: if this is intentional, prefix it with an underscore: `_end`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]   --> src/week_416/problem2.rs:31:20
[INFO] [stdout]    |
[INFO] [stdout] 31 |             .map(|(i, v)| Worker {
[INFO] [stdout]    |                    ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_week_125/problem1.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_operations` is never used
[INFO] [stdout]  --> src/double_week_125/problem1.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn min_operations(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_week_125/problem2.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_operations` is never used
[INFO] [stdout]  --> src/double_week_125/problem2.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn min_operations(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/double_week_125/problem3.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution;
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `count_pairs_of_connectable_servers`, `dfs`, and `tree_dp` are never used
[INFO] [stdout]   --> src/double_week_125/problem3.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn count_pairs_of_connectable_servers(edges: Vec<Vec<i32>>, signal_speed: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     fn tree_dp(
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/lcp24_nums_game.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `nums_game` is never used
[INFO] [stdout]  --> src/problem/lcp24_nums_game.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn nums_game(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/lcp30_magic_tower.rs:1:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `magic_tower` is never used
[INFO] [stdout]  --> src/problem/lcp30_magic_tower.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn magic_tower(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p100_same_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_same_tree` is never used
[INFO] [stdout]   --> src/problem/p100_same_tree.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn is_same_tree(
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p101_symmetric_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_same` and `is_symmetric` are never used
[INFO] [stdout]   --> src/problem/p101_symmetric_tree.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 31 |     fn is_same(
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p102_binary_tree_level_order_traversal.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `level_order` is never used
[INFO] [stdout]   --> src/problem/p102_binary_tree_level_order_traversal.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 33 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p103_binary_tree_zigzag_level_order_traversal.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `zigzag_level_order` is never used
[INFO] [stdout]   --> src/problem/p103_binary_tree_zigzag_level_order_traversal.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn zigzag_level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p104_maximum_depth_of_binary_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_depth` is never used
[INFO] [stdout]   --> src/problem/p104_maximum_depth_of_binary_tree.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `build_tree` is never used
[INFO] [stdout]   --> src/problem/p105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 33 |     pub fn build_tree(preorder: Vec<i32>, inorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `build_tree` is never used
[INFO] [stdout]   --> src/problem/p106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn build_tree(inorder: Vec<i32>, postorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p107_binary_tree_level_order_traversal_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `level_order_bottom` is never used
[INFO] [stdout]   --> src/problem/p107_binary_tree_level_order_traversal_ii.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 33 |     pub fn level_order_bottom(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p108_convert_sorted_array_to_binary_search_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sorted_array_to_bst` and `array_to_bst` are never used
[INFO] [stdout]   --> src/problem/p108_convert_sorted_array_to_binary_search_tree.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 31 |     pub fn sorted_array_to_bst(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn array_to_bst(array: &[i32]) -> Rc<RefCell<TreeNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p112_path_sum.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `dfs` and `has_path_sum` are never used
[INFO] [stdout]   --> src/problem/p112_path_sum.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 31 |     fn dfs(node: &Rc<RefCell<TreeNode>>, current_sum: i32, target_sum: i32) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `flatten_tree` and `flatten` are never used
[INFO] [stdout]   --> src/problem/p114_flatten_binary_tree_to_linked_list.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 31 |     fn flatten_tree(root: &Rc<RefCell<TreeNode>>) -> Rc<RefCell<TreeNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p120_triangle.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_total` is never used
[INFO] [stdout]  --> src/problem/p120_triangle.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn minimum_total(triangle: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p121_best_time_to_buy_and_sell_stock.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/problem/p121_best_time_to_buy_and_sell_stock.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p122_best_time_to_buy_and_sell_stock_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/problem/p122_best_time_to_buy_and_sell_stock_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p123_best_time_to_buy_and_sell_stock_iii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/problem/p123_best_time_to_buy_and_sell_stock_iii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p124_binary_tree_maximum_path_sum.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_sum` and `max_path_sum` are never used
[INFO] [stdout]   --> src/problem/p124_binary_tree_maximum_path_sum.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 31 |     fn max_sum(node: &Rc<RefCell<TreeNode>>, result: &mut i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57 |     pub fn max_path_sum(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p125_valid_palindrome.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]  --> src/problem/p125_valid_palindrome.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn is_palindrome(s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1261_find_elements_in_a_contaminated_binary_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `FindElements` is never constructed
[INFO] [stdout]   --> src/problem/p1261_find_elements_in_a_contaminated_binary_tree.rs:29:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | struct FindElements {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `find` are never used
[INFO] [stdout]   --> src/problem/p1261_find_elements_in_a_contaminated_binary_tree.rs:38:8
[INFO] [stdout]    |
[INFO] [stdout] 37 | impl FindElements {
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 38 |     fn new(root: Option<Rc<RefCell<TreeNode>>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 65 |     fn find(&self, target: i32) -> bool {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p1276_number_of_burgers_with_no_waste_of_ingredients.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `num_of_burgers` is never used
[INFO] [stdout]   --> src/problem/p1276_number_of_burgers_with_no_waste_of_ingredients.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 44 |     pub fn num_of_burgers(tomato_slices: i32, cheese_slices: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p127_word_ladder.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `ladder_length` and `is_one_char` are never used
[INFO] [stdout]    --> src/problem/p127_word_ladder.rs:10:12
[INFO] [stdout]     |
[INFO] [stdout]   9 | impl Solution {
[INFO] [stdout]     | ------------- associated functions in this implementation
[INFO] [stdout]  10 |     pub fn ladder_length(begin_word: String, end_word: String, word_list: Vec<String>) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 103 |     fn is_one_char(a: &String, b: &String) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p128_longest_consecutive_sequence.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_consecutive` is never used
[INFO] [stdout]   --> src/problem/p128_longest_consecutive_sequence.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn longest_consecutive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p129_sum_root_to_leaf_numbers.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `dfs_sum` and `sum_numbers` are never used
[INFO] [stdout]   --> src/problem/p129_sum_root_to_leaf_numbers.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 31 |     fn dfs_sum(node: &Rc<RefCell<TreeNode>>, last_num: i32, result: &mut i32) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     pub fn sum_numbers(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p130_surrounded_regions.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `dfs` and `solve` are never used
[INFO] [stdout]   --> src/problem/p130_surrounded_regions.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     fn dfs(board: &mut Vec<Vec<char>>, x: i32, y: i32, m: i32, n: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     pub fn solve(board: &mut Vec<Vec<char>>) {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p134_gas_station.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_complete_circuit` is never used
[INFO] [stdout]  --> src/problem/p134_gas_station.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn can_complete_circuit(gas: Vec<i32>, cost: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p135_candy.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `candy` is never used
[INFO] [stdout]  --> src/problem/p135_candy.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn candy(ratings: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p136_single_number.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `single_number` is never used
[INFO] [stdout]  --> src/problem/p136_single_number.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn single_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p137_single_number_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `single_number` is never used
[INFO] [stdout]  --> src/problem/p137_single_number_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn single_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p139_word_break.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Trie` is never constructed
[INFO] [stdout]  --> src/problem/p139_word_break.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Trie {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problem/p139_word_break.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Trie {
[INFO] [stdout]    | --------- associated function in this implementation
[INFO] [stdout] 15 |     fn new(is_word: bool) -> Rc<RefCell<Self>> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `word_break` is never used
[INFO] [stdout]   --> src/problem/p139_word_break.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn word_break(s: String, word_dict: Vec<String>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p144_binary_tree_preorder_traversal.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `preorder_traversal` is never used
[INFO] [stdout]   --> src/problem/p144_binary_tree_preorder_traversal.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p145_binary_tree_postorder_traversal.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `postorder_traversal` is never used
[INFO] [stdout]   --> src/problem/p145_binary_tree_postorder_traversal.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p149_max_points_on_a_line.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Slope` is never constructed
[INFO] [stdout]   --> src/problem/p149_max_points_on_a_line.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct Slope {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `new` and `gcd` are never used
[INFO] [stdout]   --> src/problem/p149_max_points_on_a_line.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Slope {
[INFO] [stdout]    | ---------- associated functions in this implementation
[INFO] [stdout] 16 |     fn new(point1: &Vec<i32>, point2: &Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn gcd(a: i32, b: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_points` is never used
[INFO] [stdout]   --> src/problem/p149_max_points_on_a_line.rs:48:12
[INFO] [stdout]    |
[INFO] [stdout] 47 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 48 |     pub fn max_points(points: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p150_evaluate_reverse_polish_notation.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `eval_rpn` is never used
[INFO] [stdout]  --> src/problem/p150_evaluate_reverse_polish_notation.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn eval_rpn(tokens: Vec<String>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p151_reverse_words_in_a_string.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_words` is never used
[INFO] [stdout]  --> src/problem/p151_reverse_words_in_a_string.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn reverse_words(s: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p153_find_minimum_in_rotated_sorted_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min` is never used
[INFO] [stdout]  --> src/problem/p153_find_minimum_in_rotated_sorted_array.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p155_min_stack.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]  --> src/problem/p155_min_stack.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct MinStack {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used
[INFO] [stdout]   --> src/problem/p155_min_stack.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 19 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn push(&mut self, val: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn get_min(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p162_find_peak_element.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_peak_element` is never used
[INFO] [stdout]   --> src/problem/p162_find_peak_element.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 35 |     pub fn find_peak_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p167_two_sum_ii_input_array_is_sorted.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]  --> src/problem/p167_two_sum_ii_input_array_is_sorted.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn two_sum(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1686_stone_game_vi.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Stone` is never constructed
[INFO] [stdout]  --> src/problem/p1686_stone_game_vi.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Stone {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `stone_game_vi` is never used
[INFO] [stdout]   --> src/problem/p1686_stone_game_vi.rs:15:12
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 15 |     pub fn stone_game_vi(alice_values: Vec<i32>, bob_values: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1690_stone_game_vii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `stone_game_vii` is never used
[INFO] [stdout]  --> src/problem/p1690_stone_game_vii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn stone_game_vii(stones: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1696_jump_game_vi.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_result` is never used
[INFO] [stdout]   --> src/problem/p1696_jump_game_vi.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn max_result(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p169_majority_element.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `majority_element` is never used
[INFO] [stdout]  --> src/problem/p169_majority_element.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p172_factorial_trailing_zeroes.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `trailing_zeroes` is never used
[INFO] [stdout]  --> src/problem/p172_factorial_trailing_zeroes.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn trailing_zeroes(n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p173_binary_search_tree_iterator.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BSTIterator` is never constructed
[INFO] [stdout]   --> src/problem/p173_binary_search_tree_iterator.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | struct BSTIterator {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `next`, and `has_next` are never used
[INFO] [stdout]   --> src/problem/p173_binary_search_tree_iterator.rs:43:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | impl BSTIterator {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 43 |     fn new(root: Option<Rc<RefCell<TreeNode>>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 67 |     fn next(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 90 |     fn has_next(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1793_maximum_score_of_a_good_subarray.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `maximum_score` is never used
[INFO] [stdout]  --> src/problem/p1793_maximum_score_of_a_good_subarray.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn maximum_score(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p17_letter_combinations_of_a_phone_number.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `letter_combinations` and `search` are never used
[INFO] [stdout]   --> src/problem/p17_letter_combinations_of_a_phone_number.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     fn search(digits: &Vec<usize>, str: &mut Vec<char>, result: &mut Vec<String>, pos: usize) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p188_best_time_to_buy_and_sell_stock_iv.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/problem/p188_best_time_to_buy_and_sell_stock_iv.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_profit(k: i32, prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p189_rotate_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rotate` is never used
[INFO] [stdout]  --> src/problem/p189_rotate_array.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn rotate(nums: &mut Vec<i32>, k: i32) {
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p190_reverse_bits.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_bits` is never used
[INFO] [stdout]  --> src/problem/p190_reverse_bits.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn reverse_bits(x: u32) -> u32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p191_number_of_1_bits.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `hamming_weight` is never used
[INFO] [stdout]  --> src/problem/p191_number_of_1_bits.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn hamming_weight(n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1969_minimum_non_zero_product_of_the_array_elements.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `min_non_zero_product` and `fast_power` are never used
[INFO] [stdout]   --> src/problem/p1969_minimum_non_zero_product_of_the_array_elements.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 11 |     pub fn min_non_zero_product(p: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn fast_power(x: i64, n: i64, m: i64) -> i64 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1976_number_of_ways_to_arrive_at_destination.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]   --> src/problem/p1976_number_of_ways_to_arrive_at_destination.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct Node {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_paths` is never used
[INFO] [stdout]   --> src/problem/p1976_number_of_ways_to_arrive_at_destination.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 28 |     pub fn count_paths(n: i32, roads: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p198_house_robber.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rob` is never used
[INFO] [stdout]  --> src/problem/p198_house_robber.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1997_first_day_where_you_have_been_in_all_the_rooms.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `first_day_been_in_all_rooms` is never used
[INFO] [stdout]  --> src/problem/p1997_first_day_where_you_have_been_in_all_the_rooms.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn first_day_been_in_all_rooms(next_visit: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p199_binary_tree_right_side_view.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `right_side_view` is never used
[INFO] [stdout]   --> src/problem/p199_binary_tree_right_side_view.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p1_two_sum.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 35 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]   --> src/problem/p1_two_sum.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 44 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p200_number_of_islands.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_in_grid`, `dfs`, and `num_islands` are never used
[INFO] [stdout]   --> src/problem/p200_number_of_islands.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     fn is_in_grid(x: i32, y: i32, grid: &Vec<Vec<char>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn dfs(grid: &mut Vec<Vec<char>>, x: i32, y: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     pub fn num_islands(grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p201_bitwise_and_of_numbers_range.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `range_bitwise_and` is never used
[INFO] [stdout]  --> src/problem/p201_bitwise_and_of_numbers_range.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn range_bitwise_and(left: i32, right: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p202_happy_number.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_happy` and `calculate_square` are never used
[INFO] [stdout]   --> src/problem/p202_happy_number.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     pub fn is_happy(n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn calculate_square(n: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p205_isomorphic_strings.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_isomorphic` is never used
[INFO] [stdout]   --> src/problem/p205_isomorphic_strings.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn is_isomorphic(s: String, t: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p207_course_schedule.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_finish` is never used
[INFO] [stdout]   --> src/problem/p207_course_schedule.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn can_finish(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p2085_count_common_words_with_one_occurrence.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 37 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_words` is never used
[INFO] [stdout]   --> src/problem/p2085_count_common_words_with_one_occurrence.rs:47:12
[INFO] [stdout]    |
[INFO] [stdout] 46 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 47 |     pub fn count_words(words1: Vec<String>, words2: Vec<String>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p208_implement_trie_prefix_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TrieNode` is never constructed
[INFO] [stdout]   --> src/problem/p208_implement_trie_prefix_tree.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct TrieNode {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problem/p208_implement_trie_prefix_tree.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl TrieNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |     fn new(is_ended: bool) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Trie` is never constructed
[INFO] [stdout]   --> src/problem/p208_implement_trie_prefix_tree.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Trie {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `search`, and `starts_with` are never used
[INFO] [stdout]   --> src/problem/p208_implement_trie_prefix_tree.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Trie {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 33 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn insert(&mut self, word: String) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 64 |     fn search(&self, word: String) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 85 |     fn starts_with(&self, prefix: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p209_minimum_size_subarray_sum.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_sub_array_len` is never used
[INFO] [stdout]  --> src/problem/p209_minimum_size_subarray_sum.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p20_valid_parentheses.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_valid` is never used
[INFO] [stdout]   --> src/problem/p20_valid_parentheses.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 41 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 42 |     pub fn is_valid(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p210_course_schedule_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_order` is never used
[INFO] [stdout]   --> src/problem/p210_course_schedule_ii.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn find_order(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p211_design_add_and_search_words_data_structure.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TireNode` is never constructed
[INFO] [stdout]   --> src/problem/p211_design_add_and_search_words_data_structure.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct TireNode {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problem/p211_design_add_and_search_words_data_structure.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl TireNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 19 |     fn new(is_word: bool) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `WordDictionary` is never constructed
[INFO] [stdout]   --> src/problem/p211_design_add_and_search_words_data_structure.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | struct WordDictionary {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `add_word`, and `search` are never used
[INFO] [stdout]   --> src/problem/p211_design_add_and_search_words_data_structure.rs:36:8
[INFO] [stdout]    |
[INFO] [stdout] 35 | impl WordDictionary {
[INFO] [stdout]    | ------------------- associated items in this implementation
[INFO] [stdout] 36 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn add_word(&self, word: String) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 67 |     fn search(&self, word: String) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2129_capitalize_the_title.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `capitalize_title` is never used
[INFO] [stdout]  --> src/problem/p2129_capitalize_the_title.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn capitalize_title(title: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p212_word_search_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TrieNode` is never constructed
[INFO] [stdout]   --> src/problem/p212_word_search_ii.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct TrieNode {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problem/p212_word_search_ii.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl TrieNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 21 |     fn new(is_word: bool, index: usize) -> TrieNode {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_words` and `dfs` are never used
[INFO] [stdout]   --> src/problem/p212_word_search_ii.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 31 |     pub fn find_words(board: Vec<Vec<char>>, words: Vec<String>) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 73 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p215_kth_largest_element_in_an_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_kth_largest` is never used
[INFO] [stdout]  --> src/problem/p215_kth_largest_element_in_an_array.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2171_removing_minimum_number_of_magic_beans.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_removal` is never used
[INFO] [stdout]   --> src/problem/p2171_removing_minimum_number_of_magic_beans.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn minimum_removal(beans: Vec<i32>) -> i64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2182_construct_string_with_repeat_limit.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `repeat_limited_string` is never used
[INFO] [stdout]   --> src/problem/p2182_construct_string_with_repeat_limit.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn repeat_limited_string(s: String, repeat_limit: i32) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p219_contains_duplicate_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `contains_nearby_duplicate` is never used
[INFO] [stdout]   --> src/problem/p219_contains_duplicate_ii.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn contains_nearby_duplicate(nums: Vec<i32>, k: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p21_merge_two_sorted_lists.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge_two_lists` is never used
[INFO] [stdout]   --> src/problem/p21_merge_two_sorted_lists.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn merge_two_lists(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p221_maximal_square.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `maximal_square` is never used
[INFO] [stdout]  --> src/problem/p221_maximal_square.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn maximal_square(matrix: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p222_count_complete_tree_nodes.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_nodes` is never used
[INFO] [stdout]   --> src/problem/p222_count_complete_tree_nodes.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn count_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p224_basic_calculator.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `calculate` is never used
[INFO] [stdout]  --> src/problem/p224_basic_calculator.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn calculate(s: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p225_implement_stack_using_queues.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyStack` is never constructed
[INFO] [stdout]  --> src/problem/p225_implement_stack_using_queues.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct MyStack {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `empty` are never used
[INFO] [stdout]   --> src/problem/p225_implement_stack_using_queues.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl MyStack {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout] 18 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     fn push(&mut self, x: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p226_invert_binary_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `invert_tree` is never used
[INFO] [stdout]   --> src/problem/p226_invert_binary_tree.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p228_summary_ranges.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `summary_ranges` is never used
[INFO] [stdout]  --> src/problem/p228_summary_ranges.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn summary_ranges(nums: Vec<i32>) -> Vec<String> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p22_generate_parentheses.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `generate_parenthesis` and `backtrace` are never used
[INFO] [stdout]   --> src/problem/p22_generate_parentheses.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn generate_parenthesis(n: i32) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn backtrace(left: usize, right: usize, path: &mut Vec<char>, result: &mut Vec<String>) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p230_kth_smallest_element_in_a_bst.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `inorder_iterate` and `kth_smallest` are never used
[INFO] [stdout]   --> src/problem/p230_kth_smallest_element_in_a_bst.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 31 |     fn inorder_iterate(node: &Rc<RefCell<TreeNode>>, count: &mut i32, target: i32) -> Option<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2312_selling_pieces_of_wood.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `selling_wood`, `hash`, and `dfs` are never used
[INFO] [stdout]   --> src/problem/p2312_selling_pieces_of_wood.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     pub fn selling_wood(m: i32, n: i32, prices: Vec<Vec<i32>>) -> i64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn hash(x: usize, y: usize) -> usize {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn dfs(x: usize, y: usize, dp: &mut Vec<Vec<i64>>, prices_map: &HashMap<usize, i64>) -> i64 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p232_implement_queue_using_stacks.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyQueue` is never constructed
[INFO] [stdout]  --> src/problem/p232_implement_queue_using_stacks.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct MyQueue {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, and `empty` are never used
[INFO] [stdout]   --> src/problem/p232_implement_queue_using_stacks.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl MyQueue {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout] 19 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn push(&mut self, x: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn peek(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used
[INFO] [stdout]   --> src/problem/p235_lowest_common_ancestor_of_a_binary_search_tree.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn lowest_common_ancestor(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2368_reachable_nodes_with_restrictions.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reachable_nodes` is never used
[INFO] [stdout]   --> src/problem/p2368_reachable_nodes_with_restrictions.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn reachable_nodes(n: i32, edges: Vec<Vec<i32>>, restricted: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2369_check_if_there_is_a_valid_partition_for_the_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `valid_partition` is never used
[INFO] [stdout]  --> src/problem/p2369_check_if_there_is_a_valid_partition_for_the_array.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn valid_partition(nums: Vec<i32>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used
[INFO] [stdout]   --> src/problem/p236_lowest_common_ancestor_of_a_binary_tree.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn lowest_common_ancestor(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2386_find_the_k_sum_of_an_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]   --> src/problem/p2386_find_the_k_sum_of_an_array.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct Node {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `k_sum` is never used
[INFO] [stdout]   --> src/problem/p2386_find_the_k_sum_of_an_array.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 28 |     pub fn k_sum(nums: Vec<i32>, k: i32) -> i64 {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p238_product_of_array_except_self.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `product_except_self` is never used
[INFO] [stdout]  --> src/problem/p238_product_of_array_except_self.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p242_valid_anagram.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_anagram` is never used
[INFO] [stdout]   --> src/problem/p242_valid_anagram.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `closest_nodes` is never used
[INFO] [stdout]   --> src/problem/p2476_closest_nodes_queries_in_a_binary_search_tree.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 33 |     pub fn closest_nodes(root: Option<Rc<RefCell<TreeNode>>>, queries: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2549_count_distinct_numbers_on_board.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `distinct_integers` is never used
[INFO] [stdout]  --> src/problem/p2549_count_distinct_numbers_on_board.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn distinct_integers(n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2575_find_the_divisibility_array_of_a_string.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `divisibility_array` is never used
[INFO] [stdout]  --> src/problem/p2575_find_the_divisibility_array_of_a_string.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn divisibility_array(word: String, m: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2580_count_ways_to_group_overlapping_ranges.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Range` is never constructed
[INFO] [stdout]  --> src/problem/p2580_count_ways_to_group_overlapping_ranges.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Range {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_ways` is never used
[INFO] [stdout]   --> src/problem/p2580_count_ways_to_group_overlapping_ranges.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn count_ways(ranges: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2581_count_number_of_possible_root_nodes.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `root_count`, `hash`, `dfs`, and `tree_dp` are never used
[INFO] [stdout]   --> src/problem/p2581_count_number_of_possible_root_nodes.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 13 |     pub fn root_count(edges: Vec<Vec<i32>>, guesses: Vec<Vec<i32>>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn hash(x: usize, y: usize) -> i64 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 64 |     fn tree_dp(
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `kth_largest_level_sum` is never used
[INFO] [stdout]   --> src/problem/p2583_kth_largest_sum_in_a_binary_tree.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn kth_largest_level_sum(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2617_minimum_number_of_visited_cells_in_a_grid.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_visited_cells` is never used
[INFO] [stdout]   --> src/problem/p2617_minimum_number_of_visited_cells_in_a_grid.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn minimum_visited_cells(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2641_cousins_in_binary_tree_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `replace_value_in_tree` is never used
[INFO] [stdout]   --> src/problem/p2641_cousins_in_binary_tree_ii.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn replace_value_in_tree(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2642_design_graph_with_shortest_path_calculator.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Graph` is never constructed
[INFO] [stdout]  --> src/problem/p2642_design_graph_with_shortest_path_calculator.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Graph {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `add_edge`, and `shortest_path` are never used
[INFO] [stdout]   --> src/problem/p2642_design_graph_with_shortest_path_calculator.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Graph {
[INFO] [stdout]    | ---------- associated items in this implementation
[INFO] [stdout] 18 |     fn new(n: i32, edges: Vec<Vec<i32>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn add_edge(&mut self, edge: Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn shortest_path(&self, node1: i32, node2: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2670_find_the_distinct_difference_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `distinct_difference_array` is never used
[INFO] [stdout]   --> src/problem/p2670_find_the_distinct_difference_array.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn distinct_difference_array(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2671_frequency_tracker.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `FrequencyTracker` is never constructed
[INFO] [stdout]  --> src/problem/p2671_frequency_tracker.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct FrequencyTracker {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `add`, `delete_one`, and `has_frequency` are never used
[INFO] [stdout]   --> src/problem/p2671_frequency_tracker.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl FrequencyTracker {
[INFO] [stdout]    | --------------------- associated items in this implementation
[INFO] [stdout] 19 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn add(&mut self, number: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn delete_one(&mut self, number: i32) {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56 |     fn has_frequency(&self, frequency: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2673_make_costs_of_paths_equal_in_a_binary_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_increments` is never used
[INFO] [stdout]  --> src/problem/p2673_make_costs_of_paths_equal_in_a_binary_tree.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_increments(n: i32, cost: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2684_maximum_number_of_moves_in_a_grid.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_moves` is never used
[INFO] [stdout]  --> src/problem/p2684_maximum_number_of_moves_in_a_grid.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_moves(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p2697_lexicographically_smallest_palindrome.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 34 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `make_smallest_palindrome` is never used
[INFO] [stdout]   --> src/problem/p2697_lexicographically_smallest_palindrome.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 42 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 43 |     pub fn make_smallest_palindrome(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p26_remove_duplicates_from_sorted_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_duplicates` is never used
[INFO] [stdout]  --> src/problem/p26_remove_duplicates_from_sorted_array.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2719_count_of_integers.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `DigitDP` is never constructed
[INFO] [stdout]  --> src/problem/p2719_count_of_integers.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct DigitDP {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `dp` are never used
[INFO] [stdout]   --> src/problem/p2719_count_of_integers.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl DigitDP {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout] 18 |     pub fn new(num1: Vec<u32>, num2: Vec<u32>, min_sum: u32, max_sum: u32) -> DigitDP {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     pub fn dp(&mut self, sum: u32, l_limit: bool, r_limit: bool, index: usize) -> i32 {
[INFO] [stdout]    |            ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `count` and `str_to_vec` are never used
[INFO] [stdout]   --> src/problem/p2719_count_of_integers.rs:79:12
[INFO] [stdout]    |
[INFO] [stdout] 78 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 79 |     pub fn count(num1: String, num2: String, min_sum: i32, max_sum: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 93 |     fn str_to_vec(num: String) -> Vec<u32> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2744_find_maximum_number_of_string_pairs.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `maximum_number_of_string_pairs` is never used
[INFO] [stdout]  --> src/problem/p2744_find_maximum_number_of_string_pairs.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn maximum_number_of_string_pairs(words: Vec<String>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p274_h_index.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `h_index` is never used
[INFO] [stdout]  --> src/problem/p274_h_index.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn h_index(citations: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2765_longest_alternating_subarray.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `alternating_subarray` is never used
[INFO] [stdout]  --> src/problem/p2765_longest_alternating_subarray.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn alternating_subarray(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2788_split_strings_by_separator.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `split_words_by_separator` is never used
[INFO] [stdout]  --> src/problem/p2788_split_strings_by_separator.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn split_words_by_separator(words: Vec<String>, separator: char) -> Vec<String> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2789_largest_element_in_an_array_after_merge_operations.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_array_value` is never used
[INFO] [stdout]  --> src/problem/p2789_largest_element_in_an_array_after_merge_operations.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_array_value(nums: Vec<i32>) -> i64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p27_remove_element.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_element` is never used
[INFO] [stdout]  --> src/problem/p27_remove_element.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2808_minimum_seconds_to_equalize_a_circular_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_seconds` is never used
[INFO] [stdout]   --> src/problem/p2808_minimum_seconds_to_equalize_a_circular_array.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn minimum_seconds(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2809_minimum_time_to_make_array_sum_at_most_x.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Pair` is never constructed
[INFO] [stdout]  --> src/problem/p2809_minimum_time_to_make_array_sum_at_most_x.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Pair {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_time` is never used
[INFO] [stdout]   --> src/problem/p2809_minimum_time_to_make_array_sum_at_most_x.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |     pub fn minimum_time(nums1: Vec<i32>, nums2: Vec<i32>, x: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p2828_check_if_a_string_is_an_acronym_of_words.rs:38:12
[INFO] [stdout]    |
[INFO] [stdout] 38 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_acronym` is never used
[INFO] [stdout]   --> src/problem/p2828_check_if_a_string_is_an_acronym_of_words.rs:46:12
[INFO] [stdout]    |
[INFO] [stdout] 45 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 46 |     pub fn is_acronym(words: Vec<String>, s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2834_find_the_minimum_possible_sum_of_a_beautiful_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_possible_sum` is never used
[INFO] [stdout]  --> src/problem/p2834_find_the_minimum_possible_sum_of_a_beautiful_array.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 8 |     pub fn minimum_possible_sum(n: i32, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `UnionFind` is never constructed
[INFO] [stdout]   --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct UnionFind {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `find`, and `merge` are never used
[INFO] [stdout]   --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl UnionFind {
[INFO] [stdout]    | -------------- associated items in this implementation
[INFO] [stdout] 15 |     fn new(n: usize) -> UnionFind {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn find(&mut self, x: usize) -> usize {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn merge(&mut self, parent: usize, child: usize) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Tree` is never constructed
[INFO] [stdout]   --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | struct Tree {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `tarjan` are never used
[INFO] [stdout]   --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 52 | impl Tree {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 53 |     fn new(n: i32, edges: Vec<Vec<i32>>, queries: &Vec<Vec<i32>>) -> Tree {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 91 |     fn tarjan(&mut self, node: usize, parent: usize) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_operations_queries` is never used
[INFO] [stdout]    --> src/problem/p2846_minimum_edge_weight_equilibrium_queries_in_a_tree.rs:125:12
[INFO] [stdout]     |
[INFO] [stdout] 124 | impl Solution {
[INFO] [stdout]     | ------------- associated function in this implementation
[INFO] [stdout] 125 |     pub fn min_operations_queries(
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2859_sum_of_values_at_indices_with_k_set_bits.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sum_indices_with_k_set_bits` and `num_to_binary` are never used
[INFO] [stdout]   --> src/problem/p2859_sum_of_values_at_indices_with_k_set_bits.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn sum_indices_with_k_set_bits(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     fn num_to_binary(num: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2861_maximum_number_of_alloys.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `check` and `max_number_of_alloys` are never used
[INFO] [stdout]   --> src/problem/p2861_maximum_number_of_alloys.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     fn check(
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     pub fn max_number_of_alloys(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2864_maximum_odd_binary_number.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `maximum_odd_binary_number` is never used
[INFO] [stdout]  --> src/problem/p2864_maximum_odd_binary_number.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn maximum_odd_binary_number(s: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2865_beautiful_towers_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `maximum_sum_of_heights` is never used
[INFO] [stdout]  --> src/problem/p2865_beautiful_towers_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn maximum_sum_of_heights(max_heights: Vec<i32>) -> i64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2867_count_valid_paths_in_a_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `dfs` and `count_paths` are never used
[INFO] [stdout]   --> src/problem/p2867_count_valid_paths_in_a_tree.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     pub fn count_paths(n: i32, edges: Vec<Vec<i32>>) -> i64 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p289_game_of_life.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `game_of_life` is never used
[INFO] [stdout]  --> src/problem/p289_game_of_life.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn game_of_life(board: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p28_find_the_index_of_the_first_occurrence_in_a_string.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `str_str` is never used
[INFO] [stdout]  --> src/problem/p28_find_the_index_of_the_first_occurrence_in_a_string.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn str_str(haystack: String, needle: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2908_minimum_sum_of_mountain_triplets_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_sum` is never used
[INFO] [stdout]  --> src/problem/p2908_minimum_sum_of_mountain_triplets_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn minimum_sum(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p290_word_pattern.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `word_pattern` is never used
[INFO] [stdout]   --> src/problem/p290_word_pattern.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn word_pattern(pattern: String, s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2917_find_the_k_or_of_an_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_k_or` is never used
[INFO] [stdout]  --> src/problem/p2917_find_the_k_or_of_an_array.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn find_k_or(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p292_nim_game.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_win_nim` is never used
[INFO] [stdout]  --> src/problem/p292_nim_game.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn can_win_nim(n: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2952_minimum_number_of_coins_to_be_added.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_added_coins` is never used
[INFO] [stdout]  --> src/problem/p2952_minimum_number_of_coins_to_be_added.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn minimum_added_coins(coins: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p295_find_median_from_data_stream.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MedianFinder` is never constructed
[INFO] [stdout]   --> src/problem/p295_find_median_from_data_stream.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct MedianFinder {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `add_num`, and `find_median` are never used
[INFO] [stdout]   --> src/problem/p295_find_median_from_data_stream.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl MedianFinder {
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 20 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn add_num(&mut self, num: i32) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     fn find_median(&self) -> f64 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p299_bulls_and_cows.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `get_hint` is never used
[INFO] [stdout]   --> src/problem/p299_bulls_and_cows.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn get_hint(secret: String, guess: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p2_add_two_numbers.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_two_numbers` is never used
[INFO] [stdout]   --> src/problem/p2_add_two_numbers.rs:56:12
[INFO] [stdout]    |
[INFO] [stdout] 55 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 56 |     pub fn add_two_numbers(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p300_longest_increasing_subsequence.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_lis` is never used
[INFO] [stdout]  --> src/problem/p300_longest_increasing_subsequence.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn length_of_lis(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p303_range_sum_query_immutable.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `NumArray` is never constructed
[INFO] [stdout]  --> src/problem/p303_range_sum_query_immutable.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct NumArray {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `sum_range` are never used
[INFO] [stdout]   --> src/problem/p303_range_sum_query_immutable.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl NumArray {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 17 |     fn new(nums: Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn sum_range(&self, left: i32, right: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p30_substring_with_concatenation_of_all_words.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_substring` is never used
[INFO] [stdout]   --> src/problem/p30_substring_with_concatenation_of_all_words.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn find_substring(s: String, words: Vec<String>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p310_minimum_height_trees.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_min_height_trees` and `find_longest_node` are never used
[INFO] [stdout]   --> src/problem/p310_minimum_height_trees.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     pub fn find_min_height_trees(n: i32, edges: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn find_longest_node(node: usize, parents: &mut Vec<usize>, graph: &Vec<Vec<usize>>) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3117_minimum_sum_of_values_by_dividing_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `INFINITE` is never used
[INFO] [stdout]  --> src/problem/p3117_minimum_sum_of_values_by_dividing_array.rs:9:7
[INFO] [stdout]   |
[INFO] [stdout] 9 | const INFINITE: i32 = (1 << 20) - 1;
[INFO] [stdout]   |       ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `minimum_value_sum` and `dfs` are never used
[INFO] [stdout]   --> src/problem/p3117_minimum_sum_of_values_by_dividing_array.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 12 |     pub fn minimum_value_sum(nums: Vec<i32>, and_values: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3137_minimum_number_of_operations_to_make_word_k_periodic.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_operations_to_make_k_periodic` is never used
[INFO] [stdout]   --> src/problem/p3137_minimum_number_of_operations_to_make_word_k_periodic.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn minimum_operations_to_make_k_periodic(word: String, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p322_coin_change.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `coin_change` is never used
[INFO] [stdout]  --> src/problem/p322_coin_change.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p331_verify_preorder_serialization_of_a_binary_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_valid_serialization` is never used
[INFO] [stdout]  --> src/problem/p331_verify_preorder_serialization_of_a_binary_tree.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn is_valid_serialization(preorder: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p33_search_in_rotated_sorted_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search` is never used
[INFO] [stdout]  --> src/problem/p33_search_in_rotated_sorted_array.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p34_find_first_and_last_position_of_element_in_sorted_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_range` is never used
[INFO] [stdout]  --> src/problem/p34_find_first_and_last_position_of_element_in_sorted_array.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn search_range(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p35_search_insert_position.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_insert` is never used
[INFO] [stdout]  --> src/problem/p35_search_insert_position.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p365_water_and_jug_problem.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `can_measure_water` and `gcd` are never used
[INFO] [stdout]   --> src/problem/p365_water_and_jug_problem.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn can_measure_water(jug1_capacity: i32, jug2_capacity: i32, target_capacity: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn gcd(a: i32, b: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p36_valid_sudoku.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_valid_sudoku` is never used
[INFO] [stdout]   --> src/problem/p36_valid_sudoku.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn is_valid_sudoku(board: Vec<Vec<char>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p373_find_k_pairs_with_smallest_sums.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Pair` is never constructed
[INFO] [stdout]   --> src/problem/p373_find_k_pairs_with_smallest_sums.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct Pair<'a> {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/problem/p373_find_k_pairs_with_smallest_sums.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Pair<'_> {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 18 |     fn new<'a>(nums1: &'a Vec<i32>, nums2: &'a Vec<i32>, x: usize, y: usize) -> Pair<'a> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `k_smallest_pairs` is never used
[INFO] [stdout]   --> src/problem/p373_find_k_pairs_with_smallest_sums.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 37 |     pub fn k_smallest_pairs(nums1: Vec<i32>, nums2: Vec<i32>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p380_insert_delete_getrandom_o1.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `RandomizedSet` is never constructed
[INFO] [stdout]   --> src/problem/p380_insert_delete_getrandom_o1.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct RandomizedSet {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `remove`, and `get_random` are never used
[INFO] [stdout]   --> src/problem/p380_insert_delete_getrandom_o1.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | impl RandomizedSet {
[INFO] [stdout]    | ------------------ associated items in this implementation
[INFO] [stdout] 22 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn insert(&mut self, val: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn remove(&mut self, val: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57 |     fn get_random(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p383_ransom_note.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_construct` is never used
[INFO] [stdout]   --> src/problem/p383_ransom_note.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn can_construct(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p392_is_subsequence.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_subsequence` is never used
[INFO] [stdout]  --> src/problem/p392_is_subsequence.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn is_subsequence(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p399_evaluate_division.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `UnionFind` is never constructed
[INFO] [stdout]  --> src/problem/p399_evaluate_division.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct UnionFind {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `find`, `merge`, and `is_connected` are never used
[INFO] [stdout]   --> src/problem/p399_evaluate_division.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl UnionFind {
[INFO] [stdout]    | -------------- associated items in this implementation
[INFO] [stdout] 15 |     fn new(n: usize) -> UnionFind {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn find(&mut self, x: usize) -> usize {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn merge(&mut self, x: usize, y: usize, value: f64) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 49 |     fn is_connected(&mut self, x: usize, y: usize) -> f64 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `calc_equation` is never used
[INFO] [stdout]   --> src/problem/p399_evaluate_division.rs:61:12
[INFO] [stdout]    |
[INFO] [stdout] 60 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 61 |     pub fn calc_equation(
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p39_combination_sum.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum` and `dfs` are never used
[INFO] [stdout]   --> src/problem/p39_combination_sum.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     pub fn combination_sum(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p3_longest_substring_without_repeating_characters.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_longest_substring` is never used
[INFO] [stdout]   --> src/problem/p3_longest_substring_without_repeating_characters.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 41 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 42 |     pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p410_split_array_largest_sum.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `check` and `split_array` are never used
[INFO] [stdout]   --> src/problem/p410_split_array_largest_sum.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     fn check(nums: &Vec<i32>, value: i64, m: i32) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     pub fn split_array(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p42_trapping_rain_water.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `trap` is never used
[INFO] [stdout]  --> src/problem/p42_trapping_rain_water.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn trap(height: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p433_minimum_genetic_mutation.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_mutation` is never used
[INFO] [stdout]   --> src/problem/p433_minimum_genetic_mutation.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn min_mutation(start_gene: String, end_gene: String, bank: Vec<String>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p447_number_of_boomerangs.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `number_of_boomerangs` is never used
[INFO] [stdout]   --> src/problem/p447_number_of_boomerangs.rs:42:12
[INFO] [stdout]    |
[INFO] [stdout] 41 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 42 |     pub fn number_of_boomerangs(points: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p452_minimum_number_of_arrows_to_burst_balloons.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_min_arrow_shots` is never used
[INFO] [stdout]  --> src/problem/p452_minimum_number_of_arrows_to_burst_balloons.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn find_min_arrow_shots(points: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p45_jump_game_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `jump` is never used
[INFO] [stdout]  --> src/problem/p45_jump_game_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn jump(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p46_permutations.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute`, `search`, and `swap` are never used
[INFO] [stdout]   --> src/problem/p46_permutations.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn search(length: usize, output: &mut Vec<i32>, result: &mut Vec<Vec<i32>>, pos: usize) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn swap(output: &mut Vec<i32>, a: usize, b: usize) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p48_rotate_image.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rotate` is never used
[INFO] [stdout]  --> src/problem/p48_rotate_image.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn rotate(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p49_group_anagrams.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `WordState` is never constructed
[INFO] [stdout]   --> src/problem/p49_group_anagrams.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct WordState {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `group_anagrams` is never used
[INFO] [stdout]   --> src/problem/p49_group_anagrams.rs:53:12
[INFO] [stdout]    |
[INFO] [stdout] 52 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 53 |     pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p4_median_of_two_sorted_arrays.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_median_sorted_arrays` and `get_k_th` are never used
[INFO] [stdout]   --> src/problem/p4_median_of_two_sorted_arrays.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 39 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 40 |     pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     fn get_k_th(
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p502_ipo.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_maximized_capital` is never used
[INFO] [stdout]  --> src/problem/p502_ipo.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn find_maximized_capital(k: i32, w: i32, profits: Vec<i32>, capital: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p50_powx_n.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `my_pow` and `quick_pow` are never used
[INFO] [stdout]   --> src/problem/p50_powx_n.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn my_pow(x: f64, n: i32) -> f64 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn quick_pow(x: f64, n: i32) -> f64 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p514_freedom_trail.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_rotate_steps` is never used
[INFO] [stdout]   --> src/problem/p514_freedom_trail.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn find_rotate_steps(ring: String, key: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p518_coin_change_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `change` is never used
[INFO] [stdout]  --> src/problem/p518_coin_change_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn change(amount: i32, coins: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p52_n_queens_ii.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `total_n_queens` is never used
[INFO] [stdout]   --> src/problem/p52_n_queens_ii.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 34 |     pub fn total_n_queens(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p530_minimum_absolute_difference_in_bst.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `inorder_iterate` and `get_minimum_difference` are never used
[INFO] [stdout]   --> src/problem/p530_minimum_absolute_difference_in_bst.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 31 |     fn inorder_iterate(node: &Rc<RefCell<TreeNode>>, arrap: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p53_maximum_subarray.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_sub_array` is never used
[INFO] [stdout]  --> src/problem/p53_maximum_subarray.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p54_spiral_matrix.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `spiral_order` is never used
[INFO] [stdout]  --> src/problem/p54_spiral_matrix.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn spiral_order(matrix: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p551_student_attendance_record_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `check_record` is never used
[INFO] [stdout]  --> src/problem/p551_student_attendance_record_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn check_record(s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p55_jump_game.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_jump` is never used
[INFO] [stdout]  --> src/problem/p55_jump_game.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn can_jump(nums: Vec<i32>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p56_merge_intervals.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge` is never used
[INFO] [stdout]  --> src/problem/p56_merge_intervals.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn merge(intervals: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p57_insert_interval.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `insert` is never used
[INFO] [stdout]  --> src/problem/p57_insert_interval.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn insert(intervals: Vec<Vec<i32>>, new_interval: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p58_length_of_last_word.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_last_word` is never used
[INFO] [stdout]  --> src/problem/p58_length_of_last_word.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn length_of_last_word(s: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p637_average_of_levels_in_binary_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `average_of_levels` is never used
[INFO] [stdout]   --> src/problem/p637_average_of_levels_in_binary_tree.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn average_of_levels(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<f64> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p63_unique_paths_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `unique_paths_with_obstacles` is never used
[INFO] [stdout]  --> src/problem/p63_unique_paths_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn unique_paths_with_obstacles(obstacle_grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p64_minimum_path_sum.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_path_sum` is never used
[INFO] [stdout]  --> src/problem/p64_minimum_path_sum.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_path_sum(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p66_plus_one.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `plus_one` is never used
[INFO] [stdout]  --> src/problem/p66_plus_one.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn plus_one(digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p670_maximum_swap.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `maximum_swap` is never used
[INFO] [stdout]  --> src/problem/p670_maximum_swap.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn maximum_swap(num: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p67_add_binary.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_binary` is never used
[INFO] [stdout]  --> src/problem/p67_add_binary.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn add_binary(a: String, b: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p68_text_justification.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `full_justify` is never used
[INFO] [stdout]  --> src/problem/p68_text_justification.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn full_justify(words: Vec<String>, max_width: i32) -> Vec<String> {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p69_sqrtx.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `my_sqrt` is never used
[INFO] [stdout]  --> src/problem/p69_sqrtx.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn my_sqrt(x: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p6_zigzag_conversion.rs:44:12
[INFO] [stdout]    |
[INFO] [stdout] 44 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `convert` is never used
[INFO] [stdout]   --> src/problem/p6_zigzag_conversion.rs:52:12
[INFO] [stdout]    |
[INFO] [stdout] 51 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 52 |     pub fn convert(s: String, num_rows: i32) -> String {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p70_climbing_stairs.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `climb_stairs` is never used
[INFO] [stdout]  --> src/problem/p70_climbing_stairs.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p71_simplify_path.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `simplify_path` is never used
[INFO] [stdout]  --> src/problem/p71_simplify_path.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn simplify_path(path: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p72_edit_distance.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_distance` is never used
[INFO] [stdout]  --> src/problem/p72_edit_distance.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_distance(word1: String, word2: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p73_set_matrix_zeroes.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `set_zeroes` is never used
[INFO] [stdout]  --> src/problem/p73_set_matrix_zeroes.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn set_zeroes(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p743_network_delay_time.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `network_delay_time` is never used
[INFO] [stdout]   --> src/problem/p743_network_delay_time.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn network_delay_time(times: Vec<Vec<i32>>, n: i32, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p74_search_a_2d_matrix.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search_matrix` is never used
[INFO] [stdout]  --> src/problem/p74_search_a_2d_matrix.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p76_minimum_window_substring.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `min_window` and `check_map` are never used
[INFO] [stdout]   --> src/problem/p76_minimum_window_substring.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     pub fn min_window(s: String, t: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 53 |     fn check_map(s: &HashMap<char, i32>, t: &HashMap<char, i32>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p77_combinations.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combine` and `search` are never used
[INFO] [stdout]   --> src/problem/p77_combinations.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn search(n: i32, k: i32, x: i32, now: &mut Vec<i32>, result: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p79_word_search.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `exist` and `search` are never used
[INFO] [stdout]   --> src/problem/p79_word_search.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn exist(board: Vec<Vec<char>>, word: String) -> bool {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn search(
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p7_reverse_integer.rs:28:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse` is never used
[INFO] [stdout]   --> src/problem/p7_reverse_integer.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 35 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 36 |     pub fn reverse(x: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p80_remove_duplicates_from_sorted_array_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_duplicates` is never used
[INFO] [stdout]  --> src/problem/p80_remove_duplicates_from_sorted_array_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `delete_duplicates` is never used
[INFO] [stdout]   --> src/problem/p82_remove_duplicates_from_sorted_list_ii.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 27 |     pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p83_remove_duplicates_from_sorted_list.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `delete_duplicates` is never used
[INFO] [stdout]   --> src/problem/p83_remove_duplicates_from_sorted_list.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 27 |     pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `construct_from_pre_post` is never used
[INFO] [stdout]   --> src/problem/p889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 34 |     pub fn construct_from_pre_post(
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p88_merge_sorted_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge` is never used
[INFO] [stdout]  --> src/problem/p88_merge_sorted_array.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p909_snakes_and_ladders.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `snakes_and_ladders` is never used
[INFO] [stdout]   --> src/problem/p909_snakes_and_ladders.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn snakes_and_ladders(board: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p912_sort_an_array.rs:26:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `sort_array` and `merge_sort` are never used
[INFO] [stdout]   --> src/problem/p912_sort_an_array.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 34 |     pub fn sort_array(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 44 |     fn merge_sort(nums: &mut Vec<i32>, temp: &mut Vec<i32>, left: usize, right: usize) {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p918_maximum_sum_circular_subarray.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_subarray_sum_circular` is never used
[INFO] [stdout]   --> src/problem/p918_maximum_sum_circular_subarray.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn max_subarray_sum_circular(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p938_range_sum_of_bst.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `range_sum_bst` is never used
[INFO] [stdout]   --> src/problem/p938_range_sum_of_bst.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 32 |     pub fn range_sum_bst(root: Option<Rc<RefCell<TreeNode>>>, low: i32, high: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p94_binary_tree_inorder_traversal.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `inorder_traversal` is never used
[INFO] [stdout]   --> src/problem/p94_binary_tree_inorder_traversal.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 31 |     pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p97_interleaving_string.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_interleave` is never used
[INFO] [stdout]  --> src/problem/p97_interleaving_string.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn is_interleave(s1: String, s2: String, s3: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]   --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 32 | struct Node {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `DFS` is never constructed
[INFO] [stdout]   --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:38:8
[INFO] [stdout]    |
[INFO] [stdout] 38 | struct DFS {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `search` are never used
[INFO] [stdout]   --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:43:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | impl DFS {
[INFO] [stdout]    | -------- associated items in this implementation
[INFO] [stdout] 43 |     fn new() -> DFS {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     fn search(&mut self, node: &Rc<RefCell<TreeNode>>, x: i32, y: i32) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `vertical_traversal` is never used
[INFO] [stdout]   --> src/problem/p987_vertical_order_traversal_of_a_binary_tree.rs:65:12
[INFO] [stdout]    |
[INFO] [stdout] 64 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 65 |     pub fn vertical_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p98_validate_binary_search_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `inorder_iterate` and `is_valid_bst` are never used
[INFO] [stdout]   --> src/problem/p98_validate_binary_search_tree.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 31 |     fn inorder_iterate(node: &Rc<RefCell<TreeNode>>, array: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p993_cousins_in_binary_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Tree` is never constructed
[INFO] [stdout]   --> src/problem/p993_cousins_in_binary_tree.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct Tree {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `dfs` are never used
[INFO] [stdout]   --> src/problem/p993_cousins_in_binary_tree.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 41 | impl Tree {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 42 |     fn new(root: Rc<RefCell<TreeNode>>, x: i32, y: i32) -> Tree {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     fn dfs(&mut self, node: &Rc<RefCell<TreeNode>>, height: usize, parent: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_cousins` is never used
[INFO] [stdout]   --> src/problem/p993_cousins_in_binary_tree.rs:86:12
[INFO] [stdout]    |
[INFO] [stdout] 85 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 86 |     pub fn is_cousins(root: Option<Rc<RefCell<TreeNode>>>, x: i32, y: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/problem/p9_palindrome_number.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | pub struct Solution {}
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]   --> src/problem/p9_palindrome_number.rs:40:12
[INFO] [stdout]    |
[INFO] [stdout] 39 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 40 |     pub fn is_palindrome(x: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1184_distance_between_bus_stops.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `distance_between_bus_stops` is never used
[INFO] [stdout]  --> src/problem/p1184_distance_between_bus_stops.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn distance_between_bus_stops(distance: Vec<i32>, start: i32, destination: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1227_airplane_seat_assignment_probability.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `nth_person_gets_nth_seat` is never used
[INFO] [stdout]  --> src/problem/p1227_airplane_seat_assignment_probability.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn nth_person_gets_nth_seat(n: i32) -> f64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1436_destination_city.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `dest_city` is never used
[INFO] [stdout]  --> src/problem/p1436_destination_city.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn dest_city(paths: Vec<Vec<String>>) -> String {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1450_number_of_students_doing_homework_at_a_given_time.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `busy_student` is never used
[INFO] [stdout]  --> src/problem/p1450_number_of_students_doing_homework_at_a_given_time.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn busy_student(start_time: Vec<i32>, end_time: Vec<i32>, query_time: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1845_seat_reservation_manager.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SeatManager` is never constructed
[INFO] [stdout]   --> src/problem/p1845_seat_reservation_manager.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | struct SeatManager {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `reserve`, and `unreserve` are never used
[INFO] [stdout]   --> src/problem/p1845_seat_reservation_manager.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl SeatManager {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 19 |     fn new(n: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     fn reserve(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |     fn unreserve(&mut self, seat_number: i32) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1870_minimum_speed_to_arrive_on_time.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_speed_on_time` is never used
[INFO] [stdout]  --> src/problem/p1870_minimum_speed_to_arrive_on_time.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_speed_on_time(dist: Vec<i32>, hour: f64) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1884_egg_drop_with_2_eggs_and_n_floors.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_egg_drop` is never used
[INFO] [stdout]  --> src/problem/p1884_egg_drop_with_2_eggs_and_n_floors.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn two_egg_drop(n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1928_minimum_cost_to_reach_destination_in_time.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_cost` is never used
[INFO] [stdout]  --> src/problem/p1928_minimum_cost_to_reach_destination_in_time.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_cost(max_time: i32, edges: Vec<Vec<i32>>, passing_fees: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2024_maximize_the_confusion_of_an_exam.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_consecutive_answers` and `max_consecutive_char` are never used
[INFO] [stdout]   --> src/problem/p2024_maximize_the_confusion_of_an_exam.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn max_consecutive_answers(answer_key: String, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn max_consecutive_char(str: &Vec<char>, k: i32, c: char) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2073_time_needed_to_buy_tickets.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `time_required_to_buy` is never used
[INFO] [stdout]  --> src/problem/p2073_time_needed_to_buy_tickets.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn time_required_to_buy(tickets: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2181_merge_nodes_in_between_zeros.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge_nodes` is never used
[INFO] [stdout]   --> src/problem/p2181_merge_nodes_in_between_zeros.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 27 |     pub fn merge_nodes(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2187_minimum_time_to_complete_trips.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_time` is never used
[INFO] [stdout]  --> src/problem/p2187_minimum_time_to_complete_trips.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn minimum_time(time: Vec<i32>, total_trips: i32) -> i64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2207_maximize_number_of_subsequences_in_a_string.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `maximum_subsequence_count` is never used
[INFO] [stdout]  --> src/problem/p2207_maximize_number_of_subsequences_in_a_string.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn maximum_subsequence_count(text: String, pattern: String) -> i64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2286_booking_concert_tickets_in_groups.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BookMyShow` is never constructed
[INFO] [stdout]  --> src/problem/p2286_booking_concert_tickets_in_groups.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct BookMyShow {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `modify`, `query_min_row`, `query_sum`, `gather`, and `scatter` are never used
[INFO] [stdout]   --> src/problem/p2286_booking_concert_tickets_in_groups.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl BookMyShow {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 20 |     fn new(n: i32, m: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn modify(&mut self, i: usize, l: i32, r: i32, index: i32, val: i32) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     fn query_min_row(&self, i: usize, l: i32, r: i32, val: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 65 |     fn query_sum(&self, i: usize, l: i32, r: i32, target_left: i32, target_right: i32) -> i64 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 84 |     fn gather(&mut self, k: i32, max_row: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 95 |     fn scatter(&mut self, k: i32, max_row: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2306_naming_a_company.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `distinct_names` is never used
[INFO] [stdout]  --> src/problem/p2306_naming_a_company.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn distinct_names(ideas: Vec<String>) -> i64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2332_the_latest_time_to_catch_a_bus.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `latest_time_catch_the_bus` is never used
[INFO] [stdout]  --> src/problem/p2332_the_latest_time_to_catch_a_bus.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn latest_time_catch_the_bus(buses: Vec<i32>, passengers: Vec<i32>, capacity: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2374_node_with_highest_edge_score.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `edge_score` is never used
[INFO] [stdout]  --> src/problem/p2374_node_with_highest_edge_score.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn edge_score(edges: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2376_count_special_integers.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `count_special_numbers` and `dp` are never used
[INFO] [stdout]   --> src/problem/p2376_count_special_integers.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     pub fn count_special_numbers(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn dp(
[INFO] [stdout]    |        ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2390_removing_stars_from_a_string.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_stars` is never used
[INFO] [stdout]  --> src/problem/p2390_removing_stars_from_a_string.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn remove_stars(s: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2398_maximum_number_of_robots_within_budget.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `maximum_robots` is never used
[INFO] [stdout]  --> src/problem/p2398_maximum_number_of_robots_within_budget.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn maximum_robots(charge_times: Vec<i32>, running_costs: Vec<i32>, budget: i64) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2414_length_of_the_longest_alphabetical_continuous_substring.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_continuous_substring` is never used
[INFO] [stdout]  --> src/problem/p2414_length_of_the_longest_alphabetical_continuous_substring.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn longest_continuous_substring(s: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2516_take_k_of_each_character_from_left_and_right.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `take_characters` is never used
[INFO] [stdout]  --> src/problem/p2516_take_k_of_each_character_from_left_and_right.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn take_characters(s: String, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2535_difference_between_element_sum_and_digit_sum_of_an_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `difference_of_sum` is never used
[INFO] [stdout]  --> src/problem/p2535_difference_between_element_sum_and_digit_sum_of_an_array.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn difference_of_sum(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2552_count_increasing_quadruplets.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_quadruplets` is never used
[INFO] [stdout]  --> src/problem/p2552_count_increasing_quadruplets.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn count_quadruplets(nums: Vec<i32>) -> i64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2555_maximize_win_from_two_segments.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `maximize_win` and `binary_search` are never used
[INFO] [stdout]   --> src/problem/p2555_maximize_win_from_two_segments.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn maximize_win(prize_positions: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     fn binary_search(array: &Vec<i32>, target: i32) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2576_find_the_maximum_number_of_marked_indices.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_num_of_marked_indices` is never used
[INFO] [stdout]  --> src/problem/p2576_find_the_maximum_number_of_marked_indices.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_num_of_marked_indices(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2708_maximum_strength_of_a_group.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_strength` is never used
[INFO] [stdout]  --> src/problem/p2708_maximum_strength_of_a_group.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_strength(nums: Vec<i32>) -> i64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2848_points_that_intersect_with_cars.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `number_of_points` is never used
[INFO] [stdout]  --> src/problem/p2848_points_that_intersect_with_cars.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn number_of_points(nums: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2860_happy_students.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_ways` is never used
[INFO] [stdout]  --> src/problem/p2860_happy_students.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn count_ways(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3007_maximum_number_that_sum_of_the_prices_is_less_than_or_equal_to_k.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_maximum_number`, `accumulate_price`, and `accumulate_bit_price` are never used
[INFO] [stdout]   --> src/problem/p3007_maximum_number_that_sum_of_the_prices_is_less_than_or_equal_to_k.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn find_maximum_number(k: i64, x: i32) -> i64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn accumulate_price(x: i32, num: i64) -> i64 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn accumulate_bit_price(x: i32, num: i64) -> i64 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3127_make_a_square_with_the_same_color.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `DELTA` is never used
[INFO] [stdout]  --> src/problem/p3127_make_a_square_with_the_same_color.rs:8:7
[INFO] [stdout]   |
[INFO] [stdout] 8 | const DELTA: [(usize, usize); 4] = [(0, 0), (0, 1), (1, 0), (1, 1)];
[INFO] [stdout]   |       ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_make_square` is never used
[INFO] [stdout]   --> src/problem/p3127_make_a_square_with_the_same_color.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn can_make_square(grid: Vec<Vec<char>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3133_minimum_array_end.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_end` is never used
[INFO] [stdout]  --> src/problem/p3133_minimum_array_end.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_end(n: i32, x: i32) -> i64 {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3134_find_the_median_of_the_uniqueness_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `median_of_uniqueness_array` is never used
[INFO] [stdout]   --> src/problem/p3134_find_the_median_of_the_uniqueness_array.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn median_of_uniqueness_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3142_check_if_grid_satisfies_conditions.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `satisfies_conditions` is never used
[INFO] [stdout]  --> src/problem/p3142_check_if_grid_satisfies_conditions.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn satisfies_conditions(grid: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3144_minimum_substring_partition_of_equal_character_frequency.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_substrings_in_partition` is never used
[INFO] [stdout]   --> src/problem/p3144_minimum_substring_partition_of_equal_character_frequency.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn minimum_substrings_in_partition(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3145_find_products_of_elements_of_big_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_products_of_elements`, `middle_check`, `count_one`, `count_power`, and `power_mod` are never used
[INFO] [stdout]    --> src/problem/p3145_find_products_of_elements_of_big_array.rs:9:12
[INFO] [stdout]     |
[INFO] [stdout]   8 | impl Solution {
[INFO] [stdout]     | ------------- associated functions in this implementation
[INFO] [stdout]   9 |     pub fn find_products_of_elements(queries: Vec<Vec<i64>>) -> Vec<i32> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  56 |     fn middle_check(x: i64) -> i64 {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  72 |     fn count_one(x: i64) -> i64 {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  91 |     fn count_power(x: i64) -> i64 {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 110 |     fn power_mod(x: i64, y: i64, mod_number: i64) -> i64 {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3146_permutation_difference_between_two_strings.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_permutation_difference` is never used
[INFO] [stdout]   --> src/problem/p3146_permutation_difference_between_two_strings.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn find_permutation_difference(s: String, t: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3153_sum_of_digit_differences_of_all_pairs.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sum_digit_differences` is never used
[INFO] [stdout]  --> src/problem/p3153_sum_of_digit_differences_of_all_pairs.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn sum_digit_differences(nums: Vec<i32>) -> i64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3154_find_number_of_ways_to_reach_the_k_th_stair.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `ways_to_reach_stair` and `combine` are never used
[INFO] [stdout]   --> src/problem/p3154_find_number_of_ways_to_reach_the_k_th_stair.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn ways_to_reach_stair(k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn combine(n: i32, k: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3158_find_the_xor_of_numbers_which_appear_twice.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `duplicate_numbers_xor` is never used
[INFO] [stdout]  --> src/problem/p3158_find_the_xor_of_numbers_which_appear_twice.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn duplicate_numbers_xor(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3162_find_the_number_of_good_pairs_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `number_of_pairs` is never used
[INFO] [stdout]  --> src/problem/p3162_find_the_number_of_good_pairs_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn number_of_pairs(nums1: Vec<i32>, nums2: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3164_find_the_number_of_good_pairs_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `number_of_pairs` is never used
[INFO] [stdout]  --> src/problem/p3164_find_the_number_of_good_pairs_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn number_of_pairs(nums1: Vec<i32>, nums2: Vec<i32>, k: i32) -> i64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3171_find_subarray_with_bitwise_or_closest_to_k.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_difference` is never used
[INFO] [stdout]   --> src/problem/p3171_find_subarray_with_bitwise_or_closest_to_k.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn minimum_difference(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3174_clear_digits.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `clear_digits` is never used
[INFO] [stdout]  --> src/problem/p3174_clear_digits.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn clear_digits(s: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3175_find_the_first_player_to_win_k_games_in_a_row.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_winning_player` is never used
[INFO] [stdout]  --> src/problem/p3175_find_the_first_player_to_win_k_games_in_a_row.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn find_winning_player(skills: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3176_find_the_maximum_length_of_a_good_subsequence_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `maximum_length` is never used
[INFO] [stdout]  --> src/problem/p3176_find_the_maximum_length_of_a_good_subsequence_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn maximum_length(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3177_find_the_maximum_length_of_a_good_subsequence_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `maximum_length` is never used
[INFO] [stdout]  --> src/problem/p3177_find_the_maximum_length_of_a_good_subsequence_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn maximum_length(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3184_count_pairs_that_form_a_complete_day_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_complete_day_pairs` is never used
[INFO] [stdout]  --> src/problem/p3184_count_pairs_that_form_a_complete_day_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn count_complete_day_pairs(hours: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3185_count_pairs_that_form_a_complete_day_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_complete_day_pairs` is never used
[INFO] [stdout]  --> src/problem/p3185_count_pairs_that_form_a_complete_day_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn count_complete_day_pairs(hours: Vec<i32>) -> i64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3191_minimum_operations_to_make_binary_array_elements_equal_to_one_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `min_operations` and `reverse` are never used
[INFO] [stdout]   --> src/problem/p3191_minimum_operations_to_make_binary_array_elements_equal_to_one_i.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn min_operations(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 40 |     fn reverse(pos: usize, nums: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3192_minimum_operations_to_make_binary_array_elements_equal_to_one_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_operations` is never used
[INFO] [stdout]  --> src/problem/p3192_minimum_operations_to_make_binary_array_elements_equal_to_one_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_operations(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3193_count_the_number_of_inversions.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MOD` is never used
[INFO] [stdout]  --> src/problem/p3193_count_the_number_of_inversions.rs:9:7
[INFO] [stdout]   |
[INFO] [stdout] 9 | const MOD: i32 = 1_000_000_007;
[INFO] [stdout]   |       ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `number_of_permutations` and `dfs` are never used
[INFO] [stdout]   --> src/problem/p3193_count_the_number_of_inversions.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 12 |     pub fn number_of_permutations(n: i32, requirements: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3194_minimum_average_of_smallest_and_largest_elements.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_average` is never used
[INFO] [stdout]  --> src/problem/p3194_minimum_average_of_smallest_and_largest_elements.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn minimum_average(nums: Vec<i32>) -> f64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3200_maximum_height_of_a_triangle.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_height_of_triangle` is never used
[INFO] [stdout]  --> src/problem/p3200_maximum_height_of_a_triangle.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_height_of_triangle(red: i32, blue: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p552_student_attendance_record_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `check_record` is never used
[INFO] [stdout]  --> src/problem/p552_student_attendance_record_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn check_record(n: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p698_partition_to_k_equal_sum_subsets.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `can_partition_k_subsets` and `search` are never used
[INFO] [stdout]   --> src/problem/p698_partition_to_k_equal_sum_subsets.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn can_partition_k_subsets(nums: Vec<i32>, k: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn search(state: usize, now: i32, dp: &mut Vec<bool>, target: i32, nums: &Vec<i32>) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p815_bus_routes.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `num_buses_to_destination` is never used
[INFO] [stdout]  --> src/problem/p815_bus_routes.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn num_buses_to_destination(routes: Vec<Vec<i32>>, source: i32, target: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p871_minimum_number_of_refueling_stops.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_refuel_stops` is never used
[INFO] [stdout]  --> src/problem/p871_minimum_number_of_refueling_stops.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_refuel_stops(target: i32, start_fuel: i32, stations: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p887_super_egg_drop.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `super_egg_drop` and `dp` are never used
[INFO] [stdout]   --> src/problem/p887_super_egg_drop.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 11 |     pub fn super_egg_drop(k: i32, n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn dp(k: i32, n: i32, memory: &mut HashMap<i32, i32>) -> i32 {
[INFO] [stdout]    |        ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p908_smallest_range_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `smallest_range_i` is never used
[INFO] [stdout]  --> src/problem/p908_smallest_range_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn smallest_range_i(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p910_smallest_range_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `smallest_range_ii` is never used
[INFO] [stdout]  --> src/problem/p910_smallest_range_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn smallest_range_ii(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p977_squares_of_a_sorted_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sorted_squares` is never used
[INFO] [stdout]  --> src/problem/p977_squares_of_a_sorted_array.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn sorted_squares(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p983_minimum_cost_for_tickets.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `mincost_tickets` and `dp` are never used
[INFO] [stdout]   --> src/problem/p983_minimum_cost_for_tickets.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     pub fn mincost_tickets(days: Vec<i32>, costs: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 17 |     fn dp(
[INFO] [stdout]    |        ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p997_find_the_town_judge.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_judge` is never used
[INFO] [stdout]  --> src/problem/p997_find_the_town_judge.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn find_judge(n: i32, trust: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3180_maximum_total_reward_using_operations_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_total_reward` is never used
[INFO] [stdout]  --> src/problem/p3180_maximum_total_reward_using_operations_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_total_reward(reward_values: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3181_maximum_total_reward_using_operations_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_total_reward` is never used
[INFO] [stdout]  --> src/problem/p3181_maximum_total_reward_using_operations_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_total_reward(reward_values: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p684_redundant_connection.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `UnionFindSet` is never constructed
[INFO] [stdout]  --> src/problem/p684_redundant_connection.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct UnionFindSet {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `find`, and `merge` are never used
[INFO] [stdout]   --> src/problem/p684_redundant_connection.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl UnionFindSet {
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 13 |     fn new(n: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn find(&mut self, n: usize) -> usize {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     fn merge(&mut self, a: usize, b: usize) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_redundant_connection` is never used
[INFO] [stdout]   --> src/problem/p684_redundant_connection.rs:37:12
[INFO] [stdout]    |
[INFO] [stdout] 36 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 37 |     pub fn find_redundant_connection(edges: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p685_redundant_connection_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `UnionFindSet` is never constructed
[INFO] [stdout]  --> src/problem/p685_redundant_connection_ii.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct UnionFindSet {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `find`, and `merge` are never used
[INFO] [stdout]   --> src/problem/p685_redundant_connection_ii.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl UnionFindSet {
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 12 |     fn new(n: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |     fn find(&mut self, n: usize) -> usize {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn merge(&mut self, a: usize, b: usize) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_redundant_directed_connection` is never used
[INFO] [stdout]   --> src/problem/p685_redundant_connection_ii.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 35 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 36 |     pub fn find_redundant_directed_connection(edges: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3211_generate_binary_strings_without_adjacent_zeros.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `valid_strings` and `dfs` are never used
[INFO] [stdout]   --> src/problem/p3211_generate_binary_strings_without_adjacent_zeros.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn valid_strings(n: i32) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn dfs(i: usize, last_zero: bool, str: &mut Vec<char>, result: &mut Vec<String>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3216_lexicographically_smallest_string_after_a_swap.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `get_smallest_string` is never used
[INFO] [stdout]  --> src/problem/p3216_lexicographically_smallest_string_after_a_swap.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn get_smallest_string(s: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3165_maximum_sum_of_subsequence_with_non_adjacent_elements.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SegementNode` is never constructed
[INFO] [stdout]  --> src/problem/p3165_maximum_sum_of_subsequence_with_non_adjacent_elements.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct SegementNode {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `set` are never used
[INFO] [stdout]   --> src/problem/p3165_maximum_sum_of_subsequence_with_non_adjacent_elements.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl SegementNode {
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 17 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn set(&mut self, v: i64) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SegementTree` is never constructed
[INFO] [stdout]   --> src/problem/p3165_maximum_sum_of_subsequence_with_non_adjacent_elements.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | struct SegementTree {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push_up`, `init_recurisely`, `init`, `update_recurisely`, and `update` are never used
[INFO] [stdout]   --> src/problem/p3165_maximum_sum_of_subsequence_with_non_adjacent_elements.rs:40:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | impl SegementTree {
[INFO] [stdout]    | ----------------- associated items in this implementation
[INFO] [stdout] 40 |     fn new(n: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |     fn push_up(&mut self, pos: usize) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56 |     fn init_recurisely(&mut self, nums: &Vec<i32>, pos: usize, left: usize, right: usize) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 68 |     fn init(&mut self, nums: Vec<i32>) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 72 |     fn update_recurisely(&mut self, x: usize, l: usize, r: usize, pos: usize, v: i64) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 88 |     fn update(&mut self, query: Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MOD` is never used
[INFO] [stdout]   --> src/problem/p3165_maximum_sum_of_subsequence_with_non_adjacent_elements.rs:93:7
[INFO] [stdout]    |
[INFO] [stdout] 93 | const MOD: i64 = 1_000_000_007;
[INFO] [stdout]    |       ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `maximum_sum_subsequence` is never used
[INFO] [stdout]   --> src/problem/p3165_maximum_sum_of_subsequence_with_non_adjacent_elements.rs:96:12
[INFO] [stdout]    |
[INFO] [stdout] 95 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 96 |     pub fn maximum_sum_subsequence(nums: Vec<i32>, queries: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3259_maximum_energy_boost_from_two_drinks.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_energy_boost` is never used
[INFO] [stdout]  --> src/problem/p3259_maximum_energy_boost_from_two_drinks.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_energy_boost(energy_drink_a: Vec<i32>, energy_drink_b: Vec<i32>) -> i64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3226_number_of_bit_changes_to_make_two_integers_equal.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_changes` is never used
[INFO] [stdout]  --> src/problem/p3226_number_of_bit_changes_to_make_two_integers_equal.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_changes(n: i32, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p638_shopping_offers.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `shopping_offers` and `dfs` are never used
[INFO] [stdout]   --> src/problem/p638_shopping_offers.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     pub fn shopping_offers(price: Vec<i32>, special: Vec<Vec<i32>>, needs: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p633_sum_of_square_numbers.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `judge_square_sum` is never used
[INFO] [stdout]  --> src/problem/p633_sum_of_square_numbers.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn judge_square_sum(c: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3222_find_the_winning_player_in_coin_game.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `losing_player` is never used
[INFO] [stdout]  --> src/problem/p3222_find_the_winning_player_in_coin_game.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn losing_player(x: i32, y: i32) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3254_find_the_power_of_k_size_subarrays_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `results_array` is never used
[INFO] [stdout]  --> src/problem/p3254_find_the_power_of_k_size_subarrays_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn results_array(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3255_find_the_power_of_k_size_subarrays_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `results_array` is never used
[INFO] [stdout]  --> src/problem/p3255_find_the_power_of_k_size_subarrays_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn results_array(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3235_check_if_the_rectangle_corner_is_reachable.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Circle` is never constructed
[INFO] [stdout]  --> src/problem/p3235_check_if_the_rectangle_corner_is_reachable.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Circle {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `intersect_in_rectangle`, `contains_point`, `intersect_with_top_left`, and `intersect_with_bottom_right` are never used
[INFO] [stdout]   --> src/problem/p3235_check_if_the_rectangle_corner_is_reachable.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | impl Circle {
[INFO] [stdout]    | ----------- associated items in this implementation
[INFO] [stdout] 15 |     fn new(array: Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 23 |     fn intersect_in_rectangle(a: &Self, b: &Self, x: i64, y: i64) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     fn contains_point(&self, x: i64, y: i64) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn intersect_with_top_left(&self, x: i64, y: i64) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn intersect_with_bottom_right(&self, x: i64, y: i64) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `can_reach_corner` and `dfs` are never used
[INFO] [stdout]   --> src/problem/p3235_check_if_the_rectangle_corner_is_reachable.rs:47:12
[INFO] [stdout]    |
[INFO] [stdout] 46 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 47 |     pub fn can_reach_corner(x_corner: i32, y_corner: i32, circles: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 69 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3242_design_neighbor_sum_service.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `NeighborSum` is never constructed
[INFO] [stdout]  --> src/problem/p3242_design_neighbor_sum_service.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct NeighborSum {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `DIAGONAL_DELTA` is never used
[INFO] [stdout]   --> src/problem/p3242_design_neighbor_sum_service.rs:13:7
[INFO] [stdout]    |
[INFO] [stdout] 13 | const DIAGONAL_DELTA: [(i32, i32); 4] = [(-1, 1), (1, 1), (1, -1), (-1, -1)];
[INFO] [stdout]    |       ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `ADJACENT_DELTA` is never used
[INFO] [stdout]   --> src/problem/p3242_design_neighbor_sum_service.rs:14:7
[INFO] [stdout]    |
[INFO] [stdout] 14 | const ADJACENT_DELTA: [(i32, i32); 4] = [(-1, 0), (0, 1), (0, -1), (1, 0)];
[INFO] [stdout]    |       ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `adjacent_sum`, and `diagonal_sum` are never used
[INFO] [stdout]   --> src/problem/p3242_design_neighbor_sum_service.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | impl NeighborSum {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 21 |     fn new(grid: Vec<Vec<i32>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     fn adjacent_sum(&self, value: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 59 |     fn diagonal_sum(&self, value: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p540_single_element_in_a_sorted_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `single_non_duplicate` is never used
[INFO] [stdout]  --> src/problem/p540_single_element_in_a_sorted_array.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn single_non_duplicate(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1547_minimum_cost_to_cut_a_stick.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_cost` is never used
[INFO] [stdout]  --> src/problem/p1547_minimum_cost_to_cut_a_stick.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_cost(n: i32, cuts: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3258_count_substrings_that_satisfy_k_constraint_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_k_constraint_substrings` is never used
[INFO] [stdout]  --> src/problem/p3258_count_substrings_that_satisfy_k_constraint_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn count_k_constraint_substrings(s: String, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3261_count_substrings_that_satisfy_k_constraint_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_k_constraint_substrings` is never used
[INFO] [stdout]  --> src/problem/p3261_count_substrings_that_satisfy_k_constraint_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn count_k_constraint_substrings(s: String, k: i32, queries: Vec<Vec<i32>>) -> Vec<i64> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3249_count_the_number_of_good_nodes.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `count_good_nodes` and `dfs` are never used
[INFO] [stdout]   --> src/problem/p3249_count_the_number_of_good_nodes.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn count_good_nodes(edges: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn dfs(tree: &Vec<Vec<usize>>, node: usize, parent: usize, result: &mut i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3239_minimum_number_of_flips_to_make_binary_grid_palindromic_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_flips` is never used
[INFO] [stdout]  --> src/problem/p3239_minimum_number_of_flips_to_make_binary_grid_palindromic_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_flips(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3240_minimum_number_of_flips_to_make_binary_grid_palindromic_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_flips` is never used
[INFO] [stdout]  --> src/problem/p3240_minimum_number_of_flips_to_make_binary_grid_palindromic_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_flips(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p825_friends_of_appropriate_ages.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `num_friend_requests` is never used
[INFO] [stdout]  --> src/problem/p825_friends_of_appropriate_ages.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn num_friend_requests(ages: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p661_image_smoother.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `image_smoother` is never used
[INFO] [stdout]  --> src/problem/p661_image_smoother.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn image_smoother(img: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3243_shortest_distance_after_road_addition_queries_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `shortest_distance_after_queries` and `bfs` are never used
[INFO] [stdout]   --> src/problem/p3243_shortest_distance_after_road_addition_queries_i.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn shortest_distance_after_queries(n: i32, queries: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn bfs(n: usize, matrix: &Vec<Vec<usize>>) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3244_shortest_distance_after_road_addition_queries_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `shortest_distance_after_queries` is never used
[INFO] [stdout]  --> src/problem/p3244_shortest_distance_after_road_addition_queries_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn shortest_distance_after_queries(n: i32, queries: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3248_snake_in_matrix.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `final_position_of_snake` is never used
[INFO] [stdout]  --> src/problem/p3248_snake_in_matrix.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn final_position_of_snake(n: i32, commands: Vec<String>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3233_find_the_count_of_numbers_which_are_not_special.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `non_special_count` is never used
[INFO] [stdout]  --> src/problem/p3233_find_the_count_of_numbers_which_are_not_special.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn non_special_count(l: i32, r: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3238_find_the_number_of_winning_players.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `winning_player_count` is never used
[INFO] [stdout]  --> src/problem/p3238_find_the_number_of_winning_players.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn winning_player_count(n: i32, pick: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p632_smallest_range_covering_elements_from_k_lists.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ArrayPointer` is never constructed
[INFO] [stdout]   --> src/problem/p632_smallest_range_covering_elements_from_k_lists.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct ArrayPointer<'a> {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `value` are never used
[INFO] [stdout]   --> src/problem/p632_smallest_range_covering_elements_from_k_lists.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl<'a> ArrayPointer<'a> {
[INFO] [stdout]    | ------------------------- associated items in this implementation
[INFO] [stdout] 20 |     fn new(nums: &'a Vec<Vec<i32>>, pointers: Rc<RefCell<Vec<usize>>>, index: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn value(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `smallest_range` is never used
[INFO] [stdout]   --> src/problem/p632_smallest_range_covering_elements_from_k_lists.rs:53:12
[INFO] [stdout]    |
[INFO] [stdout] 52 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 53 |     pub fn smallest_range(nums: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3206_alternating_groups_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `number_of_alternating_groups` is never used
[INFO] [stdout]  --> src/problem/p3206_alternating_groups_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn number_of_alternating_groups(colors: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3208_alternating_groups_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `number_of_alternating_groups` is never used
[INFO] [stdout]  --> src/problem/p3208_alternating_groups_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn number_of_alternating_groups(colors: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3250_find_the_count_of_monotonic_pairs_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MOD` is never used
[INFO] [stdout]  --> src/problem/p3250_find_the_count_of_monotonic_pairs_i.rs:8:7
[INFO] [stdout]   |
[INFO] [stdout] 8 | const MOD: i32 = 1_000_000_007;
[INFO] [stdout]   |       ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_of_pairs` is never used
[INFO] [stdout]   --> src/problem/p3250_find_the_count_of_monotonic_pairs_i.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn count_of_pairs(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3232_find_if_digit_game_can_be_won.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_alice_win` is never used
[INFO] [stdout]  --> src/problem/p3232_find_if_digit_game_can_be_won.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn can_alice_win(nums: Vec<i32>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p51_n_queens.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `solve_n_queens` and `dfs` are never used
[INFO] [stdout]   --> src/problem/p51_n_queens.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn solve_n_queens(n: i32) -> Vec<Vec<String>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     fn dfs(y: usize, n: usize, chessboard: &mut Vec<usize>, result: &mut Vec<Vec<String>>) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3274_check_if_two_chessboard_squares_have_the_same_color.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `check_two_chessboards` and `get_color` are never used
[INFO] [stdout]   --> src/problem/p3274_check_if_two_chessboard_squares_have_the_same_color.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn check_two_chessboards(coordinate1: String, coordinate2: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn get_color(x: char, y: char) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2056_number_of_valid_move_combinations_on_chessboard.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `DIRECTIONS` is never used
[INFO] [stdout]  --> src/problem/p2056_number_of_valid_move_combinations_on_chessboard.rs:9:7
[INFO] [stdout]   |
[INFO] [stdout] 9 | const DIRECTIONS: [(i32, i32); 8] = [
[INFO] [stdout]   |       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `SIZE` is never used
[INFO] [stdout]   --> src/problem/p2056_number_of_valid_move_combinations_on_chessboard.rs:20:7
[INFO] [stdout]    |
[INFO] [stdout] 20 | const SIZE: i32 = 8;
[INFO] [stdout]    |       ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Movement` is never constructed
[INFO] [stdout]   --> src/problem/p2056_number_of_valid_move_combinations_on_chessboard.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct Movement {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `generate_movements`, and `is_valid` are never used
[INFO] [stdout]   --> src/problem/p2056_number_of_valid_move_combinations_on_chessboard.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl Movement {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 32 |     fn new(x: i32, y: i32, dx: i32, dy: i32, step: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn generate_movements(x0: i32, y0: i32, directions: &[(i32, i32)]) -> Vec<Self> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     fn is_valid(&self, other: &Self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `count_combinations`, `dfs`, and `generate_pieces_directions` are never used
[INFO] [stdout]    --> src/problem/p2056_number_of_valid_move_combinations_on_chessboard.rs:80:12
[INFO] [stdout]     |
[INFO] [stdout]  79 | impl Solution {
[INFO] [stdout]     | ------------- associated functions in this implementation
[INFO] [stdout]  80 |     pub fn count_combinations(pieces: Vec<String>, positions: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 103 |     fn dfs(
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 124 |     fn generate_pieces_directions() -> HashMap<&'static str, &'static [(i32, i32)]> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3001_minimum_moves_to_capture_the_queen.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `min_moves_to_capture_the_queen` and `check_on_path` are never used
[INFO] [stdout]   --> src/problem/p3001_minimum_moves_to_capture_the_queen.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn min_moves_to_capture_the_queen(a: i32, b: i32, c: i32, d: i32, e: i32, f: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn check_on_path(a: i32, b: i32, c: i32, d: i32, e: i32, f: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p999_available_captures_for_rook.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `num_rook_captures` is never used
[INFO] [stdout]  --> src/problem/p999_available_captures_for_rook.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn num_rook_captures(board: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p688_knight_probability_in_chessboard.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `DIRECTIONS` is never used
[INFO] [stdout]  --> src/problem/p688_knight_probability_in_chessboard.rs:8:7
[INFO] [stdout]   |
[INFO] [stdout] 8 | const DIRECTIONS: [(i32, i32); 8] = [
[INFO] [stdout]   |       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `knight_probability` is never used
[INFO] [stdout]   --> src/problem/p688_knight_probability_in_chessboard.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 20 |     pub fn knight_probability(n: i32, k: i32, row: i32, column: i32) -> f64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p782_transform_to_chessboard.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `moves_to_chessboard` and `get_moves` are never used
[INFO] [stdout]   --> src/problem/p782_transform_to_chessboard.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn moves_to_chessboard(board: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56 |     fn get_moves(mask: i32, count: i32, n: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1812_determine_color_of_a_chessboard_square.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `square_is_white` is never used
[INFO] [stdout]  --> src/problem/p1812_determine_color_of_a_chessboard_square.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn square_is_white(coordinates: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p935_knight_dialer.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MOD` is never used
[INFO] [stdout]  --> src/problem/p935_knight_dialer.rs:8:7
[INFO] [stdout]   |
[INFO] [stdout] 8 | const MOD: i32 = 1_000_000_007;
[INFO] [stdout]   |       ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `knight_dialer` is never used
[INFO] [stdout]   --> src/problem/p935_knight_dialer.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn knight_dialer(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2717_semi_ordered_permutation.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `semi_ordered_permutation` is never used
[INFO] [stdout]  --> src/problem/p2717_semi_ordered_permutation.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn semi_ordered_permutation(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2931_maximum_spending_after_buying_items.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Item` is never constructed
[INFO] [stdout]   --> src/problem/p2931_maximum_spending_after_buying_items.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | struct Item {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_spending` is never used
[INFO] [stdout]   --> src/problem/p2931_maximum_spending_after_buying_items.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 30 |     pub fn max_spending(values: Vec<Vec<i32>>) -> i64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3264_final_array_state_after_k_multiplication_operations_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `get_final_state` is never used
[INFO] [stdout]  --> src/problem/p3264_final_array_state_after_k_multiplication_operations_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn get_final_state(nums: Vec<i32>, k: i32, multiplier: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3266_final_array_state_after_k_multiplication_operations_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Number` is never constructed
[INFO] [stdout]   --> src/problem/p3266_final_array_state_after_k_multiplication_operations_ii.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | struct Number {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MOD` is never used
[INFO] [stdout]   --> src/problem/p3266_final_array_state_after_k_multiplication_operations_ii.rs:31:7
[INFO] [stdout]    |
[INFO] [stdout] 31 | const MOD: i64 = 1_000_000_007;
[INFO] [stdout]    |       ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `get_final_state` and `quick_mulitplx` are never used
[INFO] [stdout]   --> src/problem/p3266_final_array_state_after_k_multiplication_operations_ii.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 34 |     pub fn get_final_state(nums: Vec<i32>, k: i32, multiplier: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 83 |     fn quick_mulitplx(mut x: i64, mut y: i64) -> i64 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1338_reduce_array_size_to_the_half.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_set_size` is never used
[INFO] [stdout]   --> src/problem/p1338_reduce_array_size_to_the_half.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn min_set_size(arr: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1847_closest_room.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `EventTypeKind` is never used
[INFO] [stdout]   --> src/problem/p1847_closest_room.rs:11:6
[INFO] [stdout]    |
[INFO] [stdout] 11 | enum EventTypeKind {
[INFO] [stdout]    |      ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Event` is never constructed
[INFO] [stdout]   --> src/problem/p1847_closest_room.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | struct Event {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `new_room` and `new_query` are never used
[INFO] [stdout]   --> src/problem/p1847_closest_room.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Event {
[INFO] [stdout]    | ---------- associated functions in this implementation
[INFO] [stdout] 24 |     fn new_room(i: usize, room: &Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     fn new_query(i: usize, query: &Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `closest_room` is never used
[INFO] [stdout]   --> src/problem/p1847_closest_room.rs:67:12
[INFO] [stdout]    |
[INFO] [stdout] 66 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 67 |     pub fn closest_room(rooms: Vec<Vec<i32>>, queries: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3291_minimum_number_of_valid_strings_to_form_target_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_valid_strings` is never used
[INFO] [stdout]  --> src/problem/p3291_minimum_number_of_valid_strings_to_form_target_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_valid_strings(words: Vec<String>, target: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3292_minimum_number_of_valid_strings_to_form_target_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_valid_strings` is never used
[INFO] [stdout]  --> src/problem/p3292_minimum_number_of_valid_strings_to_form_target_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_valid_strings(words: Vec<String>, target: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3285_find_indices_of_stable_mountains.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `stable_mountains` is never used
[INFO] [stdout]  --> src/problem/p3285_find_indices_of_stable_mountains.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn stable_mountains(height: Vec<i32>, threshold: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3138_minimum_length_of_anagram_concatenation.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_anagram_length` is never used
[INFO] [stdout]   --> src/problem/p3138_minimum_length_of_anagram_concatenation.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn min_anagram_length(s: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2545_sort_the_students_by_their_kth_score.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sort_the_students` is never used
[INFO] [stdout]  --> src/problem/p2545_sort_the_students_by_their_kth_score.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn sort_the_students(score: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1387_sort_integers_by_the_power_value.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `get_kth` and `search` are never used
[INFO] [stdout]   --> src/problem/p1387_sort_integers_by_the_power_value.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 10 |     pub fn get_kth(lo: i32, hi: i32, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn search(x: i32, memo: &mut HashMap<i32, i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p855_exam_room.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Interval` is never constructed
[INFO] [stdout]   --> src/problem/p855_exam_room.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | struct Interval {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `distance` are never used
[INFO] [stdout]   --> src/problem/p855_exam_room.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Interval {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 17 |     fn new(start: i32, end: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn distance(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ExamRoom` is never constructed
[INFO] [stdout]   --> src/problem/p855_exam_room.rs:44:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | struct ExamRoom {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `seat`, and `leave` are never used
[INFO] [stdout]    --> src/problem/p855_exam_room.rs:55:8
[INFO] [stdout]     |
[INFO] [stdout]  54 | impl ExamRoom {
[INFO] [stdout]     | ------------- associated items in this implementation
[INFO] [stdout]  55 |     fn new(n: i32) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout]  63 |     fn seat(&mut self) -> i32 {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 116 |     fn leave(&mut self, p: i32) {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1705_maximum_number_of_eaten_apples.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `eaten_apples` is never used
[INFO] [stdout]   --> src/problem/p1705_maximum_number_of_eaten_apples.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn eaten_apples(apples: Vec<i32>, days: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3218_minimum_cost_for_cutting_cake_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_cost` is never used
[INFO] [stdout]  --> src/problem/p3218_minimum_cost_for_cutting_cake_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn minimum_cost(
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3083_existence_of_a_substring_in_a_string_and_its_reverse.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_substring_present` is never used
[INFO] [stdout]   --> src/problem/p3083_existence_of_a_substring_in_a_string_and_its_reverse.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn is_substring_present(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3159_find_occurrences_of_an_element_in_an_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `occurrences_of_element` is never used
[INFO] [stdout]  --> src/problem/p3159_find_occurrences_of_an_element_in_an_array.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn occurrences_of_element(nums: Vec<i32>, queries: Vec<i32>, x: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3046_split_the_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_possible_to_split` is never used
[INFO] [stdout]   --> src/problem/p3046_split_the_array.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn is_possible_to_split(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1366_rank_teams_by_votes.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rank_teams` is never used
[INFO] [stdout]   --> src/problem/p1366_rank_teams_by_votes.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn rank_teams(votes: Vec<String>) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1367_linked_list_in_binary_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_sub_path` and `search` are never used
[INFO] [stdout]   --> src/problem/p1367_linked_list_in_binary_tree.rs:49:12
[INFO] [stdout]    |
[INFO] [stdout] 48 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 49 |     pub fn is_sub_path(head: Option<Box<ListNode>>, root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     fn search(node: &Box<ListNode>, tree_node: &Rc<RefCell<TreeNode>>) -> bool {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3219_minimum_cost_for_cutting_cake_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_cost` is never used
[INFO] [stdout]  --> src/problem/p3219_minimum_cost_for_cutting_cake_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn minimum_cost(m: i32, n: i32, horizontal_cut: Vec<i32>, vertical_cut: Vec<i32>) -> i64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3280_convert_date_to_binary.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `convert_date_to_binary` is never used
[INFO] [stdout]   --> src/problem/p3280_convert_date_to_binary.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn convert_date_to_binary(date: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p729_my_calendar_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyCalendar` is never constructed
[INFO] [stdout]  --> src/problem/p729_my_calendar_i.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct MyCalendar {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `book` are never used
[INFO] [stdout]   --> src/problem/p729_my_calendar_i.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl MyCalendar {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 19 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn book(&mut self, start_time: i32, end_time: i32) -> bool {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p731_my_calendar_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyCalendarTwo` is never constructed
[INFO] [stdout]  --> src/problem/p731_my_calendar_ii.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct MyCalendarTwo {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `book` are never used
[INFO] [stdout]   --> src/problem/p731_my_calendar_ii.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl MyCalendarTwo {
[INFO] [stdout]    | ------------------ associated items in this implementation
[INFO] [stdout] 18 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     fn book(&mut self, start_time: i32, end_time: i32) -> bool {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p732_my_calendar_iii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyCalendarThree` is never constructed
[INFO] [stdout]  --> src/problem/p732_my_calendar_iii.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct MyCalendarThree {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `book` are never used
[INFO] [stdout]   --> src/problem/p732_my_calendar_iii.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl MyCalendarThree {
[INFO] [stdout]    | -------------------- associated items in this implementation
[INFO] [stdout] 18 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     fn book(&mut self, start_time: i32, end_time: i32) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2241_design_an_atm_machine.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ATM` is never constructed
[INFO] [stdout]  --> src/problem/p2241_design_an_atm_machine.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct ATM {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `deposit`, and `withdraw` are never used
[INFO] [stdout]   --> src/problem/p2241_design_an_atm_machine.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl ATM {
[INFO] [stdout]    | -------- associated items in this implementation
[INFO] [stdout] 18 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn deposit(&mut self, banknotes_count: Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn withdraw(&mut self, mut amount: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2274_maximum_consecutive_floors_without_special_floors.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_consecutive` is never used
[INFO] [stdout]  --> src/problem/p2274_maximum_consecutive_floors_without_special_floors.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_consecutive(bottom: i32, top: i32, mut special: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3019_number_of_changing_keys.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_key_changes` is never used
[INFO] [stdout]  --> src/problem/p3019_number_of_changing_keys.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn count_key_changes(s: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2264_largest_3_same_digit_number_in_string.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `NUMBERS` is never used
[INFO] [stdout]  --> src/problem/p2264_largest_3_same_digit_number_in_string.rs:8:7
[INFO] [stdout]   |
[INFO] [stdout] 8 | const NUMBERS: [&str; 10] = [
[INFO] [stdout]   |       ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `largest_good_integer` is never used
[INFO] [stdout]   --> src/problem/p2264_largest_3_same_digit_number_in_string.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn largest_good_integer(num: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3297_count_substrings_that_can_be_rearranged_to_contain_a_string_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `valid_substring_count` is never used
[INFO] [stdout]   --> src/problem/p3297_count_substrings_that_can_be_rearranged_to_contain_a_string_i.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn valid_substring_count(word1: String, word2: String) -> i64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3298_count_substrings_that_can_be_rearranged_to_contain_a_string_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `valid_substring_count` is never used
[INFO] [stdout]   --> src/problem/p3298_count_substrings_that_can_be_rearranged_to_contain_a_string_ii.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn valid_substring_count(word1: String, word2: String) -> i64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3270_find_the_key_of_the_numbers.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `generate_key` is never used
[INFO] [stdout]  --> src/problem/p3270_find_the_key_of_the_numbers.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn generate_key(num1: i32, num2: i32, num3: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2275_largest_combination_with_bitwise_and_greater_than_zero.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `largest_combination` is never used
[INFO] [stdout]  --> src/problem/p2275_largest_combination_with_bitwise_and_greater_than_zero.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn largest_combination(candidates: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2270_number_of_ways_to_split_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `ways_to_split_array` is never used
[INFO] [stdout]  --> src/problem/p2270_number_of_ways_to_split_array.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn ways_to_split_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3065_minimum_operations_to_exceed_threshold_value_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_operations` is never used
[INFO] [stdout]  --> src/problem/p3065_minimum_operations_to_exceed_threshold_value_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_operations(mut nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3066_minimum_operations_to_exceed_threshold_value_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_operations` is never used
[INFO] [stdout]   --> src/problem/p3066_minimum_operations_to_exceed_threshold_value_ii.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn min_operations(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3095_shortest_subarray_with_or_at_least_k_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_subarray_length` is never used
[INFO] [stdout]  --> src/problem/p3095_shortest_subarray_with_or_at_least_k_i.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn minimum_subarray_length(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3097_shortest_subarray_with_or_at_least_k_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_subarray_length` is never used
[INFO] [stdout]  --> src/problem/p3097_shortest_subarray_with_or_at_least_k_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn minimum_subarray_length(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3287_find_the_maximum_sequence_value_of_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_value` is never used
[INFO] [stdout]   --> src/problem/p3287_find_the_maximum_sequence_value_of_array.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn max_value(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2266_count_number_of_texts.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MODE` is never used
[INFO] [stdout]  --> src/problem/p2266_count_number_of_texts.rs:9:7
[INFO] [stdout]   |
[INFO] [stdout] 9 | const MODE: i64 = 1_000_000_007;
[INFO] [stdout]   |       ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_texts` is never used
[INFO] [stdout]   --> src/problem/p2266_count_number_of_texts.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn count_texts(pressed_keys: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2239_find_closest_number_to_zero.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_closest_number` is never used
[INFO] [stdout]  --> src/problem/p2239_find_closest_number_to_zero.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn find_closest_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2218_maximum_value_of_k_coins_from_piles.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_value_of_coins` is never used
[INFO] [stdout]  --> src/problem/p2218_maximum_value_of_k_coins_from_piles.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_value_of_coins(piles: Vec<Vec<i32>>, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1561_maximum_number_of_coins_you_can_get.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_coins` is never used
[INFO] [stdout]  --> src/problem/p1561_maximum_number_of_coins_you_can_get.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_coins(mut piles: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2920_maximum_points_after_collecting_coins_from_all_nodes.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Search` is never constructed
[INFO] [stdout]  --> src/problem/p2920_maximum_points_after_collecting_coins_from_all_nodes.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Search {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `search` are never used
[INFO] [stdout]   --> src/problem/p2920_maximum_points_after_collecting_coins_from_all_nodes.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Search {
[INFO] [stdout]    | ----------- associated items in this implementation
[INFO] [stdout] 16 |     fn new(children: Vec<Vec<usize>>, n: usize, coins: Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn search(&self, node: usize, parent: usize, f: usize, k: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `maximum_points` is never used
[INFO] [stdout]   --> src/problem/p2920_maximum_points_after_collecting_coins_from_all_nodes.rs:50:12
[INFO] [stdout]    |
[INFO] [stdout] 49 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 50 |     pub fn maximum_points(edges: Vec<Vec<i32>>, coins: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2944_minimum_number_of_coins_for_fruits.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_coins` is never used
[INFO] [stdout]   --> src/problem/p2944_minimum_number_of_coins_for_fruits.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn minimum_coins(prices: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2412_minimum_money_required_before_transactions.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_money` is never used
[INFO] [stdout]  --> src/problem/p2412_minimum_money_required_before_transactions.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn minimum_money(transactions: Vec<Vec<i32>>) -> i64 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p40_combination_sum_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum2` and `dfs` are never used
[INFO] [stdout]   --> src/problem/p40_combination_sum_ii.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 11 |     pub fn combination_sum2(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p119_pascals_triangle_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `get_row` is never used
[INFO] [stdout]   --> src/problem/p119_pascals_triangle_ii.rs:16:12
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |     pub fn get_row(row_index: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p350_intersection_of_two_arrays_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `intersect` is never used
[INFO] [stdout]   --> src/problem/p350_intersection_of_two_arrays_ii.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn intersect(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p541_reverse_string_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_str` is never used
[INFO] [stdout]  --> src/problem/p541_reverse_string_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn reverse_str(s: String, k: i32) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p81_search_in_rotated_sorted_array_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `search`, `get_first_middle`, and `get_last_middle` are never used
[INFO] [stdout]   --> src/problem/p81_search_in_rotated_sorted_array_ii.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn search(nums: Vec<i32>, target: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     fn get_first_middle(nums: &Vec<i32>, mut middle: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 62 |     fn get_last_middle(nums: &Vec<i32>, mut middle: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p598_range_addition_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_count` is never used
[INFO] [stdout]  --> src/problem/p598_range_addition_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn max_count(mut m: i32, mut n: i32, ops: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p680_valid_palindrome_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `valid_palindrome` and `check_palindrome` are never used
[INFO] [stdout]   --> src/problem/p680_valid_palindrome_ii.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn valid_palindrome(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn check_palindrome(s: &[char]) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p922_sort_array_by_parity_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sort_array_by_parity_ii` is never used
[INFO] [stdout]  --> src/problem/p922_sort_array_by_parity_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn sort_array_by_parity_ii(mut nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p90_subsets_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `subsets_with_dup` and `search` are never used
[INFO] [stdout]   --> src/problem/p90_subsets_ii.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn subsets_with_dup(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     pub fn search(
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p47_permutations_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `permute_unique` and `search` are never used
[INFO] [stdout]   --> src/problem/p47_permutations_ii.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn permute_unique(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn search(
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p59_spiral_matrix_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `DIRECTIONS` is never used
[INFO] [stdout]  --> src/problem/p59_spiral_matrix_ii.rs:8:7
[INFO] [stdout]   |
[INFO] [stdout] 8 | const DIRECTIONS: [(i32, i32); 4] = [(0, 1), (1, 0), (0, -1), (-1, 0)];
[INFO] [stdout]   |       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `generate_matrix` is never used
[INFO] [stdout]   --> src/problem/p59_spiral_matrix_ii.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn generate_matrix(n: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p913_cat_and_mouse.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MOUSE_TURN` is never used
[INFO] [stdout]  --> src/problem/p913_cat_and_mouse.rs:9:7
[INFO] [stdout]   |
[INFO] [stdout] 9 | const MOUSE_TURN: usize = 0;
[INFO] [stdout]   |       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `CAT_TURN` is never used
[INFO] [stdout]   --> src/problem/p913_cat_and_mouse.rs:10:7
[INFO] [stdout]    |
[INFO] [stdout] 10 | const CAT_TURN: usize = 1;
[INFO] [stdout]    |       ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `Status` is never used
[INFO] [stdout]   --> src/problem/p913_cat_and_mouse.rs:13:6
[INFO] [stdout]    |
[INFO] [stdout] 13 | enum Status {
[INFO] [stdout]    |      ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Gamer` is never constructed
[INFO] [stdout]   --> src/problem/p913_cat_and_mouse.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Gamer {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `search`, and `get_previous_states` are never used
[INFO] [stdout]    --> src/problem/p913_cat_and_mouse.rs:29:8
[INFO] [stdout]     |
[INFO] [stdout]  28 | impl Gamer {
[INFO] [stdout]     | ---------- associated items in this implementation
[INFO] [stdout]  29 |     fn new(graph: Vec<Vec<i32>>) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout]  61 |     fn search(&mut self) -> i32 {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 118 |     fn get_previous_states(
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `cat_mouse_game` is never used
[INFO] [stdout]    --> src/problem/p913_cat_and_mouse.rs:151:12
[INFO] [stdout]     |
[INFO] [stdout] 150 | impl Solution {
[INFO] [stdout]     | ------------- associated function in this implementation
[INFO] [stdout] 151 |     pub fn cat_mouse_game(graph: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1728_cat_and_mouse_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MOUSE_TURN` is never used
[INFO] [stdout]  --> src/problem/p1728_cat_and_mouse_ii.rs:9:7
[INFO] [stdout]   |
[INFO] [stdout] 9 | const MOUSE_TURN: usize = 0;
[INFO] [stdout]   |       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `CAT_TURN` is never used
[INFO] [stdout]   --> src/problem/p1728_cat_and_mouse_ii.rs:10:7
[INFO] [stdout]    |
[INFO] [stdout] 10 | const CAT_TURN: usize = 1;
[INFO] [stdout]    |       ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MAX_ROUND` is never used
[INFO] [stdout]   --> src/problem/p1728_cat_and_mouse_ii.rs:11:7
[INFO] [stdout]    |
[INFO] [stdout] 11 | const MAX_ROUND: i32 = 1000;
[INFO] [stdout]    |       ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `DIRECTIONS` is never used
[INFO] [stdout]   --> src/problem/p1728_cat_and_mouse_ii.rs:12:7
[INFO] [stdout]    |
[INFO] [stdout] 12 | const DIRECTIONS: [(i32, i32); 4] = [(-1, 0), (1, 0), (0, -1), (0, 1)];
[INFO] [stdout]    |       ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `Status` is never used
[INFO] [stdout]   --> src/problem/p1728_cat_and_mouse_ii.rs:15:6
[INFO] [stdout]    |
[INFO] [stdout] 15 | enum Status {
[INFO] [stdout]    |      ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Result` is never constructed
[INFO] [stdout]   --> src/problem/p1728_cat_and_mouse_ii.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Result {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `new_with_status`, and `next` are never used
[INFO] [stdout]   --> src/problem/p1728_cat_and_mouse_ii.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl Result {
[INFO] [stdout]    | ----------- associated items in this implementation
[INFO] [stdout] 28 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn new_with_status(status: Status) -> Self {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn next(&self) -> Self {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Gamer` is never constructed
[INFO] [stdout]   --> src/problem/p1728_cat_and_mouse_ii.rs:47:8
[INFO] [stdout]    |
[INFO] [stdout] 47 | struct Gamer {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `get_state`, `search`, and `get_previous_states` are never used
[INFO] [stdout]    --> src/problem/p1728_cat_and_mouse_ii.rs:60:8
[INFO] [stdout]     |
[INFO] [stdout]  58 | impl Gamer {
[INFO] [stdout]     | ---------- associated items in this implementation
[INFO] [stdout]  59 |     // (Self, start_mouse_pos, start_cat_pos)
[INFO] [stdout]  60 |     fn new(
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 158 |     fn get_state(&self, (x, y): (usize, usize)) -> usize {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 162 |     fn search(&mut self, start_mouse: (usize, usize), start_cat: (usize, usize)) -> bool {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 271 |     fn get_previous_states(
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_mouse_win` is never used
[INFO] [stdout]    --> src/problem/p1728_cat_and_mouse_ii.rs:341:12
[INFO] [stdout]     |
[INFO] [stdout] 340 | impl Solution {
[INFO] [stdout]     | ------------- associated function in this implementation
[INFO] [stdout] 341 |     pub fn can_mouse_win(grid: Vec<String>, cat_jump: i32, mouse_jump: i32) -> bool {
[INFO] [stdout]     |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1760_minimum_limit_of_balls_in_a_bag.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_size` is never used
[INFO] [stdout]  --> src/problem/p1760_minimum_limit_of_balls_in_a_bag.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn minimum_size(nums: Vec<i32>, max_operations: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1742_maximum_number_of_balls_in_a_box.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_balls` is never used
[INFO] [stdout]  --> src/problem/p1742_maximum_number_of_balls_in_a_box.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn count_balls(low_limit: i32, high_limit: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1552_magnetic_force_between_two_balls.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `max_distance` and `check` are never used
[INFO] [stdout]   --> src/problem/p1552_magnetic_force_between_two_balls.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn max_distance(mut position: Vec<i32>, m: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn check(position: &Vec<i32>, m: i32, dis: i32) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1706_where_will_the_ball_fall.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `LEFT` is never used
[INFO] [stdout]  --> src/problem/p1706_where_will_the_ball_fall.rs:9:7
[INFO] [stdout]   |
[INFO] [stdout] 9 | const LEFT: i32 = -1;
[INFO] [stdout]   |       ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `RIGHT` is never used
[INFO] [stdout]   --> src/problem/p1706_where_will_the_ball_fall.rs:10:7
[INFO] [stdout]    |
[INFO] [stdout] 10 | const RIGHT: i32 = 1;
[INFO] [stdout]    |       ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Grid` is never constructed
[INFO] [stdout]   --> src/problem/p1706_where_will_the_ball_fall.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | struct Grid {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `search` are never used
[INFO] [stdout]   --> src/problem/p1706_where_will_the_ball_fall.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | impl Grid {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 20 |     fn new(grid: Vec<Vec<i32>>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn search(&mut self, x: usize, y: usize) -> Option<usize> {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_ball` is never used
[INFO] [stdout]   --> src/problem/p1706_where_will_the_ball_fall.rs:79:12
[INFO] [stdout]    |
[INFO] [stdout] 78 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 79 |     pub fn find_ball(grid: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1299_replace_elements_with_greatest_element_on_right_side.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `replace_elements` is never used
[INFO] [stdout]   --> src/problem/p1299_replace_elements_with_greatest_element_on_right_side.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn replace_elements(arr: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2080_range_frequency_queries.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `RangeFreqQuery` is never constructed
[INFO] [stdout]  --> src/problem/p2080_range_frequency_queries.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct RangeFreqQuery {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `query` are never used
[INFO] [stdout]   --> src/problem/p2080_range_frequency_queries.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl RangeFreqQuery {
[INFO] [stdout]    | ------------------- associated items in this implementation
[INFO] [stdout] 18 |     fn new(arr: Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     fn query(&self, left: i32, right: i32, value: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p624_maximum_distance_in_arrays.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_distance` is never used
[INFO] [stdout]   --> src/problem/p624_maximum_distance_in_arrays.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn max_distance(arrays: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2595_number_of_even_and_odd_bits.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `even_odd_bit` is never used
[INFO] [stdout]  --> src/problem/p2595_number_of_even_and_odd_bits.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn even_odd_bit(mut n: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2209_minimum_white_tiles_after_covering_with_carpets.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `minimum_white_tiles` is never used
[INFO] [stdout]   --> src/problem/p2209_minimum_white_tiles_after_covering_with_carpets.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     pub fn minimum_white_tiles(floor: String, num_carpets: i32, carpet_len: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2506_count_pairs_of_similar_strings.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `similar_pairs` is never used
[INFO] [stdout]   --> src/problem/p2506_count_pairs_of_similar_strings.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn similar_pairs(words: Vec<String>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1206_design_skiplist.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `SkiplistNode` is never constructed
[INFO] [stdout]   --> src/problem/p1206_design_skiplist.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | struct SkiplistNode {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `NodeCell` is never used
[INFO] [stdout]   --> src/problem/p1206_design_skiplist.rs:17:6
[INFO] [stdout]    |
[INFO] [stdout] 17 | type NodeCell = Rc<RefCell<SkiplistNode>>;
[INFO] [stdout]    |      ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Skiplist` is never constructed
[INFO] [stdout]   --> src/problem/p1206_design_skiplist.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | struct Skiplist {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `create_node`, `new`, `search`, `add`, and `erase` are never used
[INFO] [stdout]    --> src/problem/p1206_design_skiplist.rs:29:8
[INFO] [stdout]     |
[INFO] [stdout]  28 | impl Skiplist {
[INFO] [stdout]     | ------------- associated items in this implementation
[INFO] [stdout]  29 |     fn create_node(value: i32) -> NodeCell {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  37 |     fn new() -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout]  44 |     fn search(&self, target: i32) -> bool {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  69 |     fn add(&mut self, num: i32) {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 119 |     fn erase(&self, num: i32) -> bool {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1656_design_an_ordered_stream.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `OrderedStream` is never constructed
[INFO] [stdout]  --> src/problem/p1656_design_an_ordered_stream.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct OrderedStream {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `insert` are never used
[INFO] [stdout]   --> src/problem/p1656_design_an_ordered_stream.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl OrderedStream {
[INFO] [stdout]    | ------------------ associated items in this implementation
[INFO] [stdout] 18 |     fn new(n: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn insert(&mut self, id_key: i32, value: String) -> Vec<String> {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2502_design_memory_allocator.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Allocator` is never constructed
[INFO] [stdout]  --> src/problem/p2502_design_memory_allocator.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | struct Allocator {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `allocate`, and `free_memory` are never used
[INFO] [stdout]   --> src/problem/p2502_design_memory_allocator.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | impl Allocator {
[INFO] [stdout]    | -------------- associated items in this implementation
[INFO] [stdout] 19 |     fn new(n: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn allocate(&mut self, size: i32, m_id: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     fn free_memory(&mut self, m_id: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1472_design_browser_history.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BrowserHistory` is never constructed
[INFO] [stdout]  --> src/problem/p1472_design_browser_history.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct BrowserHistory {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `visit`, `back`, and `forward` are never used
[INFO] [stdout]   --> src/problem/p1472_design_browser_history.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl BrowserHistory {
[INFO] [stdout]    | ------------------- associated items in this implementation
[INFO] [stdout] 18 |     fn new(homepage: String) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn visit(&mut self, url: String) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn back(&mut self, steps: i32) -> String {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     fn forward(&mut self, steps: i32) -> String {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2353_design_a_food_rating_system.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Food` is never constructed
[INFO] [stdout]   --> src/problem/p2353_design_a_food_rating_system.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | struct Food {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `update_rating` are never used
[INFO] [stdout]   --> src/problem/p2353_design_a_food_rating_system.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | impl Food {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 18 |     fn new(name: String, cuisine: String, rating: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn update_rating(&self, new_rating: i32) -> Self {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `FoodRatings` is never constructed
[INFO] [stdout]   --> src/problem/p2353_design_a_food_rating_system.rs:50:8
[INFO] [stdout]    |
[INFO] [stdout] 50 | struct FoodRatings {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `change_rating`, and `highest_rated` are never used
[INFO] [stdout]   --> src/problem/p2353_design_a_food_rating_system.rs:60:8
[INFO] [stdout]    |
[INFO] [stdout] 59 | impl FoodRatings {
[INFO] [stdout]    | ---------------- associated items in this implementation
[INFO] [stdout] 60 |     fn new(foods: Vec<String>, cuisines: Vec<String>, ratings: Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 82 |     fn change_rating(&mut self, food: String, new_rating: i32) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 90 |     fn highest_rated(&mut self, cuisine: String) -> String {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p131_palindrome_partitioning.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `partition` and `dfs` are never used
[INFO] [stdout]   --> src/problem/p131_palindrome_partitioning.rs:9:12
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  9 |     pub fn partition(s: String) -> Vec<Vec<String>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn dfs(
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p132_palindrome_partitioning_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_cut` is never used
[INFO] [stdout]  --> src/problem/p132_palindrome_partitioning_ii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn min_cut(s: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1278_palindrome_partitioning_iii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `palindrome_partition` is never used
[INFO] [stdout]  --> src/problem/p1278_palindrome_partitioning_iii.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn palindrome_partition(s: String, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1745_palindrome_partitioning_iv.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `check_partitioning` is never used
[INFO] [stdout]  --> src/problem/p1745_palindrome_partitioning_iv.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn check_partitioning(s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p1328_break_a_palindrome.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `break_palindrome` is never used
[INFO] [stdout]  --> src/problem/p1328_break_a_palindrome.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn break_palindrome(palindrome: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2588_count_the_number_of_beautiful_subarrays.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `beautiful_subarrays` is never used
[INFO] [stdout]   --> src/problem/p2588_count_the_number_of_beautiful_subarrays.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn beautiful_subarrays(nums: Vec<i32>) -> i64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2597_the_number_of_beautiful_subsets.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `beautiful_subsets` is never used
[INFO] [stdout]   --> src/problem/p2597_the_number_of_beautiful_subsets.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn beautiful_subsets(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2234_maximum_total_beauty_of_the_gardens.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `maximum_beauty` is never used
[INFO] [stdout]  --> src/problem/p2234_maximum_total_beauty_of_the_gardens.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn maximum_beauty(
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2070_most_beautiful_item_for_each_query.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `maximum_beauty` is never used
[INFO] [stdout]   --> src/problem/p2070_most_beautiful_item_for_each_query.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn maximum_beauty(items: Vec<Vec<i32>>, queries: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2269_find_the_k_beauty_of_a_number.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `divisor_substrings` is never used
[INFO] [stdout]  --> src/problem/p2269_find_the_k_beauty_of_a_number.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn divisor_substrings(num: i32, k: i32) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2012_sum_of_beauty_in_the_array.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sum_of_beauties` is never used
[INFO] [stdout]  --> src/problem/p2012_sum_of_beauty_in_the_array.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn sum_of_beauties(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3305_count_of_substrings_containing_every_vowel_and_k_consonants_i.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_of_substrings` is never used
[INFO] [stdout]   --> src/problem/p3305_count_of_substrings_containing_every_vowel_and_k_consonants_i.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn count_of_substrings(word: String, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3306_count_of_substrings_containing_every_vowel_and_k_consonants_ii.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_of_substrings` is never used
[INFO] [stdout]   --> src/problem/p3306_count_of_substrings_containing_every_vowel_and_k_consonants_ii.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     pub fn count_of_substrings(word: String, k: i32) -> i64 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3340_check_balanced_string.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_balanced` is never used
[INFO] [stdout]  --> src/problem/p3340_check_balanced_string.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn is_balanced(num: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p3110_score_of_a_string.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `score_of_string` is never used
[INFO] [stdout]  --> src/problem/p3110_score_of_a_string.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 9 |     pub fn score_of_string(s: String) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/problem/p2272_substring_with_largest_variance.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct Solution {}
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `largest_variance` is never used
[INFO] [stdout]   --> src/problem/p2272_substring_with_largest_variance.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Solution {
[WARN] too many lines in the log, truncating it
