[INFO] cloning repository https://github.com/VielenDanke/algorithms_rust [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/VielenDanke/algorithms_rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FVielenDanke%2Falgorithms_rust", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FVielenDanke%2Falgorithms_rust'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 489b18483be311fd5251c835026dd98604e45672 [INFO] checking VielenDanke/algorithms_rust against try#7424ce9ff9baac3e9d9f5dd3c85828cddea0134d for pr-136776-1 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FVielenDanke%2Falgorithms_rust" "/workspace/builds/worker-1-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-1-tc2/source'... [INFO] [stderr] done. [INFO] started tweaking git repo https://github.com/VielenDanke/algorithms_rust [INFO] finished tweaking git repo https://github.com/VielenDanke/algorithms_rust [INFO] tweaked toml for git repo https://github.com/VielenDanke/algorithms_rust written to /workspace/builds/worker-1-tc2/source/Cargo.toml [INFO] validating manifest of git repo https://github.com/VielenDanke/algorithms_rust on toolchain 7424ce9ff9baac3e9d9f5dd3c85828cddea0134d [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+7424ce9ff9baac3e9d9f5dd3c85828cddea0134d" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] crate git repo https://github.com/VielenDanke/algorithms_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" "+7424ce9ff9baac3e9d9f5dd3c85828cddea0134d" "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-1-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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:94a0c148923f5b2b52a63ef0eeb1882ad339ab61bce784c8077cbe41c61feb6c" "/opt/rustwide/cargo-home/bin/cargo" "+7424ce9ff9baac3e9d9f5dd3c85828cddea0134d" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] ec451c878bd12f772786440092af4068a5bc320effa62bb00377612ddb8a4362 [INFO] running `Command { std: "docker" "start" "-a" "ec451c878bd12f772786440092af4068a5bc320effa62bb00377612ddb8a4362", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "ec451c878bd12f772786440092af4068a5bc320effa62bb00377612ddb8a4362", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "ec451c878bd12f772786440092af4068a5bc320effa62bb00377612ddb8a4362", kill_on_drop: false }` [INFO] [stdout] ec451c878bd12f772786440092af4068a5bc320effa62bb00377612ddb8a4362 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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:94a0c148923f5b2b52a63ef0eeb1882ad339ab61bce784c8077cbe41c61feb6c" "/opt/rustwide/cargo-home/bin/cargo" "+7424ce9ff9baac3e9d9f5dd3c85828cddea0134d" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 4d333f214191dea1d947997adec98f01088d40452774906adef4c9f53279a52d [INFO] running `Command { std: "docker" "start" "-a" "4d333f214191dea1d947997adec98f01088d40452774906adef4c9f53279a52d", kill_on_drop: false }` [INFO] [stderr] Compiling proc-macro2 v1.0.95 [INFO] [stderr] Compiling serde_json v1.0.141 [INFO] [stderr] Checking regex-syntax v0.8.8 [INFO] [stderr] Compiling quote v1.0.40 [INFO] [stderr] Compiling syn v2.0.104 [INFO] [stderr] Checking regex-automata v0.4.13 [INFO] [stderr] Compiling serde_derive v1.0.219 [INFO] [stderr] Checking regex v1.12.2 [INFO] [stderr] Checking serde v1.0.219 [INFO] [stderr] Checking algorithms_rust v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unnecessary parentheses around index expression [INFO] [stdout] --> src/dynamic_programming/medium/task_1578.rs:11:33 [INFO] [stdout] | [INFO] [stdout] 11 | if colors_bytes[(i - 1)] == colors_bytes[i] { [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] 11 - if colors_bytes[(i - 1)] == colors_bytes[i] { [INFO] [stdout] 11 + if colors_bytes[i - 1 ] == colors_bytes[i] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/array/easy/task_1475.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/array/easy/task_3349.rs:6:22 [INFO] [stdout] | [INFO] [stdout] 6 | let window = (k * 2); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 6 - let window = (k * 2); [INFO] [stdout] 6 + let window = k * 2 ; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/array/medium/find_the_winner_of_the_circular_game_1823.rs:17:32 [INFO] [stdout] | [INFO] [stdout] 17 | next_friend_idx += (k - 1); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 17 - next_friend_idx += (k - 1); [INFO] [stdout] 17 + next_friend_idx += k - 1 ; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/array/medium/filling_bookcase_shelves_1105.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/array/hard/count_subarrays_with_fixed_bounds_2444.rs:36:28 [INFO] [stdout] | [INFO] [stdout] 36 | result += i64::max((i64::min(max_i, min_i) - left_i + 1), 0); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 36 - result += i64::max((i64::min(max_i, min_i) - left_i + 1), 0); [INFO] [stdout] 36 + result += i64::max(i64::min(max_i, min_i) - left_i + 1 , 0); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around method argument [INFO] [stdout] --> src/strings/easy/score_of_a_string_3110.rs:8:42 [INFO] [stdout] | [INFO] [stdout] 8 | score += s_bytes[i].abs_diff((s_bytes[i-1])) as i32; [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 8 - score += s_bytes[i].abs_diff((s_bytes[i-1])) as i32; [INFO] [stdout] 8 + score += s_bytes[i].abs_diff(s_bytes[i-1] ) as i32; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/strings/easy/task_1945.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::hash::Hash` [INFO] [stdout] --> src/graph/medium/find_the_city_with_the_smallest_number_of_neighbors_at_threshold_distance_1334.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::hash::Hash; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around method argument [INFO] [stdout] --> src/backtracking/medium/find_the_safest_path_in_a_grid_2812.rs:97:102 [INFO] [stdout] | [INFO] [stdout] 97 | result = result.min(((i as i32).abs_diff((*ii) as i32) + (j as i32).abs_diff((*jj as i32))) as i32); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 97 - result = result.min(((i as i32).abs_diff((*ii) as i32) + (j as i32).abs_diff((*jj as i32))) as i32); [INFO] [stdout] 97 + result = result.min(((i as i32).abs_diff((*ii) as i32) + (j as i32).abs_diff(*jj as i32 )) as i32); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fs::File` [INFO] [stdout] --> src/main.rs:15:5 [INFO] [stdout] | [INFO] [stdout] 15 | use std::fs::File; // Для открытия файла [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BufRead` and `BufReader` [INFO] [stdout] --> src/main.rs:16:15 [INFO] [stdout] | [INFO] [stdout] 16 | use std::io::{BufRead, BufReader}; // Для буферизованного чтения (построчно) [INFO] [stdout] | ^^^^^^^ ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::path::Path` [INFO] [stdout] --> src/main.rs:17:5 [INFO] [stdout] | [INFO] [stdout] 17 | use std::path::Path; // Для работы с путями к файлам [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around index expression [INFO] [stdout] --> src/dynamic_programming/medium/task_1578.rs:11:33 [INFO] [stdout] | [INFO] [stdout] 11 | if colors_bytes[(i - 1)] == colors_bytes[i] { [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] 11 - if colors_bytes[(i - 1)] == colors_bytes[i] { [INFO] [stdout] 11 + if colors_bytes[i - 1 ] == colors_bytes[i] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/array/easy/task_1475.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/array/easy/task_3349.rs:6:22 [INFO] [stdout] | [INFO] [stdout] 6 | let window = (k * 2); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 6 - let window = (k * 2); [INFO] [stdout] 6 + let window = k * 2 ; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/array/medium/find_the_winner_of_the_circular_game_1823.rs:17:32 [INFO] [stdout] | [INFO] [stdout] 17 | next_friend_idx += (k - 1); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 17 - next_friend_idx += (k - 1); [INFO] [stdout] 17 + next_friend_idx += k - 1 ; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/array/medium/filling_bookcase_shelves_1105.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/array/hard/count_subarrays_with_fixed_bounds_2444.rs:36:28 [INFO] [stdout] | [INFO] [stdout] 36 | result += i64::max((i64::min(max_i, min_i) - left_i + 1), 0); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 36 - result += i64::max((i64::min(max_i, min_i) - left_i + 1), 0); [INFO] [stdout] 36 + result += i64::max(i64::min(max_i, min_i) - left_i + 1 , 0); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around method argument [INFO] [stdout] --> src/strings/easy/score_of_a_string_3110.rs:8:42 [INFO] [stdout] | [INFO] [stdout] 8 | score += s_bytes[i].abs_diff((s_bytes[i-1])) as i32; [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 8 - score += s_bytes[i].abs_diff((s_bytes[i-1])) as i32; [INFO] [stdout] 8 + score += s_bytes[i].abs_diff(s_bytes[i-1] ) as i32; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/strings/easy/task_1945.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::hash::Hash` [INFO] [stdout] --> src/graph/medium/find_the_city_with_the_smallest_number_of_neighbors_at_threshold_distance_1334.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 3 | use std::hash::Hash; [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around method argument [INFO] [stdout] --> src/backtracking/medium/find_the_safest_path_in_a_grid_2812.rs:97:102 [INFO] [stdout] | [INFO] [stdout] 97 | result = result.min(((i as i32).abs_diff((*ii) as i32) + (j as i32).abs_diff((*jj as i32))) as i32); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 97 - result = result.min(((i as i32).abs_diff((*ii) as i32) + (j as i32).abs_diff((*jj as i32))) as i32); [INFO] [stdout] 97 + result = result.min(((i as i32).abs_diff((*ii) as i32) + (j as i32).abs_diff(*jj as i32 )) as i32); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::fs::File` [INFO] [stdout] --> src/main.rs:15:5 [INFO] [stdout] | [INFO] [stdout] 15 | use std::fs::File; // Для открытия файла [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `BufRead` and `BufReader` [INFO] [stdout] --> src/main.rs:16:15 [INFO] [stdout] | [INFO] [stdout] 16 | use std::io::{BufRead, BufReader}; // Для буферизованного чтения (построчно) [INFO] [stdout] | ^^^^^^^ ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::path::Path` [INFO] [stdout] --> src/main.rs:17:5 [INFO] [stdout] | [INFO] [stdout] 17 | use std::path::Path; // Для работы с путями к файлам [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/math/medium/tasl_869.rs:6:39 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn reordered_power_of2_faster(mut n: i32) -> bool { [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/math/easy/task_1518.rs:16:39 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn num_water_bottles_one_line(mut num_bottles: i32, num_exchange: i32) -> 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/dynamic_programming/medium/task_494.rs:5:52 [INFO] [stdout] | [INFO] [stdout] 5 | fn backtrack(nums: &Vec, target: i32, mut sum: i32, total_sum: i32, idx: usize, memo: &mut Vec>>) -> i32 { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/dynamic_programming/medium/task_416.rs:9:26 [INFO] [stdout] | [INFO] [stdout] 9 | pub fn can_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/dynamic_programming/hard/task_1639.rs:24:17 [INFO] [stdout] | [INFO] [stdout] 24 | let mut current_position = (target.as_bytes()[target_idx] - b'a') as 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/array/easy/relative_ranks_506.rs:22:17 [INFO] [stdout] | [INFO] [stdout] 22 | let mut place = m[v]; [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/math/medium/tasl_869.rs:6:39 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn reordered_power_of2_faster(mut n: i32) -> bool { [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/array/easy/intersection_of_two_arrays_2_350.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let mut nums_1_counter = nums1.iter().fold(vec![0; m], |mut arr, &num| { [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/array/easy/pass_the_pillow_2582.rs:4:41 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn pass_the_pillow_math(n: i32, mut time: i32) -> 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/array/easy/pass_the_pillow_2582.rs:5:13 [INFO] [stdout] | [INFO] [stdout] 5 | let mut chunks = time / (n - 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/math/easy/task_1518.rs:16:39 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn num_water_bottles_one_line(mut num_bottles: i32, num_exchange: i32) -> 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/array/easy/task_1331.rs:6:33 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn array_rank_transform(mut arr: Vec) -> Vec { [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/array/easy/task_3264.rs:21:58 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn get_final_state_no_struct(mut nums: Vec, mut k: i32, multiplier: i32) -> Vec { [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/dynamic_programming/medium/task_494.rs:5:52 [INFO] [stdout] | [INFO] [stdout] 5 | fn backtrack(nums: &Vec, target: i32, mut sum: i32, total_sum: i32, idx: usize, memo: &mut Vec>>) -> i32 { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/dynamic_programming/medium/task_416.rs:9:26 [INFO] [stdout] | [INFO] [stdout] 9 | pub fn can_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/array/easy/task_1475.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | let mut last_elem = stack.remove(stack.len() - 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/array/easy/task_2873.rs:16:39 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn maximum_triplet_value_sort(mut nums: Vec) -> i64 { [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/array/easy/task_3396.rs:4:31 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn minimum_operations(mut nums: Vec) -> i32 { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `left_sum` is never read [INFO] [stdout] --> src/array/easy/task_2843.rs:36:37 [INFO] [stdout] | [INFO] [stdout] 36 | let mut left_sum: i32 = 0; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `right_sum` is never read [INFO] [stdout] --> src/array/easy/task_2843.rs:37:38 [INFO] [stdout] | [INFO] [stdout] 37 | let mut right_sum: i32 = 0; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/dynamic_programming/hard/task_1639.rs:24:17 [INFO] [stdout] | [INFO] [stdout] 24 | let mut current_position = (target.as_bytes()[target_idx] - b'a') as 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/array/easy/relative_ranks_506.rs:22:17 [INFO] [stdout] | [INFO] [stdout] 22 | let mut place = m[v]; [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/array/easy/intersection_of_two_arrays_2_350.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let mut nums_1_counter = nums1.iter().fold(vec![0; m], |mut arr, &num| { [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/array/easy/pass_the_pillow_2582.rs:4:41 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn pass_the_pillow_math(n: i32, mut time: i32) -> 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/array/easy/pass_the_pillow_2582.rs:5:13 [INFO] [stdout] | [INFO] [stdout] 5 | let mut chunks = time / (n - 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/array/easy/task_1331.rs:6:33 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn array_rank_transform(mut arr: Vec) -> Vec { [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/array/easy/task_3264.rs:21:58 [INFO] [stdout] | [INFO] [stdout] 21 | pub fn get_final_state_no_struct(mut nums: Vec, mut k: i32, multiplier: i32) -> Vec { [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/array/easy/task_1475.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | let mut last_elem = stack.remove(stack.len() - 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/array/medium/maximize_happiness_of_selected_children_3075.rs:4:59 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn maximum_happiness_sum(mut happiness: Vec, mut k: i32) -> i64 { [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/array/easy/task_2873.rs:16:39 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn maximum_triplet_value_sort(mut nums: Vec) -> i64 { [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/array/medium/count_triplets_that_can_form_two_arrays_of_equal_xor_1442.rs:6:13 [INFO] [stdout] | [INFO] [stdout] 6 | let mut n = arr.len(); [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/array/easy/task_3396.rs:4:31 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn minimum_operations(mut nums: Vec) -> i32 { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `left_sum` is never read [INFO] [stdout] --> src/array/easy/task_2843.rs:36:37 [INFO] [stdout] | [INFO] [stdout] 36 | let mut left_sum: i32 = 0; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `right_sum` is never read [INFO] [stdout] --> src/array/easy/task_2843.rs:37:38 [INFO] [stdout] | [INFO] [stdout] 37 | let mut right_sum: i32 = 0; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/array/medium/task_264.rs:31:28 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn nth_ugly_number(mut n: i32) -> 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/array/medium/task_1894.rs:22:51 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn chalk_replacer_faster(chalk: Vec, mut k: i32) -> 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/array/medium/task_2028.rs:4:26 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn missing_rolls(mut rolls: Vec, mean: i32, n: i32) -> Vec { [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/array/medium/task_2028.rs:14:13 [INFO] [stdout] | [INFO] [stdout] 14 | let mut left_sum = expected_sum - rolls.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/array/medium/task_2275.rs:16:19 [INFO] [stdout] | [INFO] [stdout] 16 | fn count_bits(mut num: i32, bit_counts: &mut Vec) { [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/array/medium/task_2554.rs:31:13 [INFO] [stdout] | [INFO] [stdout] 31 | let mut set = banned.into_iter().collect::>(); [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/array/medium/task_3152.rs:8:18 [INFO] [stdout] | [INFO] [stdout] 8 | let (mut left, mut right) = (query[0] as usize, query[1] as 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/array/medium/task_3152.rs:8:28 [INFO] [stdout] | [INFO] [stdout] 8 | let (mut left, mut right) = (query[0] as usize, query[1] as 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/array/medium/maximize_happiness_of_selected_children_3075.rs:4:59 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn maximum_happiness_sum(mut happiness: Vec, mut k: i32) -> i64 { [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/array/medium/task_2779.rs:18:39 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn maximum_beauty_brute_force(mut nums: Vec, k: i32) -> 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/array/medium/count_triplets_that_can_form_two_arrays_of_equal_xor_1442.rs:6:13 [INFO] [stdout] | [INFO] [stdout] 6 | let mut n = arr.len(); [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `limit` [INFO] [stdout] --> src/array/medium/task_3160.rs:4:26 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn query_results(limit: i32, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_limit` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/array/medium/task_3208.rs:4:41 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn number_of_alternating_groups(mut colors: Vec, k: i32) -> 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/array/medium/task_2401.rs:6:13 [INFO] [stdout] | [INFO] [stdout] 6 | let mut window = n; [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/array/medium/task_2401.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let mut longest = 0; [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `window` [INFO] [stdout] --> src/array/medium/task_2401.rs:6:13 [INFO] [stdout] | [INFO] [stdout] 6 | let mut window = n; [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_window` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `longest` [INFO] [stdout] --> src/array/medium/task_2401.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let mut longest = 0; [INFO] [stdout] | ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_longest` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/array/medium/task_264.rs:31:28 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn nth_ugly_number(mut n: i32) -> 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/array/medium/task_1894.rs:22:51 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn chalk_replacer_faster(chalk: Vec, mut k: i32) -> 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/array/medium/task_2028.rs:4:26 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn missing_rolls(mut rolls: Vec, mean: i32, n: i32) -> Vec { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `days` is never read [INFO] [stdout] --> src/array/medium/task_3169.rs:12:21 [INFO] [stdout] | [INFO] [stdout] 12 | days -= 1; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/array/medium/task_2028.rs:14:13 [INFO] [stdout] | [INFO] [stdout] 14 | let mut left_sum = expected_sum - rolls.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/array/medium/task_2275.rs:16:19 [INFO] [stdout] | [INFO] [stdout] 16 | fn count_bits(mut num: i32, bit_counts: &mut Vec) { [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/array/medium/task_2616.rs:4:45 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn minimize_max(mut nums: Vec, mut p: i32) -> 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/array/medium/task_2554.rs:31:13 [INFO] [stdout] | [INFO] [stdout] 31 | let mut set = banned.into_iter().collect::>(); [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/array/medium/task_3152.rs:8:18 [INFO] [stdout] | [INFO] [stdout] 8 | let (mut left, mut right) = (query[0] as usize, query[1] as 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/array/medium/task_3152.rs:8:28 [INFO] [stdout] | [INFO] [stdout] 8 | let (mut left, mut right) = (query[0] as usize, query[1] as 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/array/medium/task_2779.rs:18:39 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn maximum_beauty_brute_force(mut nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `limit` [INFO] [stdout] --> src/array/medium/task_3160.rs:4:26 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn query_results(limit: i32, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_limit` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/array/medium/task_3208.rs:4:41 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn number_of_alternating_groups(mut colors: Vec, k: i32) -> 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/array/medium/task_2401.rs:6:13 [INFO] [stdout] | [INFO] [stdout] 6 | let mut window = n; [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/array/medium/task_2401.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let mut longest = 0; [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `window` [INFO] [stdout] --> src/array/medium/task_2401.rs:6:13 [INFO] [stdout] | [INFO] [stdout] 6 | let mut window = n; [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_window` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `longest` [INFO] [stdout] --> src/array/medium/task_2401.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let mut longest = 0; [INFO] [stdout] | ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_longest` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/array/hard/maximal_rectangle_85.rs:5:14 [INFO] [stdout] | [INFO] [stdout] 5 | let (mut row, mut col) = (matrix.len(), matrix[0].len()); [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/array/hard/maximal_rectangle_85.rs:5:23 [INFO] [stdout] | [INFO] [stdout] 5 | let (mut row, mut col) = (matrix.len(), matrix[0].len()); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/array/hard/maximal_rectangle_85.rs:19:14 [INFO] [stdout] | [INFO] [stdout] 19 | for (i, row) in matrix_clone.iter_mut().enumerate() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/array/hard/task_440.rs:4:36 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn find_kth_number(n: i32, mut k: i32) -> i32 { [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `days` is never read [INFO] [stdout] --> src/array/medium/task_3169.rs:12:21 [INFO] [stdout] | [INFO] [stdout] 12 | days -= 1; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/strings/easy/reverse_prefix_of_word_2000.rs:8:18 [INFO] [stdout] | [INFO] [stdout] 8 | let (mut left, mut right) = word_bytes.split_at(idx + 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/strings/easy/reverse_prefix_of_word_2000.rs:8:28 [INFO] [stdout] | [INFO] [stdout] 8 | let (mut left, mut right) = word_bytes.split_at(idx + 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/strings/easy/largest_positive_integer_that_exists_with_its_negative_2441.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let mut storage: HashSet = HashSet::from_iter(nums.clone()); [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/array/medium/task_2616.rs:4:45 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn minimize_max(mut nums: Vec, mut p: i32) -> 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/strings/easy/k_th_distinc_string_in_an_array_2053.rs:6:43 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn kth_distinct(arr: Vec, mut k: i32) -> String { [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/strings/easy/task_1945.rs:29:41 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn get_lucky_shorter(s: String, mut k: i32) -> 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/strings/easy/task_2696.rs:15:17 [INFO] [stdout] | [INFO] [stdout] 15 | for mut i in 0..s_bytes.len() - 1 { [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/strings/easy/task_796.rs:22:13 [INFO] [stdout] | [INFO] [stdout] 22 | for i in 0..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/array/hard/maximal_rectangle_85.rs:5:14 [INFO] [stdout] | [INFO] [stdout] 5 | let (mut row, mut col) = (matrix.len(), matrix[0].len()); [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/array/hard/maximal_rectangle_85.rs:5:23 [INFO] [stdout] | [INFO] [stdout] 5 | let (mut row, mut col) = (matrix.len(), matrix[0].len()); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/array/hard/maximal_rectangle_85.rs:19:14 [INFO] [stdout] | [INFO] [stdout] 19 | for (i, row) in matrix_clone.iter_mut().enumerate() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/array/hard/task_440.rs:4:36 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn find_kth_number(n: i32, mut k: i32) -> 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/strings/medium/task_2559.rs:8:13 [INFO] [stdout] | [INFO] [stdout] 8 | let mut vowels: HashSet = HashSet::from_iter(vec![b'a', b'e', b'i', b'o', b'u']); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/strings/medium/task_2559.rs:32:20 [INFO] [stdout] | [INFO] [stdout] 32 | .map(|(i, q)| { [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/strings/easy/reverse_prefix_of_word_2000.rs:8:18 [INFO] [stdout] | [INFO] [stdout] 8 | let (mut left, mut right) = word_bytes.split_at(idx + 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/strings/easy/reverse_prefix_of_word_2000.rs:8:28 [INFO] [stdout] | [INFO] [stdout] 8 | let (mut left, mut right) = word_bytes.split_at(idx + 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/strings/easy/largest_positive_integer_that_exists_with_its_negative_2441.rs:7:13 [INFO] [stdout] | [INFO] [stdout] 7 | let mut storage: HashSet = HashSet::from_iter(nums.clone()); [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/strings/easy/k_th_distinc_string_in_an_array_2053.rs:6:43 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn kth_distinct(arr: Vec, mut k: i32) -> String { [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/strings/easy/task_1945.rs:29:41 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn get_lucky_shorter(s: String, mut k: i32) -> 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/strings/easy/task_2696.rs:15:17 [INFO] [stdout] | [INFO] [stdout] 15 | for mut i in 0..s_bytes.len() - 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/strings/hard/task_564.rs:16:13 [INFO] [stdout] | [INFO] [stdout] 16 | let mut palindrome_candidates = vec![ [INFO] [stdout] | ----^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/strings/easy/task_796.rs:22:13 [INFO] [stdout] | [INFO] [stdout] 22 | for i in 0..n { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `heap` [INFO] [stdout] --> src/structures/medium/task_2353.rs:47:13 [INFO] [stdout] | [INFO] [stdout] 47 | let heap = btree_map.get_mut(&old_rating).unwrap(); [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_heap` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `rows` [INFO] [stdout] --> src/structures/medium/task_3484.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 14 | fn new(rows: i32) -> Self { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_rows` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `err` [INFO] [stdout] --> src/graph/easy/sum_of_left_leaves_404.rs:50:35 [INFO] [stdout] | [INFO] [stdout] 50 | bfs(root).unwrap_or_else(|err| { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_err` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/graph/medium/maximum_total_importance_of_roads_2285.rs:4:47 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn maximum_importance_shorter(n: i32, mut roads: Vec>) -> i64 { [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/strings/medium/task_2559.rs:8:13 [INFO] [stdout] | [INFO] [stdout] 8 | let mut vowels: HashSet = HashSet::from_iter(vec![b'a', b'e', b'i', b'o', b'u']); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/strings/medium/task_2559.rs:32:20 [INFO] [stdout] | [INFO] [stdout] 32 | .map(|(i, q)| { [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/graph/medium/all_ancestors_of_node_in_directec_acyclic_graph_2192.rs:85:26 [INFO] [stdout] | [INFO] [stdout] 85 | for (&k, mut v) in collector.iter_mut() { [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/strings/hard/task_564.rs:16:13 [INFO] [stdout] | [INFO] [stdout] 16 | let mut palindrome_candidates = vec![ [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/graph/hard/sum_of_distances_in_tree_834.rs:33:45 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn sum_of_distances_in_tree(n: i32, mut edges: Vec>) -> Vec { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `heap` [INFO] [stdout] --> src/structures/medium/task_2353.rs:47:13 [INFO] [stdout] | [INFO] [stdout] 47 | let heap = btree_map.get_mut(&old_rating).unwrap(); [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_heap` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `rows` [INFO] [stdout] --> src/structures/medium/task_3484.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 14 | fn new(rows: i32) -> Self { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_rows` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `edges` [INFO] [stdout] --> src/graph/hard/find_the_maximum_sum_of_node_values_3068.rs:4:54 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn maximum_value_sum(nums: Vec, k: i32, edges: Vec>) -> i64 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/graph.rs:36:13 [INFO] [stdout] | [INFO] [stdout] 36 | let mut count = 0; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `err` [INFO] [stdout] --> src/graph/easy/sum_of_left_leaves_404.rs:50:35 [INFO] [stdout] | [INFO] [stdout] 50 | bfs(root).unwrap_or_else(|err| { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_err` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/backtracking/medium/task_2516.rs:38:13 [INFO] [stdout] | [INFO] [stdout] 38 | let mut bytes = s.as_bytes().clone(); [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/graph/medium/maximum_total_importance_of_roads_2285.rs:4:47 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn maximum_importance_shorter(n: i32, mut roads: Vec>) -> i64 { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `process_line` is never used [INFO] [stdout] --> src/main.rs:27:4 [INFO] [stdout] | [INFO] [stdout] 27 | fn process_line(line: &str, re: &Regex, counts: &mut BTreeMap) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/sum_of_square_numbers_633.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `judge_square_sum_binary_search`, `binary_search`, `judge_square_sum_sqrt`, `judge_square_sum_tle`, and `judge_square_sum_brute_force` are never used [INFO] [stdout] --> src/math/medium/sum_of_square_numbers_633.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | [INFO] [stdout] 7 | pub fn judge_square_sum_binary_search(c: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn binary_search(s: i64, e: i64, n: i64) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | pub fn judge_square_sum_sqrt(c: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | pub fn judge_square_sum_tle(c: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | pub fn judge_square_sum_brute_force(c: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/task_592.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `fraction_addition` and `gcd` are never used [INFO] [stdout] --> src/math/medium/task_592.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn fraction_addition(expression: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | pub fn gcd(a: i32, b: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/math/medium/task_1290.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 2 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/math/medium/task_1290.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | #[inline] [INFO] [stdout] 9 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/task_1290.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 14 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `get_decimal_value_bit` and `get_decimal_value` are never used [INFO] [stdout] --> src/math/medium/task_1290.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 30 | pub fn get_decimal_value_bit(mut head: Option>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | pub fn get_decimal_value(mut head: Option>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/tasl_869.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `reordered_power_of2_faster` and `reordered_power_of2` are never used [INFO] [stdout] --> src/math/medium/tasl_869.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn reordered_power_of2_faster(mut n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | pub fn reordered_power_of2(mut n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/task_2438.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `product_queries` is never used [INFO] [stdout] --> src/math/medium/task_2438.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn product_queries(n: i32, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/task_611.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `triangle_number_brute_force` and `triangle_number` are never used [INFO] [stdout] --> src/math/medium/task_611.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn triangle_number_brute_force(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn triangle_number(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/task_120.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_total` is never used [INFO] [stdout] --> src/math/medium/task_120.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn minimum_total(triangle: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/task_2048.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `next_beautiful_number` is never used [INFO] [stdout] --> src/math/medium/task_2048.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn next_beautiful_number(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_476.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_complement` is never used [INFO] [stdout] --> src/math/easy/task_476.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_complement(num: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_231.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_power_of_two` is never used [INFO] [stdout] --> src/math/easy/task_231.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_power_of_two(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_1317.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_no_zero_integers` is never used [INFO] [stdout] --> src/math/easy/task_1317.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn get_no_zero_integers(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/graph/medium/all_ancestors_of_node_in_directec_acyclic_graph_2192.rs:85:26 [INFO] [stdout] | [INFO] [stdout] 85 | for (&k, mut v) in collector.iter_mut() { [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_1304.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sum_zero` is never used [INFO] [stdout] --> src/math/easy/task_1304.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn sum_zero(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_812.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `largest_triangle_area` is never used [INFO] [stdout] --> src/math/easy/task_812.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn largest_triangle_area(points: Vec>) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_976.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `largest_perimeter_brute_force` and `largest_perimeter` are never used [INFO] [stdout] --> src/math/easy/task_976.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn largest_perimeter_brute_force(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn largest_perimeter(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_1518.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_water_bottles` and `num_water_bottles_one_line` are never used [INFO] [stdout] --> src/math/easy/task_1518.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn num_water_bottles(mut num_bottles: i32, num_exchange: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | pub fn num_water_bottles_one_line(mut num_bottles: i32, num_exchange: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_3370.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `smallest_number` is never used [INFO] [stdout] --> src/math/easy/task_3370.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn smallest_number(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `climb_stairs` is never used [INFO] [stdout] --> src/dynamic_programming/easy/climbing_stairs_70.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/easy/n_th_tribonacci_number_1137.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `tribonacci` is never used [INFO] [stdout] --> src/dynamic_programming/easy/n_th_tribonacci_number_1137.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn tribonacci(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rob` is never used [INFO] [stdout] --> src/dynamic_programming/medium/house_robber.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/longest_ideal_subsequence_2370.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `longest_ideal_string`, `longest_ideal_string_tle`, and `longest_ideal_string_recursive_tle` are never used [INFO] [stdout] --> src/dynamic_programming/medium/longest_ideal_subsequence_2370.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn longest_ideal_string(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | pub fn longest_ideal_string_tle(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | pub fn longest_ideal_string_recursive_tle(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_494.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_target_sum_ways` is never used [INFO] [stdout] --> src/dynamic_programming/medium/task_494.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_target_sum_ways(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_1014.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_score_sightseeing_pair` and `max_score_sightseeing_pair_brute_force` are never used [INFO] [stdout] --> src/dynamic_programming/medium/task_1014.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn max_score_sightseeing_pair(values: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | pub fn max_score_sightseeing_pair_brute_force(values: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_416.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_partition` is never used [INFO] [stdout] --> src/dynamic_programming/medium/task_416.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn can_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_790.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `MOD`, `num_tilings`, and `count_dominoes` are never used [INFO] [stdout] --> src/dynamic_programming/medium/task_790.rs:4:11 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 4 | const MOD: i64 = 1_000_000_007; [INFO] [stdout] | ^^^ [INFO] [stdout] 5 | [INFO] [stdout] 6 | pub fn num_tilings(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 11 | fn count_dominoes(sum: i32, n: i32, is_gap: bool, dp: &mut Vec<[Option; 2]>) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_3201.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `maximum_length_faster` and `maximum_length` are never used [INFO] [stdout] --> src/dynamic_programming/medium/task_3201.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn maximum_length_faster(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn maximum_length(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_808.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `soup_servings` is never used [INFO] [stdout] --> src/dynamic_programming/medium/task_808.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn soup_servings(n: i32) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_2787.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `number_of_ways` is never used [INFO] [stdout] --> src/dynamic_programming/medium/task_2787.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn number_of_ways(n: i32, x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_1578.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_cost` is never used [INFO] [stdout] --> src/dynamic_programming/medium/task_1578.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_cost(colors: String, needed_time: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_474.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_max_form` and `dp_helper` are never used [INFO] [stdout] --> src/dynamic_programming/medium/task_474.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn find_max_form(strs: Vec, m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | fn dp_helper( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `number_of_arithmetic_slices` is never used [INFO] [stdout] --> src/dynamic_programming/hard/arithmetic_slices_2_subsequence.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn number_of_arithmetic_slices(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/hard/minimum_falling_path_sum_2_1289.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_falling_path_sum` is never used [INFO] [stdout] --> src/dynamic_programming/hard/minimum_falling_path_sum_2_1289.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_falling_path_sum(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/hard/freedom_trail_514.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_steps`, `rotate_dial`, `find_rotate_steps_top_down`, and `find_rotate_steps` are never used [INFO] [stdout] --> src/dynamic_programming/hard/freedom_trail_514.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | fn count_steps(current: usize, next: usize, ring_length: usize) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | fn rotate_dial(cache: &mut Vec>, ring_index: usize, key_index: usize, ring: &[u8], key: &[u8]) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | pub fn find_rotate_steps_top_down(ring: String, key: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | 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/dynamic_programming/hard/task_1639.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_ways` is never used [INFO] [stdout] --> src/dynamic_programming/hard/task_1639.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn num_ways(words: Vec, target: String) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/hard/task_1900.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `earliest_and_latest` and `dp` are never used [INFO] [stdout] --> src/dynamic_programming/hard/task_1900.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn earliest_and_latest(n: i32, first_player: i32, second_player: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 19 | fn dp( [INFO] [stdout] | ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `create_prefix_sum` is never used [INFO] [stdout] --> src/array.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn create_prefix_sum(nums: &Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sorted_squares` is never used [INFO] [stdout] --> src/array/easy/squares_of_sorted_array_977.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn sorted_squares(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sorted_squares_sort` is never used [INFO] [stdout] --> src/array/easy/squares_of_sorted_array_977.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn sorted_squares_sort(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_frequency_elements` is never used [INFO] [stdout] --> src/array/easy/count_elements_with_maximum_frequency_3005.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn max_frequency_elements(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_common` is never used [INFO] [stdout] --> src/array/easy/minimum_common_value_2540.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn get_common(nums1: Vec, nums2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `intersection` is never used [INFO] [stdout] --> src/array/easy/intersect_of_two_arrays_349.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn intersection(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `intersection_hash_set` is never used [INFO] [stdout] --> src/array/easy/intersect_of_two_arrays_349.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn intersection_hash_set(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/find_the_pivot_integer_2485.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `pivot_integer` and `pivot_integer_better` are never used [INFO] [stdout] --> src/array/easy/find_the_pivot_integer_2485.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn pivot_integer(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | pub fn pivot_integer_better(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/number_of_students_unable_to_eat_lunch_1700.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_students` is never used [INFO] [stdout] --> src/array/easy/number_of_students_unable_to_eat_lunch_1700.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_students(students: Vec, sandwiches: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/time_needed_to_buy_tickets_2073.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `time_required_to_buy` and `time_required_to_buy_without_while_cycle` are never used [INFO] [stdout] --> src/array/easy/time_needed_to_buy_tickets_2073.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn time_required_to_buy(tickets: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | pub fn time_required_to_buy_without_while_cycle(tickets: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/island_perimeter_463.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `island_perimeter_iterative` is never used [INFO] [stdout] --> src/array/easy/island_perimeter_463.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn island_perimeter_iterative(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `island_perimeter`, `dfs`, and `is_boarders_violated` are never used [INFO] [stdout] --> src/array/easy/island_perimeter_463.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 25 | pub fn island_perimeter(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn dfs(grid: &mut Vec>, row: usize, col: usize) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | fn is_boarders_violated(grid: &Vec>, row: i32, col: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/relative_ranks_506.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_relative_ranks` and `find_relative_ranks_binary_search` are never used [INFO] [stdout] --> src/array/easy/relative_ranks_506.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn find_relative_ranks(scores: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn find_relative_ranks_binary_search(scores: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/largest_local_values_in_a_matrix_2373.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `largest_local` is never used [INFO] [stdout] --> src/array/easy/largest_local_values_in_a_matrix_2373.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn largest_local(grid: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/sum_of_all_subset_xor_totals_1863.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `subset_xor_sum_short`, `subset_xor_sum`, `backtrack`, and `calculate_xor` are never used [INFO] [stdout] --> src/array/easy/sum_of_all_subset_xor_totals_1863.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | [INFO] [stdout] 7 | pub fn subset_xor_sum_short(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 11 | pub fn subset_xor_sum(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | fn backtrack(nums: &Vec, temp: &mut VecDeque, start: usize, result: &mut i32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | fn calculate_xor(temp: &VecDeque) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/special_array_with_x_elements_greater_than_or_equal_x_1608.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `special_array` is never used [INFO] [stdout] --> src/array/easy/special_array_with_x_elements_greater_than_or_equal_x_1608.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn special_array(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/height_checker_1051.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `height_checker` and `height_checker_b_tree` are never used [INFO] [stdout] --> src/array/easy/height_checker_1051.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn height_checker(heights: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn height_checker_b_tree(heights: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/relative_sort_array_1122.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `relative_sort_array` is never used [INFO] [stdout] --> src/array/easy/relative_sort_array_1122.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn relative_sort_array(arr1: Vec, arr2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/intersection_of_two_arrays_2_350.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `intersect` is never used [INFO] [stdout] --> src/array/easy/intersection_of_two_arrays_2_350.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn intersect(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/pass_the_pillow_2582.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `pass_the_pillow_math` and `pass_the_pillow` are never used [INFO] [stdout] --> src/array/easy/pass_the_pillow_2582.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn pass_the_pillow_math(n: i32, mut time: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | pub fn pass_the_pillow(n: i32, mut time: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/crawler_log_folder_1598.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_operations_only_step` and `min_operations` are never used [INFO] [stdout] --> src/array/easy/crawler_log_folder_1598.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn min_operations_only_step(logs: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | pub fn min_operations(logs: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/lucky_numbers_in_matrix_1380.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lucky_numbers` is never used [INFO] [stdout] --> src/array/easy/lucky_numbers_in_matrix_1380.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn lucky_numbers(matrix: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/make_two_arrays_equal_by_reversing_subarrays_1460.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_be_equal` is never used [INFO] [stdout] --> src/array/easy/make_two_arrays_equal_by_reversing_subarrays_1460.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn can_be_equal(target: Vec, arr: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `KthLargest` is never constructed [INFO] [stdout] --> src/array/easy/task_703.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct KthLargest { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `add` are never used [INFO] [stdout] --> src/array/easy/task_703.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl KthLargest { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 9 | fn new(k: i32, nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn add(&mut self, val: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1331.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `array_rank_transform` is never used [INFO] [stdout] --> src/array/easy/task_1331.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn array_rank_transform(mut arr: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2558.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `pick_gifts` and `floor_sqrt` are never used [INFO] [stdout] --> src/array/easy/task_2558.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn pick_gifts(gifts: Vec, mut k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn floor_sqrt(n: i64) -> i64 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3264.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `get_final_state` and `get_final_state_no_struct` are never used [INFO] [stdout] --> src/array/easy/task_3264.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | pub fn get_final_state(mut nums: Vec, mut k: i32, multiplier: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn get_final_state_no_struct(mut nums: Vec, mut k: i32, multiplier: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Element` is never constructed [INFO] [stdout] --> src/array/easy/task_3264.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | struct Element { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/array/easy/task_3264.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 46 | impl Element { [INFO] [stdout] | ------------ associated function in this implementation [INFO] [stdout] 47 | fn new(number: i32, idx: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2762.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `continuous_subarrays` and `continuous_subarrays_tle` are never used [INFO] [stdout] --> src/array/easy/task_2762.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn continuous_subarrays(nums: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn continuous_subarrays_tle(nums: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1475.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `final_prices` and `final_prices_faster` are never used [INFO] [stdout] --> src/array/easy/task_1475.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn final_prices(mut prices: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn final_prices_faster(mut prices: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3151.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_array_special` and `is_array_special_declarative` are never used [INFO] [stdout] --> src/array/easy/task_3151.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn is_array_special(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | pub fn is_array_special_declarative(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1752.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `check_find_smallest` and `check` are never used [INFO] [stdout] --> src/array/easy/task_1752.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn check_find_smallest(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | pub fn check(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2529.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `maximum_count` and `maximum_count_shorter` are never used [INFO] [stdout] --> src/array/easy/task_2529.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn maximum_count(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | pub fn maximum_count_shorter(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2206.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `divide_array` is never used [INFO] [stdout] --> src/array/easy/task_2206.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn divide_array(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2873.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `maximum_triplet_value` and `maximum_triplet_value_sort` are never used [INFO] [stdout] --> src/array/easy/task_2873.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn maximum_triplet_value(nums: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | pub fn maximum_triplet_value_sort(mut nums: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1863.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `subset_xor_sum` and `subset_xor_sum_faster` are never used [INFO] [stdout] --> src/array/easy/task_1863.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn subset_xor_sum(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn subset_xor_sum_faster(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3375.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_operations` is never used [INFO] [stdout] --> src/array/easy/task_3375.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn min_operations(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3396.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_operations` is never used [INFO] [stdout] --> src/array/easy/task_3396.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn minimum_operations(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2843.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_symmetric_integers_faster` and `count_symmetric_integers` are never used [INFO] [stdout] --> src/array/easy/task_2843.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn count_symmetric_integers_faster(low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn count_symmetric_integers(low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1534.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_good_triplets` is never used [INFO] [stdout] --> src/array/easy/task_1534.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_good_triplets(arr: Vec, a: i32, b: i32, c: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2176.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_pairs` and `count_pairs_faster` are never used [INFO] [stdout] --> src/array/easy/task_2176.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn count_pairs(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn count_pairs_faster(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3392.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_subarrays` is never used [INFO] [stdout] --> src/array/easy/task_3392.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_subarrays(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1128.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/array/easy/task_1128.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | pub struct Pair { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_equiv_domino_pairs_brute_force` and `num_equiv_domino_pairs` are never used [INFO] [stdout] --> src/array/easy/task_1128.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 37 | pub fn num_equiv_domino_pairs_brute_force(dominoes: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | pub fn num_equiv_domino_pairs(dominoes: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1550.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `three_consecutive_odds` is never used [INFO] [stdout] --> src/array/easy/task_1550.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn three_consecutive_odds(arr: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2094.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_even_numbers` is never used [INFO] [stdout] --> src/array/easy/task_2094.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn find_even_numbers(digits: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3423.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_adjacent_distance` is never used [INFO] [stdout] --> src/array/easy/task_3423.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_adjacent_distance(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_594.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 8 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_lhs` and `find_lhs_shorter` are never used [INFO] [stdout] --> src/array/easy/task_594.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 11 | pub fn find_lhs(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn find_lhs_shorter(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1394.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_lucky` is never used [INFO] [stdout] --> src/array/easy/task_1394.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_lucky(arr: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3487.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_sum` and `max_sum_sorting` are never used [INFO] [stdout] --> src/array/easy/task_3487.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn max_sum(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | pub fn max_sum_sorting(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2210.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_hills_valleys` is never used [INFO] [stdout] --> src/array/easy/task_2210.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_hills_valleys(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3005.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_frequency_elements` and `max_frequency_elements_vec` are never used [INFO] [stdout] --> src/array/easy/task_3005.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn max_frequency_elements(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn max_frequency_elements_vec(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3349.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `has_increasing_subarrays` is never used [INFO] [stdout] --> src/array/easy/task_3349.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn has_increasing_subarrays(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3461.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `has_same_digits` is never used [INFO] [stdout] --> src/array/easy/task_3461.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn has_same_digits(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1716.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `total_money` is never used [INFO] [stdout] --> src/array/easy/task_1716.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn total_money(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3354.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_valid_selections_prefix_sum` and `count_valid_selections` are never used [INFO] [stdout] --> src/array/easy/task_3354.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn count_valid_selections_prefix_sum(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn count_valid_selections(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3289.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_sneaky_numbers` is never used [INFO] [stdout] --> src/array/easy/task_3289.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn get_sneaky_numbers(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3318.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_x_sum` is never used [INFO] [stdout] --> src/array/easy/task_3318.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | pub fn find_x_sum(nums: Vec, k: i32, x: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1437.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `k_length_apart` is never used [INFO] [stdout] --> src/array/easy/task_1437.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn k_length_apart(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_717.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_one_bit_character` is never used [INFO] [stdout] --> src/array/easy/task_717.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_one_bit_character(bits: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2154.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_final_value` and `find_final_value_hash_map` are never used [INFO] [stdout] --> src/array/easy/task_2154.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn find_final_value(mut nums: Vec, mut original: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | pub fn find_final_value_hash_map(nums: Vec, mut original: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3190.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_operations` is never used [INFO] [stdout] --> src/array/easy/task_3190.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn minimum_operations(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1018.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `prefixes_div_by5` is never used [INFO] [stdout] --> src/array/easy/task_1018.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn prefixes_div_by5(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_winners` is never used [INFO] [stdout] --> src/array/medium/find_players_with_zero_or_one_losses_2225.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn find_winners(matches: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `product_except_self` is never used [INFO] [stdout] --> src/array/medium/product_of_array_except_self_238.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn product_except_self(mut nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_max_length_shorter` is never used [INFO] [stdout] --> src/array/medium/contiguous_array_525.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn find_max_length_shorter(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_max_length` is never used [INFO] [stdout] --> src/array/medium/contiguous_array_525.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn find_max_length(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_max_length_brute_force` is never used [INFO] [stdout] --> src/array/medium/contiguous_array_525.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn find_max_length_brute_force(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insert` is never used [INFO] [stdout] --> src/array/medium/insert_inteval_57.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn insert(mut intervals: Vec>, new_interval: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_min_arrow_shots` is never used [INFO] [stdout] --> src/array/medium/minimum_number_of_arrows_to_burst_balloons_452.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn find_min_arrow_shots(mut points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_min_arrow_shots_stack` is never used [INFO] [stdout] --> src/array/medium/minimum_number_of_arrows_to_burst_balloons_452.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn find_min_arrow_shots_stack(mut points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_intersect` is never used [INFO] [stdout] --> src/array/medium/minimum_number_of_arrows_to_burst_balloons_452.rs:34:4 [INFO] [stdout] | [INFO] [stdout] 34 | fn is_intersect(from_stack: &Vec, next: &Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `least_interval` is never used [INFO] [stdout] --> src/array/medium/task_scheduler_621.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn least_interval(tasks: Vec, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_subarray_length` is never used [INFO] [stdout] --> src/array/medium/length_of_longest_subarray_with_most_k_frequency_2958.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn max_subarray_length(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `count_subarrays` is never used [INFO] [stdout] --> src/array/medium/count_subarrays_where_max_element_appears_at_least_k_times_2962.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn count_subarrays(nums: Vec, k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/number_of_islands_200.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_islands` is never used [INFO] [stdout] --> src/array/medium/number_of_islands_200.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/find_all_groups_of_farmland_1992.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_farmland_no_recursion` and `find_farmland` are never used [INFO] [stdout] --> src/array/medium/find_all_groups_of_farmland_1992.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 5 | pub fn find_farmland_no_recursion(mut land: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn find_farmland(mut land: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/minimum_number_of_operations_to_make_array_xor_equal_to_k_2997.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_operations` is never used [INFO] [stdout] --> src/array/medium/minimum_number_of_operations_to_make_array_xor_equal_to_k_2997.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, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/maximize_happiness_of_selected_children_3075.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `maximum_happiness_sum` and `maximum_happiness_sum_more_readable` are never used [INFO] [stdout] --> src/array/medium/maximize_happiness_of_selected_children_3075.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn maximum_happiness_sum(mut happiness: Vec, mut k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn maximum_happiness_sum_more_readable(mut happiness: Vec, mut k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/k_th_smallest_prime_fraction_786.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `kth_smallest_prime_fraction` is never used [INFO] [stdout] --> src/array/medium/k_th_smallest_prime_fraction_786.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn kth_smallest_prime_fraction(mut arr: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Fraction` is never constructed [INFO] [stdout] --> src/array/medium/k_th_smallest_prime_fraction_786.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Fraction { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `into_vec` and `build` are never used [INFO] [stdout] --> src/array/medium/k_th_smallest_prime_fraction_786.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 29 | impl Fraction { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 30 | fn into_vec(self) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn build(numerator: i32, denominator: i32) -> Fraction { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/score_after_flipping_matrix_861.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `matrix_score` and `matrix_score_brute_force` are never used [INFO] [stdout] --> src/array/medium/score_after_flipping_matrix_861.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn matrix_score(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | pub fn matrix_score_brute_force(mut grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/count_triplets_that_can_form_two_arrays_of_equal_xor_1442.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_triplets` is never used [INFO] [stdout] --> src/array/medium/count_triplets_that_can_form_two_arrays_of_equal_xor_1442.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_triplets(arr: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/single_number_3_260.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `single_number` and `single_number_bit_manipulation` are never used [INFO] [stdout] --> src/array/medium/single_number_3_260.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn single_number(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn single_number_bit_manipulation(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/hand_of_straights_846.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_n_straight_hand` and `is_n_straight_hand_faster` are never used [INFO] [stdout] --> src/array/medium/hand_of_straights_846.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | pub fn is_n_straight_hand(mut hand: Vec, group_size: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn is_n_straight_hand_faster(hand: Vec, group_size: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/continuous_subarray_sum_523.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `check_subarray_sum` is never used [INFO] [stdout] --> src/array/medium/continuous_subarray_sum_523.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn check_subarray_sum(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/subarray_sums_divisible_by_k_974.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `subarrays_div_by_k`, `subarrays_div_by_k_no_prefix_sum_array`, and `subarrays_div_by_k_tle` are never used [INFO] [stdout] --> src/array/medium/subarray_sums_divisible_by_k_974.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn subarrays_div_by_k(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | pub fn subarrays_div_by_k_no_prefix_sum_array(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | pub fn subarrays_div_by_k_tle(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/minimum_increment_to_make_array_unique_945.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_increment_for_unique`, `min_increment_for_unique_sort`, and `min_increment_for_unique_tle` are never used [INFO] [stdout] --> src/array/medium/minimum_increment_to_make_array_unique_945.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn min_increment_for_unique(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn min_increment_for_unique_sort(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn min_increment_for_unique_tle(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/count_number_of_nice_subarrays_1248.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `number_of_subarrays`, `number_of_subarrays_prefix_sum`, and `number_of_subarrays_tle` are never used [INFO] [stdout] --> src/array/medium/count_number_of_nice_subarrays_1248.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn number_of_subarrays(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn number_of_subarrays_prefix_sum(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | pub fn number_of_subarrays_tle(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit_1438.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `longest_subarray` and `longest_subarray_tle` are never used [INFO] [stdout] --> src/array/medium/longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit_1438.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn longest_subarray(nums: Vec, limit: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | pub fn longest_subarray_tle(nums: Vec, limit: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/minimum_difference_between_largest_and_smallest_value_in_three_moves_1509.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_difference_sort` and `min_difference` are never used [INFO] [stdout] --> src/array/medium/minimum_difference_between_largest_and_smallest_value_in_three_moves_1509.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | [INFO] [stdout] 5 | pub fn min_difference_sort(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn min_difference(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/find_the_winner_of_the_circular_game_1823.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_the_winner` is never used [INFO] [stdout] --> src/array/medium/find_the_winner_of_the_circular_game_1823.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_the_winner(n: i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/count_number_of_teams_1395.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_teams` and `num_teams_brute_force` are never used [INFO] [stdout] --> src/array/medium/count_number_of_teams_1395.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn num_teams(rating: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn num_teams_brute_force(rating: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/filling_bookcase_shelves_1105.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_height_shelves` is never used [INFO] [stdout] --> src/array/medium/filling_bookcase_shelves_1105.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn min_height_shelves(books: Vec>, shelf_width: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MODULUS` is never used [INFO] [stdout] --> src/array/medium/range_sum_of_sorted_subarray_sums_1508.rs:3:7 [INFO] [stdout] | [INFO] [stdout] 3 | const MODULUS: i64 = (10e8 + 7f64) as i64; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/range_sum_of_sorted_subarray_sums_1508.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `range_sum` and `range_sum_sliding_window` are never used [INFO] [stdout] --> src/array/medium/range_sum_of_sorted_subarray_sums_1508.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 8 | pub fn range_sum(nums: Vec, n: i32, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | pub fn range_sum_sliding_window(nums: Vec, n: i32, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_40.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `combination_sum2` and `backtracking` are never used [INFO] [stdout] --> src/array/medium/task_40.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn combination_sum2(mut candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | fn backtracking(result: &mut Vec>, candidates: &mut Vec, temp: &mut Vec, target: i32, n: usize, start: usize) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_624.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_distance` and `max_distance_brute_force` are never used [INFO] [stdout] --> src/array/medium/task_624.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn max_distance(arrays: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn max_distance_brute_force(arrays: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_264.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `nth_ugly_number_brute_force` and `nth_ugly_number` are never used [INFO] [stdout] --> src/array/medium/task_264.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn nth_ugly_number_brute_force(mut n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | pub fn nth_ugly_number(mut n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1140.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `stone_game_ii` is never used [INFO] [stdout] --> src/array/medium/task_1140.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn stone_game_ii(mut piles: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1937.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_points` and `pick` are never used [INFO] [stdout] --> src/array/medium/task_1937.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn max_points(points: Vec>) -> i64 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 9 | fn pick(points: &Vec>, current_row: usize, previous_col: i32, cache: &mut Vec>) -> i64 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1894.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `chalk_replacer` and `chalk_replacer_faster` are never used [INFO] [stdout] --> src/array/medium/task_1894.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn chalk_replacer(chalk: Vec, mut k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn chalk_replacer_faster(chalk: Vec, mut k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_874.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `robot_sim` is never used [INFO] [stdout] --> src/array/medium/task_874.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn robot_sim(commands: Vec, obstacles: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2028.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `missing_rolls` is never used [INFO] [stdout] --> src/array/medium/task_2028.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn missing_rolls(mut rolls: Vec, mean: i32, n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1310.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `xor_queries` is never used [INFO] [stdout] --> src/array/medium/task_1310.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn xor_queries(mut arr: Vec, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_386.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lexical_order` is never used [INFO] [stdout] --> src/array/medium/task_386.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn lexical_order(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCalendar` is never constructed [INFO] [stdout] --> src/array/medium/task_729.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct MyCalendar { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `book` are never used [INFO] [stdout] --> src/array/medium/task_729.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl MyCalendar { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 13 | [INFO] [stdout] 14 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn book(&mut self, start: i32, end: i32) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCalendarTwo` is never constructed [INFO] [stdout] --> src/array/medium/task_731.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct MyCalendarTwo { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `book` are never used [INFO] [stdout] --> src/array/medium/task_731.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl MyCalendarTwo { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 7 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 11 | fn book(&mut self, start: i32, end: i32) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCircularDeque` is never constructed [INFO] [stdout] --> src/array/medium/task_641.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct MyCircularDeque { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/array/medium/task_641.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 14 | impl MyCircularDeque { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 15 | [INFO] [stdout] 16 | fn new(k: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | fn insert_front(&mut self, value: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn insert_last(&mut self, value: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn delete_front(&mut self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | fn delete_last(&mut self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn get_front(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn get_rear(&self) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn is_full(&self) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `CustomStack` is never constructed [INFO] [stdout] --> src/array/medium/task_1381.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct CustomStack { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, and `increment` are never used [INFO] [stdout] --> src/array/medium/task_1381.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl CustomStack { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 11 | fn new(max_size: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | fn increment(&mut self, k: i32, val: i32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2275.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `largest_combination` and `count_bits` are never used [INFO] [stdout] --> src/array/medium/task_2275.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn largest_combination(candidates: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | fn count_bits(mut num: i32, bit_counts: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1829.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_maximum_xor` is never used [INFO] [stdout] --> src/array/medium/task_1829.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn get_maximum_xor(nums: Vec, maximum_bit: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3097.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `update_counts`, `counts_to_num`, and `minimum_subarray_length` are never used [INFO] [stdout] --> src/array/medium/task_3097.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn update_counts(counter_arr: &mut Vec, mut val: i32, delta: i32) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | fn counts_to_num(counter_arr: &Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | pub fn minimum_subarray_length(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2070.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `maximum_beauty` and `maximum_beauty_brute_force` are never used [INFO] [stdout] --> src/array/medium/task_2070.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn maximum_beauty(mut items: Vec>, queries: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 15 | pub fn maximum_beauty_brute_force(items: Vec>, queries: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3254.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `results_array` is never used [INFO] [stdout] --> src/array/medium/task_3254.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn results_array(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1861.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `rotate_the_box`, `move_stones`, and `rotate_matrix` are never used [INFO] [stdout] --> src/array/medium/task_1861.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn rotate_the_box(mut matrix: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | fn move_stones(matrix: &mut Vec>, i: usize, start: usize, end: usize, total_stones: &mut i32) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn rotate_matrix(matrix: Vec>, row: usize, col: usize) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1975.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_matrix_sum` is never used [INFO] [stdout] --> src/array/medium/task_1975.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_matrix_sum(matrix: Vec>) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2554.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_count` and `max_count_only_set` are never used [INFO] [stdout] --> src/array/medium/task_2554.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | // beat 100% [INFO] [stdout] 7 | pub fn max_count(banned: Vec, n: i32, max_sum: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn max_count_only_set(banned: Vec, n: i32, max_sum: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1760.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `minimum_size`, `minimum_size_brute_force_binary_search`, `minimum_size_brute_force_second`, `can_divide`, `minimum_size_brute_force`, and `dfs` are never used [INFO] [stdout] --> src/array/medium/task_1760.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn minimum_size(nums: Vec, max_operations: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn minimum_size_brute_force_binary_search(nums: Vec, max_operations: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | pub fn minimum_size_brute_force_second(nums: Vec, max_operations: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | fn can_divide(nums: &Vec, max_balls: i32, max_operations: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | pub fn minimum_size_brute_force(mut nums: Vec, max_operations: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn dfs(nums: &mut Vec, max_operations: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3152.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_array_special` is never used [INFO] [stdout] --> src/array/medium/task_3152.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_array_special(nums: Vec, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2779.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `maximum_beauty` and `maximum_beauty_brute_force` are never used [INFO] [stdout] --> src/array/medium/task_2779.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn maximum_beauty(mut nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn maximum_beauty_brute_force(mut nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1792.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_average_ratio` is never used [INFO] [stdout] --> src/array/medium/task_1792.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_average_ratio(classes: Vec>, extra_students: i32) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `OrderedF64` is never constructed [INFO] [stdout] --> src/array/medium/task_1792.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | struct OrderedF64(f64); [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_769.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_chunks_to_sorted_short` and `max_chunks_to_sorted` are never used [INFO] [stdout] --> src/array/medium/task_769.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn max_chunks_to_sorted_short(arr: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn max_chunks_to_sorted(arr: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2270.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `ways_to_split_array` and `ways_to_split_array_optimized` are never used [INFO] [stdout] --> src/array/medium/task_2270.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn ways_to_split_array(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | pub fn ways_to_split_array_optimized(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2657.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_the_prefix_common_array` and `find_the_prefix_common_array_frequency_array` are never used [INFO] [stdout] --> src/array/medium/task_2657.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn find_the_prefix_common_array(a: Vec, b: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn find_the_prefix_common_array_frequency_array(a: Vec, b: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2661.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `first_complete_index`, `first_complete_index_counter`, `first_complete_index_brute_force`, `check_row`, and `check_column` are never used [INFO] [stdout] --> src/array/medium/task_2661.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn first_complete_index(arr: Vec, mat: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | pub fn first_complete_index_counter(arr: Vec, mat: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | pub fn first_complete_index_brute_force(arr: Vec, mut mat: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 93 | fn check_row(row: usize, mat: &Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 97 | fn check_column(col: usize, mat: &Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2948.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lexicographically_smallest_array` is never used [INFO] [stdout] --> src/array/medium/task_2948.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn lexicographically_smallest_array(mut nums: Vec, limit: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1462.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_prerequisite` and `check_if_prerequisite` are never used [INFO] [stdout] --> src/array/medium/task_1462.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | fn is_prerequisite( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn check_if_prerequisite( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2658.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_max_fish` is never used [INFO] [stdout] --> src/array/medium/task_2658.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_max_fish(mut grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3160.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `query_results` is never used [INFO] [stdout] --> src/array/medium/task_3160.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn query_results(limit: i32, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2364.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_bad_pairs` and `count_bad_pairs_tle` are never used [INFO] [stdout] --> src/array/medium/task_2364.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn count_bad_pairs(nums: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | pub fn count_bad_pairs_tle(nums: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3066.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/array/medium/task_3066.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, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1749.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_absolute_sum` is never used [INFO] [stdout] --> src/array/medium/task_1749.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_absolute_sum(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3208.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `number_of_alternating_groups` is never used [INFO] [stdout] --> src/array/medium/task_3208.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn number_of_alternating_groups(mut colors: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3306.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_of_substrings_faster`, `is_vowel`, and `count_of_substrings` are never used [INFO] [stdout] --> src/array/medium/task_3306.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn count_of_substrings_faster(word: String, k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 77 | fn is_vowel(c: char) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | 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/array/medium/task_1358.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `number_of_substrings` and `number_of_substrings_brute_force` are never used [INFO] [stdout] --> src/array/medium/task_1358.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn number_of_substrings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | pub fn number_of_substrings_brute_force(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2560.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_capability` is never used [INFO] [stdout] --> src/array/medium/task_2560.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_capability(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2594.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `repair_cars` and `can_repair_in_time` are never used [INFO] [stdout] --> src/array/medium/task_2594.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn repair_cars(ranks: Vec, cars: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | fn can_repair_in_time(time: i64, ranks: &Vec, cars: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2401.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `longest_nice_subarray` and `longest_nice_subarray_brute_force` are never used [INFO] [stdout] --> src/array/medium/task_2401.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn longest_nice_subarray(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | pub fn longest_nice_subarray_brute_force(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3191.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/array/medium/task_3191.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_operations(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2115.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_all_recipes_faster`, `search`, and `find_all_recipes` are never used [INFO] [stdout] --> src/array/medium/task_2115.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn find_all_recipes_faster( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | fn search<'a>( [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | pub fn find_all_recipes( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3169.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_days_line_sweep`, `count_days_line_sort_merge`, and `count_days_brute_force_sort` are never used [INFO] [stdout] --> src/array/medium/task_3169.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn count_days_line_sweep(mut days: i32, meetings: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 19 | pub fn count_days_line_sort_merge(mut days: i32, mut meetings: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | pub fn count_days_brute_force_sort(days: i32, mut meetings: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_368.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `largest_divisible_subset` and `largest_divisible_subset_dp` are never used [INFO] [stdout] --> src/array/medium/task_368.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn largest_divisible_subset(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn largest_divisible_subset_dp(mut nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1922.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_good_numbers` is never used [INFO] [stdout] --> src/array/medium/task_1922.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_good_numbers(n: i64) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2537.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_good` is never used [INFO] [stdout] --> src/array/medium/task_2537.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_good(nums: Vec, k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_781.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_rabbits` is never used [INFO] [stdout] --> src/array/medium/task_781.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn num_rabbits(answers: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2145.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `number_of_arrays` is never used [INFO] [stdout] --> src/array/medium/task_2145.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn number_of_arrays(differences: Vec, lower: i32, upper: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2962.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_subarrays` is never used [INFO] [stdout] --> src/array/medium/task_2962.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_subarrays(nums: Vec, k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1007.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_domino_rotations` is never used [INFO] [stdout] --> src/array/medium/task_1007.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_domino_rotations(tops: Vec, bottoms: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2918.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_sum` is never used [INFO] [stdout] --> src/array/medium/task_2918.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_sum(nums1: Vec, nums2: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2616.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimize_max` is never used [INFO] [stdout] --> src/array/medium/task_2616.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn minimize_max(mut nums: Vec, mut p: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2966.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `divide_array` is never used [INFO] [stdout] --> src/array/medium/task_2966.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | pub fn divide_array(mut nums: Vec, k: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1498.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_subseq_easier`, `mod_pow`, `num_subseq`, and `num_subseq_brute_force` are never used [INFO] [stdout] --> src/array/medium/task_1498.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn num_subseq_easier(mut nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn mod_pow(mut base: u128, mut exp: u128, modulus: u128) -> u128 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 48 | pub fn num_subseq(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | pub fn num_subseq_brute_force(mut nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1353.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_events` is never used [INFO] [stdout] --> src/array/medium/task_1353.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | pub fn max_events(events: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3439.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 15 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_free_time` and `max_free_time_slower` are never used [INFO] [stdout] --> src/array/medium/task_3439.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 17 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 18 | pub fn max_free_time(event_time: i32, k: i32, start_time: Vec, end_time: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | pub fn max_free_time_slower(event_time: i32, k: i32, start_time: Vec, end_time: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2410.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 15 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `match_players_and_trainers` and `match_players_and_trainers_sort` are never used [INFO] [stdout] --> src/array/medium/task_2410.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 17 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 18 | pub fn match_players_and_trainers(players: Vec, trainers: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 47 | pub fn match_players_and_trainers_sort(mut players: Vec, mut trainers: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1695.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 12 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_unique_subarray` is never used [INFO] [stdout] --> src/array/medium/task_1695.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 15 | pub fn maximum_unique_subarray(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2044.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_max_or_subsets_shorter` and `count_max_or_subsets` are never used [INFO] [stdout] --> src/array/medium/task_2044.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn count_max_or_subsets_shorter(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn count_max_or_subsets(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3446.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sort_matrix` is never used [INFO] [stdout] --> src/array/medium/task_3446.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn sort_matrix(mut grid: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_36.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `SUDOKU_SIDE` is never used [INFO] [stdout] --> src/array/medium/task_36.rs:3:7 [INFO] [stdout] | [INFO] [stdout] 3 | const SUDOKU_SIDE: usize = 9; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_valid_sudoku`, `are_rows_valid`, `are_columns_valid`, `are_squares_valid`, and `is_square_valid` are never used [INFO] [stdout] --> src/array/medium/task_36.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn is_valid_sudoku(board: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | fn are_rows_valid(board: &Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | fn are_columns_valid(board: &Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | fn are_squares_valid(board: &Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | fn is_square_valid(board: &Vec>, row: usize, col: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2221.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `triangular_sum` is never used [INFO] [stdout] --> src/array/medium/task_2221.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn triangular_sum(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1039.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_score_triangulation` is never used [INFO] [stdout] --> src/array/medium/task_1039.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_score_triangulation(polygon_values: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3100.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_bottles_drunk` is never used [INFO] [stdout] --> src/array/medium/task_3100.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_bottles_drunk(num_bottles: i32, mut num_exchange: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_11.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_area` is never used [INFO] [stdout] --> src/array/medium/task_11.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_area(height: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_417.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 2 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `pacific_atlantic` and `dfs` are never used [INFO] [stdout] --> src/array/medium/task_417.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] ... [INFO] [stdout] 17 | pub fn pacific_atlantic(heights: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn dfs( [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1488.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `avoid_flood` is never used [INFO] [stdout] --> src/array/medium/task_1488.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 19 | pub fn avoid_flood(rains: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2300.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/graph/hard/sum_of_distances_in_tree_834.rs:33:45 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn sum_of_distances_in_tree(n: i32, mut edges: Vec>) -> Vec { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `successful_pairs_fast`, `binary_search`, and `successful_pairs` are never used [INFO] [stdout] --> src/array/medium/task_2300.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn successful_pairs_fast(mut spells: Vec, mut potions: Vec, success: i64) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | fn binary_search(arr: &Vec, to_add: i64, current_spell: i64) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | pub fn successful_pairs(spells: Vec, potions: Vec, success: i64) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3494.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_time` is never used [INFO] [stdout] --> src/array/medium/task_3494.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 7 | pub fn min_time(skill: Vec, mana: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2598.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_smallest_integer` is never used [INFO] [stdout] --> src/array/medium/task_2598.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_smallest_integer(nums: Vec, value: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3350.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_increasing_subarrays_faster` and `max_increasing_subarrays` are never used [INFO] [stdout] --> src/array/medium/task_3350.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn max_increasing_subarrays_faster(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 89 | pub fn max_increasing_subarrays(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3397.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_distinct_elements` and `max_distinct_elements_set` are never used [INFO] [stdout] --> src/array/medium/task_3397.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 15 | pub fn max_distinct_elements(mut nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn max_distinct_elements_set(mut nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3346.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_frequency` is never used [INFO] [stdout] --> src/array/medium/task_3346.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_frequency(nums: Vec, k: i32, num_operations: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2125.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `number_of_beams` is never used [INFO] [stdout] --> src/array/medium/task_2125.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn number_of_beams(bank: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3542.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_operations` is never used [INFO] [stdout] --> src/array/medium/task_3542.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn min_operations(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2654.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `gcd` and `min_operations` are never used [INFO] [stdout] --> src/array/medium/task_2654.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn gcd(mut a: i32, mut b: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 13 | pub fn min_operations(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_3228.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_operations` is never used [INFO] [stdout] --> src/array/medium/task_3228.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 36 | pub fn max_operations(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2536.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `range_add_queries_prefix_sum` and `range_add_queries` are never used [INFO] [stdout] --> src/array/medium/task_2536.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn range_add_queries_prefix_sum(n: i32, queries: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn range_add_queries(n: i32, queries: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1513.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_sub` and `num_sub_brute_force` are never used [INFO] [stdout] --> src/array/medium/task_1513.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn num_sub(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn num_sub_brute_force(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `subarrays_with_k_distinct` is never used [INFO] [stdout] --> src/array/hard/subarrays_with_k_different_integers.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn subarrays_with_k_distinct(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sliding_window_at_most` is never used [INFO] [stdout] --> src/array/hard/subarrays_with_k_different_integers.rs:7:4 [INFO] [stdout] | [INFO] [stdout] 7 | fn sliding_window_at_most(nums: &Vec, distinct_k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `count_subarrays` is never used [INFO] [stdout] --> src/array/hard/count_subarrays_with_fixed_bounds_2444.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn count_subarrays(nums: Vec, min_k: i32, max_k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `count_subarrays_second` is never used [INFO] [stdout] --> src/array/hard/count_subarrays_with_fixed_bounds_2444.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn count_subarrays_second(nums: Vec, min_k: i32, max_k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/hard/trapping_rain_water_42.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `trap` and `trap_shorter` are never used [INFO] [stdout] --> src/array/hard/trapping_rain_water_42.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn trap(height: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | pub fn trap_shorter(height: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/hard/maximal_rectangle_85.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximal_rectangle` is never used [INFO] [stdout] --> src/array/hard/maximal_rectangle_85.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn maximal_rectangle(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/hard/minimum_cost_to_hire_k_workers_857.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `edges` [INFO] [stdout] --> src/graph/hard/find_the_maximum_sum_of_node_values_3068.rs:4:54 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn maximum_value_sum(nums: Vec, k: i32, edges: Vec>) -> i64 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/graph.rs:36:13 [INFO] [stdout] | [INFO] [stdout] 36 | let mut count = 0; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `mincost_to_hire_workers` is never used [INFO] [stdout] --> src/array/hard/minimum_cost_to_hire_k_workers_857.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn mincost_to_hire_workers(quality: Vec, wage: Vec, k: i32) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/hard/patching_array_330.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_patches` is never used [INFO] [stdout] --> src/array/hard/patching_array_330.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_patches(nums: Vec, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/hard/task_440.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_kth_number` and `find_kth_number_tle` are never used [INFO] [stdout] --> src/array/hard/task_440.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn find_kth_number(n: i32, mut k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn find_kth_number_tle(n: i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/hard/task_862.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `shortest_subarray` and `shortest_subarray_fast` are never used [INFO] [stdout] --> src/array/hard/task_862.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn shortest_subarray(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn shortest_subarray_fast(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/hard/task_1526.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_number_operations` is never used [INFO] [stdout] --> src/array/hard/task_1526.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_number_operations(target: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/hard/task_3321.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `rebalance`, `remove_from_sets`, and `find_x_sum` are never used [INFO] [stdout] --> src/array/hard/task_3321.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] ... [INFO] [stdout] 14 | fn rebalance( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn remove_from_sets( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | pub fn find_x_sum(nums: Vec, k: i32, x: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `intersection_size_two_brute_force` is never used [INFO] [stdout] --> src/array/hard/task_757.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 57 | pub fn intersection_size_two_brute_force(intervals: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `first_uniq_char` is never used [INFO] [stdout] --> src/strings/easy/first_unique_character_in_string_387.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn first_uniq_char(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `min_operations` is never used [INFO] [stdout] --> src/strings/easy/minimum_changes_to_make_alternating_binary_string_1758.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn min_operations(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `make_equal` is never used [INFO] [stdout] --> src/strings/easy/redistribute_characters_to_make_all_strings_equal_1897.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn make_equal(words: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `length_of_last_word` is never used [INFO] [stdout] --> src/strings/easy/length_of_last_word_58.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | 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/strings/easy/isomorphic_strings_205.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_isomorphic` is never used [INFO] [stdout] --> src/strings/easy/isomorphic_strings_205.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | 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/strings/easy/maximum_nesting_depth_of_the_parentheses_1614.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_depth` is never used [INFO] [stdout] --> src/strings/easy/maximum_nesting_depth_of_the_parentheses_1614.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_depth(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/make_the_string_great_1544.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `make_good` is never used [INFO] [stdout] --> src/strings/easy/make_the_string_great_1544.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn make_good(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/reverse_prefix_of_word_2000.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse_prefix` is never used [INFO] [stdout] --> src/strings/easy/reverse_prefix_of_word_2000.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn reverse_prefix(word: String, ch: char) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/largest_positive_integer_that_exists_with_its_negative_2441.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_max_k` is never used [INFO] [stdout] --> src/strings/easy/largest_positive_integer_that_exists_with_its_negative_2441.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn find_max_k(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/score_of_a_string_3110.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `score_of_string` is never used [INFO] [stdout] --> src/strings/easy/score_of_a_string_3110.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | 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/strings/easy/reverse_string_344.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse_string` is never used [INFO] [stdout] --> src/strings/easy/reverse_string_344.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn reverse_string(s: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/longest_palindrome_409.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_palindrome` is never used [INFO] [stdout] --> src/strings/easy/longest_palindrome_409.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn longest_palindrome(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/k_th_distinc_string_in_an_array_2053.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `kth_distinct` is never used [INFO] [stdout] --> src/strings/easy/k_th_distinc_string_in_an_array_2053.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn kth_distinct(arr: Vec, mut k: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/task_1945.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `get_lucky` and `get_lucky_shorter` are never used [INFO] [stdout] --> src/strings/easy/task_1945.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn get_lucky(s: String, mut k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn get_lucky_shorter(s: String, mut k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/task_1684.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_consistent_strings` is never used [INFO] [stdout] --> src/strings/easy/task_1684.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_consistent_strings(allowed: String, words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/task_884.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `uncommon_from_sentences` and `uncommon_from_sentences_map` are never used [INFO] [stdout] --> src/strings/easy/task_884.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | pub fn uncommon_from_sentences(s1: String, s2: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | pub fn uncommon_from_sentences_map(s1: String, s2: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/task_2696.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_length` is never used [INFO] [stdout] --> src/strings/easy/task_2696.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_length(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/task_2490.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_circular_sentence` and `is_circular_sentence_better` are never used [INFO] [stdout] --> src/strings/easy/task_2490.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn is_circular_sentence(sentence: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | pub fn is_circular_sentence_better(sentence: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/task_796.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `rotate_string` and `rotate_string_brute_force` are never used [INFO] [stdout] --> src/strings/easy/task_796.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn rotate_string(s: String, goal: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | pub fn rotate_string_brute_force(s: String, goal: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/task_1455.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_prefix_of_word` is never used [INFO] [stdout] --> src/strings/easy/task_1455.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_prefix_of_word(sentence: String, search_word: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/task_1422.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_score` is never used [INFO] [stdout] --> src/strings/easy/task_1422.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_score(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/task_1408.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `string_matching_with_sorting` and `string_matching_with` are never used [INFO] [stdout] --> src/strings/easy/task_1408.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | // count on possibility to match with the biggest word [INFO] [stdout] 5 | pub fn string_matching_with_sorting(mut words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn string_matching_with(words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/task_3042.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_prefix_suffix_pairs` is never used [INFO] [stdout] --> src/strings/easy/task_3042.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_prefix_suffix_pairs(words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/task_2185.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `prefix_count` is never used [INFO] [stdout] --> src/strings/easy/task_2185.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn prefix_count(words: Vec, pref: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/task_3304.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `kth_character` is never used [INFO] [stdout] --> src/strings/easy/task_3304.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 18 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 19 | pub fn kth_character(k: i32) -> char { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/task_3136.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid` is never used [INFO] [stdout] --> src/strings/easy/task_3136.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_valid(word: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/easy/task_1957.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `make_fancy_string` is never used [INFO] [stdout] --> src/strings/easy/task_1957.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn make_fancy_string(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `close_strings` is never used [INFO] [stdout] --> src/strings/medium/determine_if_two_strings_are_close.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn close_strings(word1: String, word2: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `minimum_length` is never used [INFO] [stdout] --> src/strings/medium/minimum_length_of_string_after_deleting_similar_ends_1750.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn minimum_length(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `custom_sort_string` is never used [INFO] [stdout] --> src/strings/medium/custom_sort_string_791.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn custom_sort_string(order: String, s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/open_the_lock_752.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `open_lock` is never used [INFO] [stdout] --> src/strings/medium/open_the_lock_752.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | pub fn open_lock(deadends: Vec, target: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/number_of_wonderful_substrings_1915.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `wonderful_substrings` and `wonderful_substrings_sliding_window` are never used [INFO] [stdout] --> src/strings/medium/number_of_wonderful_substrings_1915.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn wonderful_substrings(word: String) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn wonderful_substrings_sliding_window(word: String) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/compare_version_numbers_165.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `compare_version` is never used [INFO] [stdout] --> src/strings/medium/compare_version_numbers_165.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn compare_version(version1: String, version2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/palindrome_partitioning_131.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `partition`, `backtrack`, and `is_palindrome` are never used [INFO] [stdout] --> src/strings/medium/palindrome_partitioning_131.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn partition(s: String) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | fn backtrack(s_bytes: &[u8], temp: &mut VecDeque, result: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | fn is_palindrome(sub_s_bytes: &[u8]) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/get_equal_substrings_within_budget_1208.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `equal_substring` is never used [INFO] [stdout] --> src/strings/medium/get_equal_substrings_within_budget_1208.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn equal_substring(s: String, t: String, max_cost: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/append_characters_to_string_to_make_subsequence_2486.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `append_characters` is never used [INFO] [stdout] --> src/strings/medium/append_characters_to_string_to_make_subsequence_2486.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn append_characters(s: String, t: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/find_common_characters_1002.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `ARRAY_LEN` is never used [INFO] [stdout] --> src/strings/medium/find_common_characters_1002.rs:3:7 [INFO] [stdout] | [INFO] [stdout] 3 | const ARRAY_LEN: usize = 26usize; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `common_chars` is never used [INFO] [stdout] --> src/strings/medium/find_common_characters_1002.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn common_chars(words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/replace_words_648.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `replace_words` and `replace_with_word_if_needed` are never used [INFO] [stdout] --> src/strings/medium/replace_words_648.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn replace_words(mut dictionary: Vec, sentence: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | fn replace_with_word_if_needed(word: String, dictionary: &Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/minimum_cost_to_convert_string_2976.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_cost` is never used [INFO] [stdout] --> src/strings/medium/minimum_cost_to_convert_string_2976.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn minimum_cost(source: String, target: String, original: Vec, changed: Vec, cost: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_3016.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_pushes` is never used [INFO] [stdout] --> src/strings/medium/task_3016.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn minimum_pushes(word: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_1371.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_the_longest_substring` and `find_the_longest_substring_tle` are never used [INFO] [stdout] --> src/strings/medium/task_1371.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn find_the_longest_substring(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn find_the_longest_substring_tle(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_539.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_min_difference` is never used [INFO] [stdout] --> src/strings/medium/task_539.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_min_difference(time_points: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_179.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `largest_number` is never used [INFO] [stdout] --> src/strings/medium/task_179.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn largest_number(nums: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_241.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `diff_ways_to_compute` is never used [INFO] [stdout] --> src/strings/medium/task_241.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn diff_ways_to_compute(expression: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_3043.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TrieNode` is never constructed [INFO] [stdout] --> src/strings/medium/task_3043.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | struct TrieNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/strings/medium/task_3043.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, and `find_longest_prefix` are never used [INFO] [stdout] --> src/strings/medium/task_3043.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl Trie { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 16 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn insert(&mut self, num: &i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn find_longest_prefix(&self, num: &i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `longest_common_prefix_tle_strings`, `longest_common_prefix`, and `longest_common_prefix_i32` are never used [INFO] [stdout] --> src/strings/medium/task_3043.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 47 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 48 | pub fn longest_common_prefix_tle_strings(arr1: Vec, arr2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | pub fn longest_common_prefix(arr1: Vec, arr2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 82 | pub fn longest_common_prefix_i32(arr1: Vec, arr2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_567.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `check_inclusion` is never used [INFO] [stdout] --> src/strings/medium/task_567.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn check_inclusion(s1: String, s2: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_921.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_add_to_make_valid` and `min_add_to_make_valid_no_stack` are never used [INFO] [stdout] --> src/strings/medium/task_921.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn min_add_to_make_valid(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn min_add_to_make_valid_no_stack(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_3163.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `compressed_string` is never used [INFO] [stdout] --> src/strings/medium/task_3163.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn compressed_string(word: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_2825.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `can_make_subsequence` and `can_make_subsequence_two_pointers` are never used [INFO] [stdout] --> src/strings/medium/task_2825.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn can_make_subsequence(source: String, target: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | pub fn can_make_subsequence_two_pointers(source: String, target: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_2981.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_length` is never used [INFO] [stdout] --> src/strings/medium/task_2981.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn maximum_length(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_2182.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `repeat_limited_string` is never used [INFO] [stdout] --> src/strings/medium/task_2182.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | 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/strings/medium/task_2559.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `vowel_strings` is never used [INFO] [stdout] --> src/strings/medium/task_2559.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn vowel_strings(words: Vec, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_1930.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_palindromic_subsequence`, `count_palindromic_subsequence_shorter`, `count_palindromic_subsequence_bits`, `count_palindromic_subsequence_alph`, and `count_palindromic_subsequence_backtrack` are never used [INFO] [stdout] --> src/strings/medium/task_1930.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | fn count_palindromic_subsequence(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | pub fn count_palindromic_subsequence_shorter(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | pub fn count_palindromic_subsequence_bits(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 103 | fn count_palindromic_subsequence_alph(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 133 | pub fn count_palindromic_subsequence_backtrack(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_2381.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `shifting_letters` is never used [INFO] [stdout] --> src/strings/medium/task_2381.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn shifting_letters(s: String, shifts: Vec>) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_2116.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_be_valid` is never used [INFO] [stdout] --> src/strings/medium/task_2116.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn can_be_valid(s: String, locked: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_3223.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `minimum_length` and `minimum_length_brute_force` are never used [INFO] [stdout] --> src/strings/medium/task_3223.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn minimum_length(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | pub fn minimum_length_brute_force(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_763.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `partition_labels` is never used [INFO] [stdout] --> src/strings/medium/task_763.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn partition_labels(s: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_2131.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `longest_palindrome_faster` and `longest_palindrome` are never used [INFO] [stdout] --> src/strings/medium/task_2131.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn longest_palindrome_faster(words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | pub fn longest_palindrome(words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_2434.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `robot_with_string` is never used [INFO] [stdout] --> src/strings/medium/task_2434.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn robot_with_string(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_3443.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_distance` is never used [INFO] [stdout] --> src/strings/medium/task_3443.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_distance(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_3085.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_deletions` is never used [INFO] [stdout] --> src/strings/medium/task_3085.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 6 | pub fn minimum_deletions(w: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_3330.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `possible_string_count` is never used [INFO] [stdout] --> src/strings/medium/task_3330.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | // abbcccc [INFO] [stdout] 15 | pub fn possible_string_count(word: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_1717.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `maximum_gain` and `remove_pair` are never used [INFO] [stdout] --> src/strings/medium/task_1717.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 14 | pub fn maximum_gain(s: String, x: i32, y: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | fn remove_pair(s: &str, first: char, second: char) -> (String, i32) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_1233.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Tree` is never constructed [INFO] [stdout] --> src/strings/medium/task_1233.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct Tree { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `new` and `build` are never used [INFO] [stdout] --> src/strings/medium/task_1233.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 12 | impl Tree { [INFO] [stdout] | --------- associated functions in this implementation [INFO] [stdout] 13 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn build(val: String, is_leaf: bool) -> Self { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `remove_subfolders_prefix_tree` and `remove_subfolders_faster` are never used [INFO] [stdout] --> src/strings/medium/task_1233.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 31 | pub fn remove_subfolders_prefix_tree(mut folders: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | pub fn remove_subfolders_faster(mut folder: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_3227.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `VOWELS` is never used [INFO] [stdout] --> src/strings/medium/task_3227.rs:3:7 [INFO] [stdout] | [INFO] [stdout] 3 | const VOWELS: [bool; 256] = { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `does_alice_win` is never used [INFO] [stdout] --> src/strings/medium/task_3227.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 13 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 14 | pub fn does_alice_win(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_165.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `compare_version` is never used [INFO] [stdout] --> src/strings/medium/task_165.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn compare_version(version1: String, version2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_1625.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_lex_smallest_string` and `find_lex_smallest_string_gcd` are never used [INFO] [stdout] --> src/strings/medium/task_1625.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn find_lex_smallest_string(s: String, a: i32, b: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | pub fn find_lex_smallest_string_gcd(s: String, a: i32, b: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/medium/task_3234.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_dominant`, `number_of_substrings_2_prefix_sum`, `number_of_substrings`, and `number_of_substrings_brute_force` are never used [INFO] [stdout] --> src/strings/medium/task_3234.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | fn is_dominant(sub_bytes: &[u8]) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn number_of_substrings_2_prefix_sum(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | pub fn number_of_substrings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 146 | pub fn number_of_substrings_brute_force(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/strings/hard/task_564.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `nearest_palindromic` and `generate_palindrome_from_left` are never used [INFO] [stdout] --> src/strings/hard/task_564.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn nearest_palindromic(n: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | fn generate_palindrome_from_left(mut left_half: i64, is_even_length: bool) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `AllOne` is never constructed [INFO] [stdout] --> src/strings/hard/task_432.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct AllOne { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `inc`, `dec`, `get_max_key`, and `get_min_key` are never used [INFO] [stdout] --> src/strings/hard/task_432.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 13 | impl AllOne { [INFO] [stdout] | ----------- associated items in this implementation [INFO] [stdout] 14 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn inc(&mut self, key: String) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | fn dec(&mut self, key: String) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn get_max_key(&mut self) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | fn get_min_key(&mut self) -> String { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumberContainersTle` is never constructed [INFO] [stdout] --> src/structures/medium/task_2349.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct NumberContainersTle { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `change`, and `find` are never used [INFO] [stdout] --> src/structures/medium/task_2349.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl NumberContainersTle { [INFO] [stdout] | ------------------------ associated items in this implementation [INFO] [stdout] 8 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | fn change(&mut self, index: i32, number: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | fn find(&self, number: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `NumberContainers` is never constructed [INFO] [stdout] --> src/structures/medium/task_2349.rs:54:8 [INFO] [stdout] | [INFO] [stdout] 54 | struct NumberContainers { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `change`, and `find` are never used [INFO] [stdout] --> src/structures/medium/task_2349.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 59 | impl NumberContainers { [INFO] [stdout] | --------------------- associated items in this implementation [INFO] [stdout] 60 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn change(&mut self, index: i32, number: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | fn find(&self, number: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `FindSumPairs` is never constructed [INFO] [stdout] --> src/structures/medium/task_1865.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | struct FindSumPairs { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add`, and `count` are never used [INFO] [stdout] --> src/structures/medium/task_1865.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 19 | impl FindSumPairs { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 20 | fn new(nums1: Vec, nums2: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn add(&mut self, index: i32, val: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | fn count(&self, tot: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `FoodRatings` is never constructed [INFO] [stdout] --> src/structures/medium/task_2353.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | 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/structures/medium/task_2353.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl FoodRatings { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 11 | fn new(foods: Vec, cuisines: Vec, ratings: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | fn change_rating(&mut self, food: String, new_rating: i32) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn highest_rated(&mut self, cuisine: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Spreadsheet` is never constructed [INFO] [stdout] --> src/structures/medium/task_3484.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Spreadsheet { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `set_cell`, `reset_cell`, and `get_value` are never used [INFO] [stdout] --> src/structures/medium/task_3484.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl Spreadsheet { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 13 | [INFO] [stdout] 14 | fn new(rows: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn set_cell(&mut self, cell: String, value: i32) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | fn reset_cell(&mut self, cell: String) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn get_value(&mut self, formula: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Router` is never constructed [INFO] [stdout] --> src/structures/medium/task_3508.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Router { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `make_key`, `new`, `add_packet`, `forward_packet`, and `get_count` are never used [INFO] [stdout] --> src/structures/medium/task_3508.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 10 | impl Router { [INFO] [stdout] | ----------- associated items in this implementation [INFO] [stdout] 11 | fn make_key(source: i32, dest: i32, timestamp: i32) -> String { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 15 | fn new(memory_limit: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | fn add_packet(&mut self, source: i32, destination: i32, timestamp: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | fn forward_packet(&mut self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn get_count(&self, destination: i32, start_time: i32, end_time: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Bank` is never constructed [INFO] [stdout] --> src/structures/medium/task_2043.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Bank { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `transfer`, `deposit`, `withdraw`, `is_account_valid`, and `does_account_exist` are never used [INFO] [stdout] --> src/structures/medium/task_2043.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 9 | impl Bank { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 10 | fn new(mut balance: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 15 | fn transfer(&mut self, account1: i32, account2: i32, money: i64) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | fn deposit(&mut self, account: i32, money: i64) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn withdraw(&mut self, account: i32, money: i64) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn is_account_valid(&self, account: i32, money: i64) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 47 | fn does_account_exist(&self, account: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `TreeNode` is never constructed [INFO] [stdout] --> src/graph.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 9 | pub struct TreeNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/graph.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl TreeNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 16 | #[inline] [INFO] [stdout] 17 | pub fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `UnionFind` is never constructed [INFO] [stdout] --> src/graph.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `build`, `union`, and `find` are never used [INFO] [stdout] --> src/graph.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl UnionFind { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 33 | pub fn build(n: usize) -> UnionFind { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | pub fn union(&mut self, x: usize, y: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | pub fn find(&mut self, mut p: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `diameter_of_binary_tree` is never used [INFO] [stdout] --> src/graph/easy/diameter_of_binary_tree_543.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn diameter_of_binary_tree(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `leaf_similar` is never used [INFO] [stdout] --> src/graph/easy/leaf_similar_trees_872.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn leaf_similar(root1: Option>>, root2: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder` is never used [INFO] [stdout] --> src/graph/easy/leaf_similar_trees_872.rs:14:4 [INFO] [stdout] | [INFO] [stdout] 14 | fn inorder(root: &Option>>, list: &mut Vec) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `range_sum_bst` is never used [INFO] [stdout] --> src/graph/easy/range_sum_bst_938.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | pub fn range_sum_bst(root: Option>>, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `range_sum_bst_recursive` is never used [INFO] [stdout] --> src/graph/easy/range_sum_bst_938.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 29 | pub fn range_sum_bst_recursive(root: Option>>, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_same_tree` is never used [INFO] [stdout] --> src/graph/easy/same_tree_100.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn is_same_tree(p: Option>>, q: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/easy/sum_of_left_leaves_404.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `sum_of_left_leaves_dfs`, `sum_of_left_leaves`, and `sum_of_left_leaves_unsafe` are never used [INFO] [stdout] --> src/graph/easy/sum_of_left_leaves_404.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 12 | pub fn sum_of_left_leaves_dfs(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | pub fn sum_of_left_leaves(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | pub fn sum_of_left_leaves_unsafe(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/easy/find_if_path_exists_in_graph_1971.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `UnionFind` is never constructed [INFO] [stdout] --> src/graph/easy/find_if_path_exists_in_graph_1971.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `find`, and `union` are never used [INFO] [stdout] --> src/graph/easy/find_if_path_exists_in_graph_1971.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 11 | impl UnionFind { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 12 | [INFO] [stdout] 13 | fn new(n: usize) -> UnionFind { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn find(&self, mut p: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | fn union(&self, p: usize, q: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `valid_path` is never used [INFO] [stdout] --> src/graph/easy/find_if_path_exists_in_graph_1971.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 50 | pub fn valid_path(n: i32, edges: Vec>, source: i32, destination: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/easy/evaluate_boolean_binary_tree.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `evaluate_tree` is never used [INFO] [stdout] --> src/graph/easy/evaluate_boolean_binary_tree.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn evaluate_tree(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/easy/find_center_of_ster_graph_1791.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_center` is never used [INFO] [stdout] --> src/graph/easy/find_center_of_ster_graph_1791.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_center(edges: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/easy/task_145.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `postorder_traversal` is never used [INFO] [stdout] --> src/graph/easy/task_145.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn postorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/sum_root_to_leaf_numbers_129.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `sum_numbers` and `sum_numbers_string` are never used [INFO] [stdout] --> src/graph/medium/sum_root_to_leaf_numbers_129.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 9 | pub fn sum_numbers(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | pub fn sum_numbers_string(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/add_one_row_to_tree_623.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_one_row` is never used [INFO] [stdout] --> src/graph/medium/add_one_row_to_tree_623.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 27 | pub fn add_one_row(root: Option>>, val: i32, depth: i32) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/smallest_string_starting_from_leaf_988.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `smallest_from_leaf` is never used [INFO] [stdout] --> src/graph/medium/smallest_string_starting_from_leaf_988.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn smallest_from_leaf(root: Option>>) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/minimum_height_trees_310.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_min_height_trees`, `find_min_height_trees_bfs`, and `find_min_height_trees_dfs_tle` are never used [INFO] [stdout] --> src/graph/medium/minimum_height_trees_310.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | [INFO] [stdout] 7 | pub fn find_min_height_trees(n: i32, edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 40 | pub fn find_min_height_trees_bfs(n: i32, edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | pub fn find_min_height_trees_dfs_tle(n: i32, edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `create_graph` is never used [INFO] [stdout] --> src/graph/medium/minimum_height_trees_310.rs:120:4 [INFO] [stdout] | [INFO] [stdout] 120 | fn create_graph(edges: Vec>) -> HashMap> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/path_with_minimum_effort_1631.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/graph/medium/path_with_minimum_effort_1631.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `build` is never used [INFO] [stdout] --> src/graph/medium/path_with_minimum_effort_1631.rs:33:8 [INFO] [stdout] | [INFO] [stdout] 32 | impl Node { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 33 | fn build(row: i32, col: i32, weight: i32) -> Node { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_effort_path` is never used [INFO] [stdout] --> src/graph/medium/path_with_minimum_effort_1631.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | pub fn minimum_effort_path(heights: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/delete_leaves_with_a_given_value_1325.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `remove_leaf_nodes` and `remove_leaf_nodes_brute` are never used [INFO] [stdout] --> src/graph/medium/delete_leaves_with_a_given_value_1325.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 25 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 26 | pub fn remove_leaf_nodes(root: Option>>, target: i32) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn remove_leaf_nodes_brute(root: Option>>, target: i32) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/distribute_coins_in_binary_tree_979.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `distribute_coins` is never used [INFO] [stdout] --> src/graph/medium/distribute_coins_in_binary_tree_979.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn distribute_coins(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/binary_search_tree_to_greater_sum_tree_1038.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `bst_to_gst` and `traverse` are never used [INFO] [stdout] --> src/graph/medium/binary_search_tree_to_greater_sum_tree_1038.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 8 | pub fn bst_to_gst(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 13 | fn traverse(node_opt: Option>>, val: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/balance_binary_search_tree_1382.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `balance_bst`, `build_tree`, and `collect_in_order` are never used [INFO] [stdout] --> src/graph/medium/balance_binary_search_tree_1382.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 8 | pub fn balance_bst(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | fn build_tree(arr: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | fn collect_in_order(root: Option>>, arr: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/maximum_total_importance_of_roads_2285.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `maximum_importance_shorter` and `maximum_importance` are never used [INFO] [stdout] --> src/graph/medium/maximum_total_importance_of_roads_2285.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn maximum_importance_shorter(n: i32, mut roads: Vec>) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn maximum_importance(n: i32, roads: Vec>) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/backtracking/medium/task_2516.rs:38:13 [INFO] [stdout] | [INFO] [stdout] 38 | let mut bytes = s.as_bytes().clone(); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/all_ancestors_of_node_in_directec_acyclic_graph_2192.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `get_ancestors`, `dfs`, `get_ancestors_stack`, `get_ancestors_tle`, and `dfs_topological` are never used [INFO] [stdout] --> src/graph/medium/all_ancestors_of_node_in_directec_acyclic_graph_2192.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn get_ancestors(n: i32, edges: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | fn dfs(next: i32, parent: i32, graph: &Vec>, result: &mut Vec>) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn get_ancestors_stack(n: i32, edges: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | pub fn get_ancestors_tle(n: i32, edges: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 125 | fn dfs_topological(next: i32, result: &Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/create_binary_tree_from_descriptions_2196.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `create_binary_tree` is never used [INFO] [stdout] --> src/graph/medium/create_binary_tree_from_descriptions_2196.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn create_binary_tree(descriptions: Vec>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/step_by_step_directions_from_binary_tree_node_to_another_2096.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_directions` is never used [INFO] [stdout] --> src/graph/medium/step_by_step_directions_from_binary_tree_node_to_another_2096.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn get_directions(root: Option>>, start_value: i32, dest_value: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/delete_nodes_and_return_forest_1110.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `del_nodes` is never used [INFO] [stdout] --> src/graph/medium/delete_nodes_and_return_forest_1110.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 10 | pub fn del_nodes(root: Option>>, to_delete: Vec) -> Vec>>> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/number_of_good_leaf_nodes_pairs_1530.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_pairs` is never used [INFO] [stdout] --> src/graph/medium/number_of_good_leaf_nodes_pairs_1530.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | pub fn count_pairs(root: Option>>, distance: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/find_the_city_with_the_smallest_number_of_neighbors_at_threshold_distance_1334.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `WeightPair` is never constructed [INFO] [stdout] --> src/graph/medium/find_the_city_with_the_smallest_number_of_neighbors_at_threshold_distance_1334.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 8 | pub struct WeightPair { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `build` is never used [INFO] [stdout] --> src/graph/medium/find_the_city_with_the_smallest_number_of_neighbors_at_threshold_distance_1334.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 13 | impl WeightPair { [INFO] [stdout] | --------------- associated function in this implementation [INFO] [stdout] 14 | fn build(node: i32, weight: i32) -> WeightPair { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_the_city` is never used [INFO] [stdout] --> src/graph/medium/find_the_city_with_the_smallest_number_of_neighbors_at_threshold_distance_1334.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | pub fn find_the_city(n: i32, edges: Vec>, distance_threshold: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/task_959.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `regions_by_slashes` is never used [INFO] [stdout] --> src/graph/medium/task_959.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn regions_by_slashes(grid: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/task_947.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `remove_stones` and `remove_stones_dfs` are never used [INFO] [stdout] --> src/graph/medium/task_947.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn remove_stones(stones: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn remove_stones_dfs(stones: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/task_3243.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `calculate_shortest_distance_tle`, `calculate_shortest_distance`, and `shortest_distance_after_queries` are never used [INFO] [stdout] --> src/graph/medium/task_3243.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | fn calculate_shortest_distance_tle(graph: &HashMap>, current: i32, n: i32, length: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn calculate_shortest_distance(graph: &HashMap>, current: i32, n: i32, length: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn shortest_distance_after_queries(n: i32, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/task_2415.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `dfs`, `reverse_odd_levels_dfs`, `reverse_odd_levels_faster`, `reverse_odd_levels`, and `build_tree_from_level_map` are never used [INFO] [stdout] --> src/graph/medium/task_2415.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 27 | fn dfs( [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | pub fn reverse_odd_levels_dfs( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | pub fn reverse_odd_levels_faster( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 99 | pub fn reverse_odd_levels( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 136 | pub fn build_tree_from_level_map( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/taks_2471.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `minimum_operations` and `total_swaps` are never used [INFO] [stdout] --> src/graph/medium/taks_2471.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 26 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 27 | pub fn minimum_operations(mut root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 58 | fn total_swaps(mut level_values: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/task_889.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `construct_from_pre_post` is never used [INFO] [stdout] --> src/graph/medium/task_889.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 25 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 26 | pub fn construct_from_pre_post(preorder: Vec, postorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/task_3341.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_time_to_reach_binary_heap` and `min_time_to_reach` are never used [INFO] [stdout] --> src/graph/medium/task_3341.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 18 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 19 | pub fn min_time_to_reach_binary_heap(move_time: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | pub fn min_time_to_reach(move_time: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/task_2359.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `closest_meeting_node` is never used [INFO] [stdout] --> src/graph/medium/task_2359.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn closest_meeting_node(edges: Vec, node1: i32, node2: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/task_2257.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `DIRECTIONS`, `dfs`, and `count_unguarded` are never used [INFO] [stdout] --> src/graph/medium/task_2257.rs:6:11 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 5 | [INFO] [stdout] 6 | const DIRECTIONS: [(i32, i32); 4] = [(-1, 0), (1, 0), (0, -1), (0, 1)]; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] 7 | [INFO] [stdout] 8 | fn dfs(store: &mut Vec>, dir: &(i32, i32), x: i32, y: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn count_unguarded(m: i32, n: i32, guards: Vec>, walls: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/medium/task_3607.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `UnionFind` is never constructed [INFO] [stdout] --> src/graph/medium/task_3607.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `find`, `union`, `is_connected`, and `set_count` are never used [INFO] [stdout] --> src/graph/medium/task_3607.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl UnionFind { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 12 | pub fn new(n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn find(&mut self, mut i: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | pub fn union(&mut self, i: usize, j: usize) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 48 | pub fn is_connected(&mut self, i: usize, j: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | pub fn set_count(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `process_queries` is never used [INFO] [stdout] --> src/graph/medium/task_3607.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 57 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] ... [INFO] [stdout] 61 | pub fn process_queries(c: i32, connections: Vec>, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/hard/sum_of_distances_in_tree_834.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/graph/hard/sum_of_distances_in_tree_834.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `sum_of_distances_in_tree`, `sum_of_distances_in_tree_tle_dijkstra`, `traverse`, and `collect_edges` are never used [INFO] [stdout] --> src/graph/hard/sum_of_distances_in_tree_834.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 33 | pub fn sum_of_distances_in_tree(n: i32, mut edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | pub fn sum_of_distances_in_tree_tle_dijkstra(n: i32, mut edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 89 | fn traverse(start: usize, end: usize, edges: &Vec>) -> Option { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 123 | fn collect_edges(n: i32, edges: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/graph/hard/find_the_maximum_sum_of_node_values_3068.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_value_sum` is never used [INFO] [stdout] --> src/graph/hard/find_the_maximum_sum_of_node_values_3068.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn maximum_value_sum(nums: Vec, k: i32, edges: Vec>) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `countSort` is never used [INFO] [stdout] --> src/hackerrank/the_full_counting_sort.rs:7:4 [INFO] [stdout] | [INFO] [stdout] 7 | fn countSort(arr: &[Vec]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/medium/word_search_79.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `exist`, `traverse`, and `is_valid_coordinates` are never used [INFO] [stdout] --> src/backtracking/medium/word_search_79.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn exist(board: Vec>, word: String) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn traverse(board: &mut Vec>, word: &[u8], row: usize, col: usize, idx: usize) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | fn is_valid_coordinates(board: &Vec>, row: usize, col: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/medium/path_with_maximum_gold_1219.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `get_maximum_gold`, `backtrack`, and `is_size_violated` are never used [INFO] [stdout] --> src/backtracking/medium/path_with_maximum_gold_1219.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn get_maximum_gold(mut grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | fn backtrack(grid: &mut Vec>, row: i32, col: i32, current_value: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | fn is_size_violated(grid: &Vec>, row: i32, col: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/medium/find_the_safest_path_in_a_grid_2812.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/backtracking/medium/find_the_safest_path_in_a_grid_2812.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct Node { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `build` is never used [INFO] [stdout] --> src/backtracking/medium/find_the_safest_path_in_a_grid_2812.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Node { [INFO] [stdout] | --------- associated function in this implementation [INFO] [stdout] 33 | pub fn build(x: i32, y: i32, safeness: i32) -> Node { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `maximum_safeness_factor`, `maximum_safeness_factor_dijkstra`, `maximum_safeness_factor_brute_force`, and `backtrack` are never used [INFO] [stdout] --> src/backtracking/medium/find_the_safest_path_in_a_grid_2812.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 41 | pub fn maximum_safeness_factor(mut grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 82 | pub fn maximum_safeness_factor_dijkstra(mut grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 137 | pub fn maximum_safeness_factor_brute_force(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 156 | fn backtrack(grid: &Vec>, visited: &mut Vec>, path: &mut Vec<(i32, i32)>, thieves: &Vec<(i32, i32)>, row: i3... [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/medium/subsets_78.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `subsets` and `backtrack` are never used [INFO] [stdout] --> src/backtracking/medium/subsets_78.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 10 | fn backtrack(nums: &Vec, temp: &mut Vec, result: &mut Vec>, start: usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/medium/the_number_of_beautiful_subsets_2597.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `beautiful_subsets` and `backtrack` are never used [INFO] [stdout] --> src/backtracking/medium/the_number_of_beautiful_subsets_2597.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn beautiful_subsets(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | fn backtrack(nums: &Vec, visited: &mut HashMap, start: usize, k: i32, result: &mut i32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/medium/task_2530.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_kelements` and `max_kelements_order` are never used [INFO] [stdout] --> src/backtracking/medium/task_2530.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn max_kelements(mut nums: Vec, k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | pub fn max_kelements_order(nums: Vec, mut k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/medium/task_1405.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `longest_diverse_string_heap` and `longest_diverse_string` are never used [INFO] [stdout] --> src/backtracking/medium/task_1405.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn longest_diverse_string_heap(a: i32, b: i32, c: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn longest_diverse_string(a: i32, b: i32, c: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/medium/task_2516.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `take_characters_faster`, `take_characters`, and `backtrack` are never used [INFO] [stdout] --> src/backtracking/medium/task_2516.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn take_characters_faster(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | pub fn take_characters(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | fn backtrack(bytes: &[u8], left: usize, right: usize, k: i32, counter: &mut Vec, minutes: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/medium/task_1718.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `construct_distanced_sequence` and `backtrack` are never used [INFO] [stdout] --> src/backtracking/medium/task_1718.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn construct_distanced_sequence(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | fn backtrack(result: &mut Vec, used: &mut Vec, n: usize, index: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/medium/task_2579.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `colored_cells` is never used [INFO] [stdout] --> src/backtracking/medium/task_2579.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn colored_cells(mut n: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/medium/task_2140.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `most_points` is never used [INFO] [stdout] --> src/backtracking/medium/task_2140.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn most_points(questions: Vec>) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/medium/task_1262.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sum_div_three` is never used [INFO] [stdout] --> src/backtracking/medium/task_1262.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_sum_div_three(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/hard/maximum_score_words_formed_by_letters_1255.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_score_words`, `backtrack`, `decrement_letters`, `increment_letters`, and `is_letters_enough` are never used [INFO] [stdout] --> src/backtracking/hard/maximum_score_words_formed_by_letters_1255.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn max_score_words(words: Vec, letters: Vec, score: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn backtrack(words: &Vec, letters: &mut HashMap, score_by_word: &HashMap, max: &mut i32, temp: i... [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | fn decrement_letters(word: &String, letters: &mut HashMap) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn increment_letters(word: &String, letters: &mut HashMap) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn is_letters_enough(letters: &HashMap) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/hard/word_break_2_140.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `word_break` and `backtrack` are never used [INFO] [stdout] --> src/backtracking/hard/word_break_2_140.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn word_break(s: String, word_dict: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | fn backtrack(s: &[u8], words: &HashSet, result: &mut Vec, temp: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/hard/check_record_552.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `BIG_MOD` is never used [INFO] [stdout] --> src/backtracking/hard/check_record_552.rs:2:7 [INFO] [stdout] | [INFO] [stdout] 2 | const BIG_MOD: u32 = 1000000007; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `check_record`, `check_record_backtracking_memo`, and `form_possible_attendance` are never used [INFO] [stdout] --> src/backtracking/hard/check_record_552.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 5 | [INFO] [stdout] 6 | pub fn check_record(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 33 | pub fn check_record_backtracking_memo(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn form_possible_attendance(cache: &mut Vec>>, n: i32, absence: i32, consecutive: i32, ch_arr: &Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/backtracking/hard/task_664.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `strange_printer` is never used [INFO] [stdout] --> src/backtracking/hard/task_664.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn strange_printer(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/array/medium/maximize_happiness_of_selected_children_3075.rs:23:15 [INFO] [stdout] | [INFO] [stdout] 23 | while idx >= 0 && k > 0 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_comparisons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `process_line` is never used [INFO] [stdout] --> src/main.rs:27:4 [INFO] [stdout] | [INFO] [stdout] 27 | fn process_line(line: &str, re: &Regex, counts: &mut BTreeMap) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/sum_of_square_numbers_633.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `judge_square_sum_binary_search`, `binary_search`, `judge_square_sum_sqrt`, `judge_square_sum_tle`, and `judge_square_sum_brute_force` are never used [INFO] [stdout] --> src/math/medium/sum_of_square_numbers_633.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | [INFO] [stdout] 7 | pub fn judge_square_sum_binary_search(c: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn binary_search(s: i64, e: i64, n: i64) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | pub fn judge_square_sum_sqrt(c: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | pub fn judge_square_sum_tle(c: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | pub fn judge_square_sum_brute_force(c: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/task_592.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `fraction_addition` and `gcd` are never used [INFO] [stdout] --> src/math/medium/task_592.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn fraction_addition(expression: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | pub fn gcd(a: i32, b: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `ListNode` is never constructed [INFO] [stdout] --> src/math/medium/task_1290.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 2 | pub struct ListNode { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/math/medium/task_1290.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl ListNode { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 8 | #[inline] [INFO] [stdout] 9 | fn new(val: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/task_1290.rs:14:12 [INFO] [stdout] | [INFO] [stdout] 14 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `get_decimal_value_bit` and `get_decimal_value` are never used [INFO] [stdout] --> src/math/medium/task_1290.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 30 | pub fn get_decimal_value_bit(mut head: Option>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | pub fn get_decimal_value(mut head: Option>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/tasl_869.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `reordered_power_of2_faster` and `reordered_power_of2` are never used [INFO] [stdout] --> src/math/medium/tasl_869.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn reordered_power_of2_faster(mut n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | pub fn reordered_power_of2(mut n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/task_2438.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `product_queries` is never used [INFO] [stdout] --> src/math/medium/task_2438.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn product_queries(n: i32, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/task_611.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `triangle_number_brute_force` and `triangle_number` are never used [INFO] [stdout] --> src/math/medium/task_611.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn triangle_number_brute_force(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn triangle_number(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/task_120.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_total` is never used [INFO] [stdout] --> src/math/medium/task_120.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn minimum_total(triangle: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/medium/task_2048.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `next_beautiful_number` is never used [INFO] [stdout] --> src/math/medium/task_2048.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn next_beautiful_number(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_476.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_complement` is never used [INFO] [stdout] --> src/math/easy/task_476.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_complement(num: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_231.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_power_of_two` is never used [INFO] [stdout] --> src/math/easy/task_231.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_power_of_two(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_1317.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_no_zero_integers` is never used [INFO] [stdout] --> src/math/easy/task_1317.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn get_no_zero_integers(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_1304.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sum_zero` is never used [INFO] [stdout] --> src/math/easy/task_1304.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn sum_zero(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_812.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `largest_triangle_area` is never used [INFO] [stdout] --> src/math/easy/task_812.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn largest_triangle_area(points: Vec>) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_976.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `largest_perimeter_brute_force` and `largest_perimeter` are never used [INFO] [stdout] --> src/math/easy/task_976.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn largest_perimeter_brute_force(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn largest_perimeter(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_1518.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_water_bottles` and `num_water_bottles_one_line` are never used [INFO] [stdout] --> src/math/easy/task_1518.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn num_water_bottles(mut num_bottles: i32, num_exchange: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | pub fn num_water_bottles_one_line(mut num_bottles: i32, num_exchange: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/math/easy/task_3370.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `smallest_number` is never used [INFO] [stdout] --> src/math/easy/task_3370.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn smallest_number(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `countSort` should have a snake case name [INFO] [stdout] --> src/hackerrank/the_full_counting_sort.rs:7:4 [INFO] [stdout] | [INFO] [stdout] 7 | fn countSort(arr: &[Vec]) { [INFO] [stdout] | ^^^^^^^^^ help: convert the identifier to snake case: `count_sort` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` (part of `#[warn(nonstandard_style)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/backtracking/medium/word_search_79.rs:46:9 [INFO] [stdout] | [INFO] [stdout] 46 | row >= 0 && col >= 0 && row < board.len() && col < board[row].len() [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/backtracking/medium/word_search_79.rs:46:21 [INFO] [stdout] | [INFO] [stdout] 46 | row >= 0 && col >= 0 && row < board.len() && col < board[row].len() [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `climb_stairs` is never used [INFO] [stdout] --> src/dynamic_programming/easy/climbing_stairs_70.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/easy/n_th_tribonacci_number_1137.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `tribonacci` is never used [INFO] [stdout] --> src/dynamic_programming/easy/n_th_tribonacci_number_1137.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn tribonacci(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rob` is never used [INFO] [stdout] --> src/dynamic_programming/medium/house_robber.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/longest_ideal_subsequence_2370.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `longest_ideal_string`, `longest_ideal_string_tle`, and `longest_ideal_string_recursive_tle` are never used [INFO] [stdout] --> src/dynamic_programming/medium/longest_ideal_subsequence_2370.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn longest_ideal_string(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | pub fn longest_ideal_string_tle(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | pub fn longest_ideal_string_recursive_tle(s: String, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_494.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_target_sum_ways` is never used [INFO] [stdout] --> src/dynamic_programming/medium/task_494.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_target_sum_ways(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_1014.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_score_sightseeing_pair` and `max_score_sightseeing_pair_brute_force` are never used [INFO] [stdout] --> src/dynamic_programming/medium/task_1014.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn max_score_sightseeing_pair(values: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | pub fn max_score_sightseeing_pair_brute_force(values: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_416.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_partition` is never used [INFO] [stdout] --> src/dynamic_programming/medium/task_416.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 9 | pub fn can_partition(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_790.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `MOD`, `num_tilings`, and `count_dominoes` are never used [INFO] [stdout] --> src/dynamic_programming/medium/task_790.rs:4:11 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 4 | const MOD: i64 = 1_000_000_007; [INFO] [stdout] | ^^^ [INFO] [stdout] 5 | [INFO] [stdout] 6 | pub fn num_tilings(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 11 | fn count_dominoes(sum: i32, n: i32, is_gap: bool, dp: &mut Vec<[Option; 2]>) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_3201.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `maximum_length_faster` and `maximum_length` are never used [INFO] [stdout] --> src/dynamic_programming/medium/task_3201.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn maximum_length_faster(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn maximum_length(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_808.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `soup_servings` is never used [INFO] [stdout] --> src/dynamic_programming/medium/task_808.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn soup_servings(n: i32) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_2787.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `number_of_ways` is never used [INFO] [stdout] --> src/dynamic_programming/medium/task_2787.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn number_of_ways(n: i32, x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_1578.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_cost` is never used [INFO] [stdout] --> src/dynamic_programming/medium/task_1578.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_cost(colors: String, needed_time: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/medium/task_474.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_max_form` and `dp_helper` are never used [INFO] [stdout] --> src/dynamic_programming/medium/task_474.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn find_max_form(strs: Vec, m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | fn dp_helper( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `number_of_arithmetic_slices` is never used [INFO] [stdout] --> src/dynamic_programming/hard/arithmetic_slices_2_subsequence.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn number_of_arithmetic_slices(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/hard/minimum_falling_path_sum_2_1289.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_falling_path_sum` is never used [INFO] [stdout] --> src/dynamic_programming/hard/minimum_falling_path_sum_2_1289.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn min_falling_path_sum(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/hard/freedom_trail_514.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_steps`, `rotate_dial`, `find_rotate_steps_top_down`, and `find_rotate_steps` are never used [INFO] [stdout] --> src/dynamic_programming/hard/freedom_trail_514.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | fn count_steps(current: usize, next: usize, ring_length: usize) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | fn rotate_dial(cache: &mut Vec>, ring_index: usize, key_index: usize, ring: &[u8], key: &[u8]) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | pub fn find_rotate_steps_top_down(ring: String, key: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | 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/dynamic_programming/hard/task_1639.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_ways` is never used [INFO] [stdout] --> src/dynamic_programming/hard/task_1639.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn num_ways(words: Vec, target: String) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/dynamic_programming/hard/task_1900.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `earliest_and_latest` and `dp` are never used [INFO] [stdout] --> src/dynamic_programming/hard/task_1900.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn earliest_and_latest(n: i32, first_player: i32, second_player: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 19 | fn dp( [INFO] [stdout] | ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `create_prefix_sum` is never used [INFO] [stdout] --> src/array.rs:5:4 [INFO] [stdout] | [INFO] [stdout] 5 | fn create_prefix_sum(nums: &Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sorted_squares` is never used [INFO] [stdout] --> src/array/easy/squares_of_sorted_array_977.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn sorted_squares(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sorted_squares_sort` is never used [INFO] [stdout] --> src/array/easy/squares_of_sorted_array_977.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn sorted_squares_sort(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_frequency_elements` is never used [INFO] [stdout] --> src/array/easy/count_elements_with_maximum_frequency_3005.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn max_frequency_elements(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `get_common` is never used [INFO] [stdout] --> src/array/easy/minimum_common_value_2540.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn get_common(nums1: Vec, nums2: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `intersection` is never used [INFO] [stdout] --> src/array/easy/intersect_of_two_arrays_349.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn intersection(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `intersection_hash_set` is never used [INFO] [stdout] --> src/array/easy/intersect_of_two_arrays_349.rs:23:8 [INFO] [stdout] | [INFO] [stdout] 23 | pub fn intersection_hash_set(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/find_the_pivot_integer_2485.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `pivot_integer` and `pivot_integer_better` are never used [INFO] [stdout] --> src/array/easy/find_the_pivot_integer_2485.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn pivot_integer(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 32 | pub fn pivot_integer_better(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/number_of_students_unable_to_eat_lunch_1700.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_students` is never used [INFO] [stdout] --> src/array/easy/number_of_students_unable_to_eat_lunch_1700.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_students(students: Vec, sandwiches: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/time_needed_to_buy_tickets_2073.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: call to `.clone()` on a reference in this situation does nothing [INFO] [stdout] --> src/backtracking/medium/task_2516.rs:38:37 [INFO] [stdout] | [INFO] [stdout] 38 | let mut bytes = s.as_bytes().clone(); [INFO] [stdout] | ^^^^^^^^ help: remove this redundant call [INFO] [stdout] | [INFO] [stdout] = note: the type `[u8]` does not implement `Clone`, so calling `clone` on `&[u8]` copies the reference, which does not do anything and can be removed [INFO] [stdout] = note: `#[warn(noop_method_call)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/backtracking/hard/task_664.rs:19:16 [INFO] [stdout] | [INFO] [stdout] 19 | if left < 0 || right < 0 || left > right || left > MAX_LEN || right > MAX_LEN { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> src/backtracking/hard/task_664.rs:19:28 [INFO] [stdout] | [INFO] [stdout] 19 | if left < 0 || right < 0 || left > right || left > MAX_LEN || right > MAX_LEN { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `time_required_to_buy` and `time_required_to_buy_without_while_cycle` are never used [INFO] [stdout] --> src/array/easy/time_needed_to_buy_tickets_2073.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn time_required_to_buy(tickets: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | pub fn time_required_to_buy_without_while_cycle(tickets: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/island_perimeter_463.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `island_perimeter_iterative` is never used [INFO] [stdout] --> src/array/easy/island_perimeter_463.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 5 | pub fn island_perimeter_iterative(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `island_perimeter`, `dfs`, and `is_boarders_violated` are never used [INFO] [stdout] --> src/array/easy/island_perimeter_463.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 24 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 25 | pub fn island_perimeter(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn dfs(grid: &mut Vec>, row: usize, col: usize) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | fn is_boarders_violated(grid: &Vec>, row: i32, col: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/relative_ranks_506.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_relative_ranks` and `find_relative_ranks_binary_search` are never used [INFO] [stdout] --> src/array/easy/relative_ranks_506.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn find_relative_ranks(scores: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn find_relative_ranks_binary_search(scores: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/largest_local_values_in_a_matrix_2373.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `largest_local` is never used [INFO] [stdout] --> src/array/easy/largest_local_values_in_a_matrix_2373.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn largest_local(grid: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/sum_of_all_subset_xor_totals_1863.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `subset_xor_sum_short`, `subset_xor_sum`, `backtrack`, and `calculate_xor` are never used [INFO] [stdout] --> src/array/easy/sum_of_all_subset_xor_totals_1863.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | [INFO] [stdout] 7 | pub fn subset_xor_sum_short(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 11 | pub fn subset_xor_sum(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | fn backtrack(nums: &Vec, temp: &mut VecDeque, start: usize, result: &mut i32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | fn calculate_xor(temp: &VecDeque) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/special_array_with_x_elements_greater_than_or_equal_x_1608.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `special_array` is never used [INFO] [stdout] --> src/array/easy/special_array_with_x_elements_greater_than_or_equal_x_1608.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn special_array(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/height_checker_1051.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `height_checker` and `height_checker_b_tree` are never used [INFO] [stdout] --> src/array/easy/height_checker_1051.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn height_checker(heights: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn height_checker_b_tree(heights: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/relative_sort_array_1122.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `relative_sort_array` is never used [INFO] [stdout] --> src/array/easy/relative_sort_array_1122.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn relative_sort_array(arr1: Vec, arr2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/intersection_of_two_arrays_2_350.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `intersect` is never used [INFO] [stdout] --> src/array/easy/intersection_of_two_arrays_2_350.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn intersect(nums1: Vec, nums2: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/pass_the_pillow_2582.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `pass_the_pillow_math` and `pass_the_pillow` are never used [INFO] [stdout] --> src/array/easy/pass_the_pillow_2582.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn pass_the_pillow_math(n: i32, mut time: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | pub fn pass_the_pillow(n: i32, mut time: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/crawler_log_folder_1598.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_operations_only_step` and `min_operations` are never used [INFO] [stdout] --> src/array/easy/crawler_log_folder_1598.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn min_operations_only_step(logs: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | pub fn min_operations(logs: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/lucky_numbers_in_matrix_1380.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lucky_numbers` is never used [INFO] [stdout] --> src/array/easy/lucky_numbers_in_matrix_1380.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn lucky_numbers(matrix: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/make_two_arrays_equal_by_reversing_subarrays_1460.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_be_equal` is never used [INFO] [stdout] --> src/array/easy/make_two_arrays_equal_by_reversing_subarrays_1460.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn can_be_equal(target: Vec, arr: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `KthLargest` is never constructed [INFO] [stdout] --> src/array/easy/task_703.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct KthLargest { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `add` are never used [INFO] [stdout] --> src/array/easy/task_703.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl KthLargest { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 9 | fn new(k: i32, nums: Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn add(&mut self, val: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1331.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `array_rank_transform` is never used [INFO] [stdout] --> src/array/easy/task_1331.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn array_rank_transform(mut arr: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2558.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `pick_gifts` and `floor_sqrt` are never used [INFO] [stdout] --> src/array/easy/task_2558.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn pick_gifts(gifts: Vec, mut k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | fn floor_sqrt(n: i64) -> i64 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3264.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `get_final_state` and `get_final_state_no_struct` are never used [INFO] [stdout] --> src/array/easy/task_3264.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | pub fn get_final_state(mut nums: Vec, mut k: i32, multiplier: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn get_final_state_no_struct(mut nums: Vec, mut k: i32, multiplier: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Element` is never constructed [INFO] [stdout] --> src/array/easy/task_3264.rs:41:8 [INFO] [stdout] | [INFO] [stdout] 41 | struct Element { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> src/array/easy/task_3264.rs:47:8 [INFO] [stdout] | [INFO] [stdout] 46 | impl Element { [INFO] [stdout] | ------------ associated function in this implementation [INFO] [stdout] 47 | fn new(number: i32, idx: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2762.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `continuous_subarrays` and `continuous_subarrays_tle` are never used [INFO] [stdout] --> src/array/easy/task_2762.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn continuous_subarrays(nums: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn continuous_subarrays_tle(nums: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1475.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `final_prices` and `final_prices_faster` are never used [INFO] [stdout] --> src/array/easy/task_1475.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn final_prices(mut prices: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn final_prices_faster(mut prices: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3151.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_array_special` and `is_array_special_declarative` are never used [INFO] [stdout] --> src/array/easy/task_3151.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn is_array_special(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | pub fn is_array_special_declarative(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1752.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `check_find_smallest` and `check` are never used [INFO] [stdout] --> src/array/easy/task_1752.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn check_find_smallest(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | pub fn check(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2529.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `maximum_count` and `maximum_count_shorter` are never used [INFO] [stdout] --> src/array/easy/task_2529.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn maximum_count(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 14 | pub fn maximum_count_shorter(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2206.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `divide_array` is never used [INFO] [stdout] --> src/array/easy/task_2206.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn divide_array(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2873.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `maximum_triplet_value` and `maximum_triplet_value_sort` are never used [INFO] [stdout] --> src/array/easy/task_2873.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn maximum_triplet_value(nums: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 16 | pub fn maximum_triplet_value_sort(mut nums: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1863.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `subset_xor_sum` and `subset_xor_sum_faster` are never used [INFO] [stdout] --> src/array/easy/task_1863.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn subset_xor_sum(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn subset_xor_sum_faster(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3375.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_operations` is never used [INFO] [stdout] --> src/array/easy/task_3375.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn min_operations(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3396.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_operations` is never used [INFO] [stdout] --> src/array/easy/task_3396.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn minimum_operations(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2843.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_symmetric_integers_faster` and `count_symmetric_integers` are never used [INFO] [stdout] --> src/array/easy/task_2843.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn count_symmetric_integers_faster(low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn count_symmetric_integers(low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1534.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_good_triplets` is never used [INFO] [stdout] --> src/array/easy/task_1534.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_good_triplets(arr: Vec, a: i32, b: i32, c: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2176.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_pairs` and `count_pairs_faster` are never used [INFO] [stdout] --> src/array/easy/task_2176.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn count_pairs(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | pub fn count_pairs_faster(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3392.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_subarrays` is never used [INFO] [stdout] --> src/array/easy/task_3392.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_subarrays(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1128.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/array/easy/task_1128.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | pub struct Pair { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_equiv_domino_pairs_brute_force` and `num_equiv_domino_pairs` are never used [INFO] [stdout] --> src/array/easy/task_1128.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 37 | pub fn num_equiv_domino_pairs_brute_force(dominoes: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | pub fn num_equiv_domino_pairs(dominoes: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1550.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `three_consecutive_odds` is never used [INFO] [stdout] --> src/array/easy/task_1550.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn three_consecutive_odds(arr: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2094.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_even_numbers` is never used [INFO] [stdout] --> src/array/easy/task_2094.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn find_even_numbers(digits: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3423.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_adjacent_distance` is never used [INFO] [stdout] --> src/array/easy/task_3423.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn max_adjacent_distance(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_594.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 8 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_lhs` and `find_lhs_shorter` are never used [INFO] [stdout] --> src/array/easy/task_594.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 11 | pub fn find_lhs(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn find_lhs_shorter(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1394.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_lucky` is never used [INFO] [stdout] --> src/array/easy/task_1394.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_lucky(arr: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3487.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_sum` and `max_sum_sorting` are never used [INFO] [stdout] --> src/array/easy/task_3487.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn max_sum(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | pub fn max_sum_sorting(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2210.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_hills_valleys` is never used [INFO] [stdout] --> src/array/easy/task_2210.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_hills_valleys(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3005.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_frequency_elements` and `max_frequency_elements_vec` are never used [INFO] [stdout] --> src/array/easy/task_3005.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn max_frequency_elements(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn max_frequency_elements_vec(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3349.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `has_increasing_subarrays` is never used [INFO] [stdout] --> src/array/easy/task_3349.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn has_increasing_subarrays(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3461.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `has_same_digits` is never used [INFO] [stdout] --> src/array/easy/task_3461.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn has_same_digits(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1716.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `total_money` is never used [INFO] [stdout] --> src/array/easy/task_1716.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn total_money(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3354.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `count_valid_selections_prefix_sum` and `count_valid_selections` are never used [INFO] [stdout] --> src/array/easy/task_3354.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn count_valid_selections_prefix_sum(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn count_valid_selections(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3289.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_sneaky_numbers` is never used [INFO] [stdout] --> src/array/easy/task_3289.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn get_sneaky_numbers(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3318.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_x_sum` is never used [INFO] [stdout] --> src/array/easy/task_3318.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 7 | pub fn find_x_sum(nums: Vec, k: i32, x: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1437.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `k_length_apart` is never used [INFO] [stdout] --> src/array/easy/task_1437.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn k_length_apart(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_717.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_one_bit_character` is never used [INFO] [stdout] --> src/array/easy/task_717.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_one_bit_character(bits: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_2154.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_final_value` and `find_final_value_hash_map` are never used [INFO] [stdout] --> src/array/easy/task_2154.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn find_final_value(mut nums: Vec, mut original: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | pub fn find_final_value_hash_map(nums: Vec, mut original: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_3190.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_operations` is never used [INFO] [stdout] --> src/array/easy/task_3190.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn minimum_operations(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/easy/task_1018.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `prefixes_div_by5` is never used [INFO] [stdout] --> src/array/easy/task_1018.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn prefixes_div_by5(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_winners` is never used [INFO] [stdout] --> src/array/medium/find_players_with_zero_or_one_losses_2225.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn find_winners(matches: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `product_except_self` is never used [INFO] [stdout] --> src/array/medium/product_of_array_except_self_238.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn product_except_self(mut nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_max_length_shorter` is never used [INFO] [stdout] --> src/array/medium/contiguous_array_525.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn find_max_length_shorter(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_max_length` is never used [INFO] [stdout] --> src/array/medium/contiguous_array_525.rs:17:8 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn find_max_length(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_max_length_brute_force` is never used [INFO] [stdout] --> src/array/medium/contiguous_array_525.rs:39:8 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn find_max_length_brute_force(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `insert` is never used [INFO] [stdout] --> src/array/medium/insert_inteval_57.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn insert(mut intervals: Vec>, new_interval: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_min_arrow_shots` is never used [INFO] [stdout] --> src/array/medium/minimum_number_of_arrows_to_burst_balloons_452.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn find_min_arrow_shots(mut points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_min_arrow_shots_stack` is never used [INFO] [stdout] --> src/array/medium/minimum_number_of_arrows_to_burst_balloons_452.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn find_min_arrow_shots_stack(mut points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `is_intersect` is never used [INFO] [stdout] --> src/array/medium/minimum_number_of_arrows_to_burst_balloons_452.rs:34:4 [INFO] [stdout] | [INFO] [stdout] 34 | fn is_intersect(from_stack: &Vec, next: &Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `least_interval` is never used [INFO] [stdout] --> src/array/medium/task_scheduler_621.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn least_interval(tasks: Vec, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `max_subarray_length` is never used [INFO] [stdout] --> src/array/medium/length_of_longest_subarray_with_most_k_frequency_2958.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn max_subarray_length(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `count_subarrays` is never used [INFO] [stdout] --> src/array/medium/count_subarrays_where_max_element_appears_at_least_k_times_2962.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn count_subarrays(nums: Vec, k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/number_of_islands_200.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_islands` is never used [INFO] [stdout] --> src/array/medium/number_of_islands_200.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/find_all_groups_of_farmland_1992.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_farmland_no_recursion` and `find_farmland` are never used [INFO] [stdout] --> src/array/medium/find_all_groups_of_farmland_1992.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 4 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 5 | pub fn find_farmland_no_recursion(mut land: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn find_farmland(mut land: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/minimum_number_of_operations_to_make_array_xor_equal_to_k_2997.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_operations` is never used [INFO] [stdout] --> src/array/medium/minimum_number_of_operations_to_make_array_xor_equal_to_k_2997.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, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/maximize_happiness_of_selected_children_3075.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `maximum_happiness_sum` and `maximum_happiness_sum_more_readable` are never used [INFO] [stdout] --> src/array/medium/maximize_happiness_of_selected_children_3075.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn maximum_happiness_sum(mut happiness: Vec, mut k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn maximum_happiness_sum_more_readable(mut happiness: Vec, mut k: i32) -> i64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/k_th_smallest_prime_fraction_786.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `kth_smallest_prime_fraction` is never used [INFO] [stdout] --> src/array/medium/k_th_smallest_prime_fraction_786.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn kth_smallest_prime_fraction(mut arr: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Fraction` is never constructed [INFO] [stdout] --> src/array/medium/k_th_smallest_prime_fraction_786.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Fraction { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `into_vec` and `build` are never used [INFO] [stdout] --> src/array/medium/k_th_smallest_prime_fraction_786.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 29 | impl Fraction { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 30 | fn into_vec(self) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn build(numerator: i32, denominator: i32) -> Fraction { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/score_after_flipping_matrix_861.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `matrix_score` and `matrix_score_brute_force` are never used [INFO] [stdout] --> src/array/medium/score_after_flipping_matrix_861.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn matrix_score(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 17 | pub fn matrix_score_brute_force(mut grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/count_triplets_that_can_form_two_arrays_of_equal_xor_1442.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_triplets` is never used [INFO] [stdout] --> src/array/medium/count_triplets_that_can_form_two_arrays_of_equal_xor_1442.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn count_triplets(arr: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/single_number_3_260.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `single_number` and `single_number_bit_manipulation` are never used [INFO] [stdout] --> src/array/medium/single_number_3_260.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn single_number(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn single_number_bit_manipulation(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/hand_of_straights_846.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_n_straight_hand` and `is_n_straight_hand_faster` are never used [INFO] [stdout] --> src/array/medium/hand_of_straights_846.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 6 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 7 | pub fn is_n_straight_hand(mut hand: Vec, group_size: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn is_n_straight_hand_faster(hand: Vec, group_size: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/continuous_subarray_sum_523.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `check_subarray_sum` is never used [INFO] [stdout] --> src/array/medium/continuous_subarray_sum_523.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn check_subarray_sum(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/subarray_sums_divisible_by_k_974.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `subarrays_div_by_k`, `subarrays_div_by_k_no_prefix_sum_array`, and `subarrays_div_by_k_tle` are never used [INFO] [stdout] --> src/array/medium/subarray_sums_divisible_by_k_974.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn subarrays_div_by_k(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | pub fn subarrays_div_by_k_no_prefix_sum_array(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | pub fn subarrays_div_by_k_tle(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/minimum_increment_to_make_array_unique_945.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_increment_for_unique`, `min_increment_for_unique_sort`, and `min_increment_for_unique_tle` are never used [INFO] [stdout] --> src/array/medium/minimum_increment_to_make_array_unique_945.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn min_increment_for_unique(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn min_increment_for_unique_sort(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn min_increment_for_unique_tle(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/count_number_of_nice_subarrays_1248.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `number_of_subarrays`, `number_of_subarrays_prefix_sum`, and `number_of_subarrays_tle` are never used [INFO] [stdout] --> src/array/medium/count_number_of_nice_subarrays_1248.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn number_of_subarrays(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 29 | pub fn number_of_subarrays_prefix_sum(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 51 | pub fn number_of_subarrays_tle(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit_1438.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `longest_subarray` and `longest_subarray_tle` are never used [INFO] [stdout] --> src/array/medium/longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit_1438.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn longest_subarray(nums: Vec, limit: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | pub fn longest_subarray_tle(nums: Vec, limit: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/minimum_difference_between_largest_and_smallest_value_in_three_moves_1509.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_difference_sort` and `min_difference` are never used [INFO] [stdout] --> src/array/medium/minimum_difference_between_largest_and_smallest_value_in_three_moves_1509.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | [INFO] [stdout] 5 | pub fn min_difference_sort(mut nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn min_difference(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/find_the_winner_of_the_circular_game_1823.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_the_winner` is never used [INFO] [stdout] --> src/array/medium/find_the_winner_of_the_circular_game_1823.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn find_the_winner(n: i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/count_number_of_teams_1395.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_teams` and `num_teams_brute_force` are never used [INFO] [stdout] --> src/array/medium/count_number_of_teams_1395.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn num_teams(rating: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn num_teams_brute_force(rating: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/filling_bookcase_shelves_1105.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_height_shelves` is never used [INFO] [stdout] --> src/array/medium/filling_bookcase_shelves_1105.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn min_height_shelves(books: Vec>, shelf_width: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MODULUS` is never used [INFO] [stdout] --> src/array/medium/range_sum_of_sorted_subarray_sums_1508.rs:3:7 [INFO] [stdout] | [INFO] [stdout] 3 | const MODULUS: i64 = (10e8 + 7f64) as i64; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/range_sum_of_sorted_subarray_sums_1508.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `range_sum` and `range_sum_sliding_window` are never used [INFO] [stdout] --> src/array/medium/range_sum_of_sorted_subarray_sums_1508.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 7 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 8 | pub fn range_sum(nums: Vec, n: i32, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | pub fn range_sum_sliding_window(nums: Vec, n: i32, left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_40.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `combination_sum2` and `backtracking` are never used [INFO] [stdout] --> src/array/medium/task_40.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn combination_sum2(mut candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 12 | fn backtracking(result: &mut Vec>, candidates: &mut Vec, temp: &mut Vec, target: i32, n: usize, start: usize) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_624.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_distance` and `max_distance_brute_force` are never used [INFO] [stdout] --> src/array/medium/task_624.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn max_distance(arrays: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn max_distance_brute_force(arrays: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_264.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `nth_ugly_number_brute_force` and `nth_ugly_number` are never used [INFO] [stdout] --> src/array/medium/task_264.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn nth_ugly_number_brute_force(mut n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | pub fn nth_ugly_number(mut n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1140.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `stone_game_ii` is never used [INFO] [stdout] --> src/array/medium/task_1140.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn stone_game_ii(mut piles: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1937.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_points` and `pick` are never used [INFO] [stdout] --> src/array/medium/task_1937.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn max_points(points: Vec>) -> i64 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 9 | fn pick(points: &Vec>, current_row: usize, previous_col: i32, cache: &mut Vec>) -> i64 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1894.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `chalk_replacer` and `chalk_replacer_faster` are never used [INFO] [stdout] --> src/array/medium/task_1894.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 4 | pub fn chalk_replacer(chalk: Vec, mut k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn chalk_replacer_faster(chalk: Vec, mut k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_874.rs:3:12 [INFO] [stdout] | [INFO] [stdout] 3 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `robot_sim` is never used [INFO] [stdout] --> src/array/medium/task_874.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 6 | pub fn robot_sim(commands: Vec, obstacles: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_2028.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `missing_rolls` is never used [INFO] [stdout] --> src/array/medium/task_2028.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn missing_rolls(mut rolls: Vec, mean: i32, n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_1310.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `xor_queries` is never used [INFO] [stdout] --> src/array/medium/task_1310.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn xor_queries(mut arr: Vec, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/array/medium/task_386.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct Solution; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lexical_order` is never used [INFO] [stdout] --> src/array/medium/task_386.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn lexical_order(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCalendar` is never constructed [INFO] [stdout] --> src/array/medium/task_729.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct MyCalendar { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `book` are never used [INFO] [stdout] --> src/array/medium/task_729.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl MyCalendar { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 13 | [INFO] [stdout] 14 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 20 | fn book(&mut self, start: i32, end: i32) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCalendarTwo` is never constructed [INFO] [stdout] --> src/array/medium/task_731.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct MyCalendarTwo { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `book` are never used [INFO] [stdout] --> src/array/medium/task_731.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 6 | impl MyCalendarTwo { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 7 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 11 | fn book(&mut self, start: i32, end: i32) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyCircularDeque` is never constructed [INFO] [stdout] --> src/array/medium/task_641.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct MyCircularDeque { [WARN] too many lines in the log, truncating it