[INFO] cloning repository https://github.com/tienshaoku/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/tienshaoku/leetcode-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftienshaoku%2Fleetcode-rust", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftienshaoku%2Fleetcode-rust'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] e2bcaf933e8513440bdc1b2f87c77f31abcc0e2f
[INFO] checking tienshaoku/leetcode-rust against try#9228062c11d321a3ea08123f57e47533a3c88b00 for pr-154781
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftienshaoku%2Fleetcode-rust" "/workspace/builds/worker-6-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-6-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/tienshaoku/leetcode-rust
[INFO] finished tweaking git repo https://github.com/tienshaoku/leetcode-rust
[INFO] tweaked toml for git repo https://github.com/tienshaoku/leetcode-rust written to /workspace/builds/worker-6-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/tienshaoku/leetcode-rust on toolchain 9228062c11d321a3ea08123f57e47533a3c88b00
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+9228062c11d321a3ea08123f57e47533a3c88b00" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/tienshaoku/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" "+9228062c11d321a3ea08123f57e47533a3c88b00" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+9228062c11d321a3ea08123f57e47533a3c88b00" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 12903fb4081859b852a17467b6a0f64cee64f983f126869e83683500ca7ff353
[INFO] running `Command { std: "docker" "start" "-a" "12903fb4081859b852a17467b6a0f64cee64f983f126869e83683500ca7ff353", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "12903fb4081859b852a17467b6a0f64cee64f983f126869e83683500ca7ff353", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "12903fb4081859b852a17467b6a0f64cee64f983f126869e83683500ca7ff353", kill_on_drop: false }`
[INFO] [stdout] 12903fb4081859b852a17467b6a0f64cee64f983f126869e83683500ca7ff353
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+9228062c11d321a3ea08123f57e47533a3c88b00" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 19aa8f3e4d325ffbf64e5922bb5a488d9df897cbc52dec77e7d4fc5ae002de2f
[INFO] running `Command { std: "docker" "start" "-a" "19aa8f3e4d325ffbf64e5922bb5a488d9df897cbc52dec77e7d4fc5ae002de2f", kill_on_drop: false }`
[INFO] [stderr]     Checking leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `to_sparse_tree`
[INFO] [stdout]  --> src/easy/balanced_binary_tree.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_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_sparse_tree`
[INFO] [stdout]  --> src/easy/binary_search_preorder_traversal.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_sparse_tree`
[INFO] [stdout]  --> src/easy/diameter_of_binary_tree.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_full_tree`
[INFO] [stdout]  --> src/easy/invert_binary_tree.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_full_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_sparse_tree`
[INFO] [stdout]  --> src/easy/maximum_depth_of_binary_tree.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_sparse_tree`
[INFO] [stdout]  --> src/easy/same_tree.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_sparse_tree`
[INFO] [stdout]  --> src/easy/subtree_of_another_tree.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_sparse_tree`
[INFO] [stdout]  --> src/medium/binary_tree_level_order_traversal.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::vector::normalise`
[INFO] [stdout]  --> src/medium/combination_sum.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::vector::normalise;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::vector::normalise`
[INFO] [stdout]  --> src/medium/combination_sum_two.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::vector::normalise;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_sparse_tree`
[INFO] [stdout]  --> src/medium/construct_bst_from_preorder.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_sparse_tree`
[INFO] [stdout]  --> src/medium/construct_bt_from_inorder_and_postorder.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_sparse_tree`
[INFO] [stdout]  --> src/medium/construct_bt_from_preorder_and_inorder.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_sparse_tree`
[INFO] [stdout]  --> src/medium/good_nodes.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_sparse_tree`
[INFO] [stdout]  --> src/medium/is_valid_bst.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_sparse_tree`
[INFO] [stdout]  --> src/medium/kth_smallest.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_sparse_tree`
[INFO] [stdout]  --> src/medium/lowest_common_ancestor_of_binary_search_tree.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_sparse_tree`
[INFO] [stdout]  --> src/medium/lowest_common_ancestor_of_binary_tree.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `to_sparse_tree`
[INFO] [stdout]  --> src/medium/right_side_view.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::binary_tree::{to_sparse_tree, TreeNode};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `crate::vector::normalise`
[INFO] [stdout]  --> src/medium/subsets_two.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::vector::normalise;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/binary_tree.rs:31:13
[INFO] [stdout]    |
[INFO] [stdout] 31 |         let mut current = queue.remove(0);
[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/binary_tree.rs:58:13
[INFO] [stdout]    |
[INFO] [stdout] 58 |         let mut current = queue.remove(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/easy/longest_palindrome.rs:6:13
[INFO] [stdout]   |
[INFO] [stdout] 6 |         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: value assigned to `tmp` is never read
[INFO] [stdout]   --> src/easy/pascal_triangle_two.rs:6:23
[INFO] [stdout]    |
[INFO] [stdout]  6 |         let mut tmp = 0;
[INFO] [stdout]    |                       ^ this value is reassigned later and never used
[INFO] [stdout] ...
[INFO] [stdout] 12 |             tmp = arr[j];
[INFO] [stdout]    |             ------------ `tmp` is overwritten here before the previous value is read
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/easy/pivot_index.rs:2:9
[INFO] [stdout]   |
[INFO] [stdout] 2 |     let mut right: i32 = nums.iter().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/medium/construct_bst_from_preorder.rs:18:13
[INFO] [stdout]    |
[INFO] [stdout] 18 |         let mut left;
[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/medium/construct_bst_from_preorder.rs:19:13
[INFO] [stdout]    |
[INFO] [stdout] 19 |         let mut right;
[INFO] [stdout]    |             ----^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `right` is never read
[INFO] [stdout]   --> src/medium/search_in_rotated_sorted_array.rs:41:20
[INFO] [stdout]    |
[INFO] [stdout] 41 |     let (mut left, mut right) = (0, 0);
[INFO] [stdout]    |                    ^^^^^^^^^ this value is reassigned later and never used
[INFO] [stdout] ...
[INFO] [stdout] 50 |                 right = min_idx - 1;
[INFO] [stdout]    |                 ------------------- `right` is overwritten here before the previous value is read
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `min` is never read
[INFO] [stdout]   --> src/medium/search_in_rotated_sorted_array.rs:80:17
[INFO] [stdout]    |
[INFO] [stdout] 80 |                 min = nums[left];
[INFO] [stdout]    |                 ^^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_balanced` is never used
[INFO] [stdout]  --> src/easy/balanced_binary_tree.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn is_balanced(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `best_time_to_buy_and_sell_stock` is never used
[INFO] [stdout]  --> src/easy/best_time_to_buy_and_sell_stock.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn best_time_to_buy_and_sell_stock(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search` is never used
[INFO] [stdout]  --> src/easy/binary_search.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn binary_search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search_redundant_comparison` is never used
[INFO] [stdout]   --> src/easy/binary_search.rs:23:4
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn binary_search_redundant_comparison(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search_preorder_traversal` is never used
[INFO] [stdout]  --> src/easy/binary_search_preorder_traversal.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn binary_search_preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `check_if_array_is_sorted_and_rotated` is never used
[INFO] [stdout]  --> src/easy/check_if_array_is_sorted_and_rotated.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn check_if_array_is_sorted_and_rotated(nums: Vec<i32>) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `climb_stairs` is never used
[INFO] [stdout]  --> src/easy/climb_stairs.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `contain_duplicate` is never used
[INFO] [stdout]  --> src/easy/contain_duplicate.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn contain_duplicate(nums: Vec<i32>) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `contain_duplicate_slow` is never used
[INFO] [stdout]   --> src/easy/contain_duplicate.rs:13:4
[INFO] [stdout]    |
[INFO] [stdout] 13 | fn contain_duplicate_slow(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_bits` is never used
[INFO] [stdout]  --> src/easy/count_bits.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn count_bits(n: i32) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_bits_complicated` is never used
[INFO] [stdout]  --> src/easy/count_bits.rs:9:4
[INFO] [stdout]   |
[INFO] [stdout] 9 | fn count_bits_complicated(n: i32) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_partitions` is never used
[INFO] [stdout]  --> src/easy/count_partitions.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn count_partitions(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `diameter_of_binary_tree` is never used
[INFO] [stdout]  --> src/easy/diameter_of_binary_tree.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn diameter_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_numbers_with_even_digits` is never used
[INFO] [stdout]  --> src/easy/find_numbers_with_even_digits.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn find_numbers_with_even_digits(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fizz_buzz` is never used
[INFO] [stdout]  --> src/easy/fizz_buzz.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn fizz_buzz(n: i32) -> Vec<String> {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `guess_number` is never used
[INFO] [stdout]  --> src/easy/guess_number.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn guess_number(n: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `guess` is never used
[INFO] [stdout]   --> src/easy/guess_number.rs:20:4
[INFO] [stdout]    |
[INFO] [stdout] 20 | fn guess(n: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_happy_number` is never used
[INFO] [stdout]  --> src/easy/happy_number.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn is_happy_number(n: i32) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `highest_altitude` is never used
[INFO] [stdout]  --> src/easy/highest_altitude.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn highest_altitude(gain: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `highest_altitude_lengthy_but_saves_memory` is never used
[INFO] [stdout]  --> src/easy/highest_altitude.rs:7:4
[INFO] [stdout]   |
[INFO] [stdout] 7 | fn highest_altitude_lengthy_but_saves_memory(gain: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `invert_tree` is never used
[INFO] [stdout]  --> src/easy/invert_binary_tree.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_subsequence` is never used
[INFO] [stdout]  --> src/easy/is_subsequence.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn is_subsequence(s: String, t: String) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `KthLargest` is never constructed
[INFO] [stdout]  --> src/easy/kth_largest_element_in_stream.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | struct KthLargest {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `add` are never used
[INFO] [stdout]   --> src/easy/kth_largest_element_in_stream.rs:8:8
[INFO] [stdout]    |
[INFO] [stdout]  7 | impl KthLargest {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout]  8 |     fn new(k: i32, nums: Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     fn add(&mut self, val: i32) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_last_word` is never used
[INFO] [stdout]  --> src/easy/length_of_last_word.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn length_of_last_word(s: String) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_palindrome` is never used
[INFO] [stdout]  --> src/easy/longest_palindrome.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn longest_palindrome(s: String) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `majority_element` is never used
[INFO] [stdout]  --> src/easy/majority_element.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_ascending_sum` is never used
[INFO] [stdout]  --> src/easy/max_ascending_sum.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn max_ascending_sum(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_consecutive_ones` is never used
[INFO] [stdout]  --> src/easy/max_consecutive_ones.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn max_consecutive_ones(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_depth` is never used
[INFO] [stdout]  --> src/easy/maximum_depth_of_binary_tree.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `maximum_wealth` is never used
[INFO] [stdout]  --> src/easy/maximum_wealth.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn maximum_wealth(accounts: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sorted_array` is never used
[INFO] [stdout]  --> src/easy/merge_sorted_array.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn merge_sorted_array(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_cost_climbing_stairs` is never used
[INFO] [stdout]  --> src/easy/min_cost_climbing_stairs.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn min_cost_climbing_stairs(cost: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `missing_number` is never used
[INFO] [stdout]  --> src/easy/missing_number.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn missing_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sum_zero` is never used
[INFO] [stdout]  --> src/easy/n_unique_integers_sum_zero.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn sum_zero(n: i32) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `number_of_steps` is never used
[INFO] [stdout]  --> src/easy/number_of_steps.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn number_of_steps(num: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `palindrome_number` is never used
[INFO] [stdout]  --> src/easy/palindrome_number.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn palindrome_number(x: i32) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `palindrome_number_slow` is never used
[INFO] [stdout]   --> src/easy/palindrome_number.rs:16:4
[INFO] [stdout]    |
[INFO] [stdout] 16 | fn palindrome_number_slow(x: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `pascal_triangle` is never used
[INFO] [stdout]  --> src/easy/pascal_triangle.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn pascal_triangle(num_rows: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `pascal_triangle_two` is never used
[INFO] [stdout]  --> src/easy/pascal_triangle_two.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn pascal_triangle_two(row_index: i32) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `pivot_index` is never used
[INFO] [stdout]  --> src/easy/pivot_index.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn pivot_index(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `plus_one` is never used
[INFO] [stdout]  --> src/easy/plus_one.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn plus_one(digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `ransom_note` is never used
[INFO] [stdout]  --> src/easy/ransom_note.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn ransom_note(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `remove_element` is never used
[INFO] [stdout]  --> src/easy/remove_element.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_same_tree` is never used
[INFO] [stdout]  --> src/easy/same_tree.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn is_same_tree(p: Option<Rc<RefCell<TreeNode>>>, q: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_subtree` is never used
[INFO] [stdout]  --> src/easy/subtree_of_another_tree.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn is_subtree(
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]  --> src/easy/two_sum.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `ugly_number` is never used
[INFO] [stdout]  --> src/easy/ugly_number.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn ugly_number(n: i32) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `valid_anagram` is never used
[INFO] [stdout]  --> src/easy/valid_anagram.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn valid_anagram(s: String, t: String) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid_palindrome` is never used
[INFO] [stdout]  --> src/easy/valid_palindrome.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn is_valid_palindrome(s: String) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid` is never used
[INFO] [stdout]  --> src/easy/valid_parentheses.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn is_valid(s: String) -> bool {
[INFO] [stdout]   |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `largest_rectangle_area` is never used
[INFO] [stdout]  --> src/hard/largest_rectangle_area.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn largest_rectangle_area(heights: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `best_time_to_buy_and_sell_stock_two` is never used
[INFO] [stdout]  --> src/medium/best_time_to_buy_and_sell_stock_two.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn best_time_to_buy_and_sell_stock_two(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `best_time_to_buy_and_sell_stock_two_dp` is never used
[INFO] [stdout]   --> src/medium/best_time_to_buy_and_sell_stock_two.rs:13:4
[INFO] [stdout]    |
[INFO] [stdout] 13 | fn best_time_to_buy_and_sell_stock_two_dp(prices: Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `best_time_to_buy_and_sell_stock_with_cooldown` is never used
[INFO] [stdout]  --> src/medium/best_time_to_buy_and_sell_stock_with_cooldown.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn best_time_to_buy_and_sell_stock_with_cooldown(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `level_order` is never used
[INFO] [stdout]  --> src/medium/binary_tree_level_order_traversal.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `coin_change` is never used
[INFO] [stdout]  --> src/medium/coin_change.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `combination_sum` is never used
[INFO] [stdout]  --> src/medium/combination_sum.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn combination_sum(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `combination_sum_duplicates` is never used
[INFO] [stdout]   --> src/medium/combination_sum.rs:36:4
[INFO] [stdout]    |
[INFO] [stdout] 36 | fn combination_sum_duplicates(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `combination_sum_two` is never used
[INFO] [stdout]  --> src/medium/combination_sum_two.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn combination_sum_two(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `construct_bst_from_preorder` is never used
[INFO] [stdout]  --> src/medium/construct_bst_from_preorder.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn construct_bst_from_preorder(preorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `construct_bt_from_inorder_and_postorder` is never used
[INFO] [stdout]  --> src/medium/construct_bt_from_inorder_and_postorder.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn construct_bt_from_inorder_and_postorder(
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `construct_bt_from_preorder_and_inorder` is never used
[INFO] [stdout]  --> src/medium/construct_bt_from_preorder_and_inorder.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn construct_bt_from_preorder_and_inorder(
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_area` is never used
[INFO] [stdout]  --> src/medium/container_with_the_most_water.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn max_area(height: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_primes` is never used
[INFO] [stdout]  --> src/medium/count_primes.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn count_primes(n: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_primes_slow` is never used
[INFO] [stdout]   --> src/medium/count_primes.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn count_primes_slow(n: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `daily_temperatures` is never used
[INFO] [stdout]  --> src/medium/daily_temperature.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn daily_temperatures(temperatures: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `daily_temperatures_fat` is never used
[INFO] [stdout]   --> src/medium/daily_temperature.rs:19:4
[INFO] [stdout]    |
[INFO] [stdout] 19 | fn daily_temperatures_fat(temperatures: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `diff_ways_to_add_parentheses` is never used
[INFO] [stdout]  --> src/medium/diff_ways_to_add_parentheses.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn diff_ways_to_add_parentheses(expression: String) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `edit_distance` is never used
[INFO] [stdout]  --> src/medium/edit_distance.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn edit_distance(word1: String, word2: String) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `evaluate_reverse_polish_notation` is never used
[INFO] [stdout]  --> src/medium/evaluate_reverse_polish_notation.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn evaluate_reverse_polish_notation(tokens: Vec<String>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `trailing_zeroes` is never used
[INFO] [stdout]  --> src/medium/factorial_trailing_zeros.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn trailing_zeroes(n: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_min` is never used
[INFO] [stdout]  --> src/medium/find_min_in_rotated_sorted_array.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `generate_parenthesis` is never used
[INFO] [stdout]  --> src/medium/generate_parentheses.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn generate_parenthesis(n: i32) -> Vec<String> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `good_nodes` is never used
[INFO] [stdout]  --> src/medium/good_nodes.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn good_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `good_nodes_slow` is never used
[INFO] [stdout]   --> src/medium/good_nodes.rs:21:4
[INFO] [stdout]    |
[INFO] [stdout] 21 | fn good_nodes_slow(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `group_anagrams` is never used
[INFO] [stdout]  --> src/medium/group_anagrams.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rob` is never used
[INFO] [stdout]  --> src/medium/house_robber.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rob_two` is never used
[INFO] [stdout]  --> src/medium/house_robber_two.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn rob_two(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid_bst` is never used
[INFO] [stdout]  --> src/medium/is_valid_bst.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `jump_game` is never used
[INFO] [stdout]  --> src/medium/jump_game.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn jump_game(nums: Vec<i32>) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `jump_game_slow` is never used
[INFO] [stdout]   --> src/medium/jump_game.rs:18:4
[INFO] [stdout]    |
[INFO] [stdout] 18 | fn jump_game_slow(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `jump_game_two` is never used
[INFO] [stdout]  --> src/medium/jump_game_two.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn jump_game_two(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `jump_game_two_slow` is never used
[INFO] [stdout]   --> src/medium/jump_game_two.rs:25:4
[INFO] [stdout]    |
[INFO] [stdout] 25 | fn jump_game_two_slow(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `k_closest` is never used
[INFO] [stdout]  --> src/medium/k_closest.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn k_closest(points: Vec<Vec<i32>>, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `kth_largest_element_in_array` is never used
[INFO] [stdout]  --> src/medium/kth_largest_element_in_array.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn kth_largest_element_in_array(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `kth_smallest` is never used
[INFO] [stdout]  --> src/medium/kth_smallest.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_longest_substring` is never used
[INFO] [stdout]  --> src/medium/length_of_longest_substring.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `letter_case_permutation` is never used
[INFO] [stdout]  --> src/medium/letter_case_permutation.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn letter_case_permutation(s: String) -> Vec<String> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `letter_combinations` is never used
[INFO] [stdout]  --> src/medium/letter_combinations.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `letter_combinations_without_backtracking` is never used
[INFO] [stdout]   --> src/medium/letter_combinations.rs:31:4
[INFO] [stdout]    |
[INFO] [stdout] 31 | fn letter_combinations_without_backtracking(digits: String) -> Vec<String> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_palindrome_substring` is never used
[INFO] [stdout]  --> src/medium/longest_palindrome_substring.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn longest_palindrome_substring(s: String) -> String {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lowest_common_ancestor_of_binary_search_tree` is never used
[INFO] [stdout]  --> src/medium/lowest_common_ancestor_of_binary_search_tree.rs:6:4
[INFO] [stdout]   |
[INFO] [stdout] 6 | fn lowest_common_ancestor_of_binary_search_tree(
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lowest_common_ancestor_of_binary_search_tree_complicated` is never used
[INFO] [stdout]   --> src/medium/lowest_common_ancestor_of_binary_search_tree.rs:29:4
[INFO] [stdout]    |
[INFO] [stdout] 29 | fn lowest_common_ancestor_of_binary_search_tree_complicated(
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lowest_common_ancestor_of_binary_tree` is never used
[INFO] [stdout]  --> src/medium/lowest_common_ancestor_of_binary_tree.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn lowest_common_ancestor_of_binary_tree(
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lowest_common_ancestor_of_binary_tree_complicated` is never used
[INFO] [stdout]   --> src/medium/lowest_common_ancestor_of_binary_tree.rs:31:4
[INFO] [stdout]    |
[INFO] [stdout] 31 | fn lowest_common_ancestor_of_binary_tree_complicated(
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_area_of_island` is never used
[INFO] [stdout]  --> src/medium/max_area_of_island.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn max_area_of_island(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_subarray` is never used
[INFO] [stdout]  --> src/medium/maximum_subarray.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn max_subarray(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_path_sum` is never used
[INFO] [stdout]  --> src/medium/min_path_sum.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn min_path_sum(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]  --> src/medium/min_stack.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | 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/medium/min_stack.rs:7:8
[INFO] [stdout]    |
[INFO] [stdout]  6 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout]  7 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |     fn push(&mut self, val: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     fn get_min(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_sub_array_len` is never used
[INFO] [stdout]  --> src/medium/min_sub_array_len.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `number_of_islands` is never used
[INFO] [stdout]  --> src/medium/number_of_islands.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn number_of_islands(grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `palindrome_partitioning` is never used
[INFO] [stdout]  --> src/medium/palindrome_partitioning.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn palindrome_partitioning(s: String) -> Vec<Vec<String>> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `permutations` is never used
[INFO] [stdout]  --> src/medium/permutations.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn permutations(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `pow` is never used
[INFO] [stdout]  --> src/medium/pow.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn pow(x: f64, n: i32) -> f64 {
[INFO] [stdout]   |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `product_except_self` is never used
[INFO] [stdout]  --> src/medium/product_except_self.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `right_side_view` is never used
[INFO] [stdout]  --> src/medium/right_side_view.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rotate_image` is never used
[INFO] [stdout]  --> src/medium/rotate_image.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn rotate_image(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rotate_image_cool_but_complex` is never used
[INFO] [stdout]   --> src/medium/rotate_image.rs:11:4
[INFO] [stdout]    |
[INFO] [stdout] 11 | fn rotate_image_cool_but_complex(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_matrix` is never used
[INFO] [stdout]  --> src/medium/search_a_2d_matrix.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_matrix_lean_but_slow` is never used
[INFO] [stdout]   --> src/medium/search_a_2d_matrix.rs:34:4
[INFO] [stdout]    |
[INFO] [stdout] 34 | fn search_matrix_lean_but_slow(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_in_rotated_sorted_array` is never used
[INFO] [stdout]  --> src/medium/search_in_rotated_sorted_array.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn search_in_rotated_sorted_array(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_in_rotated_sorted_array_flashy_but_too_complex` is never used
[INFO] [stdout]   --> src/medium/search_in_rotated_sorted_array.rs:30:4
[INFO] [stdout]    |
[INFO] [stdout] 30 | fn search_in_rotated_sorted_array_flashy_but_too_complex(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_min_idx` is never used
[INFO] [stdout]   --> src/medium/search_in_rotated_sorted_array.rs:66:4
[INFO] [stdout]    |
[INFO] [stdout] 66 | fn find_min_idx(nums: &Vec<i32>) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search` is never used
[INFO] [stdout]   --> src/medium/search_in_rotated_sorted_array.rs:94:4
[INFO] [stdout]    |
[INFO] [stdout] 94 | fn binary_search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `ship_within_days` is never used
[INFO] [stdout]  --> src/medium/ship_within_days.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn ship_within_days(weights: Vec<i32>, days: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `subsets` is never used
[INFO] [stdout]  --> src/medium/subsets.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `subsets_two` is never used
[INFO] [stdout]  --> src/medium/subsets_two.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn subsets_two(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `task_scheduler` is never used
[INFO] [stdout]  --> src/medium/task_scheduler.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn task_scheduler(tasks: Vec<char>, n: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `task_scheduler_slow` is never used
[INFO] [stdout]   --> src/medium/task_scheduler.rs:21:4
[INFO] [stdout]    |
[INFO] [stdout] 21 | fn task_scheduler_slow(tasks: Vec<char>, n: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `top_k_frequent` is never used
[INFO] [stdout]  --> src/medium/top_k_frequent.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `top_k_frequent_n_square_sooooo_slow` is never used
[INFO] [stdout]   --> src/medium/top_k_frequent.rs:14:4
[INFO] [stdout]    |
[INFO] [stdout] 14 | fn top_k_frequent_n_square_sooooo_slow(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `colored_cells` is never used
[INFO] [stdout]  --> src/medium/total_number_of_colored_cells.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn colored_cells(n: i32) -> i64 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum_two` is never used
[INFO] [stdout]  --> src/medium/two_sum_two_array_sorted.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn two_sum_two(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum__two_slow` is never used
[INFO] [stdout]   --> src/medium/two_sum_two_array_sorted.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn two_sum__two_slow(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `ugly_number_two` is never used
[INFO] [stdout]  --> src/medium/ugly_number_two.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn ugly_number_two(n: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `unique_paths` is never used
[INFO] [stdout]  --> src/medium/unique_paths.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn unique_paths(m: i32, n: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `unique_paths_with_obstacles` is never used
[INFO] [stdout]  --> src/medium/unique_paths_with_obstacles.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn unique_paths_with_obstacles(obstacle_grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid_sudoku` is never used
[INFO] [stdout]  --> src/medium/valid_sudoku.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn is_valid_sudoku(board: Vec<Vec<char>>) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid_sudoku_redundant` is never used
[INFO] [stdout]   --> src/medium/valid_sudoku.rs:33:4
[INFO] [stdout]    |
[INFO] [stdout] 33 | fn is_valid_sudoku_redundant(board: Vec<Vec<char>>) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `word_search` is never used
[INFO] [stdout]  --> src/medium/word_search.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn word_search(board: Vec<Vec<char>>, word: String) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum__two_slow` should have a snake case name
[INFO] [stdout]   --> src/medium/two_sum_two_array_sorted.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn two_sum__two_slow(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `two_sum_two_slow`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(non_snake_case)]` (part of `#[warn(nonstandard_style)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/binary_tree.rs:31:13
[INFO] [stdout]    |
[INFO] [stdout] 31 |         let mut current = queue.remove(0);
[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/binary_tree.rs:58:13
[INFO] [stdout]    |
[INFO] [stdout] 58 |         let mut current = queue.remove(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/easy/longest_palindrome.rs:6:13
[INFO] [stdout]   |
[INFO] [stdout] 6 |         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: value assigned to `tmp` is never read
[INFO] [stdout]   --> src/easy/pascal_triangle_two.rs:6:23
[INFO] [stdout]    |
[INFO] [stdout]  6 |         let mut tmp = 0;
[INFO] [stdout]    |                       ^ this value is reassigned later and never used
[INFO] [stdout] ...
[INFO] [stdout] 12 |             tmp = arr[j];
[INFO] [stdout]    |             ------------ `tmp` is overwritten here before the previous value is read
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/easy/pivot_index.rs:2:9
[INFO] [stdout]   |
[INFO] [stdout] 2 |     let mut right: i32 = nums.iter().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/medium/construct_bst_from_preorder.rs:18:13
[INFO] [stdout]    |
[INFO] [stdout] 18 |         let mut left;
[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/medium/construct_bst_from_preorder.rs:19:13
[INFO] [stdout]    |
[INFO] [stdout] 19 |         let mut right;
[INFO] [stdout]    |             ----^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `right` is never read
[INFO] [stdout]   --> src/medium/search_in_rotated_sorted_array.rs:41:20
[INFO] [stdout]    |
[INFO] [stdout] 41 |     let (mut left, mut right) = (0, 0);
[INFO] [stdout]    |                    ^^^^^^^^^ this value is reassigned later and never used
[INFO] [stdout] ...
[INFO] [stdout] 50 |                 right = min_idx - 1;
[INFO] [stdout]    |                 ------------------- `right` is overwritten here before the previous value is read
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `min` is never read
[INFO] [stdout]   --> src/medium/search_in_rotated_sorted_array.rs:80:17
[INFO] [stdout]    |
[INFO] [stdout] 80 |                 min = nums[left];
[INFO] [stdout]    |                 ^^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search_redundant_comparison` is never used
[INFO] [stdout]   --> src/easy/binary_search.rs:23:4
[INFO] [stdout]    |
[INFO] [stdout] 23 | fn binary_search_redundant_comparison(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `contain_duplicate_slow` is never used
[INFO] [stdout]   --> src/easy/contain_duplicate.rs:13:4
[INFO] [stdout]    |
[INFO] [stdout] 13 | fn contain_duplicate_slow(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_bits_complicated` is never used
[INFO] [stdout]  --> src/easy/count_bits.rs:9:4
[INFO] [stdout]   |
[INFO] [stdout] 9 | fn count_bits_complicated(n: i32) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `highest_altitude_lengthy_but_saves_memory` is never used
[INFO] [stdout]  --> src/easy/highest_altitude.rs:7:4
[INFO] [stdout]   |
[INFO] [stdout] 7 | fn highest_altitude_lengthy_but_saves_memory(gain: Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `palindrome_number_slow` is never used
[INFO] [stdout]   --> src/easy/palindrome_number.rs:16:4
[INFO] [stdout]    |
[INFO] [stdout] 16 | fn palindrome_number_slow(x: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `best_time_to_buy_and_sell_stock_two_dp` is never used
[INFO] [stdout]   --> src/medium/best_time_to_buy_and_sell_stock_two.rs:13:4
[INFO] [stdout]    |
[INFO] [stdout] 13 | fn best_time_to_buy_and_sell_stock_two_dp(prices: Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `combination_sum_duplicates` is never used
[INFO] [stdout]   --> src/medium/combination_sum.rs:36:4
[INFO] [stdout]    |
[INFO] [stdout] 36 | fn combination_sum_duplicates(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_primes_slow` is never used
[INFO] [stdout]   --> src/medium/count_primes.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn count_primes_slow(n: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `daily_temperatures_fat` is never used
[INFO] [stdout]   --> src/medium/daily_temperature.rs:19:4
[INFO] [stdout]    |
[INFO] [stdout] 19 | fn daily_temperatures_fat(temperatures: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `good_nodes_slow` is never used
[INFO] [stdout]   --> src/medium/good_nodes.rs:21:4
[INFO] [stdout]    |
[INFO] [stdout] 21 | fn good_nodes_slow(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `jump_game_slow` is never used
[INFO] [stdout]   --> src/medium/jump_game.rs:18:4
[INFO] [stdout]    |
[INFO] [stdout] 18 | fn jump_game_slow(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `jump_game_two_slow` is never used
[INFO] [stdout]   --> src/medium/jump_game_two.rs:25:4
[INFO] [stdout]    |
[INFO] [stdout] 25 | fn jump_game_two_slow(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `letter_combinations_without_backtracking` is never used
[INFO] [stdout]   --> src/medium/letter_combinations.rs:31:4
[INFO] [stdout]    |
[INFO] [stdout] 31 | fn letter_combinations_without_backtracking(digits: String) -> Vec<String> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lowest_common_ancestor_of_binary_search_tree_complicated` is never used
[INFO] [stdout]   --> src/medium/lowest_common_ancestor_of_binary_search_tree.rs:29:4
[INFO] [stdout]    |
[INFO] [stdout] 29 | fn lowest_common_ancestor_of_binary_search_tree_complicated(
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lowest_common_ancestor_of_binary_tree_complicated` is never used
[INFO] [stdout]   --> src/medium/lowest_common_ancestor_of_binary_tree.rs:31:4
[INFO] [stdout]    |
[INFO] [stdout] 31 | fn lowest_common_ancestor_of_binary_tree_complicated(
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rotate_image_cool_but_complex` is never used
[INFO] [stdout]   --> src/medium/rotate_image.rs:11:4
[INFO] [stdout]    |
[INFO] [stdout] 11 | fn rotate_image_cool_but_complex(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_matrix_lean_but_slow` is never used
[INFO] [stdout]   --> src/medium/search_a_2d_matrix.rs:34:4
[INFO] [stdout]    |
[INFO] [stdout] 34 | fn search_matrix_lean_but_slow(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_in_rotated_sorted_array_flashy_but_too_complex` is never used
[INFO] [stdout]   --> src/medium/search_in_rotated_sorted_array.rs:30:4
[INFO] [stdout]    |
[INFO] [stdout] 30 | fn search_in_rotated_sorted_array_flashy_but_too_complex(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_min_idx` is never used
[INFO] [stdout]   --> src/medium/search_in_rotated_sorted_array.rs:66:4
[INFO] [stdout]    |
[INFO] [stdout] 66 | fn find_min_idx(nums: &Vec<i32>) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search` is never used
[INFO] [stdout]   --> src/medium/search_in_rotated_sorted_array.rs:94:4
[INFO] [stdout]    |
[INFO] [stdout] 94 | fn binary_search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `task_scheduler_slow` is never used
[INFO] [stdout]   --> src/medium/task_scheduler.rs:21:4
[INFO] [stdout]    |
[INFO] [stdout] 21 | fn task_scheduler_slow(tasks: Vec<char>, n: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `top_k_frequent_n_square_sooooo_slow` is never used
[INFO] [stdout]   --> src/medium/top_k_frequent.rs:14:4
[INFO] [stdout]    |
[INFO] [stdout] 14 | fn top_k_frequent_n_square_sooooo_slow(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum__two_slow` is never used
[INFO] [stdout]   --> src/medium/two_sum_two_array_sorted.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn two_sum__two_slow(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid_sudoku_redundant` is never used
[INFO] [stdout]   --> src/medium/valid_sudoku.rs:33:4
[INFO] [stdout]    |
[INFO] [stdout] 33 | fn is_valid_sudoku_redundant(board: Vec<Vec<char>>) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum__two_slow` should have a snake case name
[INFO] [stdout]   --> src/medium/two_sum_two_array_sorted.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn two_sum__two_slow(numbers: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^ help: convert the identifier to snake case: `two_sum_two_slow`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(non_snake_case)]` (part of `#[warn(nonstandard_style)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.61s
[INFO] running `Command { std: "docker" "inspect" "19aa8f3e4d325ffbf64e5922bb5a488d9df897cbc52dec77e7d4fc5ae002de2f", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "19aa8f3e4d325ffbf64e5922bb5a488d9df897cbc52dec77e7d4fc5ae002de2f", kill_on_drop: false }`
[INFO] [stdout] 19aa8f3e4d325ffbf64e5922bb5a488d9df897cbc52dec77e7d4fc5ae002de2f