[INFO] cloning repository https://github.com/tan-wei/leetcode-rust [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/tan-wei/leetcode-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftan-wei%2Fleetcode-rust", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftan-wei%2Fleetcode-rust'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 50277c7332c1b8356211f6416d039fc68b755e3d [INFO] building tan-wei/leetcode-rust against master#ad85bc524b1ad696e42061ad8338d382dffbdbe5 for pr-146237-1 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftan-wei%2Fleetcode-rust" "/workspace/builds/worker-6-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-6-tc1/source'... [INFO] [stderr] done. [INFO] removed /workspace/builds/worker-6-tc1/source/.cargo/config.toml [INFO] started tweaking git repo https://github.com/tan-wei/leetcode-rust [INFO] finished tweaking git repo https://github.com/tan-wei/leetcode-rust [INFO] tweaked toml for git repo https://github.com/tan-wei/leetcode-rust written to /workspace/builds/worker-6-tc1/source/Cargo.toml [INFO] validating manifest of git repo https://github.com/tan-wei/leetcode-rust on toolchain ad85bc524b1ad696e42061ad8338d382dffbdbe5 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ad85bc524b1ad696e42061ad8338d382dffbdbe5" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ad85bc524b1ad696e42061ad8338d382dffbdbe5" "generate-lockfile" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Updating crates.io index [INFO] [stderr] Locking 313 packages to latest compatible versions [INFO] [stderr] Adding rand v0.6.5 (available: v0.9.2) [INFO] [stderr] Adding reqwest v0.12.4 (available: v0.12.23) [INFO] [stderr] Adding subtle v2.4.1 (available: v2.6.1) [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ad85bc524b1ad696e42061ad8338d382dffbdbe5" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded sluice v0.5.5 [INFO] [stderr] Downloaded compression-core v0.4.29 [INFO] [stderr] Downloaded async-io v2.6.0 [INFO] [stderr] Downloaded crypto-mac v0.10.1 [INFO] [stderr] Downloaded compression-codecs v0.4.31 [INFO] [stderr] Downloaded assert_float_eq v1.1.4 [INFO] [stderr] Downloaded flume v0.9.2 [INFO] [stderr] Downloaded spinning_top v0.2.5 [INFO] [stderr] Downloaded surf v2.3.2 [INFO] [stderr] Downloaded polling v3.11.0 [INFO] [stderr] Downloaded async-compression v0.4.32 [INFO] [stderr] Downloaded curl v0.4.49 [INFO] [stderr] Downloaded isahc v0.9.14 [INFO] [stderr] Downloaded async-std v1.13.2 [INFO] [stderr] Downloaded zstd-sys v2.0.16+zstd.1.5.7 [INFO] [stderr] Downloaded libnghttp2-sys v0.1.11+1.64.0 [INFO] [stderr] Downloaded curl-sys v0.4.83+curl-8.15.0 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+ad85bc524b1ad696e42061ad8338d382dffbdbe5" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] e005049ec53f90c54b29a96c864b329beb256a36caafe6de7906b0618de57430 [INFO] running `Command { std: "docker" "start" "-a" "e005049ec53f90c54b29a96c864b329beb256a36caafe6de7906b0618de57430", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "e005049ec53f90c54b29a96c864b329beb256a36caafe6de7906b0618de57430", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "e005049ec53f90c54b29a96c864b329beb256a36caafe6de7906b0618de57430", kill_on_drop: false }` [INFO] [stdout] e005049ec53f90c54b29a96c864b329beb256a36caafe6de7906b0618de57430 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+ad85bc524b1ad696e42061ad8338d382dffbdbe5" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 9c9d3087cc58cbd7659596fdfa9695a1152ef895a35fde09da518eed9f76b2ee [INFO] running `Command { std: "docker" "start" "-a" "9c9d3087cc58cbd7659596fdfa9695a1152ef895a35fde09da518eed9f76b2ee", kill_on_drop: false }` [INFO] [stderr] Compiling unicode-ident v1.0.19 [INFO] [stderr] Compiling libc v0.2.176 [INFO] [stderr] Compiling find-msvc-tools v0.1.2 [INFO] [stderr] Compiling value-bag v1.11.1 [INFO] [stderr] Compiling smallvec v1.15.1 [INFO] [stderr] Compiling generic-array v0.14.7 [INFO] [stderr] Compiling memchr v2.7.6 [INFO] [stderr] Compiling slab v0.4.11 [INFO] [stderr] Compiling serde_core v1.0.228 [INFO] [stderr] Compiling concurrent-queue v2.5.0 [INFO] [stderr] Compiling subtle v2.4.1 [INFO] [stderr] Compiling serde v1.0.228 [INFO] [stderr] Compiling percent-encoding v2.3.2 [INFO] [stderr] Compiling wasm-bindgen-shared v0.2.104 [INFO] [stderr] Compiling standback v0.2.17 [INFO] [stderr] Compiling autocfg v0.1.8 [INFO] [stderr] Compiling proc-macro-hack v0.5.20+deprecated [INFO] [stderr] Compiling rustix v1.1.2 [INFO] [stderr] Compiling proc-macro2 v1.0.101 [INFO] [stderr] Compiling log v0.4.28 [INFO] [stderr] Compiling ppv-lite86 v0.2.21 [INFO] [stderr] Compiling futures-lite v2.6.1 [INFO] [stderr] Compiling event-listener v5.4.1 [INFO] [stderr] Compiling futures-channel v0.3.31 [INFO] [stderr] Compiling rustversion v1.0.22 [INFO] [stderr] Compiling linux-raw-sys v0.11.0 [INFO] [stderr] Compiling form_urlencoded v1.2.2 [INFO] [stderr] Compiling async-io v2.6.0 [INFO] [stderr] Compiling const_fn v0.4.11 [INFO] [stderr] Compiling event-listener-strategy v0.5.4 [INFO] [stderr] Compiling quote v1.0.40 [INFO] [stderr] Compiling cipher v0.2.5 [INFO] [stderr] Compiling universal-hash v0.4.1 [INFO] [stderr] Compiling digest v0.9.0 [INFO] [stderr] Compiling cpuid-bool v0.2.0 [INFO] [stderr] Compiling bumpalo v3.19.0 [INFO] [stderr] Compiling polyval v0.4.5 [INFO] [stderr] Compiling aes-soft v0.6.4 [INFO] [stderr] Compiling async-channel v1.9.0 [INFO] [stderr] Compiling async-channel v2.5.0 [INFO] [stderr] Compiling syn v2.0.106 [INFO] [stderr] Compiling syn v1.0.109 [INFO] [stderr] Compiling crypto-mac v0.10.1 [INFO] [stderr] Compiling piper v0.2.4 [INFO] [stderr] Compiling time v0.2.27 [INFO] [stderr] Compiling zstd-safe v7.2.4 [INFO] [stderr] Compiling hashbrown v0.16.0 [INFO] [stderr] Compiling hmac v0.10.1 [INFO] [stderr] Compiling aes v0.6.0 [INFO] [stderr] Compiling blocking v1.6.2 [INFO] [stderr] Compiling async-executor v1.13.3 [INFO] [stderr] Compiling ghash v0.3.1 [INFO] [stderr] Compiling ctr v0.6.0 [INFO] [stderr] Compiling async-lock v3.4.1 [INFO] [stderr] Compiling block-buffer v0.9.0 [INFO] [stderr] Compiling aead v0.3.2 [INFO] [stderr] Compiling indexmap v2.11.4 [INFO] [stderr] Compiling cookie v0.14.4 [INFO] [stderr] Compiling curl v0.4.49 [INFO] [stderr] Compiling native-tls v0.2.14 [INFO] [stderr] Compiling anyhow v1.0.100 [INFO] [stderr] Compiling futures-lite v1.13.0 [INFO] [stderr] Compiling aes-gcm v0.8.0 [INFO] [stderr] Compiling sha2 v0.9.9 [INFO] [stderr] Compiling hkdf v0.10.0 [INFO] [stderr] Compiling brotli-decompressor v5.0.0 [INFO] [stderr] Compiling crc32fast v1.5.0 [INFO] [stderr] Compiling kv-log-macro v1.0.7 [INFO] [stderr] Compiling spinning_top v0.2.5 [INFO] [stderr] Compiling isahc v0.9.14 [INFO] [stderr] Compiling jobserver v0.1.34 [INFO] [stderr] Compiling socket2 v0.6.0 [INFO] [stderr] Compiling parking_lot_core v0.9.11 [INFO] [stderr] Compiling signal-hook-registry v1.4.6 [INFO] [stderr] Compiling mio v1.0.4 [INFO] [stderr] Compiling getrandom v0.2.16 [INFO] [stderr] Compiling cc v1.2.39 [INFO] [stderr] Compiling parking_lot v0.12.4 [INFO] [stderr] Compiling rand_core v0.6.4 [INFO] [stderr] Compiling getrandom v0.1.16 [INFO] [stderr] Compiling wasm-bindgen v0.2.104 [INFO] [stderr] Compiling rand_chacha v0.3.1 [INFO] [stderr] Compiling rand_core v0.5.1 [INFO] [stderr] Compiling http-types v2.12.0 [INFO] [stderr] Compiling unicase v2.8.1 [INFO] [stderr] Compiling brotli v8.0.2 [INFO] [stderr] Compiling flume v0.9.2 [INFO] [stderr] Compiling flate2 v1.1.2 [INFO] [stderr] Compiling rand v0.8.5 [INFO] [stderr] Compiling rand_chacha v0.2.2 [INFO] [stderr] Compiling sluice v0.5.5 [INFO] [stderr] Compiling rand_chacha v0.1.1 [INFO] [stderr] Compiling rand_pcg v0.1.2 [INFO] [stderr] Compiling mime_guess v2.0.5 [INFO] [stderr] Compiling infer v0.2.3 [INFO] [stderr] Compiling compression-core v0.4.29 [INFO] [stderr] Compiling rand v0.7.3 [INFO] [stderr] Compiling rustls-pki-types v1.12.0 [INFO] [stderr] Compiling num_cpus v1.17.0 [INFO] [stderr] Compiling aho-corasick v1.1.3 [INFO] [stderr] Compiling rand v0.6.5 [INFO] [stderr] Compiling encoding_rs v0.8.35 [INFO] [stderr] Compiling serde_json v1.0.145 [INFO] [stderr] Compiling rustls-pemfile v2.2.0 [INFO] [stderr] Compiling rand_os v0.1.3 [INFO] [stderr] Compiling time-macros-impl v0.1.2 [INFO] [stderr] Compiling openssl-sys v0.9.109 [INFO] [stderr] Compiling libz-sys v1.1.22 [INFO] [stderr] Compiling libnghttp2-sys v0.1.11+1.64.0 [INFO] [stderr] Compiling zstd-sys v2.0.16+zstd.1.5.7 [INFO] [stderr] Compiling curl-sys v0.4.83+curl-8.15.0 [INFO] [stderr] Compiling regex-automata v0.4.11 [INFO] [stderr] Compiling time-macros v0.1.1 [INFO] [stderr] Compiling openssl v0.10.73 [INFO] [stderr] Compiling regex v1.11.3 [INFO] [stderr] Compiling synstructure v0.13.2 [INFO] [stderr] Compiling wasm-bindgen-backend v0.2.104 [INFO] [stderr] Compiling polling v3.11.0 [INFO] [stderr] Compiling zerofrom-derive v0.1.6 [INFO] [stderr] Compiling yoke-derive v0.8.0 [INFO] [stderr] Compiling zerovec-derive v0.11.1 [INFO] [stderr] Compiling displaydoc v0.2.5 [INFO] [stderr] Compiling tracing-attributes v0.1.30 [INFO] [stderr] Compiling tokio-macros v2.5.0 [INFO] [stderr] Compiling serde_derive v1.0.228 [INFO] [stderr] Compiling futures-macro v0.3.31 [INFO] [stderr] Compiling openssl-macros v0.1.1 [INFO] [stderr] Compiling thiserror-impl v1.0.69 [INFO] [stderr] Compiling pin-project-internal v1.1.10 [INFO] [stderr] Compiling async-trait v0.1.89 [INFO] [stderr] Compiling tokio v1.47.1 [INFO] [stderr] Compiling futures-util v0.3.31 [INFO] [stderr] Compiling wasm-bindgen-macro-support v0.2.104 [INFO] [stderr] Compiling async-global-executor v2.4.1 [INFO] [stderr] Compiling zerofrom v0.1.6 [INFO] [stderr] Compiling async-std v1.13.2 [INFO] [stderr] Compiling thiserror v1.0.69 [INFO] [stderr] Compiling yoke v0.8.0 [INFO] [stderr] Compiling tracing v0.1.41 [INFO] [stderr] Compiling pin-project v1.1.10 [INFO] [stderr] Compiling tracing-futures v0.2.5 [INFO] [stderr] Compiling wasm-bindgen-macro v0.2.104 [INFO] [stderr] Compiling zerovec v0.11.4 [INFO] [stderr] Compiling zerotrie v0.2.2 [INFO] [stderr] Compiling zstd v0.13.3 [INFO] [stderr] Compiling compression-codecs v0.4.31 [INFO] [stderr] Compiling futures-executor v0.3.31 [INFO] [stderr] Compiling tinystr v0.8.1 [INFO] [stderr] Compiling potential_utf v0.1.3 [INFO] [stderr] Compiling icu_collections v2.0.0 [INFO] [stderr] Compiling js-sys v0.3.81 [INFO] [stderr] Compiling icu_locale_core v2.0.0 [INFO] [stderr] Compiling futures v0.3.31 [INFO] [stderr] Compiling icu_provider v2.0.0 [INFO] [stderr] Compiling serde_urlencoded v0.7.1 [INFO] [stderr] Compiling serde_qs v0.8.5 [INFO] [stderr] Compiling icu_normalizer v2.0.0 [INFO] [stderr] Compiling icu_properties v2.0.1 [INFO] [stderr] Compiling idna_adapter v1.2.1 [INFO] [stderr] Compiling idna v1.1.0 [INFO] [stderr] Compiling url v2.5.7 [INFO] [stderr] Compiling tokio-util v0.7.16 [INFO] [stderr] Compiling tokio-native-tls v0.3.1 [INFO] [stderr] Compiling async-compression v0.4.32 [INFO] [stderr] Compiling h2 v0.4.12 [INFO] [stderr] Compiling http-client v6.5.3 [INFO] [stderr] Compiling web-sys v0.3.81 [INFO] [stderr] Compiling surf v2.3.2 [INFO] [stderr] Compiling hyper v1.7.0 [INFO] [stderr] Compiling hyper-util v0.1.17 [INFO] [stderr] Compiling hyper-tls v0.6.0 [INFO] [stderr] Compiling reqwest v0.12.4 [INFO] [stderr] Compiling leetcode-rust v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0002_add_two_numbers.rs:41:32 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0019_remove_nth_node_from_end_of_list.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0021_merge_two_sorted_lists.rs:30:32 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0023_merge_k_sorted_lists.rs:42:32 [INFO] [stdout] | [INFO] [stdout] 42 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0024_swap_nodes_in_pairs.rs:31:32 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:42:32 [INFO] [stdout] | [INFO] [stdout] 42 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:73:20 [INFO] [stdout] | [INFO] [stdout] 73 | if (board[i][j] != '.') { [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] 73 - if (board[i][j] != '.') { [INFO] [stdout] 73 + if board[i][j] != '.' { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:77:24 [INFO] [stdout] | [INFO] [stdout] 77 | if (used1[i][num] || used2[j][num] || used3[k][num]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 77 - if (used1[i][num] || used2[j][num] || used3[k][num]) { [INFO] [stdout] 77 + if used1[i][num] || used2[j][num] || used3[k][num] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:25:32 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0064_minimum_path_sum.rs:47:27 [INFO] [stdout] | [INFO] [stdout] 47 | } else if (j == n - 1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 47 - } else if (j == n - 1) { [INFO] [stdout] 47 + } else if j == n - 1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:42:16 [INFO] [stdout] | [INFO] [stdout] 42 | if (nums[mid] == target) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 42 - if (nums[mid] == target) { [INFO] [stdout] 42 + if nums[mid] == target { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:44:23 [INFO] [stdout] | [INFO] [stdout] 44 | } else if (nums[mid] > nums[h]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 44 - } else if (nums[mid] > nums[h]) { [INFO] [stdout] 44 + } else if nums[mid] > nums[h] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:25:32 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:25:32 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0086_partition_list.rs:26:32 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:28:32 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0094_binary_tree_inorder_traversal.rs:44:25 [INFO] [stdout] | [INFO] [stdout] 44 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:23:25 [INFO] [stdout] | [INFO] [stdout] 23 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0098_validate_binary_search_tree.rs:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0099_recover_binary_search_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0100_same_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0101_symmetric_tree.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0102_binary_tree_level_order_traversal.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0103_binary_tree_zigzag_level_order_traversal.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0104_maximum_depth_of_binary_tree.rs:46:25 [INFO] [stdout] | [INFO] [stdout] 46 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0107_binary_tree_level_order_traversal_ii.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:36:32 [INFO] [stdout] | [INFO] [stdout] 36 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0110_balanced_binary_tree.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0111_minimum_depth_of_binary_tree.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0112_path_sum.rs:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0113_path_sum_ii.rs:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0114_flatten_binary_tree_to_linked_list.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs:53:18 [INFO] [stdout] | [INFO] [stdout] 53 | for i in (0..prices.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - for i in (0..prices.len()) { [INFO] [stdout] 53 + for i in 0..prices.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0124_binary_tree_maximum_path_sum.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0129_sum_root_to_leaf_numbers.rs:40:25 [INFO] [stdout] | [INFO] [stdout] 40 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0132_palindrome_partitioning_ii.rs:50:20 [INFO] [stdout] | [INFO] [stdout] 50 | if (s[i] == s[j] && (j - i < 2 || pal[i + 1][j - 1])) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (s[i] == s[j] && (j - i < 2 || pal[i + 1][j - 1])) { [INFO] [stdout] 50 + if s[i] == s[j] && (j - i < 2 || pal[i + 1][j - 1]) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0144_binary_tree_preorder_traversal.rs:42:25 [INFO] [stdout] | [INFO] [stdout] 42 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0145_binary_tree_postorder_traversal.rs:41:25 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0148_sort_list.rs:30:32 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:46:25 [INFO] [stdout] | [INFO] [stdout] 46 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0199_binary_tree_right_side_view.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0203_remove_linked_list_elements.rs:30:32 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0206_reverse_linked_list.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0222_count_complete_tree_nodes.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0226_invert_binary_tree.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0230_kth_smallest_element_in_a_bst.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0234_palindrome_linked_list.rs:26:32 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0235_lowest_common_ancestor_of_a_binary_search_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0236_lowest_common_ancestor_of_a_binary_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0257_binary_tree_paths.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `while` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:39:15 [INFO] [stdout] | [INFO] [stdout] 39 | while (ugly_numbers.len() < n as usize) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 39 - while (ugly_numbers.len() < n as usize) { [INFO] [stdout] 39 + while ugly_numbers.len() < n as usize { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:47:16 [INFO] [stdout] | [INFO] [stdout] 47 | if (last == ugly_numbers[x] * 2) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 47 - if (last == ugly_numbers[x] * 2) { [INFO] [stdout] 47 + if last == ugly_numbers[x] * 2 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:50:16 [INFO] [stdout] | [INFO] [stdout] 50 | if (last == ugly_numbers[y] * 3) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (last == ugly_numbers[y] * 3) { [INFO] [stdout] 50 + if last == ugly_numbers[y] * 3 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0264_ugly_number_ii.rs:53:16 [INFO] [stdout] | [INFO] [stdout] 53 | if (last == ugly_numbers[z] * 5) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - if (last == ugly_numbers[z] * 5) { [INFO] [stdout] 53 + if last == ugly_numbers[z] * 5 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0297_serialize_and_deserialize_binary_tree.rs:36:25 [INFO] [stdout] | [INFO] [stdout] 36 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `TryFrom` [INFO] [stdout] --> src/solution/s0315_count_of_smaller_numbers_after_self.rs:44:28 [INFO] [stdout] | [INFO] [stdout] 44 | use std::convert::{TryFrom, TryInto}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0328_odd_even_linked_list.rs:28:32 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0337_house_robber_iii.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::ptr::addr_of` [INFO] [stdout] --> src/solution/s0374_guess_number_higher_or_lower.rs:36:5 [INFO] [stdout] | [INFO] [stdout] 36 | use std::ptr::addr_of; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0376_wiggle_subsequence.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 50 | if (size == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (size == 0) { [INFO] [stdout] 50 + if size == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0382_linked_list_random_node.rs:41:32 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0404_sum_of_left_leaves.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:38:28 [INFO] [stdout] | [INFO] [stdout] 38 | answer.push(if (i % 15 == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 38 - answer.push(if (i % 15 == 0) { [INFO] [stdout] 38 + answer.push(if i % 15 == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:41:20 [INFO] [stdout] | [INFO] [stdout] 41 | if (i % 3 == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 41 - if (i % 3 == 0) { [INFO] [stdout] 41 + if i % 3 == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0412_fizz_buzz.rs:44:24 [INFO] [stdout] | [INFO] [stdout] 44 | if (i % 5 == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 44 - if (i % 5 == 0) { [INFO] [stdout] 44 + if i % 5 == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0437_path_sum_iii.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0445_add_two_numbers_ii.rs:34:32 [INFO] [stdout] | [INFO] [stdout] 34 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0449_serialize_and_deserialize_bst.rs:23:25 [INFO] [stdout] | [INFO] [stdout] 23 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0450_delete_node_in_a_bst.rs:45:25 [INFO] [stdout] | [INFO] [stdout] 45 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around method argument [INFO] [stdout] --> src/solution/s0475_heaters.rs:52:47 [INFO] [stdout] | [INFO] [stdout] 52 | _ => (heaters[i] - h).min((h - heaters[i - 1])), [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 52 - _ => (heaters[i] - h).min((h - heaters[i - 1])), [INFO] [stdout] 52 + _ => (heaters[i] - h).min(h - heaters[i - 1]), [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0498_diagonal_traverse.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | if (mat.len() == 0 || mat[0].len() == 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 35 - if (mat.len() == 0 || mat[0].len() == 0) { [INFO] [stdout] 35 + if mat.len() == 0 || mat[0].len() == 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0501_find_mode_in_binary_search_tree.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0508_most_frequent_subtree_sum.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0513_find_bottom_left_tree_value.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0514_freedom_trail.rs:53:26 [INFO] [stdout] | [INFO] [stdout] 53 | for r_pos in (0..ring.len()) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - for r_pos in (0..ring.len()) { [INFO] [stdout] 53 + for r_pos in 0..ring.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0515_find_largest_value_in_each_tree_row.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0530_minimum_absolute_difference_in_bst.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0538_convert_bst_to_greater_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0543_diameter_of_binary_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0563_binary_tree_tilt.rs:43:25 [INFO] [stdout] | [INFO] [stdout] 43 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0572_subtree_of_another_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0600_non_negative_integers_without_consecutive_ones.rs:61:54 [INFO] [stdout] | [INFO] [stdout] 61 | FB[bt - 1] + Self::find_integers((n & !(1 << bt))) [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - FB[bt - 1] + Self::find_integers((n & !(1 << bt))) [INFO] [stdout] 61 + FB[bt - 1] + Self::find_integers(n & !(1 << bt)) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0606_construct_string_from_binary_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0617_merge_two_binary_trees.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0623_add_one_row_to_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0637_average_of_levels_in_binary_tree.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0652_find_duplicate_subtrees.rs:31:25 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0653_two_sum_iv_input_is_a_bst.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0654_maximum_binary_tree.rs:41:25 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0655_print_binary_tree.rs:39:25 [INFO] [stdout] | [INFO] [stdout] 39 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0662_maximum_width_of_binary_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0665_non_decreasing_array.rs:41:20 [INFO] [stdout] | [INFO] [stdout] 41 | if (i < 2 || nums[i - 2] <= nums[i]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 41 - if (i < 2 || nums[i - 2] <= nums[i]) { [INFO] [stdout] 41 + if i < 2 || nums[i - 2] <= nums[i] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0669_trim_a_binary_search_tree.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `match` scrutinee expression [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:61:33 [INFO] [stdout] | [INFO] [stdout] 61 | Some(root) => match ((root.borrow().left.clone(), root.borrow().right.clone())) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - Some(root) => match ((root.borrow().left.clone(), root.borrow().right.clone())) { [INFO] [stdout] 61 + Some(root) => match (root.borrow().left.clone(), root.borrow().right.clone()) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:69:24 [INFO] [stdout] | [INFO] [stdout] 69 | if (left_val == root.borrow().val) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 69 - if (left_val == root.borrow().val) { [INFO] [stdout] 69 + if left_val == root.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0671_second_minimum_node_in_a_binary_tree.rs:73:24 [INFO] [stdout] | [INFO] [stdout] 73 | if (right_val == root.borrow().val) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 73 - if (right_val == root.borrow().val) { [INFO] [stdout] 73 + if right_val == root.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0687_longest_univalue_path.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0700_search_in_a_binary_search_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0701_insert_into_a_binary_search_tree.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0701_insert_into_a_binary_search_tree.rs:70:20 [INFO] [stdout] | [INFO] [stdout] 70 | if (val < node.borrow().val) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 70 - if (val < node.borrow().val) { [INFO] [stdout] 70 + if val < node.borrow().val { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0703_kth_largest_element_in_a_stream.rs:71:12 [INFO] [stdout] | [INFO] [stdout] 71 | if (val <= curr_kth) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 71 - if (val <= curr_kth) { [INFO] [stdout] 71 + if val <= curr_kth { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0725_split_linked_list_in_parts.rs:33:32 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0740_delete_and_earn.rs:48:50 [INFO] [stdout] | [INFO] [stdout] 48 | (2..10001).for_each(|i| dp[i] = i32::max((sum[i] + dp[i - 2]), dp[i - 1])); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 48 - (2..10001).for_each(|i| dp[i] = i32::max((sum[i] + dp[i - 2]), dp[i - 1])); [INFO] [stdout] 48 + (2..10001).for_each(|i| dp[i] = i32::max(sum[i] + dp[i - 2], dp[i - 1])); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0780_reaching_points.rs:51:40 [INFO] [stdout] | [INFO] [stdout] 51 | tx -= std::cmp::max(1, ((tx - sx) / ty)) * ty; [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - tx -= std::cmp::max(1, ((tx - sx) / ty)) * ty; [INFO] [stdout] 51 + tx -= std::cmp::max(1, (tx - sx) / ty) * ty; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s0780_reaching_points.rs:53:40 [INFO] [stdout] | [INFO] [stdout] 53 | ty -= std::cmp::max(1, ((ty - sy) / tx)) * tx; [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - ty -= std::cmp::max(1, ((ty - sy) / tx)) * tx; [INFO] [stdout] 53 + ty -= std::cmp::max(1, (ty - sy) / tx) * tx; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0783_minimum_distance_between_bst_nodes.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0814_binary_tree_pruning.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0817_linked_list_components.rs:32:32 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s0830_positions_of_large_groups.rs:49:18 [INFO] [stdout] | [INFO] [stdout] 49 | for i in (1..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 49 - for i in (1..n) { [INFO] [stdout] 49 + for i in 1..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0863_all_nodes_distance_k_in_binary_tree.rs:29:25 [INFO] [stdout] | [INFO] [stdout] 29 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s0864_shortest_path_to_get_all_keys.rs:113:33 [INFO] [stdout] | [INFO] [stdout] 113 | keys |= (1 << (c - b'a')); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 113 - keys |= (1 << (c - b'a')); [INFO] [stdout] 113 + keys |= 1 << (c - b'a'); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0865_smallest_subtree_with_all_the_deepest_nodes.rs:41:25 [INFO] [stdout] | [INFO] [stdout] 41 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0872_leaf_similar_trees.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s0876_middle_of_the_linked_list.rs:27:32 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s0878_nth_magical_number.rs:41:22 [INFO] [stdout] | [INFO] [stdout] 41 | let mut hi = (n * std::cmp::min(a, b)); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 41 - let mut hi = (n * std::cmp::min(a, b)); [INFO] [stdout] 41 + let mut hi = n * std::cmp::min(a, b); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0889_construct_binary_tree_from_preorder_and_postorder_traversal.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0894_all_possible_full_binary_trees.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0897_increasing_order_search_tree.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0919_complete_binary_tree_inserter.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/solution/s0919_complete_binary_tree_inserter.rs:64:5 [INFO] [stdout] | [INFO] [stdout] 64 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0938_range_sum_of_bst.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0951_flip_equivalent_binary_trees.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0958_check_completeness_of_a_binary_tree.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0965_univalued_binary_tree.rs:25:25 [INFO] [stdout] | [INFO] [stdout] 25 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0968_binary_tree_cameras.rs:27:25 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0971_flip_binary_tree_to_match_preorder_traversal.rs:39:25 [INFO] [stdout] | [INFO] [stdout] 39 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0978_longest_turbulent_subarray.rs:57:16 [INFO] [stdout] | [INFO] [stdout] 57 | if (arr[i] < arr[i - 1]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 57 - if (arr[i] < arr[i - 1]) { [INFO] [stdout] 57 + if arr[i] < arr[i - 1] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0978_longest_turbulent_subarray.rs:60:23 [INFO] [stdout] | [INFO] [stdout] 60 | } else if (arr[i] > arr[i - 1]) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 60 - } else if (arr[i] > arr[i - 1]) { [INFO] [stdout] 60 + } else if arr[i] > arr[i - 1] { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0979_distribute_coins_in_binary_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0987_vertical_order_traversal_of_a_binary_tree.rs:47:25 [INFO] [stdout] | [INFO] [stdout] 47 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0988_smallest_string_starting_from_leaf.rs:35:25 [INFO] [stdout] | [INFO] [stdout] 35 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0993_cousins_in_binary_tree.rs:34:25 [INFO] [stdout] | [INFO] [stdout] 34 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s0995_minimum_number_of_k_consecutive_bit_flips.rs:51:16 [INFO] [stdout] | [INFO] [stdout] 51 | if (i >= k) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - if (i >= k) { [INFO] [stdout] 51 + if i >= k { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s0998_maximum_binary_tree_ii.rs:46:25 [INFO] [stdout] | [INFO] [stdout] 46 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1008_construct_binary_search_tree_from_preorder_traversal.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1019_next_greater_node_in_linked_list.rs:27:32 [INFO] [stdout] | [INFO] [stdout] 27 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1022_sum_of_root_to_leaf_binary_numbers.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1026_maximum_difference_between_node_and_ancestor.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1028_recover_a_tree_from_preorder_traversal.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1038_binary_search_tree_to_greater_sum_tree.rs:34:25 [INFO] [stdout] | [INFO] [stdout] 34 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1080_insufficient_nodes_in_root_to_leaf_paths.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1105_filling_bookcase_shelves.rs:51:22 [INFO] [stdout] | [INFO] [stdout] 51 | for j in (i..n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - for j in (i..n) { [INFO] [stdout] 51 + for j in i..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1110_delete_nodes_and_return_forest.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1123_lowest_common_ancestor_of_deepest_leaves.rs:43:25 [INFO] [stdout] | [INFO] [stdout] 43 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1145_binary_tree_coloring_game.rs:32:25 [INFO] [stdout] | [INFO] [stdout] 32 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1147_longest_chunked_palindrome_decomposition.rs:54:16 [INFO] [stdout] | [INFO] [stdout] 54 | if (i <= prev_token_end) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 54 - if (i <= prev_token_end) { [INFO] [stdout] 54 + if i <= prev_token_end { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1161_maximum_level_sum_of_a_binary_tree.rs:30:25 [INFO] [stdout] | [INFO] [stdout] 30 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1171_remove_zero_sum_consecutive_nodes_from_linked_list.rs:33:32 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `TryFrom` [INFO] [stdout] --> src/solution/s1172_dinner_plate_stacks.rs:72:20 [INFO] [stdout] | [INFO] [stdout] 72 | use std::convert::{TryFrom, TryInto}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s1224_maximum_equal_frequency.rs:62:28 [INFO] [stdout] | [INFO] [stdout] 62 | let s_single = (cnt_min == 1 && n == cnt_histogram[cnt_max] * cnt_max + 1); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 62 - let s_single = (cnt_min == 1 && n == cnt_histogram[cnt_max] * cnt_max + 1); [INFO] [stdout] 62 + let s_single = cnt_min == 1 && n == cnt_histogram[cnt_max] * cnt_max + 1; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around block return value [INFO] [stdout] --> src/solution/s1224_maximum_equal_frequency.rs:64:17 [INFO] [stdout] | [INFO] [stdout] 64 | (cnt_max > 1 [INFO] [stdout] | ^ [INFO] [stdout] 65 | && cnt_histogram[cnt_max] == 1 [INFO] [stdout] 66 | && n == cnt_histogram[cnt_max - 1] * (cnt_max - 1) + cnt_max) [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 64 ~ cnt_max > 1 [INFO] [stdout] 65 | && cnt_histogram[cnt_max] == 1 [INFO] [stdout] 66 ~ && n == cnt_histogram[cnt_max - 1] * (cnt_max - 1) + cnt_max [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1248_count_number_of_nice_subarrays.rs:55:16 [INFO] [stdout] | [INFO] [stdout] 55 | if (i % 2 != 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 55 - if (i % 2 != 0) { [INFO] [stdout] 55 + if i % 2 != 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1248_count_number_of_nice_subarrays.rs:58:16 [INFO] [stdout] | [INFO] [stdout] 58 | if (map.contains_key(&(count - k))) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 58 - if (map.contains_key(&(count - k))) { [INFO] [stdout] 58 + if map.contains_key(&(count - k)) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1248_count_number_of_nice_subarrays.rs:61:16 [INFO] [stdout] | [INFO] [stdout] 61 | if (map.contains_key(&count)) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 61 - if (map.contains_key(&count)) { [INFO] [stdout] 61 + if map.contains_key(&count) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1261_find_elements_in_a_contaminated_binary_tree.rs:65:25 [INFO] [stdout] | [INFO] [stdout] 65 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1278_palindrome_partitioning_iii.rs:71:19 [INFO] [stdout] | [INFO] [stdout] 71 | for ll in ((k - 1) as usize..l) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 71 - for ll in ((k - 1) as usize..l) { [INFO] [stdout] 71 + for ll in (k - 1) as usize..l { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1290_convert_binary_number_in_a_linked_list_to_integer.rs:28:32 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1302_deepest_leaves_sum.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1305_all_elements_in_two_binary_search_trees.rs:24:25 [INFO] [stdout] | [INFO] [stdout] 24 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1315_sum_of_nodes_with_even_valued_grandparent.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1325_delete_leaves_with_a_given_value.rs:36:25 [INFO] [stdout] | [INFO] [stdout] 36 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1339_maximum_product_of_splitted_binary_tree.rs:28:25 [INFO] [stdout] | [INFO] [stdout] 28 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:43:16 [INFO] [stdout] | [INFO] [stdout] 43 | if (left_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 43 - if (left_child[i] != -1) { [INFO] [stdout] 43 + if left_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:46:16 [INFO] [stdout] | [INFO] [stdout] 46 | if (right_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 46 - if (right_child[i] != -1) { [INFO] [stdout] 46 + if right_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | if (root < 0 || root >= n) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - if (root < 0 || root >= n) { [INFO] [stdout] 53 + if root < 0 || root >= n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:63:16 [INFO] [stdout] | [INFO] [stdout] 63 | if (v.contains(&i)) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 63 - if (v.contains(&i)) { [INFO] [stdout] 63 + if v.contains(&i) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:69:16 [INFO] [stdout] | [INFO] [stdout] 69 | if (left_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 69 - if (left_child[i] != -1) { [INFO] [stdout] 69 + if left_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1361_validate_binary_tree_nodes.rs:72:16 [INFO] [stdout] | [INFO] [stdout] 72 | if (right_child[i] != -1) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 72 - if (right_child[i] != -1) { [INFO] [stdout] 72 + if right_child[i] != -1 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1367_linked_list_in_binary_tree.rs:36:32 [INFO] [stdout] | [INFO] [stdout] 36 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1367_linked_list_in_binary_tree.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1372_longest_zigzag_path_in_a_binary_tree.rs:40:25 [INFO] [stdout] | [INFO] [stdout] 40 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1373_maximum_sum_bst_in_binary_tree.rs:40:25 [INFO] [stdout] | [INFO] [stdout] 40 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1382_balance_a_binary_search_tree.rs:26:25 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s1383_maximum_performance_of_a_team.rs:58:17 [INFO] [stdout] | [INFO] [stdout] 58 | let k = (k as usize); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 58 - let k = (k as usize); [INFO] [stdout] 58 + let k = k as usize; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::collections::VecDeque` [INFO] [stdout] --> src/solution/s1424_diagonal_traverse_ii.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::collections::VecDeque; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1431_kids_with_the_greatest_number_of_candies.rs:53:18 [INFO] [stdout] | [INFO] [stdout] 53 | for i in (0..len) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - for i in (0..len) { [INFO] [stdout] 53 + for i in 0..len { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `for` iterator expression [INFO] [stdout] --> src/solution/s1431_kids_with_the_greatest_number_of_candies.rs:58:18 [INFO] [stdout] | [INFO] [stdout] 58 | for i in (0..len) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 58 - for i in (0..len) { [INFO] [stdout] 58 + for i in 0..len { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1448_count_good_nodes_in_binary_tree.rs:47:25 [INFO] [stdout] | [INFO] [stdout] 47 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1457_pseudo_palindromic_paths_in_a_binary_tree.rs:33:25 [INFO] [stdout] | [INFO] [stdout] 33 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around function argument [INFO] [stdout] --> src/solution/s1526_minimum_number_of_increments_on_subarrays_to_form_a_target_array.rs:50:62 [INFO] [stdout] | [INFO] [stdout] 50 | .fold(target[0], |acc, z| acc + std::cmp::max(0, (z.1 - z.0))) [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - .fold(target[0], |acc, z| acc + std::cmp::max(0, (z.1 - z.0))) [INFO] [stdout] 50 + .fold(target[0], |acc, z| acc + std::cmp::max(0, z.1 - z.0)) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1530_number_of_good_leaf_nodes_pairs.rs:34:25 [INFO] [stdout] | [INFO] [stdout] 34 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around method argument [INFO] [stdout] --> src/solution/s1561_maximum_number_of_coins_you_can_get.rs:53:27 [INFO] [stdout] | [INFO] [stdout] 53 | piles.iter().skip((piles.len() / 3)).step_by(2).sum() [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 53 - piles.iter().skip((piles.len() / 3)).step_by(2).sum() [INFO] [stdout] 53 + piles.iter().skip(piles.len() / 3).step_by(2).sum() [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1609_even_odd_tree.rs:47:25 [INFO] [stdout] | [INFO] [stdout] 47 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around assigned value [INFO] [stdout] --> src/solution/s1665_minimum_initial_energy_to_finish_tasks.rs:72:27 [INFO] [stdout] | [INFO] [stdout] 72 | result += (task[1] - result); [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 72 - result += (task[1] - result); [INFO] [stdout] 72 + result += task[1] - result; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1669_merge_in_between_linked_lists.rs:31:32 [INFO] [stdout] | [INFO] [stdout] 31 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around index expression [INFO] [stdout] --> src/solution/s1706_where_will_the_ball_fall.rs:64:58 [INFO] [stdout] | [INFO] [stdout] 64 | ... || (row[col as usize] != row[((col + row[col as usize]) as usize)]) [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 64 - || (row[col as usize] != row[((col + row[col as usize]) as usize)]) [INFO] [stdout] 64 + || (row[col as usize] != row[(col + row[col as usize]) as usize]) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around index expression [INFO] [stdout] --> src/solution/s1706_where_will_the_ball_fall.rs:68:39 [INFO] [stdout] | [INFO] [stdout] 68 | ... col + row[((col + row[col as usize]) as usize)] [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 68 - col + row[((col + row[col as usize]) as usize)] [INFO] [stdout] 68 + col + row[(col + row[col as usize]) as usize] [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s1721_swapping_nodes_in_a_linked_list.rs:26:32 [INFO] [stdout] | [INFO] [stdout] 26 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1727_largest_submatrix_with_rearrangements.rs:50:20 [INFO] [stdout] | [INFO] [stdout] 50 | if (matrix[i][j] != 0) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 50 - if (matrix[i][j] != 0) { [INFO] [stdout] 50 + if matrix[i][j] != 0 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1775_equal_sum_arrays_with_minimum_number_of_operations.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 51 | if (a < b) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - if (a < b) { [INFO] [stdout] 51 + if a < b { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s1932_merge_bsts_to_create_single_bst.rs:59:25 [INFO] [stdout] | [INFO] [stdout] 59 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1979_find_greatest_common_divisor_of_array.rs:51:16 [INFO] [stdout] | [INFO] [stdout] 51 | if (y > ma) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 51 - if (y > ma) { [INFO] [stdout] 51 + if y > ma { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1979_find_greatest_common_divisor_of_array.rs:52:20 [INFO] [stdout] | [INFO] [stdout] 52 | if (y < mn) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 52 - if (y < mn) { [INFO] [stdout] 52 + if y < mn { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around `if` condition [INFO] [stdout] --> src/solution/s1979_find_greatest_common_divisor_of_array.rs:57:23 [INFO] [stdout] | [INFO] [stdout] 57 | } else if (y < mn) { [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 57 - } else if (y < mn) { [INFO] [stdout] 57 + } else if y < mn { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s2058_find_the_minimum_and_maximum_number_of_nodes_between_critical_points.rs:46:32 [INFO] [stdout] | [INFO] [stdout] 46 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s2074_reverse_nodes_in_even_length_groups.rs:50:32 [INFO] [stdout] | [INFO] [stdout] 50 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s2095_delete_the_middle_node_of_a_linked_list.rs:43:32 [INFO] [stdout] | [INFO] [stdout] 43 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_tree` [INFO] [stdout] --> src/solution/s2096_step_by_step_directions_from_a_binary_tree_node_to_another.rs:37:25 [INFO] [stdout] | [INFO] [stdout] 37 | use crate::util::tree::{to_tree, TreeNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `to_list` [INFO] [stdout] --> src/solution/s2130_maximum_twin_sum_of_a_linked_list.rs:45:32 [INFO] [stdout] | [INFO] [stdout] 45 | use crate::util::linked_list::{to_list, ListNode}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable expression [INFO] [stdout] --> src/solution/s1046_last_stone_weight.rs:65:9 [INFO] [stdout] | [INFO] [stdout] 46 | / loop { [INFO] [stdout] 47 | | match heap.len() { [INFO] [stdout] 48 | | 0 => { [INFO] [stdout] 49 | | return 0; [INFO] [stdout] ... | [INFO] [stdout] 64 | | } [INFO] [stdout] | |_________- any code following this expression is unreachable [INFO] [stdout] 65 | 1 [INFO] [stdout] | ^ unreachable expression [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `subp` [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:160:24 [INFO] [stdout] | [INFO] [stdout] 160 | ([x, b'*', subp @ ..], [y, subs @ ..]) if *x == b'.' || x == y => { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_subp` [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/solution/s0039_combination_sum.rs:58:13 [INFO] [stdout] | [INFO] [stdout] 58 | let mut vec = Vec::new(); [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/solution/s0039_combination_sum.rs:66:9 [INFO] [stdout] | [INFO] [stdout] 66 | mut curr: 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/solution/s0040_combination_sum_ii.rs:48:13 [INFO] [stdout] | [INFO] [stdout] 48 | let mut vec = Vec::new(); [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/solution/s0040_combination_sum_ii.rs:56:9 [INFO] [stdout] | [INFO] [stdout] 56 | mut curr: Vec, [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0059_spiral_matrix_ii.rs:33:13 [INFO] [stdout] | [INFO] [stdout] 33 | for i in 0..n { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 33 | for _i in 0..n { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 33 - for i in 0..n { [INFO] [stdout] 33 + for solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD in 0..n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `mid` is never read [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:38:25 [INFO] [stdout] | [INFO] [stdout] 38 | let (mut l, mut mid, mut h) = (0, 0, nums.len() - 1); [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: unused variable: `i` [INFO] [stdout] --> src/solution/s0107_binary_tree_level_order_traversal_ii.rs:65:17 [INFO] [stdout] | [INFO] [stdout] 65 | for i in 0..deque.len() { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 65 | for _i in 0..deque.len() { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `N_LETTERS` [INFO] [stdout] | [INFO] [stdout] 65 - for i in 0..deque.len() { [INFO] [stdout] 65 + for solution::s1832_check_if_the_sentence_is_pangram::N_LETTERS in 0..deque.len() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0164_maximum_gap.rs:44:13 [INFO] [stdout] | [INFO] [stdout] 44 | for i in 0..8 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 44 | for _i in 0..8 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 44 - for i in 0..8 { [INFO] [stdout] 44 + for solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD in 0..8 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0179_largest_number.rs:45:13 [INFO] [stdout] | [INFO] [stdout] 45 | let mut result = vs.join(""); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:65:22 [INFO] [stdout] | [INFO] [stdout] 65 | Some(n) => (), [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0213_house_robber_ii.rs:54:17 [INFO] [stdout] | [INFO] [stdout] 54 | let mut temp = std::cmp::max(pre + nums[i], cur); [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/solution/s0219_contains_duplicate_ii.rs:43:25 [INFO] [stdout] | [INFO] [stdout] 43 | let mut prev = m.entry(x).or_insert(i); [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0278_first_bad_version.rs:41:37 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn first_bad_version(&self, n: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 41 | pub fn first_bad_version(&self, _n: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 41 - pub fn first_bad_version(&self, n: i32) -> i32 { [INFO] [stdout] 41 + pub fn first_bad_version(&self, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0303_range_sum_query_immutable.rs:57:27 [INFO] [stdout] | [INFO] [stdout] 57 | .scan(0, |mut state, x| { [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/solution/s0341_flatten_nested_list_iterator.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | fn new(mut nested_list: Vec) -> Self { [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/solution/s0341_flatten_nested_list_iterator.rs:76:15 [INFO] [stdout] | [INFO] [stdout] 76 | fn unnest(mut nested_list: Vec) -> Vec { [INFO] [stdout] | ----^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> src/solution/s0442_find_all_duplicates_in_an_array.rs:39:24 [INFO] [stdout] | [INFO] [stdout] 39 | .filter(|&(x, y)| y >= 2) [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 39 | .filter(|&(_x, y)| y >= 2) [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `N_LETTERS` [INFO] [stdout] | [INFO] [stdout] 39 - .filter(|&(x, y)| y >= 2) [INFO] [stdout] 39 + .filter(|&(solution::s1832_check_if_the_sentence_is_pangram::N_LETTERS, y)| y >= 2) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `y` [INFO] [stdout] --> src/solution/s0442_find_all_duplicates_in_an_array.rs:40:23 [INFO] [stdout] | [INFO] [stdout] 40 | .map(|(x, y)| (x + 1) as i32) [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 40 | .map(|(x, _y)| (x + 1) as i32) [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 40 - .map(|(x, y)| (x + 1) as i32) [INFO] [stdout] 40 + .map(|(x, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD)| (x + 1) as i32) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0502_ipo.rs:56:13 [INFO] [stdout] | [INFO] [stdout] 56 | for i in 0..k { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 56 | for _i in 0..k { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 56 - for i in 0..k { [INFO] [stdout] 56 + for solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD in 0..k { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0509_fibonacci_number.rs:51:21 [INFO] [stdout] | [INFO] [stdout] 51 | for i in 2..=n { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 51 | for _i in 2..=n { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 51 - for i in 2..=n { [INFO] [stdout] 51 + for solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD in 2..=n { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0646_maximum_length_of_pair_chain.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | let n = pairs.len() - 1; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 41 | let _n = pairs.len() - 1; [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `N_LETTERS` [INFO] [stdout] | [INFO] [stdout] 41 - let n = pairs.len() - 1; [INFO] [stdout] 41 + let solution::s1832_check_if_the_sentence_is_pangram::N_LETTERS = pairs.len() - 1; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0658_find_k_closest_elements.rs:47:13 [INFO] [stdout] | [INFO] [stdout] 47 | let mut result = &mut arr[0..(k 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/solution/s0676_implement_magic_dictionary.rs:100:13 [INFO] [stdout] | [INFO] [stdout] 100 | let mut v = unsafe { search_word.as_bytes_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/solution/s0684_redundant_connection.rs:39:13 [INFO] [stdout] | [INFO] [stdout] 39 | let mut tmp = 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/solution/s0687_longest_univalue_path.rs:62:17 [INFO] [stdout] | [INFO] [stdout] 62 | let mut left_max = Self::dfs_helper(&root.borrow().left, cur); [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/solution/s0687_longest_univalue_path.rs:63:17 [INFO] [stdout] | [INFO] [stdout] 63 | let mut right_max = Self::dfs_helper(&root.borrow().right, cur); [INFO] [stdout] | ----^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `tail` [INFO] [stdout] --> src/solution/s0699_falling_squares.rs:72:27 [INFO] [stdout] | [INFO] [stdout] 72 | if let Some((&tail, &height)) = map.range(..end).last() { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 72 | if let Some((&_tail, &height)) = map.range(..end).last() { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 72 - if let Some((&tail, &height)) = map.range(..end).last() { [INFO] [stdout] 72 + if let Some((&solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD, &height)) = map.range(..end).last() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `height` [INFO] [stdout] --> src/solution/s0699_falling_squares.rs:78:36 [INFO] [stdout] | [INFO] [stdout] 78 | while let Some((&key, &height)) = iter.next() { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 78 | while let Some((&key, &_height)) = iter.next() { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 78 - while let Some((&key, &height)) = iter.next() { [INFO] [stdout] 78 + while let Some((&key, &solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD)) = iter.next() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `count` is never read [INFO] [stdout] --> src/solution/s0764_largest_plus_sign.rs:44:17 [INFO] [stdout] | [INFO] [stdout] 44 | let mut count = 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/solution/s0770_basic_calculator_iv.rs:163:13 [INFO] [stdout] | [INFO] [stdout] 163 | let mut op = if subtract { -1 } else { 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/solution/s0770_basic_calculator_iv.rs:234:13 [INFO] [stdout] | [INFO] [stdout] 234 | let mut it = &mut iter; [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/solution/s0771_jewels_and_stones.rs:30:13 [INFO] [stdout] | [INFO] [stdout] 30 | let mut set = jewels.chars().collect::>(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0779_k_th_symbol_in_grammar.rs:47:24 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn kth_grammar(n: i32, k: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 47 | pub fn kth_grammar(_n: i32, k: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 47 - pub fn kth_grammar(n: i32, k: i32) -> i32 { [INFO] [stdout] 47 + pub fn kth_grammar(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, k: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `max` is never read [INFO] [stdout] --> src/solution/s0798_smallest_rotation_with_highest_score.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | let mut max = 0; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `row_sum` is never read [INFO] [stdout] --> src/solution/s0840_magic_squares_in_grid.rs:60:17 [INFO] [stdout] | [INFO] [stdout] 60 | let mut row_sum = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `col_sum` is never read [INFO] [stdout] --> src/solution/s0840_magic_squares_in_grid.rs:83:17 [INFO] [stdout] | [INFO] [stdout] 83 | let mut col_sum = 0; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num` is never read [INFO] [stdout] --> src/solution/s0842_split_array_into_fibonacci_sequence.rs:57:17 [INFO] [stdout] | [INFO] [stdout] 57 | let mut num = 0i64; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `word` [INFO] [stdout] --> src/solution/s0843_guess_the_word.rs:56:24 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn guess(self, word: String) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_word` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0846_hand_of_straights.rs:48:37 [INFO] [stdout] | [INFO] [stdout] 48 | if let Some(mut x) = map.get_mut(&(it + i)).or(Some(&mut 0)) { [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0850_rectangle_area_ii.rs:57:17 [INFO] [stdout] | [INFO] [stdout] 57 | let mut xi = xs.binary_search(&rec[0]).unwrap(); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0850_rectangle_area_ii.rs:59:21 [INFO] [stdout] | [INFO] [stdout] 59 | let mut yi = ys.binary_search(&rec[1]).unwrap(); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `current_iter` [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:47:17 [INFO] [stdout] | [INFO] [stdout] 47 | for current_iter in 0..queue_size { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 47 | for _current_iter in 0..queue_size { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `N_LETTERS` [INFO] [stdout] | [INFO] [stdout] 47 - for current_iter in 0..queue_size { [INFO] [stdout] 47 + for solution::s1832_check_if_the_sentence_is_pangram::N_LETTERS in 0..queue_size { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `front_itr` [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:55:25 [INFO] [stdout] | [INFO] [stdout] 55 | let mut front_itr = &front.chars(); [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_front_itr` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s2_itr` [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:56:25 [INFO] [stdout] | [INFO] [stdout] 56 | let mut s2_itr = &s2.chars(); [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_s2_itr` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0854_k_similar_strings.rs:46:17 [INFO] [stdout] | [INFO] [stdout] 46 | let mut queue_size = queue.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/solution/s0854_k_similar_strings.rs:55:21 [INFO] [stdout] | [INFO] [stdout] 55 | let mut front_itr = &front.chars(); [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/solution/s0854_k_similar_strings.rs:56:21 [INFO] [stdout] | [INFO] [stdout] 56 | let mut s2_itr = &s2.chars(); [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/solution/s0854_k_similar_strings.rs:87:17 [INFO] [stdout] | [INFO] [stdout] 87 | let mut slice = s.as_bytes_mut(); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `target_val` is never read [INFO] [stdout] --> src/solution/s0855_exam_room.rs:106:21 [INFO] [stdout] | [INFO] [stdout] 106 | target_val = self.n - 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/solution/s0864_shortest_path_to_get_all_keys.rs:82:13 [INFO] [stdout] | [INFO] [stdout] 82 | let mut all_keys = (1 << max) - 1; [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `len` [INFO] [stdout] --> src/solution/s0866_prime_palindrome.rs:51:25 [INFO] [stdout] | [INFO] [stdout] 51 | let len = s.len(); [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 51 | let _len = s.len(); [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `N_LETTERS` [INFO] [stdout] | [INFO] [stdout] 51 - let len = s.len(); [INFO] [stdout] 51 + let solution::s1832_check_if_the_sentence_is_pangram::N_LETTERS = s.len(); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0867_transpose_matrix.rs:43:29 [INFO] [stdout] | [INFO] [stdout] 43 | let mut vec: Vec = vec![*v2]; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s0874_walking_robot_simulation.rs:91:21 [INFO] [stdout] | [INFO] [stdout] 91 | for k in 0..cmd { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 91 | for _k in 0..cmd { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 91 - for k in 0..cmd { [INFO] [stdout] 91 + for solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD in 0..cmd { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `piles` [INFO] [stdout] --> src/solution/s0877_stone_game.rs:42:23 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn stone_game(piles: Vec) -> bool { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_piles` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0885_spiral_matrix_iii.rs:59:25 [INFO] [stdout] | [INFO] [stdout] 59 | for i in 1..=len { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 59 | for _i in 1..=len { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 59 - for i in 1..=len { [INFO] [stdout] 59 + for solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD in 1..=len { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0885_spiral_matrix_iii.rs:66:25 [INFO] [stdout] | [INFO] [stdout] 66 | for i in 1..=len { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 66 | for _i in 1..=len { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 66 - for i in 1..=len { [INFO] [stdout] 66 + for solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD in 1..=len { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0885_spiral_matrix_iii.rs:73:25 [INFO] [stdout] | [INFO] [stdout] 73 | for i in 1..=len { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 73 | for _i in 1..=len { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 73 - for i in 1..=len { [INFO] [stdout] 73 + for solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD in 1..=len { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s0885_spiral_matrix_iii.rs:80:25 [INFO] [stdout] | [INFO] [stdout] 80 | for i in 1..=len { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 80 | for _i in 1..=len { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 80 - for i in 1..=len { [INFO] [stdout] 80 + for solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD in 1..=len { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0897_increasing_order_search_tree.rs:55:13 [INFO] [stdout] | [INFO] [stdout] 55 | let mut dm = Rc::new(RefCell::new(TreeNode::new(0))); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s0928_minimize_malware_spread_ii.rs:46:13 [INFO] [stdout] | [INFO] [stdout] 46 | let mut result: Vec<(i32, std::collections::HashSet)> = initial [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s0959_regions_cut_by_slashes.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | let n = grid.len(); [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 41 | let _n = grid.len(); [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `N_LETTERS` [INFO] [stdout] | [INFO] [stdout] 41 - let n = grid.len(); [INFO] [stdout] 41 + let solution::s1832_check_if_the_sentence_is_pangram::N_LETTERS = grid.len(); [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `r` is never read [INFO] [stdout] --> src/solution/s0964_least_operators_to_express_number.rs:68:25 [INFO] [stdout] | [INFO] [stdout] 68 | let mut r = i32::MAX; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s1002_find_common_characters.rs:44:23 [INFO] [stdout] | [INFO] [stdout] 44 | .filter(|(i, c)| **c > 0) [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/solution/s1046_last_stone_weight.rs:57:17 [INFO] [stdout] | [INFO] [stdout] 57 | let mut v1 = heap.pop().unwrap(); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1046_last_stone_weight.rs:58:17 [INFO] [stdout] | [INFO] [stdout] 58 | let mut v2 = heap.pop().unwrap(); [INFO] [stdout] | ----^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1053_previous_permutation_with_one_swap.rs:41:13 [INFO] [stdout] | [INFO] [stdout] 41 | let mut arr = arr; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `mid` is never read [INFO] [stdout] --> src/solution/s1093_statistics_from_a_large_sample.rs:69:17 [INFO] [stdout] | [INFO] [stdout] 69 | let mut mid = 0.0; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `r` is never read [INFO] [stdout] --> src/solution/s1096_brace_expansion_ii.rs:89:21 [INFO] [stdout] | [INFO] [stdout] 89 | let mut r = 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/solution/s1096_brace_expansion_ii.rs:79:17 [INFO] [stdout] | [INFO] [stdout] 79 | let mut str = stack.pop().unwrap(); [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1110_delete_nodes_and_return_forest.rs:61:13 [INFO] [stdout] | [INFO] [stdout] 61 | let mut root = root; [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `this_sum` [INFO] [stdout] --> src/solution/s1130_minimum_cost_tree_from_leaf_values.rs:66:29 [INFO] [stdout] | [INFO] [stdout] 66 | let mut this_sum = 0; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 66 | let mut _this_sum = 0; [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 66 - let mut this_sum = 0; [INFO] [stdout] 66 + let mut solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD = 0; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1130_minimum_cost_tree_from_leaf_values.rs:66:25 [INFO] [stdout] | [INFO] [stdout] 66 | let mut this_sum = 0; [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `count` is assigned to, but never used [INFO] [stdout] --> src/solution/s1162_as_far_from_land_as_possible.rs:40:17 [INFO] [stdout] | [INFO] [stdout] 40 | let mut count = 0; [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_count` instead [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 40 - let mut count = 0; [INFO] [stdout] 40 + let mut solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD = 0; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1178_number_of_valid_words_for_each_puzzle.rs:52:13 [INFO] [stdout] | [INFO] [stdout] 52 | let mut words = words [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/solution/s1178_number_of_valid_words_for_each_puzzle.rs:56:13 [INFO] [stdout] | [INFO] [stdout] 56 | let mut puzzles = puzzles [INFO] [stdout] | ----^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s1202_smallest_string_with_swaps.rs:96:14 [INFO] [stdout] | [INFO] [stdout] 96 | for (k, v) in map.iter() { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_k` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num` [INFO] [stdout] --> src/solution/s1340_jump_game_v.rs:54:25 [INFO] [stdout] | [INFO] [stdout] 54 | .map(|(idx, num)| Self::dfs(&arr, &mut memo, d as usize, idx)) [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_num` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `i` is assigned to, but never used [INFO] [stdout] --> src/solution/s1371_find_the_longest_substring_containing_vowels_in_even_counts.rs:60:17 [INFO] [stdout] | [INFO] [stdout] 60 | let mut i = 0; [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] = note: consider using `_i` instead [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 60 - let mut i = 0; [INFO] [stdout] 60 + let mut solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD = 0; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1383_maximum_performance_of_a_team.rs:47:28 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn max_performance(n: i32, speed: Vec, efficiency: Vec, k: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 47 | pub fn max_performance(_n: i32, speed: Vec, efficiency: Vec, k: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 47 - pub fn max_performance(n: i32, speed: Vec, efficiency: Vec, k: i32) -> i32 { [INFO] [stdout] 47 + pub fn max_performance(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, speed: Vec, efficiency: Vec, k: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1464_maximum_product_of_two_elements_in_an_array.rs:54:23 [INFO] [stdout] | [INFO] [stdout] 54 | .fold(1, |mut res, x| res * (x - 1)) [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `str2` is never read [INFO] [stdout] --> src/solution/s1487_making_file_names_unique.rs:56:25 [INFO] [stdout] | [INFO] [stdout] 56 | let mut str2 = String::new(); [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable pattern [INFO] [stdout] --> src/solution/s1514_path_with_maximum_probability.rs:94:17 [INFO] [stdout] | [INFO] [stdout] 82 | Pair(prob, curr) => { [INFO] [stdout] | ---------------- matches any value [INFO] [stdout] ... [INFO] [stdout] 94 | _ => (), [INFO] [stdout] | ^ no value can reach this [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_patterns)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1582_special_positions_in_a_binary_matrix.rs:44:27 [INFO] [stdout] | [INFO] [stdout] 44 | |(mut row, mut col), (i, 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/solution/s1582_special_positions_in_a_binary_matrix.rs:44:36 [INFO] [stdout] | [INFO] [stdout] 44 | |(mut row, mut col), (i, 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/solution/s1593_split_a_string_into_the_max_number_of_unique_substrings.rs:62:21 [INFO] [stdout] | [INFO] [stdout] 62 | let mut substr = [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `l` [INFO] [stdout] --> src/solution/s1606_find_servers_that_handled_most_number_of_requests.rs:72:31 [INFO] [stdout] | [INFO] [stdout] 72 | while let Some((&t2, &l)) = iterator.peek() { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 72 | while let Some((&t2, &_l)) = iterator.peek() { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 72 - while let Some((&t2, &l)) = iterator.peek() { [INFO] [stdout] 72 + while let Some((&t2, &solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD)) = iterator.peek() { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1614_maximum_nesting_depth_of_the_parentheses.rs:43:23 [INFO] [stdout] | [INFO] [stdout] 43 | .scan(0, |mut state, c| { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `orders` is never read [INFO] [stdout] --> src/solution/s1648_sell_diminishing_valued_colored_balls.rs:70:9 [INFO] [stdout] | [INFO] [stdout] 70 | orders = 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/solution/s1657_determine_if_two_strings_are_close.rs:59:27 [INFO] [stdout] | [INFO] [stdout] 59 | let (mut word1_v, mut word1_c) = [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/solution/s1657_determine_if_two_strings_are_close.rs:70:27 [INFO] [stdout] | [INFO] [stdout] 70 | let (mut word2_v, mut word2_c) = [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/solution/s1669_merge_in_between_linked_lists.rs:61:13 [INFO] [stdout] | [INFO] [stdout] 61 | let mut list1 = list1; [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/solution/s1685_sum_of_absolute_differences_in_a_sorted_array.rs:40:51 [INFO] [stdout] | [INFO] [stdout] 40 | .scan((0, nums.iter().sum::()), |mut x, (i, v)| { [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `ports_count` [INFO] [stdout] --> src/solution/s1687_delivering_boxes_from_storage_to_ports.rs:69:9 [INFO] [stdout] | [INFO] [stdout] 69 | ports_count: i32, [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 69 | _ports_count: i32, [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 69 - ports_count: i32, [INFO] [stdout] 69 + solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1690_stone_game_vii.rs:53:21 [INFO] [stdout] | [INFO] [stdout] 53 | let mut j = i + len - 1; [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `idx2` [INFO] [stdout] --> src/solution/s1726_tuple_with_same_product.rs:49:47 [INFO] [stdout] | [INFO] [stdout] 49 | .fold(map, |mut map, (idx2, &num2)| { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 49 | .fold(map, |mut map, (_idx2, &num2)| { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `N_LETTERS` [INFO] [stdout] | [INFO] [stdout] 49 - .fold(map, |mut map, (idx2, &num2)| { [INFO] [stdout] 49 + .fold(map, |mut map, (solution::s1832_check_if_the_sentence_is_pangram::N_LETTERS, &num2)| { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1726_tuple_with_same_product.rs:45:18 [INFO] [stdout] | [INFO] [stdout] 45 | |mut map, (idx1, &num1)| { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `grid` [INFO] [stdout] --> src/solution/s1728_cat_and_mouse_ii.rs:65:26 [INFO] [stdout] | [INFO] [stdout] 65 | pub fn can_mouse_win(grid: Vec, cat_jump: i32, mouse_jump: i32) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_grid` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `cat_jump` [INFO] [stdout] --> src/solution/s1728_cat_and_mouse_ii.rs:65:45 [INFO] [stdout] | [INFO] [stdout] 65 | pub fn can_mouse_win(grid: Vec, cat_jump: i32, mouse_jump: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 65 | pub fn can_mouse_win(grid: Vec, _cat_jump: i32, mouse_jump: i32) -> bool { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 65 - pub fn can_mouse_win(grid: Vec, cat_jump: i32, mouse_jump: i32) -> bool { [INFO] [stdout] 65 + pub fn can_mouse_win(grid: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, mouse_jump: i32) -> bool { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `mouse_jump` [INFO] [stdout] --> src/solution/s1728_cat_and_mouse_ii.rs:65:60 [INFO] [stdout] | [INFO] [stdout] 65 | pub fn can_mouse_win(grid: Vec, cat_jump: i32, mouse_jump: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 65 | pub fn can_mouse_win(grid: Vec, cat_jump: i32, _mouse_jump: i32) -> bool { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 65 - pub fn can_mouse_win(grid: Vec, cat_jump: i32, mouse_jump: i32) -> bool { [INFO] [stdout] 65 + pub fn can_mouse_win(grid: Vec, cat_jump: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> bool { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `queries` [INFO] [stdout] --> src/solution/s1735_count_ways_to_make_array_with_product.rs:36:31 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn ways_to_fill_array(queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_queries` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1739_building_boxes.rs:48:26 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn minimum_boxes(n: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 48 | pub fn minimum_boxes(_n: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 48 - pub fn minimum_boxes(n: i32) -> i32 { [INFO] [stdout] 48 + pub fn minimum_boxes(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `v` [INFO] [stdout] --> src/solution/s1743_restore_the_array_from_adjacent_pairs.rs:69:21 [INFO] [stdout] | [INFO] [stdout] 69 | let mut v = mp.get(&start).unwrap(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_v` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1743_restore_the_array_from_adjacent_pairs.rs:69:17 [INFO] [stdout] | [INFO] [stdout] 69 | let mut v = mp.get(&start).unwrap(); [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num` [INFO] [stdout] --> src/solution/s1748_sum_of_unique_elements.rs:50:23 [INFO] [stdout] | [INFO] [stdout] 50 | .filter(|(num, count)| *count == &1) [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_num` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `count` [INFO] [stdout] --> src/solution/s1748_sum_of_unique_elements.rs:51:25 [INFO] [stdout] | [INFO] [stdout] 51 | .map(|(num, count)| num) [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_count` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s1766_tree_of_coprimes.rs:49:25 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn get_coprimes(nums: Vec, edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `edges` [INFO] [stdout] --> src/solution/s1766_tree_of_coprimes.rs:49:41 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn get_coprimes(nums: Vec, edges: Vec>) -> Vec { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s1787_make_the_xor_of_all_segments_equal_to_zero.rs:39:24 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn min_changes(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s1787_make_the_xor_of_all_segments_equal_to_zero.rs:39:40 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn min_changes(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 39 | pub fn min_changes(nums: Vec, _k: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 39 - pub fn min_changes(nums: Vec, k: i32) -> i32 { [INFO] [stdout] 39 + pub fn min_changes(nums: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `classes` [INFO] [stdout] --> src/solution/s1792_maximum_average_pass_ratio.rs:37:30 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn max_average_ratio(classes: Vec>, extra_students: i32) -> f64 { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_classes` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `extra_students` [INFO] [stdout] --> src/solution/s1792_maximum_average_pass_ratio.rs:37:54 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn max_average_ratio(classes: Vec>, extra_students: i32) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 37 | pub fn max_average_ratio(classes: Vec>, _extra_students: i32) -> f64 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 37 - pub fn max_average_ratio(classes: Vec>, extra_students: i32) -> f64 { [INFO] [stdout] 37 + pub fn max_average_ratio(classes: Vec>, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> f64 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s1793_maximum_score_of_a_good_subarray.rs:36:26 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn maximum_score(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s1793_maximum_score_of_a_good_subarray.rs:36:42 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn maximum_score(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 36 | pub fn maximum_score(nums: Vec, _k: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 36 - pub fn maximum_score(nums: Vec, k: i32) -> i32 { [INFO] [stdout] 36 + pub fn maximum_score(nums: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s1799_maximize_score_after_n_operations.rs:51:22 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn max_score(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `orders` [INFO] [stdout] --> src/solution/s1801_number_of_orders_in_the_backlog.rs:67:41 [INFO] [stdout] | [INFO] [stdout] 67 | pub fn get_number_of_backlog_orders(orders: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_orders` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1802_maximum_value_at_a_given_index_in_a_bounded_array.rs:42:22 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn max_value(n: i32, index: i32, max_sum: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 42 | pub fn max_value(_n: i32, index: i32, max_sum: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 42 - pub fn max_value(n: i32, index: i32, max_sum: i32) -> i32 { [INFO] [stdout] 42 + pub fn max_value(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, index: i32, max_sum: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `index` [INFO] [stdout] --> src/solution/s1802_maximum_value_at_a_given_index_in_a_bounded_array.rs:42:30 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn max_value(n: i32, index: i32, max_sum: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 42 | pub fn max_value(n: i32, _index: i32, max_sum: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 42 - pub fn max_value(n: i32, index: i32, max_sum: i32) -> i32 { [INFO] [stdout] 42 + pub fn max_value(n: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, max_sum: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `max_sum` [INFO] [stdout] --> src/solution/s1802_maximum_value_at_a_given_index_in_a_bounded_array.rs:42:42 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn max_value(n: i32, index: i32, max_sum: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 42 | pub fn max_value(n: i32, index: i32, _max_sum: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 42 - pub fn max_value(n: i32, index: i32, max_sum: i32) -> i32 { [INFO] [stdout] 42 + pub fn max_value(n: i32, index: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s1803_count_pairs_with_xor_in_a_range.rs:55:24 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn count_pairs(nums: Vec, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `low` [INFO] [stdout] --> src/solution/s1803_count_pairs_with_xor_in_a_range.rs:55:40 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn count_pairs(nums: Vec, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 55 | pub fn count_pairs(nums: Vec, _low: i32, high: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 55 - pub fn count_pairs(nums: Vec, low: i32, high: i32) -> i32 { [INFO] [stdout] 55 + pub fn count_pairs(nums: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, high: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `high` [INFO] [stdout] --> src/solution/s1803_count_pairs_with_xor_in_a_range.rs:55:50 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn count_pairs(nums: Vec, low: i32, high: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 55 | pub fn count_pairs(nums: Vec, low: i32, _high: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 55 - pub fn count_pairs(nums: Vec, low: i32, high: i32) -> i32 { [INFO] [stdout] 55 + pub fn count_pairs(nums: Vec, low: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `batch_size` [INFO] [stdout] --> src/solution/s1815_maximum_number_of_groups_getting_fresh_donuts.rs:35:29 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn max_happy_groups(batch_size: i32, groups: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 35 | pub fn max_happy_groups(_batch_size: i32, groups: Vec) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 35 - pub fn max_happy_groups(batch_size: i32, groups: Vec) -> i32 { [INFO] [stdout] 35 + pub fn max_happy_groups(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, groups: Vec) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `groups` [INFO] [stdout] --> src/solution/s1815_maximum_number_of_groups_getting_fresh_donuts.rs:35:46 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn max_happy_groups(batch_size: i32, groups: Vec) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_groups` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums1` [INFO] [stdout] --> src/solution/s1818_minimum_absolute_sum_difference.rs:54:34 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn min_absolute_sum_diff(nums1: Vec, nums2: Vec) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums2` [INFO] [stdout] --> src/solution/s1818_minimum_absolute_sum_difference.rs:54:51 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn min_absolute_sum_diff(nums1: Vec, nums2: Vec) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s1819_number_of_different_subsequences_gcds.rs:42:46 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn count_different_subsequence_gc_ds(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `obstacles` [INFO] [stdout] --> src/solution/s1824_minimum_sideway_jumps.rs:52:27 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn min_side_jumps(obstacles: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_obstacles` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s1830_minimum_number_of_operations_to_make_string_sorted.rs:47:31 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn make_string_sorted(s: String) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `arr1` [INFO] [stdout] --> src/solution/s1835_find_xor_sum_of_all_pairs_bitwise_and.rs:40:24 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn get_xor_sum(arr1: Vec, arr2: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_arr1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `arr2` [INFO] [stdout] --> src/solution/s1835_find_xor_sum_of_all_pairs_bitwise_and.rs:40:40 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn get_xor_sum(arr1: Vec, arr2: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_arr2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `word` [INFO] [stdout] --> src/solution/s1839_longest_substring_of_all_vowels_in_order.rs:45:40 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn longest_beautiful_substring(word: String) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_word` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1840_maximum_building_height.rs:53:25 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn max_building(n: i32, restrictions: Vec>) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 53 | pub fn max_building(_n: i32, restrictions: Vec>) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 53 - pub fn max_building(n: i32, restrictions: Vec>) -> i32 { [INFO] [stdout] 53 + pub fn max_building(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, restrictions: Vec>) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `restrictions` [INFO] [stdout] --> src/solution/s1840_maximum_building_height.rs:53:33 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn max_building(n: i32, restrictions: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_restrictions` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `rooms` [INFO] [stdout] --> src/solution/s1847_closest_room.rs:48:25 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn closest_room(rooms: Vec>, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_rooms` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `queries` [INFO] [stdout] --> src/solution/s1847_closest_room.rs:48:47 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn closest_room(rooms: Vec>, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_queries` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s1849_splitting_a_string_into_descending_consecutive_values.rs:47:25 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn split_string(s: String) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num` [INFO] [stdout] --> src/solution/s1850_minimum_adjacent_swaps_to_reach_the_kth_smallest_number.rs:60:26 [INFO] [stdout] | [INFO] [stdout] 60 | pub fn get_min_swaps(num: String, k: i32) -> i32 { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_num` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s1850_minimum_adjacent_swaps_to_reach_the_kth_smallest_number.rs:60:39 [INFO] [stdout] | [INFO] [stdout] 60 | pub fn get_min_swaps(num: String, k: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 60 | pub fn get_min_swaps(num: String, _k: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 60 - pub fn get_min_swaps(num: String, k: i32) -> i32 { [INFO] [stdout] 60 + pub fn get_min_swaps(num: String, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `intervals` [INFO] [stdout] --> src/solution/s1851_minimum_interval_to_include_each_query.rs:46:25 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn min_interval(intervals: Vec>, queries: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_intervals` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `queries` [INFO] [stdout] --> src/solution/s1851_minimum_interval_to_include_each_query.rs:46:51 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn min_interval(intervals: Vec>, queries: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_queries` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s1856_maximum_subarray_min_product.rs:48:32 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn max_sum_min_product(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `colors` [INFO] [stdout] --> src/solution/s1857_largest_color_value_in_a_directed_graph.rs:53:31 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn largest_path_value(colors: String, edges: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_colors` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `edges` [INFO] [stdout] --> src/solution/s1857_largest_color_value_in_a_directed_graph.rs:53:47 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn largest_path_value(colors: String, edges: Vec>) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s1862_sum_of_floored_pairs.rs:39:33 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn sum_of_floored_pairs(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s1864_minimum_number_of_swaps_to_make_the_binary_string_alternating.rs:41:22 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn min_swaps(s: String) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1866_number_of_ways_to_rearrange_sticks_with_k_sticks_visible.rs:45:29 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn rearrange_sticks(n: i32, k: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 45 | pub fn rearrange_sticks(_n: i32, k: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 45 - pub fn rearrange_sticks(n: i32, k: i32) -> i32 { [INFO] [stdout] 45 + pub fn rearrange_sticks(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, k: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s1866_number_of_ways_to_rearrange_sticks_with_k_sticks_visible.rs:45:37 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn rearrange_sticks(n: i32, k: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 45 | pub fn rearrange_sticks(n: i32, _k: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 45 - pub fn rearrange_sticks(n: i32, k: i32) -> i32 { [INFO] [stdout] 45 + pub fn rearrange_sticks(n: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `dist` [INFO] [stdout] --> src/solution/s1870_minimum_speed_to_arrive_on_time.rs:56:30 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn min_speed_on_time(dist: Vec, hour: f64) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_dist` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `hour` [INFO] [stdout] --> src/solution/s1870_minimum_speed_to_arrive_on_time.rs:56:46 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn min_speed_on_time(dist: Vec, hour: f64) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 56 | pub fn min_speed_on_time(dist: Vec, _hour: f64) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `EPSILON` [INFO] [stdout] | [INFO] [stdout] 56 - pub fn min_speed_on_time(dist: Vec, hour: f64) -> i32 { [INFO] [stdout] 56 + pub fn min_speed_on_time(dist: Vec, solution::s0857_minimum_cost_to_hire_k_workers::EPSILON: f64) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s1871_jump_game_vii.rs:41:22 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn can_reach(s: String, min_jump: i32, max_jump: i32) -> bool { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `min_jump` [INFO] [stdout] --> src/solution/s1871_jump_game_vii.rs:41:33 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn can_reach(s: String, min_jump: i32, max_jump: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 41 | pub fn can_reach(s: String, _min_jump: i32, max_jump: i32) -> bool { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 41 - pub fn can_reach(s: String, min_jump: i32, max_jump: i32) -> bool { [INFO] [stdout] 41 + pub fn can_reach(s: String, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, max_jump: i32) -> bool { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `max_jump` [INFO] [stdout] --> src/solution/s1871_jump_game_vii.rs:41:48 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn can_reach(s: String, min_jump: i32, max_jump: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 41 | pub fn can_reach(s: String, min_jump: i32, _max_jump: i32) -> bool { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 41 - pub fn can_reach(s: String, min_jump: i32, max_jump: i32) -> bool { [INFO] [stdout] 41 + pub fn can_reach(s: String, min_jump: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> bool { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `stones` [INFO] [stdout] --> src/solution/s1872_stone_game_viii.rs:73:28 [INFO] [stdout] | [INFO] [stdout] 73 | pub fn stone_game_viii(stones: Vec) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_stones` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `grid` [INFO] [stdout] --> src/solution/s1878_get_biggest_three_rhombus_sums_in_a_grid.rs:51:30 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn get_biggest_three(grid: Vec>) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_grid` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums1` [INFO] [stdout] --> src/solution/s1879_minimum_xor_sum_of_two_arrays.rs:42:28 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn minimum_xor_sum(nums1: Vec, nums2: Vec) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums2` [INFO] [stdout] --> src/solution/s1879_minimum_xor_sum_of_two_arrays.rs:42:45 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn minimum_xor_sum(nums1: Vec, nums2: Vec) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1881_maximum_value_after_insertion.rs:42:22 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn max_value(n: String, x: i32) -> String { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_n` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> src/solution/s1881_maximum_value_after_insertion.rs:42:33 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn max_value(n: String, x: i32) -> String { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 42 | pub fn max_value(n: String, _x: i32) -> String { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 42 - pub fn max_value(n: String, x: i32) -> String { [INFO] [stdout] 42 + pub fn max_value(n: String, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> String { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `servers` [INFO] [stdout] --> src/solution/s1882_process_tasks_using_servers.rs:53:25 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn assign_tasks(servers: Vec, tasks: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_servers` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `tasks` [INFO] [stdout] --> src/solution/s1882_process_tasks_using_servers.rs:53:44 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn assign_tasks(servers: Vec, tasks: Vec) -> Vec { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_tasks` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `dist` [INFO] [stdout] --> src/solution/s1883_minimum_skips_to_arrive_at_meeting_on_time.rs:56:22 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn min_skips(dist: Vec, speed: i32, hours_before: i32) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_dist` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `speed` [INFO] [stdout] --> src/solution/s1883_minimum_skips_to_arrive_at_meeting_on_time.rs:56:38 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn min_skips(dist: Vec, speed: i32, hours_before: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 56 | pub fn min_skips(dist: Vec, _speed: i32, hours_before: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 56 - pub fn min_skips(dist: Vec, speed: i32, hours_before: i32) -> i32 { [INFO] [stdout] 56 + pub fn min_skips(dist: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, hours_before: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `hours_before` [INFO] [stdout] --> src/solution/s1883_minimum_skips_to_arrive_at_meeting_on_time.rs:56:50 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn min_skips(dist: Vec, speed: i32, hours_before: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 56 | pub fn min_skips(dist: Vec, speed: i32, _hours_before: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 56 - pub fn min_skips(dist: Vec, speed: i32, hours_before: i32) -> i32 { [INFO] [stdout] 56 + pub fn min_skips(dist: Vec, speed: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s1887_reduction_operations_to_make_the_array_elements_equal.rs:52:33 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn reduction_operations(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s1888_minimum_number_of_flips_to_make_the_binary_string_alternating.rs:49:22 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn min_flips(s: String) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `packages` [INFO] [stdout] --> src/solution/s1889_minimum_space_wasted_from_packaging.rs:54:29 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn min_wasted_space(packages: Vec, boxes: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_packages` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `boxes` [INFO] [stdout] --> src/solution/s1889_minimum_space_wasted_from_packaging.rs:54:49 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn min_wasted_space(packages: Vec, boxes: Vec>) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_boxes` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `grid` [INFO] [stdout] --> src/solution/s1895_largest_magic_square.rs:39:33 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn largest_magic_square(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_grid` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `expression` [INFO] [stdout] --> src/solution/s1896_minimum_cost_to_change_the_final_value_of_expression.rs:58:35 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn min_operations_to_flip(expression: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_expression` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s1898_maximum_number_of_removable_characters.rs:50:29 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn maximum_removals(s: String, p: String, removable: Vec) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `p` [INFO] [stdout] --> src/solution/s1898_maximum_number_of_removable_characters.rs:50:40 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn maximum_removals(s: String, p: String, removable: Vec) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_p` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `removable` [INFO] [stdout] --> src/solution/s1898_maximum_number_of_removable_characters.rs:50:51 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn maximum_removals(s: String, p: String, removable: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_removable` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s1899_merge_triplets_to_form_target_triplet.rs:60:36 [INFO] [stdout] | [INFO] [stdout] 60 | .fold(vec![0; 3], |mut acc, x| { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1900_the_earliest_and_latest_rounds_where_players_compete.rs:56:32 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn earliest_and_latest(n: i32, first_player: i32, second_player: i32) -> Vec { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 56 | pub fn earliest_and_latest(_n: i32, first_player: i32, second_player: i32) -> Vec { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 56 - pub fn earliest_and_latest(n: i32, first_player: i32, second_player: i32) -> Vec { [INFO] [stdout] 56 + pub fn earliest_and_latest(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, first_player: i32, second_player: i32) -> Vec { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `first_player` [INFO] [stdout] --> src/solution/s1900_the_earliest_and_latest_rounds_where_players_compete.rs:56:40 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn earliest_and_latest(n: i32, first_player: i32, second_player: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 56 | pub fn earliest_and_latest(n: i32, _first_player: i32, second_player: i32) -> Vec { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 56 - pub fn earliest_and_latest(n: i32, first_player: i32, second_player: i32) -> Vec { [INFO] [stdout] 56 + pub fn earliest_and_latest(n: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, second_player: i32) -> Vec { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `second_player` [INFO] [stdout] --> src/solution/s1900_the_earliest_and_latest_rounds_where_players_compete.rs:56:59 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn earliest_and_latest(n: i32, first_player: i32, second_player: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 56 | pub fn earliest_and_latest(n: i32, first_player: i32, _second_player: i32) -> Vec { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 56 - pub fn earliest_and_latest(n: i32, first_player: i32, second_player: i32) -> Vec { [INFO] [stdout] 56 + pub fn earliest_and_latest(n: i32, first_player: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> Vec { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `login_time` [INFO] [stdout] --> src/solution/s1904_the_number_of_full_rounds_you_have_played.rs:49:29 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn number_of_rounds(login_time: String, logout_time: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_login_time` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `logout_time` [INFO] [stdout] --> src/solution/s1904_the_number_of_full_rounds_you_have_played.rs:49:49 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn number_of_rounds(login_time: String, logout_time: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_logout_time` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `grid1` [INFO] [stdout] --> src/solution/s1905_count_sub_islands.rs:39:30 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn count_sub_islands(grid1: Vec>, grid2: Vec>) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_grid1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `grid2` [INFO] [stdout] --> src/solution/s1905_count_sub_islands.rs:39:52 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn count_sub_islands(grid1: Vec>, grid2: Vec>) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_grid2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s1906_minimum_absolute_difference_queries.rs:55:27 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn min_difference(nums: Vec, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `queries` [INFO] [stdout] --> src/solution/s1906_minimum_absolute_difference_queries.rs:55:43 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn min_difference(nums: Vec, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_queries` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1912_design_movie_rental_system.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | fn new(n: i32, entries: Vec>) -> Self { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 70 | fn new(_n: i32, entries: Vec>) -> Self { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 70 - fn new(n: i32, entries: Vec>) -> Self { [INFO] [stdout] 70 + fn new(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, entries: Vec>) -> Self { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `prev_room` [INFO] [stdout] --> src/solution/s1916_count_ways_to_build_rooms_in_an_ant_colony.rs:54:32 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn ways_to_build_rooms(prev_room: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_prev_room` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1922_count_good_numbers.rs:41:31 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn count_good_numbers(n: i64) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 41 | pub fn count_good_numbers(_n: i64) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 41 - pub fn count_good_numbers(n: i64) -> i32 { [INFO] [stdout] 41 + pub fn count_good_numbers(solution::s1808_maximize_number_of_nice_divisors::MOD: i64) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1923_longest_common_subpath.rs:48:35 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn longest_common_subpath(n: i32, paths: Vec>) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 48 | pub fn longest_common_subpath(_n: i32, paths: Vec>) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 48 - pub fn longest_common_subpath(n: i32, paths: Vec>) -> i32 { [INFO] [stdout] 48 + pub fn longest_common_subpath(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, paths: Vec>) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `paths` [INFO] [stdout] --> src/solution/s1923_longest_common_subpath.rs:48:43 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn longest_common_subpath(n: i32, paths: Vec>) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_paths` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `maze` [INFO] [stdout] --> src/solution/s1926_nearest_exit_from_entrance_in_maze.rs:56:25 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn nearest_exit(maze: Vec>, entrance: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_maze` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `entrance` [INFO] [stdout] --> src/solution/s1926_nearest_exit_from_entrance_in_maze.rs:56:47 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn nearest_exit(maze: Vec>, entrance: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_entrance` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num` [INFO] [stdout] --> src/solution/s1927_sum_game.rs:57:21 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn sum_game(num: String) -> bool { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_num` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `max_time` [INFO] [stdout] --> src/solution/s1928_minimum_cost_to_reach_destination_in_time.rs:52:21 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn min_cost(max_time: i32, edges: Vec>, passing_fees: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 52 | pub fn min_cost(_max_time: i32, edges: Vec>, passing_fees: Vec) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 52 - pub fn min_cost(max_time: i32, edges: Vec>, passing_fees: Vec) -> i32 { [INFO] [stdout] 52 + pub fn min_cost(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, edges: Vec>, passing_fees: Vec) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `edges` [INFO] [stdout] --> src/solution/s1928_minimum_cost_to_reach_destination_in_time.rs:52:36 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn min_cost(max_time: i32, edges: Vec>, passing_fees: Vec) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `passing_fees` [INFO] [stdout] --> src/solution/s1928_minimum_cost_to_reach_destination_in_time.rs:52:58 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn min_cost(max_time: i32, edges: Vec>, passing_fees: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_passing_fees` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `m` [INFO] [stdout] --> src/solution/s1931_painting_a_grid_with_three_different_colors.rs:39:27 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn color_the_grid(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 39 | pub fn color_the_grid(_m: i32, n: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 39 - pub fn color_the_grid(m: i32, n: i32) -> i32 { [INFO] [stdout] 39 + pub fn color_the_grid(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, n: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1931_painting_a_grid_with_three_different_colors.rs:39:35 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn color_the_grid(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 39 | pub fn color_the_grid(m: i32, _n: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 39 - pub fn color_the_grid(m: i32, n: i32) -> i32 { [INFO] [stdout] 39 + pub fn color_the_grid(m: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `trees` [INFO] [stdout] --> src/solution/s1932_merge_bsts_to_create_single_bst.rs:87:22 [INFO] [stdout] | [INFO] [stdout] 87 | pub fn can_merge(trees: Vec>>>) -> Option>> { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_trees` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `parents` [INFO] [stdout] --> src/solution/s1938_maximum_genetic_difference_query.rs:45:35 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn max_genetic_difference(parents: Vec, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_parents` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `queries` [INFO] [stdout] --> src/solution/s1938_maximum_genetic_difference_query.rs:45:54 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn max_genetic_difference(parents: Vec, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_queries` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `times` [INFO] [stdout] --> src/solution/s1942_the_number_of_the_smallest_unoccupied_chair.rs:56:27 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn smallest_chair(times: Vec>, target_friend: i32) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_times` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `target_friend` [INFO] [stdout] --> src/solution/s1942_the_number_of_the_smallest_unoccupied_chair.rs:56:49 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn smallest_chair(times: Vec>, target_friend: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 56 | pub fn smallest_chair(times: Vec>, _target_friend: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 56 - pub fn smallest_chair(times: Vec>, target_friend: i32) -> i32 { [INFO] [stdout] 56 + pub fn smallest_chair(times: Vec>, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `segments` [INFO] [stdout] --> src/solution/s1943_describe_the_painting.rs:67:27 [INFO] [stdout] | [INFO] [stdout] 67 | pub fn split_painting(segments: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_segments` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `heights` [INFO] [stdout] --> src/solution/s1944_number_of_visible_people_in_a_queue.rs:43:34 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn can_see_persons_count(heights: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_heights` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `students` [INFO] [stdout] --> src/solution/s1947_maximum_compatibility_score_sum.rs:47:34 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn max_compatibility_sum(students: Vec>, mentors: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_students` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `mentors` [INFO] [stdout] --> src/solution/s1947_maximum_compatibility_score_sum.rs:47:59 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn max_compatibility_sum(students: Vec>, mentors: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_mentors` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `paths` [INFO] [stdout] --> src/solution/s1948_delete_duplicate_folders_in_system.rs:70:36 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn delete_duplicate_folder(paths: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_paths` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s1955_count_number_of_special_subsequences.rs:52:39 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn count_special_subsequences(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s1959_minimum_total_space_wasted_with_k_resizing_operations.rs:49:40 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn min_space_wasted_k_resizing(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s1959_minimum_total_space_wasted_with_k_resizing_operations.rs:49:56 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn min_space_wasted_k_resizing(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 49 | pub fn min_space_wasted_k_resizing(nums: Vec, _k: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 49 - pub fn min_space_wasted_k_resizing(nums: Vec, k: i32) -> i32 { [INFO] [stdout] 49 + pub fn min_space_wasted_k_resizing(nums: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s1960_maximum_product_of_the_length_of_two_palindromic_substrings.rs:36:24 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn max_product(s: String) -> i64 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `piles` [INFO] [stdout] --> src/solution/s1962_remove_stones_to_minimize_the_total.rs:47:26 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn min_stone_sum(piles: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_piles` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s1962_remove_stones_to_minimize_the_total.rs:47:43 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn min_stone_sum(piles: Vec, k: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 47 | pub fn min_stone_sum(piles: Vec, _k: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 47 - pub fn min_stone_sum(piles: Vec, k: i32) -> i32 { [INFO] [stdout] 47 + pub fn min_stone_sum(piles: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `obstacles` [INFO] [stdout] --> src/solution/s1964_find_the_longest_valid_obstacle_course_at_each_position.rs:61:53 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn longest_obstacle_course_at_each_position(obstacles: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_obstacles` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s1968_array_with_elements_not_equal_to_average_of_neighbors.rs:41:28 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn rearrange_array(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `p` [INFO] [stdout] --> src/solution/s1969_minimum_non_zero_product_of_the_array_elements.rs:53:33 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn min_non_zero_product(p: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 53 | pub fn min_non_zero_product(_p: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 53 - pub fn min_non_zero_product(p: i32) -> i32 { [INFO] [stdout] 53 + pub fn min_non_zero_product(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `row` [INFO] [stdout] --> src/solution/s1970_last_day_where_you_can_still_cross.rs:49:32 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn latest_day_to_cross(row: i32, col: i32, cells: Vec>) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 49 | pub fn latest_day_to_cross(_row: i32, col: i32, cells: Vec>) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 49 - pub fn latest_day_to_cross(row: i32, col: i32, cells: Vec>) -> i32 { [INFO] [stdout] 49 + pub fn latest_day_to_cross(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, col: i32, cells: Vec>) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `col` [INFO] [stdout] --> src/solution/s1970_last_day_where_you_can_still_cross.rs:49:42 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn latest_day_to_cross(row: i32, col: i32, cells: Vec>) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 49 | pub fn latest_day_to_cross(row: i32, _col: i32, cells: Vec>) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 49 - pub fn latest_day_to_cross(row: i32, col: i32, cells: Vec>) -> i32 { [INFO] [stdout] 49 + pub fn latest_day_to_cross(row: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, cells: Vec>) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `cells` [INFO] [stdout] --> src/solution/s1970_last_day_where_you_can_still_cross.rs:49:52 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn latest_day_to_cross(row: i32, col: i32, cells: Vec>) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_cells` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `matrix` [INFO] [stdout] --> src/solution/s1975_maximum_matrix_sum.rs:42:27 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn max_matrix_sum(matrix: Vec>) -> i64 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_matrix` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1976_number_of_ways_to_arrive_at_destination.rs:46:24 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn count_paths(n: i32, roads: Vec>) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 46 | pub fn count_paths(_n: i32, roads: Vec>) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 46 - pub fn count_paths(n: i32, roads: Vec>) -> i32 { [INFO] [stdout] 46 + pub fn count_paths(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, roads: Vec>) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `roads` [INFO] [stdout] --> src/solution/s1976_number_of_ways_to_arrive_at_destination.rs:46:32 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn count_paths(n: i32, roads: Vec>) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_roads` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num` [INFO] [stdout] --> src/solution/s1977_number_of_ways_to_separate_numbers.rs:42:35 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn number_of_combinations(num: String) -> i32 { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_num` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `mat` [INFO] [stdout] --> src/solution/s1981_minimize_the_difference_between_target_and_chosen_elements.rs:54:36 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn minimize_the_difference(mat: Vec>, target: i32) -> i32 { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_mat` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `target` [INFO] [stdout] --> src/solution/s1981_minimize_the_difference_between_target_and_chosen_elements.rs:54:56 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn minimize_the_difference(mat: Vec>, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 54 | pub fn minimize_the_difference(mat: Vec>, _target: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 54 - pub fn minimize_the_difference(mat: Vec>, target: i32) -> i32 { [INFO] [stdout] 54 + pub fn minimize_the_difference(mat: Vec>, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s1982_find_array_given_subset_sums.rs:52:26 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn recover_array(n: i32, sums: Vec) -> Vec { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 52 | pub fn recover_array(_n: i32, sums: Vec) -> Vec { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 52 - pub fn recover_array(n: i32, sums: Vec) -> Vec { [INFO] [stdout] 52 + pub fn recover_array(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, sums: Vec) -> Vec { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `sums` [INFO] [stdout] --> src/solution/s1982_find_array_given_subset_sums.rs:52:34 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn recover_array(n: i32, sums: Vec) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_sums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `tasks` [INFO] [stdout] --> src/solution/s1986_minimum_number_of_work_sessions_to_finish_the_tasks.rs:53:25 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn min_sessions(tasks: Vec, session_time: i32) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_tasks` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `session_time` [INFO] [stdout] --> src/solution/s1986_minimum_number_of_work_sessions_to_finish_the_tasks.rs:53:42 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn min_sessions(tasks: Vec, session_time: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 53 | pub fn min_sessions(tasks: Vec, _session_time: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 53 - pub fn min_sessions(tasks: Vec, session_time: i32) -> i32 { [INFO] [stdout] 53 + pub fn min_sessions(tasks: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `binary` [INFO] [stdout] --> src/solution/s1987_number_of_unique_good_subsequences.rs:47:47 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn number_of_unique_good_subsequences(binary: String) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_binary` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `land` [INFO] [stdout] --> src/solution/s1992_find_all_groups_of_farmland.rs:49:26 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn find_farmland(land: Vec>) -> Vec> { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_land` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s1994_the_number_of_good_subsets.rs:54:35 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn number_of_good_subsets(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s1998_gcd_sort_of_an_array.rs:48:21 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn gcd_sort(nums: Vec) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s2002_maximum_product_of_the_length_of_two_palindromic_subsequences.rs:44:24 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn max_product(s: String) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `parents` [INFO] [stdout] --> src/solution/s2003_smallest_missing_genetic_value_in_each_subtree.rs:57:43 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn smallest_missing_value_subtree(parents: Vec, nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_parents` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2003_smallest_missing_genetic_value_in_each_subtree.rs:57:62 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn smallest_missing_value_subtree(parents: Vec, nums: Vec) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `changed` [INFO] [stdout] --> src/solution/s2007_find_original_array_from_doubled_array.rs:44:32 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn find_original_array(changed: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_changed` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s2008_maximum_earnings_from_taxi.rs:43:30 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn max_taxi_earnings(n: i32, rides: Vec>) -> i64 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 43 | pub fn max_taxi_earnings(_n: i32, rides: Vec>) -> i64 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 43 - pub fn max_taxi_earnings(n: i32, rides: Vec>) -> i64 { [INFO] [stdout] 43 + pub fn max_taxi_earnings(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, rides: Vec>) -> i64 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `rides` [INFO] [stdout] --> src/solution/s2008_maximum_earnings_from_taxi.rs:43:38 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn max_taxi_earnings(n: i32, rides: Vec>) -> i64 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_rides` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2009_minimum_number_of_operations_to_make_array_continuous.rs:51:27 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn min_operations(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2012_sum_of_beauty_in_the_array.rs:49:28 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn sum_of_beauties(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s2014_longest_subsequence_repeated_k_times.rs:48:43 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn longest_subsequence_repeated_k(s: String, k: i32) -> String { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s2014_longest_subsequence_repeated_k_times.rs:48:54 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn longest_subsequence_repeated_k(s: String, k: i32) -> String { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 48 | pub fn longest_subsequence_repeated_k(s: String, _k: i32) -> String { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 48 - pub fn longest_subsequence_repeated_k(s: String, k: i32) -> String { [INFO] [stdout] 48 + pub fn longest_subsequence_repeated_k(s: String, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> String { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `grid` [INFO] [stdout] --> src/solution/s2017_grid_game.rs:50:22 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn grid_game(grid: Vec>) -> i64 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_grid` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `board` [INFO] [stdout] --> src/solution/s2018_check_if_word_can_be_placed_in_crossword.rs:50:36 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn place_word_in_crossword(board: Vec>, word: String) -> bool { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_board` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `word` [INFO] [stdout] --> src/solution/s2018_check_if_word_can_be_placed_in_crossword.rs:50:59 [INFO] [stdout] | [INFO] [stdout] 50 | pub fn place_word_in_crossword(board: Vec>, word: String) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_word` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s2019_the_score_of_students_solving_math_expression.rs:63:30 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn score_of_students(s: String, answers: Vec) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `answers` [INFO] [stdout] --> src/solution/s2019_the_score_of_students_solving_math_expression.rs:63:41 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn score_of_students(s: String, answers: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_answers` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2025_maximum_number_of_ways_to_partition_an_array.rs:52:30 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn ways_to_partition(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s2025_maximum_number_of_ways_to_partition_an_array.rs:52:46 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn ways_to_partition(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 52 | pub fn ways_to_partition(nums: Vec, _k: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 52 - pub fn ways_to_partition(nums: Vec, k: i32) -> i32 { [INFO] [stdout] 52 + pub fn ways_to_partition(nums: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `rolls` [INFO] [stdout] --> src/solution/s2028_find_missing_observations.rs:44:26 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn missing_rolls(rolls: Vec, mean: i32, n: i32) -> Vec { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_rolls` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `mean` [INFO] [stdout] --> src/solution/s2028_find_missing_observations.rs:44:43 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn missing_rolls(rolls: Vec, mean: i32, n: i32) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 44 | pub fn missing_rolls(rolls: Vec, _mean: i32, n: i32) -> Vec { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 44 - pub fn missing_rolls(rolls: Vec, mean: i32, n: i32) -> Vec { [INFO] [stdout] 44 + pub fn missing_rolls(rolls: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, n: i32) -> Vec { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s2028_find_missing_observations.rs:44:54 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn missing_rolls(rolls: Vec, mean: i32, n: i32) -> Vec { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 44 | pub fn missing_rolls(rolls: Vec, mean: i32, _n: i32) -> Vec { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 44 - pub fn missing_rolls(rolls: Vec, mean: i32, n: i32) -> Vec { [INFO] [stdout] 44 + pub fn missing_rolls(rolls: Vec, mean: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> Vec { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `stones` [INFO] [stdout] --> src/solution/s2029_stone_game_ix.rs:51:26 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn stone_game_ix(stones: Vec) -> bool { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_stones` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter.rs:48:33 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn smallest_subsequence(s: String, k: i32, letter: char, repetition: i32) -> String { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter.rs:48:44 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn smallest_subsequence(s: String, k: i32, letter: char, repetition: i32) -> String { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 48 | pub fn smallest_subsequence(s: String, _k: i32, letter: char, repetition: i32) -> String { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 48 - pub fn smallest_subsequence(s: String, k: i32, letter: char, repetition: i32) -> String { [INFO] [stdout] 48 + pub fn smallest_subsequence(s: String, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, letter: char, repetition: i32) -> String { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `letter` [INFO] [stdout] --> src/solution/s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter.rs:48:52 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn smallest_subsequence(s: String, k: i32, letter: char, repetition: i32) -> String { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 48 | pub fn smallest_subsequence(s: String, k: i32, _letter: char, repetition: i32) -> String { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `TARGET` [INFO] [stdout] | [INFO] [stdout] 48 - pub fn smallest_subsequence(s: String, k: i32, letter: char, repetition: i32) -> String { [INFO] [stdout] 48 + pub fn smallest_subsequence(s: String, k: i32, solution::s1263_minimum_moves_to_move_a_box_to_their_target_location::TARGET: char, repetition: i32) -> String { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `repetition` [INFO] [stdout] --> src/solution/s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter.rs:48:66 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn smallest_subsequence(s: String, k: i32, letter: char, repetition: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 48 | pub fn smallest_subsequence(s: String, k: i32, letter: char, _repetition: i32) -> String { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 48 - pub fn smallest_subsequence(s: String, k: i32, letter: char, repetition: i32) -> String { [INFO] [stdout] 48 + pub fn smallest_subsequence(s: String, k: i32, letter: char, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> String { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `grid` [INFO] [stdout] --> src/solution/s2033_minimum_operations_to_make_a_uni_value_grid.rs:48:27 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn min_operations(grid: Vec>, x: i32) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_grid` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `x` [INFO] [stdout] --> src/solution/s2033_minimum_operations_to_make_a_uni_value_grid.rs:48:48 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn min_operations(grid: Vec>, x: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 48 | pub fn min_operations(grid: Vec>, _x: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 48 - pub fn min_operations(grid: Vec>, x: i32) -> i32 { [INFO] [stdout] 48 + pub fn min_operations(grid: Vec>, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2035_partition_array_into_two_arrays_to_minimize_sum_difference.rs:44:31 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn minimum_difference(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `edges` [INFO] [stdout] --> src/solution/s2039_the_time_when_the_network_becomes_idle.rs:69:33 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn network_becomes_idle(edges: Vec>, patience: Vec) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `patience` [INFO] [stdout] --> src/solution/s2039_the_time_when_the_network_becomes_idle.rs:69:55 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn network_becomes_idle(edges: Vec>, patience: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_patience` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums1` [INFO] [stdout] --> src/solution/s2040_kth_smallest_product_of_two_sorted_arrays.rs:55:33 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn kth_smallest_product(nums1: Vec, nums2: Vec, k: i64) -> i64 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums2` [INFO] [stdout] --> src/solution/s2040_kth_smallest_product_of_two_sorted_arrays.rs:55:50 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn kth_smallest_product(nums1: Vec, nums2: Vec, k: i64) -> i64 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s2040_kth_smallest_product_of_two_sorted_arrays.rs:55:67 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn kth_smallest_product(nums1: Vec, nums2: Vec, k: i64) -> i64 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 55 | pub fn kth_smallest_product(nums1: Vec, nums2: Vec, _k: i64) -> i64 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 55 - pub fn kth_smallest_product(nums1: Vec, nums2: Vec, k: i64) -> i64 { [INFO] [stdout] 55 + pub fn kth_smallest_product(nums1: Vec, nums2: Vec, solution::s1808_maximize_number_of_nice_divisors::MOD: i64) -> i64 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s2045_second_minimum_time_to_reach_destination.rs:65:27 [INFO] [stdout] | [INFO] [stdout] 65 | pub fn second_minimum(n: i32, edges: Vec>, time: i32, change: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 65 | pub fn second_minimum(_n: i32, edges: Vec>, time: i32, change: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 65 - pub fn second_minimum(n: i32, edges: Vec>, time: i32, change: i32) -> i32 { [INFO] [stdout] 65 + pub fn second_minimum(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, edges: Vec>, time: i32, change: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `edges` [INFO] [stdout] --> src/solution/s2045_second_minimum_time_to_reach_destination.rs:65:35 [INFO] [stdout] | [INFO] [stdout] 65 | pub fn second_minimum(n: i32, edges: Vec>, time: i32, change: i32) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `time` [INFO] [stdout] --> src/solution/s2045_second_minimum_time_to_reach_destination.rs:65:57 [INFO] [stdout] | [INFO] [stdout] 65 | pub fn second_minimum(n: i32, edges: Vec>, time: i32, change: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 65 | pub fn second_minimum(n: i32, edges: Vec>, _time: i32, change: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 65 - pub fn second_minimum(n: i32, edges: Vec>, time: i32, change: i32) -> i32 { [INFO] [stdout] 65 + pub fn second_minimum(n: i32, edges: Vec>, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, change: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `change` [INFO] [stdout] --> src/solution/s2045_second_minimum_time_to_reach_destination.rs:65:68 [INFO] [stdout] | [INFO] [stdout] 65 | pub fn second_minimum(n: i32, edges: Vec>, time: i32, change: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 65 | pub fn second_minimum(n: i32, edges: Vec>, time: i32, _change: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 65 - pub fn second_minimum(n: i32, edges: Vec>, time: i32, change: i32) -> i32 { [INFO] [stdout] 65 + pub fn second_minimum(n: i32, edges: Vec>, time: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s2048_next_greater_numerically_balanced_number.rs:51:34 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn next_beautiful_number(n: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 51 | pub fn next_beautiful_number(_n: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 51 - pub fn next_beautiful_number(n: i32) -> i32 { [INFO] [stdout] 51 + pub fn next_beautiful_number(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `parents` [INFO] [stdout] --> src/solution/s2049_count_nodes_with_the_highest_score.rs:48:38 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn count_highest_score_nodes(parents: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_parents` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s2050_parallel_courses_iii.rs:57:25 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn minimum_time(n: i32, relations: Vec>, time: Vec) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 57 | pub fn minimum_time(_n: i32, relations: Vec>, time: Vec) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 57 - pub fn minimum_time(n: i32, relations: Vec>, time: Vec) -> i32 { [INFO] [stdout] 57 + pub fn minimum_time(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, relations: Vec>, time: Vec) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `relations` [INFO] [stdout] --> src/solution/s2050_parallel_courses_iii.rs:57:33 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn minimum_time(n: i32, relations: Vec>, time: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_relations` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `time` [INFO] [stdout] --> src/solution/s2050_parallel_courses_iii.rs:57:59 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn minimum_time(n: i32, relations: Vec>, time: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_time` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `t` [INFO] [stdout] --> src/solution/s2054_two_best_non_overlapping_events.rs:52:36 [INFO] [stdout] | [INFO] [stdout] 52 | .scan((0, 0), |state, (t, s, v)| { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 52 | .scan((0, 0), |state, (_t, s, v)| { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 52 - .scan((0, 0), |state, (t, s, v)| { [INFO] [stdout] 52 + .scan((0, 0), |state, (solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD, s, v)| { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s2055_plates_between_candles.rs:45:35 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn plates_between_candles(s: String, queries: Vec>) -> Vec { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `queries` [INFO] [stdout] --> src/solution/s2055_plates_between_candles.rs:45:46 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn plates_between_candles(s: String, queries: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_queries` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `pieces` [INFO] [stdout] --> src/solution/s2056_number_of_valid_move_combinations_on_chessboard.rs:58:31 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn count_combinations(pieces: Vec, positions: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_pieces` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `positions` [INFO] [stdout] --> src/solution/s2056_number_of_valid_move_combinations_on_chessboard.rs:58:52 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn count_combinations(pieces: Vec, positions: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_positions` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s2058_find_the_minimum_and_maximum_number_of_nodes_between_critical_points.rs:70:42 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn nodes_between_critical_points(head: Option>) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2059_minimum_operations_to_convert_number.rs:55:31 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn minimum_operations(nums: Vec, start: i32, goal: i32) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start` [INFO] [stdout] --> src/solution/s2059_minimum_operations_to_convert_number.rs:55:47 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn minimum_operations(nums: Vec, start: i32, goal: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 55 | pub fn minimum_operations(nums: Vec, _start: i32, goal: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 55 - pub fn minimum_operations(nums: Vec, start: i32, goal: i32) -> i32 { [INFO] [stdout] 55 + pub fn minimum_operations(nums: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, goal: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `goal` [INFO] [stdout] --> src/solution/s2059_minimum_operations_to_convert_number.rs:55:59 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn minimum_operations(nums: Vec, start: i32, goal: i32) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 55 | pub fn minimum_operations(nums: Vec, start: i32, _goal: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 55 - pub fn minimum_operations(nums: Vec, start: i32, goal: i32) -> i32 { [INFO] [stdout] 55 + pub fn minimum_operations(nums: Vec, start: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s1` [INFO] [stdout] --> src/solution/s2060_check_if_an_original_string_exists_given_two_encoded_strings.rs:71:28 [INFO] [stdout] | [INFO] [stdout] 71 | pub fn possibly_equals(s1: String, s2: String) -> bool { [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_s1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s2` [INFO] [stdout] --> src/solution/s2060_check_if_an_original_string_exists_given_two_encoded_strings.rs:71:40 [INFO] [stdout] | [INFO] [stdout] 71 | pub fn possibly_equals(s1: String, s2: String) -> bool { [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_s2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/solution/s2063_vowels_of_all_substrings.rs:55:23 [INFO] [stdout] | [INFO] [stdout] 55 | .filter(|(i, c)| *c == 'a' || *c == 'e' || *c == 'i' || *c == 'o' || *c == 'u') [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `c` [INFO] [stdout] --> src/solution/s2063_vowels_of_all_substrings.rs:56:23 [INFO] [stdout] | [INFO] [stdout] 56 | .map(|(i, c)| i as i64) [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 56 | .map(|(i, _c)| i as i64) [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `TARGET` [INFO] [stdout] | [INFO] [stdout] 56 - .map(|(i, c)| i as i64) [INFO] [stdout] 56 + .map(|(i, solution::s1263_minimum_moves_to_move_a_box_to_their_target_location::TARGET)| i as i64) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s2064_minimized_maximum_of_products_distributed_to_any_store.rs:55:30 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn minimized_maximum(n: i32, quantities: Vec) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 55 | pub fn minimized_maximum(_n: i32, quantities: Vec) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 55 - pub fn minimized_maximum(n: i32, quantities: Vec) -> i32 { [INFO] [stdout] 55 + pub fn minimized_maximum(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, quantities: Vec) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `quantities` [INFO] [stdout] --> src/solution/s2064_minimized_maximum_of_products_distributed_to_any_store.rs:55:38 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn minimized_maximum(n: i32, quantities: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_quantities` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `values` [INFO] [stdout] --> src/solution/s2065_maximum_path_quality_of_a_graph.rs:56:33 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn maximal_path_quality(values: Vec, edges: Vec>, max_time: i32) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_values` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `edges` [INFO] [stdout] --> src/solution/s2065_maximum_path_quality_of_a_graph.rs:56:51 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn maximal_path_quality(values: Vec, edges: Vec>, max_time: i32) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_edges` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `max_time` [INFO] [stdout] --> src/solution/s2065_maximum_path_quality_of_a_graph.rs:56:73 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn maximal_path_quality(values: Vec, edges: Vec>, max_time: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 56 | pub fn maximal_path_quality(values: Vec, edges: Vec>, _max_time: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 56 - pub fn maximal_path_quality(values: Vec, edges: Vec>, max_time: i32) -> i32 { [INFO] [stdout] 56 + pub fn maximal_path_quality(values: Vec, edges: Vec>, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `items` [INFO] [stdout] --> src/solution/s2070_most_beautiful_item_for_each_query.rs:53:27 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn maximum_beauty(items: Vec>, queries: Vec) -> Vec { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_items` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `queries` [INFO] [stdout] --> src/solution/s2070_most_beautiful_item_for_each_query.rs:53:49 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn maximum_beauty(items: Vec>, queries: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_queries` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `tasks` [INFO] [stdout] --> src/solution/s2071_maximum_number_of_tasks_you_can_assign.rs:57:28 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn max_task_assign(tasks: Vec, workers: Vec, pills: i32, strength: i32) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_tasks` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `workers` [INFO] [stdout] --> src/solution/s2071_maximum_number_of_tasks_you_can_assign.rs:57:45 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn max_task_assign(tasks: Vec, workers: Vec, pills: i32, strength: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_workers` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `pills` [INFO] [stdout] --> src/solution/s2071_maximum_number_of_tasks_you_can_assign.rs:57:64 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn max_task_assign(tasks: Vec, workers: Vec, pills: i32, strength: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 57 | pub fn max_task_assign(tasks: Vec, workers: Vec, _pills: i32, strength: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 57 - pub fn max_task_assign(tasks: Vec, workers: Vec, pills: i32, strength: i32) -> i32 { [INFO] [stdout] 57 + pub fn max_task_assign(tasks: Vec, workers: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, strength: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `strength` [INFO] [stdout] --> src/solution/s2071_maximum_number_of_tasks_you_can_assign.rs:57:76 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn max_task_assign(tasks: Vec, workers: Vec, pills: i32, strength: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 57 | pub fn max_task_assign(tasks: Vec, workers: Vec, pills: i32, _strength: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 57 - pub fn max_task_assign(tasks: Vec, workers: Vec, pills: i32, strength: i32) -> i32 { [INFO] [stdout] 57 + pub fn max_task_assign(tasks: Vec, workers: Vec, pills: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s2074_reverse_nodes_in_even_length_groups.rs:74:39 [INFO] [stdout] | [INFO] [stdout] 74 | pub fn reverse_even_length_groups(head: Option>) -> Option> { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `encoded_text` [INFO] [stdout] --> src/solution/s2075_decode_the_slanted_ciphertext.rs:54:30 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn decode_ciphertext(encoded_text: String, rows: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_encoded_text` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `rows` [INFO] [stdout] --> src/solution/s2075_decode_the_slanted_ciphertext.rs:54:52 [INFO] [stdout] | [INFO] [stdout] 54 | pub fn decode_ciphertext(encoded_text: String, rows: i32) -> String { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 54 | pub fn decode_ciphertext(encoded_text: String, _rows: i32) -> String { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 54 - pub fn decode_ciphertext(encoded_text: String, rows: i32) -> String { [INFO] [stdout] 54 + pub fn decode_ciphertext(encoded_text: String, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> String { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s2076_process_restricted_friend_requests.rs:60:9 [INFO] [stdout] | [INFO] [stdout] 60 | n: i32, [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 60 | _n: i32, [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 60 - n: i32, [INFO] [stdout] 60 + solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `restrictions` [INFO] [stdout] --> src/solution/s2076_process_restricted_friend_requests.rs:61:9 [INFO] [stdout] | [INFO] [stdout] 61 | restrictions: Vec>, [INFO] [stdout] | ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_restrictions` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `requests` [INFO] [stdout] --> src/solution/s2076_process_restricted_friend_requests.rs:62:9 [INFO] [stdout] | [INFO] [stdout] 62 | requests: Vec>, [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_requests` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s2078_two_furthest_houses_with_different_colors.rs:50:13 [INFO] [stdout] | [INFO] [stdout] 50 | let mut n = colors.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/solution/s2078_two_furthest_houses_with_different_colors.rs:51:13 [INFO] [stdout] | [INFO] [stdout] 51 | let mut l_most = 0usize.abs_diff(colors.iter().rposition(|x| *x != colors[0]).unwrap()); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/solution/s2078_two_furthest_houses_with_different_colors.rs:52:13 [INFO] [stdout] | [INFO] [stdout] 52 | let mut r_most = n.abs_diff(colors.iter().position(|x| *x != colors[n]).unwrap()); [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `plants` [INFO] [stdout] --> src/solution/s2079_watering_plants.rs:62:28 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn watering_plants(plants: Vec, capacity: i32) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_plants` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `capacity` [INFO] [stdout] --> src/solution/s2079_watering_plants.rs:62:46 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn watering_plants(plants: Vec, capacity: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 62 | pub fn watering_plants(plants: Vec, _capacity: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 62 - pub fn watering_plants(plants: Vec, capacity: i32) -> i32 { [INFO] [stdout] 62 + pub fn watering_plants(plants: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s2081_sum_of_k_mirror_numbers.rs:63:21 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn k_mirror(k: i32, n: i32) -> i64 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 63 | pub fn k_mirror(_k: i32, n: i32) -> i64 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 63 - pub fn k_mirror(k: i32, n: i32) -> i64 { [INFO] [stdout] 63 + pub fn k_mirror(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, n: i32) -> i64 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s2081_sum_of_k_mirror_numbers.rs:63:29 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn k_mirror(k: i32, n: i32) -> i64 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 63 | pub fn k_mirror(k: i32, _n: i32) -> i64 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 63 - pub fn k_mirror(k: i32, n: i32) -> i64 { [INFO] [stdout] 63 + pub fn k_mirror(k: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i64 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `hamsters` [INFO] [stdout] --> src/solution/s2086_minimum_number_of_food_buckets_to_feed_the_hamsters.rs:46:28 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn minimum_buckets(hamsters: String) -> i32 { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_hamsters` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start_pos` [INFO] [stdout] --> src/solution/s2087_minimum_cost_homecoming_of_a_robot_in_a_grid.rs:51:9 [INFO] [stdout] | [INFO] [stdout] 51 | start_pos: Vec, [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_start_pos` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `home_pos` [INFO] [stdout] --> src/solution/s2087_minimum_cost_homecoming_of_a_robot_in_a_grid.rs:52:9 [INFO] [stdout] | [INFO] [stdout] 52 | home_pos: Vec, [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_home_pos` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `row_costs` [INFO] [stdout] --> src/solution/s2087_minimum_cost_homecoming_of_a_robot_in_a_grid.rs:53:9 [INFO] [stdout] | [INFO] [stdout] 53 | row_costs: Vec, [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_row_costs` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `col_costs` [INFO] [stdout] --> src/solution/s2087_minimum_cost_homecoming_of_a_robot_in_a_grid.rs:54:9 [INFO] [stdout] | [INFO] [stdout] 54 | col_costs: Vec, [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_col_costs` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `grid` [INFO] [stdout] --> src/solution/s2088_count_fertile_pyramids_in_a_land.rs:60:27 [INFO] [stdout] | [INFO] [stdout] 60 | pub fn count_pyramids(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_grid` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2090_k_radius_subarray_averages.rs:55:25 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn get_averages(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s2090_k_radius_subarray_averages.rs:55:41 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn get_averages(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 55 | pub fn get_averages(nums: Vec, _k: i32) -> Vec { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 55 - pub fn get_averages(nums: Vec, k: i32) -> Vec { [INFO] [stdout] 55 + pub fn get_averages(nums: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> Vec { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2091_removing_minimum_and_maximum_from_array.rs:53:30 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn minimum_deletions(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s2092_find_all_people_with_secret.rs:61:28 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn find_all_people(n: i32, meetings: Vec>, first_person: i32) -> Vec { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 61 | pub fn find_all_people(_n: i32, meetings: Vec>, first_person: i32) -> Vec { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 61 - pub fn find_all_people(n: i32, meetings: Vec>, first_person: i32) -> Vec { [INFO] [stdout] 61 + pub fn find_all_people(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, meetings: Vec>, first_person: i32) -> Vec { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `meetings` [INFO] [stdout] --> src/solution/s2092_find_all_people_with_secret.rs:61:36 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn find_all_people(n: i32, meetings: Vec>, first_person: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_meetings` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `first_person` [INFO] [stdout] --> src/solution/s2092_find_all_people_with_secret.rs:61:61 [INFO] [stdout] | [INFO] [stdout] 61 | pub fn find_all_people(n: i32, meetings: Vec>, first_person: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 61 | pub fn find_all_people(n: i32, meetings: Vec>, _first_person: i32) -> Vec { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 61 - pub fn find_all_people(n: i32, meetings: Vec>, first_person: i32) -> Vec { [INFO] [stdout] 61 + pub fn find_all_people(n: i32, meetings: Vec>, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> Vec { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s2095_delete_the_middle_node_of_a_linked_list.rs:67:26 [INFO] [stdout] | [INFO] [stdout] 67 | pub fn delete_middle(head: Option>) -> Option> { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `root` [INFO] [stdout] --> src/solution/s2096_step_by_step_directions_from_a_binary_tree_node_to_another.rs:66:9 [INFO] [stdout] | [INFO] [stdout] 66 | root: Option>>, [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_root` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start_value` [INFO] [stdout] --> src/solution/s2096_step_by_step_directions_from_a_binary_tree_node_to_another.rs:67:9 [INFO] [stdout] | [INFO] [stdout] 67 | start_value: i32, [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 67 | _start_value: i32, [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 67 - start_value: i32, [INFO] [stdout] 67 + solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `dest_value` [INFO] [stdout] --> src/solution/s2096_step_by_step_directions_from_a_binary_tree_node_to_another.rs:68:9 [INFO] [stdout] | [INFO] [stdout] 68 | dest_value: i32, [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 68 | _dest_value: i32, [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 68 - dest_value: i32, [INFO] [stdout] 68 + solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `pairs` [INFO] [stdout] --> src/solution/s2097_valid_arrangement_of_pairs.rs:56:30 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn valid_arrangement(pairs: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_pairs` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `security` [INFO] [stdout] --> src/solution/s2100_find_good_days_to_rob_the_bank.rs:53:34 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn good_days_to_rob_bank(security: Vec, time: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_security` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `time` [INFO] [stdout] --> src/solution/s2100_find_good_days_to_rob_the_bank.rs:53:54 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn good_days_to_rob_bank(security: Vec, time: i32) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 53 | pub fn good_days_to_rob_bank(security: Vec, _time: i32) -> Vec { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 53 - pub fn good_days_to_rob_bank(security: Vec, time: i32) -> Vec { [INFO] [stdout] 53 + pub fn good_days_to_rob_bank(security: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> Vec { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `bombs` [INFO] [stdout] --> src/solution/s2101_detonate_the_maximum_bombs.rs:53:31 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn maximum_detonation(bombs: Vec>) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_bombs` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `name` [INFO] [stdout] --> src/solution/s2102_sequentially_ordinal_rank_tracker.rs:83:19 [INFO] [stdout] | [INFO] [stdout] 83 | fn add(&self, name: String, score: i32) { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_name` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `score` [INFO] [stdout] --> src/solution/s2102_sequentially_ordinal_rank_tracker.rs:83:33 [INFO] [stdout] | [INFO] [stdout] 83 | fn add(&self, name: String, score: i32) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 83 | fn add(&self, name: String, _score: i32) { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 83 - fn add(&self, name: String, score: i32) { [INFO] [stdout] 83 + fn add(&self, name: String, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `plants` [INFO] [stdout] --> src/solution/s2105_watering_plants_ii.rs:62:27 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn minimum_refill(plants: Vec, capacity_a: i32, capacity_b: i32) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_plants` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `capacity_a` [INFO] [stdout] --> src/solution/s2105_watering_plants_ii.rs:62:45 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn minimum_refill(plants: Vec, capacity_a: i32, capacity_b: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 62 | pub fn minimum_refill(plants: Vec, _capacity_a: i32, capacity_b: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 62 - pub fn minimum_refill(plants: Vec, capacity_a: i32, capacity_b: i32) -> i32 { [INFO] [stdout] 62 + pub fn minimum_refill(plants: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, capacity_b: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `capacity_b` [INFO] [stdout] --> src/solution/s2105_watering_plants_ii.rs:62:62 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn minimum_refill(plants: Vec, capacity_a: i32, capacity_b: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 62 | pub fn minimum_refill(plants: Vec, capacity_a: i32, _capacity_b: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 62 - pub fn minimum_refill(plants: Vec, capacity_a: i32, capacity_b: i32) -> i32 { [INFO] [stdout] 62 + pub fn minimum_refill(plants: Vec, capacity_a: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `fruits` [INFO] [stdout] --> src/solution/s2106_maximum_fruits_harvested_after_at_most_k_steps.rs:57:29 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn max_total_fruits(fruits: Vec>, start_pos: i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_fruits` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start_pos` [INFO] [stdout] --> src/solution/s2106_maximum_fruits_harvested_after_at_most_k_steps.rs:57:52 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn max_total_fruits(fruits: Vec>, start_pos: i32, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 57 | pub fn max_total_fruits(fruits: Vec>, _start_pos: i32, k: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 57 - pub fn max_total_fruits(fruits: Vec>, start_pos: i32, k: i32) -> i32 { [INFO] [stdout] 57 + pub fn max_total_fruits(fruits: Vec>, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, k: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s2106_maximum_fruits_harvested_after_at_most_k_steps.rs:57:68 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn max_total_fruits(fruits: Vec>, start_pos: i32, k: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 57 | pub fn max_total_fruits(fruits: Vec>, start_pos: i32, _k: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 57 - pub fn max_total_fruits(fruits: Vec>, start_pos: i32, k: i32) -> i32 { [INFO] [stdout] 57 + pub fn max_total_fruits(fruits: Vec>, start_pos: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s2109_adding_spaces_to_a_string.rs:51:23 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn add_spaces(s: String, spaces: Vec) -> String { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `spaces` [INFO] [stdout] --> src/solution/s2109_adding_spaces_to_a_string.rs:51:34 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn add_spaces(s: String, spaces: Vec) -> String { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_spaces` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `prices` [INFO] [stdout] --> src/solution/s2110_number_of_smooth_descent_periods_of_a_stock.rs:44:32 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn get_descent_periods(prices: Vec) -> i64 { [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_prices` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `arr` [INFO] [stdout] --> src/solution/s2111_minimum_operations_to_make_the_array_k_increasing.rs:63:25 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn k_increasing(arr: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_arr` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s2111_minimum_operations_to_make_the_array_k_increasing.rs:63:40 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn k_increasing(arr: Vec, k: i32) -> i32 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 63 | pub fn k_increasing(arr: Vec, _k: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 63 - pub fn k_increasing(arr: Vec, k: i32) -> i32 { [INFO] [stdout] 63 + pub fn k_increasing(arr: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `recipes` [INFO] [stdout] --> src/solution/s2115_find_all_possible_recipes_from_given_supplies.rs:54:9 [INFO] [stdout] | [INFO] [stdout] 54 | recipes: Vec, [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_recipes` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `ingredients` [INFO] [stdout] --> src/solution/s2115_find_all_possible_recipes_from_given_supplies.rs:55:9 [INFO] [stdout] | [INFO] [stdout] 55 | ingredients: Vec>, [INFO] [stdout] | ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_ingredients` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `supplies` [INFO] [stdout] --> src/solution/s2115_find_all_possible_recipes_from_given_supplies.rs:56:9 [INFO] [stdout] | [INFO] [stdout] 56 | supplies: Vec, [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_supplies` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `left` [INFO] [stdout] --> src/solution/s2117_abbreviating_the_product_of_a_range.rs:63:31 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn abbreviate_product(left: i32, right: i32) -> String { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 63 | pub fn abbreviate_product(_left: i32, right: i32) -> String { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 63 - pub fn abbreviate_product(left: i32, right: i32) -> String { [INFO] [stdout] 63 + pub fn abbreviate_product(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, right: i32) -> String { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `right` [INFO] [stdout] --> src/solution/s2117_abbreviating_the_product_of_a_range.rs:63:42 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn abbreviate_product(left: i32, right: i32) -> String { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 63 | pub fn abbreviate_product(left: i32, _right: i32) -> String { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 63 - pub fn abbreviate_product(left: i32, right: i32) -> String { [INFO] [stdout] 63 + pub fn abbreviate_product(left: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> String { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s2120_execution_of_all_suffix_instructions_staying_in_a_grid.rs:59:33 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn execute_instructions(n: i32, start_pos: Vec, s: String) -> Vec { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 59 | pub fn execute_instructions(_n: i32, start_pos: Vec, s: String) -> Vec { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 59 - pub fn execute_instructions(n: i32, start_pos: Vec, s: String) -> Vec { [INFO] [stdout] 59 + pub fn execute_instructions(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, start_pos: Vec, s: String) -> Vec { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start_pos` [INFO] [stdout] --> src/solution/s2120_execution_of_all_suffix_instructions_staying_in_a_grid.rs:59:41 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn execute_instructions(n: i32, start_pos: Vec, s: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_start_pos` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s2120_execution_of_all_suffix_instructions_staying_in_a_grid.rs:59:62 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn execute_instructions(n: i32, start_pos: Vec, s: String) -> Vec { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `arr` [INFO] [stdout] --> src/solution/s2121_intervals_between_identical_elements.rs:51:26 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn get_distances(arr: Vec) -> Vec { [INFO] [stdout] | ^^^ help: if this is intentional, prefix it with an underscore: `_arr` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2122_recover_the_original_array.rs:56:26 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn recover_array(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `mass` [INFO] [stdout] --> src/solution/s2126_destroying_asteroids.rs:44:32 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn asteroids_destroyed(mass: i32, asteroids: Vec) -> bool { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 44 | pub fn asteroids_destroyed(_mass: i32, asteroids: Vec) -> bool { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 44 - pub fn asteroids_destroyed(mass: i32, asteroids: Vec) -> bool { [INFO] [stdout] 44 + pub fn asteroids_destroyed(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, asteroids: Vec) -> bool { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `asteroids` [INFO] [stdout] --> src/solution/s2126_destroying_asteroids.rs:44:43 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn asteroids_destroyed(mass: i32, asteroids: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_asteroids` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `favorite` [INFO] [stdout] --> src/solution/s2127_maximum_employees_to_be_invited_to_a_meeting.rs:57:32 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn maximum_invitations(favorite: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_favorite` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `head` [INFO] [stdout] --> src/solution/s2130_maximum_twin_sum_of_a_linked_list.rs:69:21 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn pair_sum(head: Option>) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_head` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `words` [INFO] [stdout] --> src/solution/s2131_longest_palindrome_by_concatenating_two_letter_words.rs:46:31 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn longest_palindrome(words: Vec) -> i32 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_words` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `grid` [INFO] [stdout] --> src/solution/s2132_stamping_the_grid.rs:47:30 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn possible_to_stamp(grid: Vec>, stamp_height: i32, stamp_width: i32) -> bool { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_grid` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `stamp_height` [INFO] [stdout] --> src/solution/s2132_stamping_the_grid.rs:47:51 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn possible_to_stamp(grid: Vec>, stamp_height: i32, stamp_width: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 47 | pub fn possible_to_stamp(grid: Vec>, _stamp_height: i32, stamp_width: i32) -> bool { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 47 - pub fn possible_to_stamp(grid: Vec>, stamp_height: i32, stamp_width: i32) -> bool { [INFO] [stdout] 47 + pub fn possible_to_stamp(grid: Vec>, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, stamp_width: i32) -> bool { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `stamp_width` [INFO] [stdout] --> src/solution/s2132_stamping_the_grid.rs:47:70 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn possible_to_stamp(grid: Vec>, stamp_height: i32, stamp_width: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 47 | pub fn possible_to_stamp(grid: Vec>, stamp_height: i32, _stamp_width: i32) -> bool { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 47 - pub fn possible_to_stamp(grid: Vec>, stamp_height: i32, stamp_width: i32) -> bool { [INFO] [stdout] 47 + pub fn possible_to_stamp(grid: Vec>, stamp_height: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> bool { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2134_minimum_swaps_to_group_all_1s_together_ii.rs:51:22 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn min_swaps(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start_words` [INFO] [stdout] --> src/solution/s2135_count_words_obtained_after_adding_a_letter.rs:57:23 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn word_count(start_words: Vec, target_words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_start_words` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `target_words` [INFO] [stdout] --> src/solution/s2135_count_words_obtained_after_adding_a_letter.rs:57:49 [INFO] [stdout] | [INFO] [stdout] 57 | pub fn word_count(start_words: Vec, target_words: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_target_words` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `plant_time` [INFO] [stdout] --> src/solution/s2136_earliest_possible_day_of_full_bloom.rs:58:32 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn earliest_full_bloom(plant_time: Vec, grow_time: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_plant_time` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `grow_time` [INFO] [stdout] --> src/solution/s2136_earliest_possible_day_of_full_bloom.rs:58:54 [INFO] [stdout] | [INFO] [stdout] 58 | pub fn earliest_full_bloom(plant_time: Vec, grow_time: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_grow_time` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `target` [INFO] [stdout] --> src/solution/s2139_minimum_moves_to_reach_target_score.rs:55:22 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn min_moves(target: i32, max_doubles: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 55 | pub fn min_moves(_target: i32, max_doubles: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 55 - pub fn min_moves(target: i32, max_doubles: i32) -> i32 { [INFO] [stdout] 55 + pub fn min_moves(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, max_doubles: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `max_doubles` [INFO] [stdout] --> src/solution/s2139_minimum_moves_to_reach_target_score.rs:55:35 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn min_moves(target: i32, max_doubles: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 55 | pub fn min_moves(target: i32, _max_doubles: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 55 - pub fn min_moves(target: i32, max_doubles: i32) -> i32 { [INFO] [stdout] 55 + pub fn min_moves(target: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `n` [INFO] [stdout] --> src/solution/s2141_maximum_running_time_of_n_computers.rs:45:25 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn max_run_time(n: i32, batteries: Vec) -> i64 { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 45 | pub fn max_run_time(_n: i32, batteries: Vec) -> i64 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 45 - pub fn max_run_time(n: i32, batteries: Vec) -> i64 { [INFO] [stdout] 45 + pub fn max_run_time(solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, batteries: Vec) -> i64 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `batteries` [INFO] [stdout] --> src/solution/s2141_maximum_running_time_of_n_computers.rs:45:33 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn max_run_time(n: i32, batteries: Vec) -> i64 { [INFO] [stdout] | ^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_batteries` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `differences` [INFO] [stdout] --> src/solution/s2145_count_the_hidden_sequences.rs:60:29 [INFO] [stdout] | [INFO] [stdout] 60 | pub fn number_of_arrays(differences: Vec, lower: i32, upper: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_differences` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `lower` [INFO] [stdout] --> src/solution/s2145_count_the_hidden_sequences.rs:60:52 [INFO] [stdout] | [INFO] [stdout] 60 | pub fn number_of_arrays(differences: Vec, lower: i32, upper: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 60 | pub fn number_of_arrays(differences: Vec, _lower: i32, upper: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 60 - pub fn number_of_arrays(differences: Vec, lower: i32, upper: i32) -> i32 { [INFO] [stdout] 60 + pub fn number_of_arrays(differences: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, upper: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `upper` [INFO] [stdout] --> src/solution/s2145_count_the_hidden_sequences.rs:60:64 [INFO] [stdout] | [INFO] [stdout] 60 | pub fn number_of_arrays(differences: Vec, lower: i32, upper: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 60 | pub fn number_of_arrays(differences: Vec, lower: i32, _upper: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 60 - pub fn number_of_arrays(differences: Vec, lower: i32, upper: i32) -> i32 { [INFO] [stdout] 60 + pub fn number_of_arrays(differences: Vec, lower: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `grid` [INFO] [stdout] --> src/solution/s2146_k_highest_ranked_items_within_a_price_range.rs:85:9 [INFO] [stdout] | [INFO] [stdout] 85 | grid: Vec>, [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_grid` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `pricing` [INFO] [stdout] --> src/solution/s2146_k_highest_ranked_items_within_a_price_range.rs:86:9 [INFO] [stdout] | [INFO] [stdout] 86 | pricing: Vec, [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_pricing` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start` [INFO] [stdout] --> src/solution/s2146_k_highest_ranked_items_within_a_price_range.rs:87:9 [INFO] [stdout] | [INFO] [stdout] 87 | start: Vec, [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_start` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s2146_k_highest_ranked_items_within_a_price_range.rs:88:9 [INFO] [stdout] | [INFO] [stdout] 88 | k: i32, [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 88 | _k: i32, [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 88 - k: i32, [INFO] [stdout] 88 + solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `corridor` [INFO] [stdout] --> src/solution/s2147_number_of_ways_to_divide_a_long_corridor.rs:46:27 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn number_of_ways(corridor: String) -> i32 { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_corridor` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2149_rearrange_array_elements_by_sign.rs:49:28 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn rearrange_array(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2150_find_all_lonely_numbers_in_the_array.rs:44:24 [INFO] [stdout] | [INFO] [stdout] 44 | pub fn find_lonely(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `statements` [INFO] [stdout] --> src/solution/s2151_maximum_good_people_based_on_statements.rs:81:25 [INFO] [stdout] | [INFO] [stdout] 81 | pub fn maximum_good(statements: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_statements` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2155_all_divisions_with_the_highest_score_of_a_binary_array.rs:62:30 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn max_score_indices(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s2156_find_substring_with_given_hash_value.rs:47:25 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn sub_str_hash(s: String, power: i32, modulo: i32, k: i32, hash_value: i32) -> String { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `power` [INFO] [stdout] --> src/solution/s2156_find_substring_with_given_hash_value.rs:47:36 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn sub_str_hash(s: String, power: i32, modulo: i32, k: i32, hash_value: i32) -> String { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 47 | pub fn sub_str_hash(s: String, _power: i32, modulo: i32, k: i32, hash_value: i32) -> String { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 47 - pub fn sub_str_hash(s: String, power: i32, modulo: i32, k: i32, hash_value: i32) -> String { [INFO] [stdout] 47 + pub fn sub_str_hash(s: String, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, modulo: i32, k: i32, hash_value: i32) -> String { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `modulo` [INFO] [stdout] --> src/solution/s2156_find_substring_with_given_hash_value.rs:47:48 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn sub_str_hash(s: String, power: i32, modulo: i32, k: i32, hash_value: i32) -> String { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 47 | pub fn sub_str_hash(s: String, power: i32, _modulo: i32, k: i32, hash_value: i32) -> String { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 47 - pub fn sub_str_hash(s: String, power: i32, modulo: i32, k: i32, hash_value: i32) -> String { [INFO] [stdout] 47 + pub fn sub_str_hash(s: String, power: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, k: i32, hash_value: i32) -> String { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `k` [INFO] [stdout] --> src/solution/s2156_find_substring_with_given_hash_value.rs:47:61 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn sub_str_hash(s: String, power: i32, modulo: i32, k: i32, hash_value: i32) -> String { [INFO] [stdout] | ^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 47 | pub fn sub_str_hash(s: String, power: i32, modulo: i32, _k: i32, hash_value: i32) -> String { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 47 - pub fn sub_str_hash(s: String, power: i32, modulo: i32, k: i32, hash_value: i32) -> String { [INFO] [stdout] 47 + pub fn sub_str_hash(s: String, power: i32, modulo: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, hash_value: i32) -> String { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `hash_value` [INFO] [stdout] --> src/solution/s2156_find_substring_with_given_hash_value.rs:47:69 [INFO] [stdout] | [INFO] [stdout] 47 | pub fn sub_str_hash(s: String, power: i32, modulo: i32, k: i32, hash_value: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 47 | pub fn sub_str_hash(s: String, power: i32, modulo: i32, k: i32, _hash_value: i32) -> String { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 47 - pub fn sub_str_hash(s: String, power: i32, modulo: i32, k: i32, hash_value: i32) -> String { [INFO] [stdout] 47 + pub fn sub_str_hash(s: String, power: i32, modulo: i32, k: i32, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> String { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `words` [INFO] [stdout] --> src/solution/s2157_groups_of_strings.rs:62:26 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn group_strings(words: Vec) -> Vec { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_words` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start_at` [INFO] [stdout] --> src/solution/s2162_minimum_cost_to_set_cooking_time.rs:61:9 [INFO] [stdout] | [INFO] [stdout] 61 | start_at: i32, [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 61 | _start_at: i32, [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 61 - start_at: i32, [INFO] [stdout] 61 + solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `move_cost` [INFO] [stdout] --> src/solution/s2162_minimum_cost_to_set_cooking_time.rs:62:9 [INFO] [stdout] | [INFO] [stdout] 62 | move_cost: i32, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 62 | _move_cost: i32, [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 62 - move_cost: i32, [INFO] [stdout] 62 + solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `push_cost` [INFO] [stdout] --> src/solution/s2162_minimum_cost_to_set_cooking_time.rs:63:9 [INFO] [stdout] | [INFO] [stdout] 63 | push_cost: i32, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 63 | _push_cost: i32, [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 63 - push_cost: i32, [INFO] [stdout] 63 + solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `target_seconds` [INFO] [stdout] --> src/solution/s2162_minimum_cost_to_set_cooking_time.rs:64:9 [INFO] [stdout] | [INFO] [stdout] 64 | target_seconds: i32, [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 64 | _target_seconds: i32, [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 64 - target_seconds: i32, [INFO] [stdout] 64 + solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32, [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2163_minimum_difference_in_sums_after_removal_of_elements.rs:53:31 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn minimum_difference(nums: Vec) -> i64 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num` [INFO] [stdout] --> src/solution/s2165_smallest_value_of_the_rearranged_number.rs:36:28 [INFO] [stdout] | [INFO] [stdout] 36 | pub fn smallest_number(num: i64) -> i64 { [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 36 | pub fn smallest_number(_num: i64) -> i64 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 36 - pub fn smallest_number(num: i64) -> i64 { [INFO] [stdout] 36 + pub fn smallest_number(solution::s1808_maximize_number_of_nice_divisors::MOD: i64) -> i64 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `s` [INFO] [stdout] --> src/solution/s2167_minimum_time_to_remove_all_cars_containing_illegal_goods.rs:62:25 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn minimum_time(s: String) -> i32 { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_s` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2170_minimum_operations_to_make_the_array_alternating.rs:46:31 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn minimum_operations(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `beans` [INFO] [stdout] --> src/solution/s2171_removing_minimum_number_of_magic_beans.rs:51:28 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn minimum_removal(beans: Vec) -> i64 { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_beans` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `nums` [INFO] [stdout] --> src/solution/s2172_maximum_and_sum_of_array.rs:43:28 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn maximum_and_sum(nums: Vec, num_slots: i32) -> i32 { [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_nums` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num_slots` [INFO] [stdout] --> src/solution/s2172_maximum_and_sum_of_array.rs:43:44 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn maximum_and_sum(nums: Vec, num_slots: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] help: if this is intentional, prefix it with an underscore [INFO] [stdout] | [INFO] [stdout] 43 | pub fn maximum_and_sum(nums: Vec, _num_slots: i32) -> i32 { [INFO] [stdout] | + [INFO] [stdout] help: you might have meant to pattern match on the similarly named constant `MOD` [INFO] [stdout] | [INFO] [stdout] 43 - pub fn maximum_and_sum(nums: Vec, num_slots: i32) -> i32 { [INFO] [stdout] 43 + pub fn maximum_and_sum(nums: Vec, solution::s1759_count_number_of_homogenous_substrings::Solution::count_homogenous::MOD: i32) -> i32 { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0001_two_sum.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `two_sum` is never used [INFO] [stdout] --> src/solution/s0001_two_sum.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn two_sum(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0002_add_two_numbers.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_two_numbers` is never used [INFO] [stdout] --> src/solution/s0002_add_two_numbers.rs:65:12 [INFO] [stdout] | [INFO] [stdout] 64 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 65 | pub fn add_two_numbers( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0003_longest_substring_without_repeating_characters.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_longest_substring` is never used [INFO] [stdout] --> src/solution/s0003_longest_substring_without_repeating_characters.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 45 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 46 | pub fn length_of_longest_substring(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0004_median_of_two_sorted_arrays.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_median_sorted_arrays` is never used [INFO] [stdout] --> src/solution/s0004_median_of_two_sorted_arrays.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 52 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 53 | pub fn find_median_sorted_arrays(nums1: Vec, nums2: Vec) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0005_longest_palindromic_substring.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `longest_palindrome` and `is_palindrome` are never used [INFO] [stdout] --> src/solution/s0005_longest_palindromic_substring.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 42 | pub fn longest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 62 | fn is_palindrome(s: &Vec, begin: usize, end: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0006_zigzag_conversion.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `convert` is never used [INFO] [stdout] --> src/solution/s0006_zigzag_conversion.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 51 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 52 | pub fn convert(s: String, num_rows: i32) -> String { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0007_reverse_integer.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `reverse` and `reverse_v2` are never used [INFO] [stdout] --> src/solution/s0007_reverse_integer.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 33 | pub fn reverse(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | pub fn reverse_v2(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0008_string_to_integer_atoi.rs:97:12 [INFO] [stdout] | [INFO] [stdout] 97 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `my_atoi` and `my_atoi_v2` are never used [INFO] [stdout] --> src/solution/s0008_string_to_integer_atoi.rs:105:12 [INFO] [stdout] | [INFO] [stdout] 104 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 105 | pub fn my_atoi(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 137 | pub fn my_atoi_v2(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0009_palindrome_number.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_palindrome` is never used [INFO] [stdout] --> src/solution/s0009_palindrome_number.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 44 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 45 | pub fn is_palindrome(x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 50 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `CharMatcher` is never used [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:60:6 [INFO] [stdout] | [INFO] [stdout] 60 | enum CharMatcher { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `does_match` is never used [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:66:12 [INFO] [stdout] | [INFO] [stdout] 65 | impl CharMatcher { [INFO] [stdout] | ---------------- method in this implementation [INFO] [stdout] 66 | pub fn does_match(&self, ch: char) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `Pattern` is never used [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:75:6 [INFO] [stdout] | [INFO] [stdout] 75 | enum Pattern { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `can_match_zero_chars` is never used [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:81:12 [INFO] [stdout] | [INFO] [stdout] 80 | impl Pattern { [INFO] [stdout] | ------------ method in this implementation [INFO] [stdout] 81 | pub fn can_match_zero_chars(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `parse_pattern` is never used [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:89:4 [INFO] [stdout] | [INFO] [stdout] 89 | fn parse_pattern(p: &str) -> Result, &'static str> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_match`, `is_match_v2`, and `is_match_slice` are never used [INFO] [stdout] --> src/solution/s0010_regular_expression_matching.rs:149:12 [INFO] [stdout] | [INFO] [stdout] 148 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 149 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 154 | pub fn is_match_v2(s: String, p: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 158 | fn is_match_slice(s: &[u8], p: &[u8]) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0011_container_with_most_water.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_area` is never used [INFO] [stdout] --> src/solution/s0011_container_with_most_water.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn max_area(height: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0012_integer_to_roman.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `int_to_roman`, `int_to_roman_v2`, and `int_to_roman_v3` are never used [INFO] [stdout] --> src/solution/s0012_integer_to_roman.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 63 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 64 | pub fn int_to_roman(num: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 113 | pub fn int_to_roman_v2(num: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 131 | pub fn int_to_roman_v3(num: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0013_roman_to_integer.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 58 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `roman_to_int` is never used [INFO] [stdout] --> src/solution/s0013_roman_to_integer.rs:67:12 [INFO] [stdout] | [INFO] [stdout] 66 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 67 | pub fn roman_to_int(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0014_longest_common_prefix.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `longest_common_prefix`, `longest_common_prefix_v2`, and `longest_common_prefix_v3` are never used [INFO] [stdout] --> src/solution/s0014_longest_common_prefix.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 34 | pub fn longest_common_prefix(strs: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | pub fn longest_common_prefix_v2(strs: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | pub fn longest_common_prefix_v3(strs: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0015_3sum.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `three_sum` is never used [INFO] [stdout] --> src/solution/s0015_3sum.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn three_sum(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0016_3sum_closest.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `three_sum_closest` is never used [INFO] [stdout] --> src/solution/s0016_3sum_closest.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn three_sum_closest(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0017_letter_combinations_of_a_phone_number.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `DIGIT_TO_CHAR` and `letter_combinations` are never used [INFO] [stdout] --> src/solution/s0017_letter_combinations_of_a_phone_number.rs:38:11 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 38 | const DIGIT_TO_CHAR: [&'static str; 10] = [ [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn letter_combinations(digits: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0018_4sum.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `four_sum` and `four_sum_v2` are never used [INFO] [stdout] --> src/solution/s0018_4sum.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 30 | // Brute force may be AC, O(n^4), about 100ms [INFO] [stdout] 31 | pub fn four_sum(nums: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | pub fn four_sum_v2(nums: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0019_remove_nth_node_from_end_of_list.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_nth_from_end` is never used [INFO] [stdout] --> src/solution/s0019_remove_nth_node_from_end_of_list.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | pub fn remove_nth_from_end(head: Option>, n: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0020_valid_parentheses.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid` is never used [INFO] [stdout] --> src/solution/s0020_valid_parentheses.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 50 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 51 | pub fn is_valid(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0021_merge_two_sorted_lists.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `merge_two_lists`, `merge_two_lists_v2`, and `merge_two_lists_recursive` are never used [INFO] [stdout] --> src/solution/s0021_merge_two_sorted_lists.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 54 | pub fn merge_two_lists( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 93 | pub fn merge_two_lists_v2( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 100 | fn merge_two_lists_recursive( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0022_generate_parentheses.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 18 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `generate_parenthesis`, `generate_parenthesis_recursive`, and `generate_parenthesis_v2` are never used [INFO] [stdout] --> src/solution/s0022_generate_parentheses.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 25 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 26 | pub fn generate_parenthesis(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | fn generate_parenthesis_recursive(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | pub fn generate_parenthesis_v2(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0023_merge_k_sorted_lists.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge_k_lists` is never used [INFO] [stdout] --> src/solution/s0023_merge_k_sorted_lists.rs:82:12 [INFO] [stdout] | [INFO] [stdout] 80 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 81 | // Credit: https://leetcode.com/problems/merge-k-sorted-lists/discuss/221538/rust-4ms-no-clone [INFO] [stdout] 82 | pub fn merge_k_lists(lists: Vec>>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0024_swap_nodes_in_pairs.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `swap_pairs`, `swap_pairs_recursive`, and `swap_pairs_v2` are never used [INFO] [stdout] --> src/solution/s0024_swap_nodes_in_pairs.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 54 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 55 | // Recursiver verion [INFO] [stdout] 56 | pub fn swap_pairs(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn swap_pairs_recursive(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | pub fn swap_pairs_v2(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `reverse_k_group` and `reverse` are never used [INFO] [stdout] --> src/solution/s0025_reverse_nodes_in_k_group.rs:67:12 [INFO] [stdout] | [INFO] [stdout] 65 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 66 | // Credit: https://leetcode.com/problems/reverse-nodes-in-k-group/discuss/222209/Rust-4-ms [INFO] [stdout] 67 | pub fn reverse_k_group(head: Option>, k: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 96 | fn reverse(head: Option>, tail: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0026_remove_duplicates_from_sorted_array.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_duplicates` is never used [INFO] [stdout] --> src/solution/s0026_remove_duplicates_from_sorted_array.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0027_remove_element.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `remove_element` and `remove_element_v2` are never used [INFO] [stdout] --> src/solution/s0027_remove_element.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 49 | pub fn remove_element(nums: &mut Vec, val: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | pub fn remove_element_v2(nums: &mut Vec, val: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0028_implement_strstr.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `str_str` is never used [INFO] [stdout] --> src/solution/s0028_implement_strstr.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | pub fn str_str(haystack: String, needle: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0029_divide_two_integers.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `divide` is never used [INFO] [stdout] --> src/solution/s0029_divide_two_integers.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 49 | pub fn divide(dividend: i32, divisor: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_substring` is never used [INFO] [stdout] --> src/solution/s0030_substring_with_concatenation_of_all_words.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | // Credit: https://leetcode.com/problems/substring-with-concatenation-of-all-words/discuss/798407/Rust-Functional-programming-solution [INFO] [stdout] 44 | pub fn find_substring(s: String, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0031_next_permutation.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `next_permutation` and `next_permutation_v2` are never used [INFO] [stdout] --> src/solution/s0031_next_permutation.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 35 | pub fn next_permutation(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 48 | pub fn next_permutation_v2(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0032_longest_valid_parentheses.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_valid_parentheses` is never used [INFO] [stdout] --> src/solution/s0032_longest_valid_parentheses.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn longest_valid_parentheses(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0033_search_in_rotated_sorted_array.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search` is never used [INFO] [stdout] --> src/solution/s0033_search_in_rotated_sorted_array.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | // Credit: https://leetcode.com/problems/search-... [INFO] [stdout] 36 | pub fn search(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search_range` is never used [INFO] [stdout] --> src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn search_range(nums: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0035_search_insert_position.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search_insert` is never used [INFO] [stdout] --> src/solution/s0035_search_insert_position.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn search_insert(nums: Vec, target: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid_sudoku` is never used [INFO] [stdout] --> src/solution/s0036_valid_sudoku.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 60 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 61 | pub fn is_valid_sudoku(board: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0037_sudoku_solver.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `solve_sudoku`, `solve_backtrack`, and `is_grid_valid` are never used [INFO] [stdout] --> src/solution/s0037_sudoku_solver.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 37 | // Credit: https://leetcode.com/problems/sudoku-solver/discuss/300781/Not-so-fast-but-easy-to-understand-Rust-solution [INFO] [stdout] 38 | pub fn solve_sudoku(board: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | fn solve_backtrack(grid: &mut [&mut [char]], cell: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn is_grid_valid(grid: &mut [&mut [char]], y: usize, x: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0038_count_and_say.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_and_say` is never used [INFO] [stdout] --> src/solution/s0038_count_and_say.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn count_and_say(n: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0039_combination_sum.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `combination_sum` and `dfs` are never used [INFO] [stdout] --> src/solution/s0039_combination_sum.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 54 | pub fn combination_sum(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | fn dfs( [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0040_combination_sum_ii.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `combination_sum2` and `dfs` are never used [INFO] [stdout] --> src/solution/s0040_combination_sum_ii.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 44 | pub fn combination_sum2(candidates: Vec, target: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 53 | fn dfs( [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0041_first_missing_positive.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `first_missing_positive` and `first_missing_positive_v2` are never used [INFO] [stdout] --> src/solution/s0041_first_missing_positive.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 33 | pub fn first_missing_positive(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 47 | pub fn first_missing_positive_v2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0042_trapping_rain_water.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `trap` is never used [INFO] [stdout] --> src/solution/s0042_trapping_rain_water.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn trap(height: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `multiply` is never used [INFO] [stdout] --> src/solution/s0043_multiply_strings.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 28 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 29 | pub fn multiply(num1: String, num2: String) -> String { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0044_wildcard_matching.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_match` is never used [INFO] [stdout] --> src/solution/s0044_wildcard_matching.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | // Credit: https://leetcode.com/problems/wildcard-matching/discuss/442999/rust-solution-DP-O(n)-space [INFO] [stdout] 57 | pub fn is_match(s: String, p: String) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0045_jump_game_ii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `jump` is never used [INFO] [stdout] --> src/solution/s0045_jump_game_ii.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn jump(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0046_permutations.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `permute` is never used [INFO] [stdout] --> src/solution/s0046_permutations.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | // Credit: https://leetcode.com/problems/permutations/discuss/505394/Rust-0ms.-Iterators-madness [INFO] [stdout] 32 | pub fn permute(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0047_permutations_ii.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `permute_unique` is never used [INFO] [stdout] --> src/solution/s0047_permutations_ii.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | // Credit: https://leetcode.com/problems/permutations-ii/discuss/714100/Rust-Backtracking [INFO] [stdout] 35 | pub fn permute_unique(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0048_rotate_image.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `rotate` is never used [INFO] [stdout] --> src/solution/s0048_rotate_image.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn rotate(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0049_group_anagrams.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `group_anagrams` is never used [INFO] [stdout] --> src/solution/s0049_group_anagrams.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn group_anagrams(strs: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0050_powx_n.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `my_pow` is never used [INFO] [stdout] --> src/solution/s0050_powx_n.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn my_pow(x: f64, n: i32) -> f64 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0051_n_queens.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `solve_n_queens` is never used [INFO] [stdout] --> src/solution/s0051_n_queens.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | // Credit: https://leetcode.com/problems/n-queens/discuss/774044/Backtracking-in-Rust-100-in-both-speed-and-memory-usage [INFO] [stdout] 34 | pub fn solve_n_queens(n: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0052_n_queens_ii.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `QueenPositions` is never used [INFO] [stdout] --> src/solution/s0052_n_queens_ii.rs:30:6 [INFO] [stdout] | [INFO] [stdout] 30 | type QueenPositions = Vec>; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `total_n_queens`, `count_queen_configs`, and `is_invalid_pos` are never used [INFO] [stdout] --> src/solution/s0052_n_queens_ii.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 33 | // Credit: https://leetcode.com/problems/n-queens-ii/discuss/668640/Rust-backtracking-solution-with-O(n)-memory-and-0ms-runtime. [INFO] [stdout] 34 | pub fn total_n_queens(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | fn count_queen_configs(queens: &mut QueenPositions, row: usize) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn is_invalid_pos(queens: &QueenPositions, row: i16, col: i16) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0053_maximum_subarray.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sub_array` is never used [INFO] [stdout] --> src/solution/s0053_maximum_subarray.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 49 | pub fn max_sub_array(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0054_spiral_matrix.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `spiral_order` is never used [INFO] [stdout] --> src/solution/s0054_spiral_matrix.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn spiral_order(matrix: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0055_jump_game.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_jump` is never used [INFO] [stdout] --> src/solution/s0055_jump_game.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn can_jump(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0056_merge_intervals.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge` is never used [INFO] [stdout] --> src/solution/s0056_merge_intervals.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | pub fn merge(intervals: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0057_insert_interval.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `insert` is never used [INFO] [stdout] --> src/solution/s0057_insert_interval.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 50 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 51 | // Credit: https://leetcode.com/problems/insert-interval/discuss/844818/Rust-solution [INFO] [stdout] 52 | pub fn insert(intervals: Vec>, new_interval: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0058_length_of_last_word.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `length_of_last_word` is never used [INFO] [stdout] --> src/solution/s0058_length_of_last_word.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | 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/solution/s0059_spiral_matrix_ii.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `generate_matrix` is never used [INFO] [stdout] --> src/solution/s0059_spiral_matrix_ii.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 30 | pub fn generate_matrix(n: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0060_permutation_sequence.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_permutation` is never used [INFO] [stdout] --> src/solution/s0060_permutation_sequence.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | // Credit: https://leetcode.com/problems/permut... [INFO] [stdout] 41 | pub fn get_permutation(n: i32, k: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `rotate_right` is never used [INFO] [stdout] --> src/solution/s0061_rotate_list.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 49 | pub fn rotate_right(head: Option>, k: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0062_unique_paths.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `unique_paths` is never used [INFO] [stdout] --> src/solution/s0062_unique_paths.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 47 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 48 | pub fn unique_paths(m: i32, n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0063_unique_paths_ii.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `unique_paths_with_obstacles` is never used [INFO] [stdout] --> src/solution/s0063_unique_paths_ii.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn unique_paths_with_obstacles(obstacle_grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0064_minimum_path_sum.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_path_sum` is never used [INFO] [stdout] --> src/solution/s0064_minimum_path_sum.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn min_path_sum(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0065_valid_number.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_number` is never used [INFO] [stdout] --> src/solution/s0065_valid_number.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 62 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 63 | pub fn is_number(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0066_plus_one.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `plus_one` is never used [INFO] [stdout] --> src/solution/s0066_plus_one.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn plus_one(digits: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0067_add_binary.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `add_binary` is never used [INFO] [stdout] --> src/solution/s0067_add_binary.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn add_binary(a: String, b: String) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0068_text_justification.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 57 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `full_justify` is never used [INFO] [stdout] --> src/solution/s0068_text_justification.rs:65:12 [INFO] [stdout] | [INFO] [stdout] 64 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 65 | pub fn full_justify(words: Vec, max_width: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0069_sqrtx.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `my_sqrt` is never used [INFO] [stdout] --> src/solution/s0069_sqrtx.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn my_sqrt(x: i32) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0070_climbing_stairs.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `climb_stairs` is never used [INFO] [stdout] --> src/solution/s0070_climbing_stairs.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn climb_stairs(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0071_simplify_path.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 46 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `simplify_path` is never used [INFO] [stdout] --> src/solution/s0071_simplify_path.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 54 | pub fn simplify_path(path: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0072_edit_distance.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `min_distance` and `min_distance_v2` are never used [INFO] [stdout] --> src/solution/s0072_edit_distance.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 47 | pub fn min_distance(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | pub fn min_distance_v2(word1: String, word2: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0073_set_matrix_zeroes.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `M`, `N`, and `set_zeroes` are never used [INFO] [stdout] --> src/solution/s0073_set_matrix_zeroes.rs:39:11 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 39 | const M: usize = 200; [INFO] [stdout] | ^ [INFO] [stdout] 40 | const N: usize = 200; [INFO] [stdout] | ^ [INFO] [stdout] 41 | pub fn set_zeroes(matrix: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0074_search_a_2d_matrix.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search_matrix` is never used [INFO] [stdout] --> src/solution/s0074_search_a_2d_matrix.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | pub fn search_matrix(matrix: Vec>, target: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0075_sort_colors.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `RED`, `WHITE`, `BLUE`, and `sort_colors` are never used [INFO] [stdout] --> src/solution/s0075_sort_colors.rs:41:11 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 41 | const RED: i32 = 0; [INFO] [stdout] | ^^^ [INFO] [stdout] 42 | const WHITE: i32 = 1; [INFO] [stdout] | ^^^^^ [INFO] [stdout] 43 | const BLUE: i32 = 2; [INFO] [stdout] | ^^^^ [INFO] [stdout] 44 | [INFO] [stdout] 45 | pub fn sort_colors(nums: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_window` is never used [INFO] [stdout] --> src/solution/s0076_minimum_window_substring.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | // Credit: https://leetcode.com/problems/minimum-window-substring/discuss/549313/Rust-solution-for-reference [INFO] [stdout] 32 | pub fn min_window(s: String, t: String) -> String { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0077_combinations.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `combine` is never used [INFO] [stdout] --> src/solution/s0077_combinations.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn combine(n: i32, k: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0078_subsets.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `subsets` is never used [INFO] [stdout] --> src/solution/s0078_subsets.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn subsets(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0079_word_search.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `exist` is never used [INFO] [stdout] --> src/solution/s0079_word_search.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | pub fn exist(board: Vec>, word: String) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_duplicates` is never used [INFO] [stdout] --> src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 47 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 48 | pub fn remove_duplicates(nums: &mut Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search` is never used [INFO] [stdout] --> src/solution/s0081_search_in_rotated_sorted_array_ii.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn search(nums: Vec, target: i32) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `delete_duplicates` is never used [INFO] [stdout] --> src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 49 | // Credit: https://leetcode.com/problems/remove-duplicates-from-sorted-list-i... [INFO] [stdout] 50 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `delete_duplicates` is never used [INFO] [stdout] --> src/solution/s0083_remove_duplicates_from_sorted_list.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 49 | pub fn delete_duplicates(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0084_largest_rectangle_in_histogram.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `largest_rectangle_area` is never used [INFO] [stdout] --> src/solution/s0084_largest_rectangle_in_histogram.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn largest_rectangle_area(heights: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0085_maximal_rectangle.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `merge` and `maximal_rectangle` are never used [INFO] [stdout] --> src/solution/s0085_maximal_rectangle.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 49 | fn merge(row1: &mut Vec, row2: &Vec, n: usize) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | pub fn maximal_rectangle(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0086_partition_list.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `partition` is never used [INFO] [stdout] --> src/solution/s0086_partition_list.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 50 | pub fn partition(head: Option>, x: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0087_scramble_string.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_scramble` is never used [INFO] [stdout] --> src/solution/s0087_scramble_string.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn is_scramble(s1: String, s2: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0088_merge_sorted_array.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `merge` is never used [INFO] [stdout] --> src/solution/s0088_merge_sorted_array.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn merge(nums1: &mut Vec, m: i32, nums2: &mut Vec, n: i32) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0089_gray_code.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `gray_code` and `gray_code_v2` are never used [INFO] [stdout] --> src/solution/s0089_gray_code.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 42 | pub fn gray_code(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | pub fn gray_code_v2(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0090_subsets_ii.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `subsets_with_dup` is never used [INFO] [stdout] --> src/solution/s0090_subsets_ii.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn subsets_with_dup(nums: Vec) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0091_decode_ways.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_decodings` and `num_decodings_v2` are never used [INFO] [stdout] --> src/solution/s0091_decode_ways.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 60 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 61 | pub fn num_decodings(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 90 | pub fn num_decodings_v2(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `reverse_between`, `reverse`, and `append` are never used [INFO] [stdout] --> src/solution/s0092_reverse_linked_list_ii.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 51 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 52 | // Credit: https://leetcode.com/problems/reverse-linked-list-ii/discuss/808421/Rust-solution-no-stack-0ms. [INFO] [stdout] 53 | pub fn reverse_between( [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn reverse( [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 98 | fn append( [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0093_restore_ip_addresses.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `restore_ip_addresses` and `helper` are never used [INFO] [stdout] --> src/solution/s0093_restore_ip_addresses.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 37 | // Credit: https://leetcode.com/problems/restore-ip-addresses/discuss/1119335/Rust-cheapest-and-best [INFO] [stdout] 38 | pub fn restore_ip_addresses(s: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn helper(digits: &[u32], k: usize) -> Vec> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0094_binary_tree_inorder_traversal.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `inorder_traversal`, `inorder_traversal_v2`, and `helper` are never used [INFO] [stdout] --> src/solution/s0094_binary_tree_inorder_traversal.rs:72:12 [INFO] [stdout] | [INFO] [stdout] 71 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 72 | pub fn inorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 94 | pub fn inorder_traversal_v2(mut root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 100 | fn helper(r: &mut Option>>, order: &mut Vec) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `generate_trees` and `helper` are never used [INFO] [stdout] --> src/solution/s0095_unique_binary_search_trees_ii.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 50 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 51 | pub fn generate_trees(n: i32) -> Vec>>> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn helper(l: i32, r: i32) -> Vec>>> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0096_unique_binary_search_trees.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_trees` is never used [INFO] [stdout] --> src/solution/s0096_unique_binary_search_trees.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 30 | pub fn num_trees(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0097_interleaving_string.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_interleave` is never used [INFO] [stdout] --> src/solution/s0097_interleaving_string.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 47 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 48 | pub fn is_interleave(s1: String, s2: String, s3: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0098_validate_binary_search_tree.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_valid_bst` is never used [INFO] [stdout] --> src/solution/s0098_validate_binary_search_tree.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 58 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 59 | pub fn is_valid_bst(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0099_recover_binary_search_tree.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `recover_tree` is never used [INFO] [stdout] --> src/solution/s0099_recover_binary_search_tree.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 54 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 55 | // Credit: https://leetcode.com/problems/recover-binary-search-tree/discuss/448826/Rust-Inorder-Solution [INFO] [stdout] 56 | pub fn recover_tree(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0100_same_tree.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_same_tree` is never used [INFO] [stdout] --> src/solution/s0100_same_tree.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 57 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 58 | pub fn is_same_tree( [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0101_symmetric_tree.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_symmetric` is never used [INFO] [stdout] --> src/solution/s0101_symmetric_tree.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 54 | pub fn is_symmetric(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0102_binary_tree_level_order_traversal.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `level_order` is never used [INFO] [stdout] --> src/solution/s0102_binary_tree_level_order_traversal.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0103_binary_tree_zigzag_level_order_traversal.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `zigzag_level_order` is never used [INFO] [stdout] --> src/solution/s0103_binary_tree_zigzag_level_order_traversal.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn zigzag_level_order(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0104_maximum_depth_of_binary_tree.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_depth` is never used [INFO] [stdout] --> src/solution/s0104_maximum_depth_of_binary_tree.rs:74:12 [INFO] [stdout] | [INFO] [stdout] 73 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 74 | pub fn max_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `build_tree` is never used [INFO] [stdout] --> src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn build_tree(preorder: Vec, inorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `build_tree` is never used [INFO] [stdout] --> src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn build_tree(inorder: Vec, postorder: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0107_binary_tree_level_order_traversal_ii.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `level_order_bottom` is never used [INFO] [stdout] --> src/solution/s0107_binary_tree_level_order_traversal_ii.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn level_order_bottom(root: Option>>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sorted_array_to_bst` is never used [INFO] [stdout] --> src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn sorted_array_to_bst(nums: Vec) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `sorted_list_to_bst` and `helper` are never used [INFO] [stdout] --> src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:82:12 [INFO] [stdout] | [INFO] [stdout] 80 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 81 | // Credit: https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/discuss/448982/Rust-O(logN)-Space-and-O(N)-Time [INFO] [stdout] 82 | pub fn sorted_list_to_bst(head: Option>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 93 | fn helper(ptr: &mut &Option>, len: usize) -> Option>> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0110_balanced_binary_tree.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_balanced` is never used [INFO] [stdout] --> src/solution/s0110_balanced_binary_tree.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 60 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 61 | pub fn is_balanced(root: Option>>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0111_minimum_depth_of_binary_tree.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_depth` is never used [INFO] [stdout] --> src/solution/s0111_minimum_depth_of_binary_tree.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 54 | pub fn min_depth(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0112_path_sum.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `has_path_sum` is never used [INFO] [stdout] --> src/solution/s0112_path_sum.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 58 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 59 | pub fn has_path_sum(root: Option>>, target_sum: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0113_path_sum_ii.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `path_sum` is never used [INFO] [stdout] --> src/solution/s0113_path_sum_ii.rs:59:12 [INFO] [stdout] | [INFO] [stdout] 58 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 59 | pub fn path_sum(root: Option>>, target_sum: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0114_flatten_binary_tree_to_linked_list.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `flatten` is never used [INFO] [stdout] --> src/solution/s0114_flatten_binary_tree_to_linked_list.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 62 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 63 | pub fn flatten(root: &mut Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0115_distinct_subsequences.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `num_distinct` and `num_distinct_v2` are never used [INFO] [stdout] --> src/solution/s0115_distinct_subsequences.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 44 | // Credit: https://leetcode.com/problems/distinct-subsequences/discuss/1041833/Rust-naive-recursion-with-memorization [INFO] [stdout] 45 | pub fn num_distinct(s: String, t: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | pub fn num_distinct_v2(s: String, t: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0118_pascals_triangle.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `generate` is never used [INFO] [stdout] --> src/solution/s0118_pascals_triangle.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn generate(num_rows: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0119_pascals_triangle_ii.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_row` is never used [INFO] [stdout] --> src/solution/s0119_pascals_triangle_ii.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | pub fn get_row(row_index: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0120_triangle.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `minimum_total` is never used [INFO] [stdout] --> src/solution/s0120_triangle.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn minimum_total(triangle: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0121_best_time_to_buy_and_sell_stock.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/solution/s0121_best_time_to_buy_and_sell_stock.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0122_best_time_to_buy_and_sell_stock_ii.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/solution/s0122_best_time_to_buy_and_sell_stock_ii.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 43 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | pub fn max_profit(prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0124_binary_tree_maximum_path_sum.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_path_sum` is never used [INFO] [stdout] --> src/solution/s0124_binary_tree_maximum_path_sum.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | pub fn max_path_sum(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0125_valid_palindrome.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_palindrome` is never used [INFO] [stdout] --> src/solution/s0125_valid_palindrome.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn is_palindrome(s: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0126_word_ladder_ii.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_ladders` and `recursive_result` are never used [INFO] [stdout] --> src/solution/s0126_word_ladder_ii.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 45 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 46 | // Credit: https://leetcode.com/problems/word-ladder-ii/discuss/803444/Rust-8ms-solution-double-ended-BFS-%2B-DFS [INFO] [stdout] 47 | pub fn find_ladders( [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 136 | fn recursive_result( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0127_word_ladder.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `ladder_length` is never used [INFO] [stdout] --> src/solution/s0127_word_ladder.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 44 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 45 | pub fn ladder_length(begin_word: String, end_word: String, word_list: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0128_longest_consecutive_sequence.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `longest_consecutive` is never used [INFO] [stdout] --> src/solution/s0128_longest_consecutive_sequence.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | pub fn longest_consecutive(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0129_sum_root_to_leaf_numbers.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sum_numbers` is never used [INFO] [stdout] --> src/solution/s0129_sum_root_to_leaf_numbers.rs:68:12 [INFO] [stdout] | [INFO] [stdout] 67 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 68 | pub fn sum_numbers(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0130_surrounded_regions.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `solve` and `helper` are never used [INFO] [stdout] --> src/solution/s0130_surrounded_regions.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 35 | pub fn solve(board: &mut Vec>) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | fn helper(board: &mut Vec>, i: usize, j: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0131_palindrome_partitioning.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `partition`, `helper`, and `is_palindrome` are never used [INFO] [stdout] --> src/solution/s0131_palindrome_partitioning.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 28 | // Credit: https://leetcode.com/problems/palindrome-partitioning/discuss/932976/rust-DFS-simple-solution [INFO] [stdout] 29 | pub fn partition(s: String) -> Vec> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn helper(s: &Vec, cans: &mut Vec, res: &mut Vec>, idx: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | fn is_palindrome(s: &Vec, start: usize, end: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0132_palindrome_partitioning_ii.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_cut` is never used [INFO] [stdout] --> src/solution/s0132_palindrome_partitioning_ii.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn min_cut(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0134_gas_station.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_complete_circuit` is never used [INFO] [stdout] --> src/solution/s0134_gas_station.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 50 | pub fn can_complete_circuit(gas: Vec, cost: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0135_candy.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `candy` and `candy_v2` are never used [INFO] [stdout] --> src/solution/s0135_candy.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 41 | pub fn candy(ratings: Vec) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | pub fn candy_v2(ratings: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0136_single_number.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `single_number` is never used [INFO] [stdout] --> src/solution/s0136_single_number.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0137_single_number_ii.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 21 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `single_number` and `single_number_v2` are never used [INFO] [stdout] --> src/solution/s0137_single_number_ii.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 28 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 29 | pub fn single_number(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn single_number_v2(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0139_word_break.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `word_break` is never used [INFO] [stdout] --> src/solution/s0139_word_break.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn word_break(s: String, word_dict: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0140_word_break_ii.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `word_break` is never used [INFO] [stdout] --> src/solution/s0140_word_break_ii.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 41 | // Credit: https://leetcode.com/problems/word-break-ii/discuss/1120649/Naive-Rust-recursion-(but-works-%3A) [INFO] [stdout] 42 | pub fn word_break(s: String, word_dict: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `reorder_list`, `length`, `reverse`, and `merge` are never used [INFO] [stdout] --> src/solution/s0143_reorder_list.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 56 | // Credit: https://leetcode.com/problems/reorder-list/discuss/803111/Rust-4ms [INFO] [stdout] 57 | pub fn reorder_list(head: &mut Option>) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn length(mut head: &Option>) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | fn reverse( [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 100 | fn merge( [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0144_binary_tree_preorder_traversal.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `preorder_traversal` is never used [INFO] [stdout] --> src/solution/s0144_binary_tree_preorder_traversal.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 69 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 70 | pub fn preorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0145_binary_tree_postorder_traversal.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `postorder_traversal` is never used [INFO] [stdout] --> src/solution/s0145_binary_tree_postorder_traversal.rs:69:12 [INFO] [stdout] | [INFO] [stdout] 68 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 69 | pub fn postorder_traversal(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `LRUCache` is never constructed [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | struct LRUCache { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `get`, and `put` are never used [INFO] [stdout] --> src/solution/s0146_lru_cache.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 60 | impl LRUCache { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 61 | fn new(capacity: i32) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn get(&mut self, key: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 81 | fn put(&mut self, key: i32, value: i32) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `insertion_sort_list` is never used [INFO] [stdout] --> src/solution/s0147_insertion_sort_list.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | pub fn insertion_sort_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0148_sort_list.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `sort_list` is never used [INFO] [stdout] --> src/solution/s0148_sort_list.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 54 | // Credit: https://leetcode.com/problems/sort-list/discuss/477190/Rus... [INFO] [stdout] 55 | pub fn sort_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0149_max_points_on_a_line.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `max_points` and `gcd` are never used [INFO] [stdout] --> src/solution/s0149_max_points_on_a_line.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] ... [INFO] [stdout] 35 | pub fn max_points(points: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 124 | fn gcd(u: i32, v: i32) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0150_evaluate_reverse_polish_notation.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 40 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `eval_rpn` and `eval_rpn_v2` are never used [INFO] [stdout] --> src/solution/s0150_evaluate_reverse_polish_notation.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 47 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 48 | pub fn eval_rpn(tokens: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 87 | pub fn eval_rpn_v2(tokens: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0151_reverse_words_in_a_string.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse_words` is never used [INFO] [stdout] --> src/solution/s0151_reverse_words_in_a_string.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 54 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 55 | pub fn reverse_words(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0152_maximum_product_subarray.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_product` is never used [INFO] [stdout] --> src/solution/s0152_maximum_product_subarray.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | pub fn max_product(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0153_find_minimum_in_rotated_sorted_array.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_min` is never used [INFO] [stdout] --> src/solution/s0153_find_minimum_in_rotated_sorted_array.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 48 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 49 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_min` is never used [INFO] [stdout] --> src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn find_min(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0155_min_stack.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MinStack` is never constructed [INFO] [stdout] --> src/solution/s0155_min_stack.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct MinStack { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used [INFO] [stdout] --> src/solution/s0155_min_stack.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 55 | impl MinStack { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 56 | /** initialize your data structure here. */ [INFO] [stdout] 57 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | fn pop(&mut self) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | fn get_min(&mut self) -> i32 { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0162_find_peak_element.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_peak_element` is never used [INFO] [stdout] --> src/solution/s0162_find_peak_element.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn find_peak_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0164_maximum_gap.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximum_gap` is never used [INFO] [stdout] --> src/solution/s0164_maximum_gap.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 33 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 34 | // Credit: https://leetcode.com/problems/maximum-gap/discuss/756567/Rust-translated [INFO] [stdout] 35 | pub fn maximum_gap(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0165_compare_version_numbers.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `compare_version` is never used [INFO] [stdout] --> src/solution/s0165_compare_version_numbers.rs:61:12 [INFO] [stdout] | [INFO] [stdout] 60 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 61 | 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/solution/s0166_fraction_to_recurring_decimal.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `fraction_to_decimal` is never used [INFO] [stdout] --> src/solution/s0166_fraction_to_recurring_decimal.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 39 | pub fn fraction_to_decimal(numerator: i32, denominator: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0167_two_sum_ii_input_array_is_sorted.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `two_sum` is never used [INFO] [stdout] --> src/solution/s0167_two_sum_ii_input_array_is_sorted.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn two_sum(numbers: Vec, target: i32) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0168_excel_sheet_column_title.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `convert_to_title` is never used [INFO] [stdout] --> src/solution/s0168_excel_sheet_column_title.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 50 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 51 | pub fn convert_to_title(column_number: i32) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0169_majority_element.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 23 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `majority_element` is never used [INFO] [stdout] --> src/solution/s0169_majority_element.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 30 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 31 | pub fn majority_element(nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0171_excel_sheet_column_number.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `title_to_number` is never used [INFO] [stdout] --> src/solution/s0171_excel_sheet_column_number.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 52 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 53 | pub fn title_to_number(column_title: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0172_factorial_trailing_zeroes.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `trailing_zeroes` is never used [INFO] [stdout] --> src/solution/s0172_factorial_trailing_zeroes.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn trailing_zeroes(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 45 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BSTIterator` is never constructed [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:75:8 [INFO] [stdout] | [INFO] [stdout] 75 | struct BSTIterator { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `go_left`, `new`, `next`, and `has_next` are never used [INFO] [stdout] --> src/solution/s0173_binary_search_tree_iterator.rs:84:8 [INFO] [stdout] | [INFO] [stdout] 83 | impl BSTIterator { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 84 | fn go_left(stack: &mut Vec>>, mut node: Option>>) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | fn new(root: Option>>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 97 | fn next(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 105 | fn has_next(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0174_dungeon_game.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `calculate_minimum_hp` is never used [INFO] [stdout] --> src/solution/s0174_dungeon_game.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 39 | // Credit: https://leetcode.com/problems/dungeon-game/discuss/698571/Rust-DP-bottom-up-0ms-explanation-by-example. [INFO] [stdout] 40 | pub fn calculate_minimum_hp(dungeon: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0179_largest_number.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `largest_number` is never used [INFO] [stdout] --> src/solution/s0179_largest_number.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn largest_number(nums: Vec) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0187_repeated_dna_sequences.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_repeated_dna_sequences` is never used [INFO] [stdout] --> src/solution/s0187_repeated_dna_sequences.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn find_repeated_dna_sequences(s: String) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0188_best_time_to_buy_and_sell_stock_iv.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_profit` is never used [INFO] [stdout] --> src/solution/s0188_best_time_to_buy_and_sell_stock_iv.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | // Credit: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/discuss/344517/Rust-0ms-2.5MB-dp [INFO] [stdout] 37 | pub fn max_profit(k: i32, prices: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0189_rotate_array.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `rotate` is never used [INFO] [stdout] --> src/solution/s0189_rotate_array.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 44 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 45 | pub fn rotate(nums: &mut Vec, k: i32) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0190_reverse_bits.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse_bits` is never used [INFO] [stdout] --> src/solution/s0190_reverse_bits.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 38 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 39 | pub fn reverse_bits(x: u32) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0191_number_of_1_bits.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `hamming_weight` is never used [INFO] [stdout] --> src/solution/s0191_number_of_1_bits.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 44 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 45 | pub fn hamming_weight(n: u32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0198_house_robber.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `rob` is never used [INFO] [stdout] --> src/solution/s0198_house_robber.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0199_binary_tree_right_side_view.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `right_side_view` is never used [INFO] [stdout] --> src/solution/s0199_binary_tree_right_side_view.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn right_side_view(root: Option>>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0200_number_of_islands.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `num_islands` is never used [INFO] [stdout] --> src/solution/s0200_number_of_islands.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 44 | pub fn num_islands(grid: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0201_bitwise_and_of_numbers_range.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `range_bitwise_and` is never used [INFO] [stdout] --> src/solution/s0201_bitwise_and_of_numbers_range.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn range_bitwise_and(left: i32, right: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0202_happy_number.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_happy` is never used [INFO] [stdout] --> src/solution/s0202_happy_number.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn is_happy(n: i32) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0203_remove_linked_list_elements.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `remove_elements` is never used [INFO] [stdout] --> src/solution/s0203_remove_linked_list_elements.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 53 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 54 | pub fn remove_elements(head: Option>, val: i32) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0204_count_primes.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_primes` is never used [INFO] [stdout] --> src/solution/s0204_count_primes.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 35 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 36 | pub fn count_primes(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0205_isomorphic_strings.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_isomorphic` is never used [INFO] [stdout] --> src/solution/s0205_isomorphic_strings.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | 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/solution/s0206_reverse_linked_list.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `reverse_list` is never used [INFO] [stdout] --> src/solution/s0206_reverse_linked_list.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 55 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 56 | pub fn reverse_list(head: Option>) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0207_course_schedule.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `can_finish` is never used [INFO] [stdout] --> src/solution/s0207_course_schedule.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 41 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 42 | pub fn can_finish(num_courses: i32, prerequisites: Vec>) -> bool { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `search`, and `starts_with` are never used [INFO] [stdout] --> src/solution/s0208_implement_trie_prefix_tree.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 54 | impl Trie { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 55 | /** Initialize your data structure here. */ [INFO] [stdout] 56 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn insert(&mut self, word: String) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn search(&self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 83 | fn starts_with(&self, prefix: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0209_minimum_size_subarray_sum.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `min_sub_array_len` is never used [INFO] [stdout] --> src/solution/s0209_minimum_size_subarray_sum.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 40 | pub fn min_sub_array_len(target: i32, nums: Vec) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0210_course_schedule_ii.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_order` is never used [INFO] [stdout] --> src/solution/s0210_course_schedule_ii.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 47 | pub fn find_order(num_courses: i32, prerequisites: Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 38 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `WordDictionary` is never constructed [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | struct WordDictionary { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_word`, `search`, and `search_trie` are never used [INFO] [stdout] --> src/solution/s0211_design_add_and_search_words_data_structure.rs:62:8 [INFO] [stdout] | [INFO] [stdout] 60 | impl WordDictionary { [INFO] [stdout] | ------------------- associated items in this implementation [INFO] [stdout] 61 | /** Initialize your data structure here. */ [INFO] [stdout] 62 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | fn add_word(&mut self, word: String) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | fn search(&self, word: String) -> bool { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn search_trie(trie: &Trie, word: &[u8]) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0212_word_search_ii.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Trie` is never constructed [INFO] [stdout] --> src/solution/s0212_word_search_ii.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | struct Trie { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `find_words` and `dfs_helper` are never used [INFO] [stdout] --> src/solution/s0212_word_search_ii.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 43 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 44 | // Credit: https://leetcode.com/problems/word-search-ii/discuss/712977/Rust-Trie-DFS-solution [INFO] [stdout] 45 | pub fn find_words(board: Vec>, words: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 64 | fn dfs_helper( [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0213_house_robber_ii.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `rob` and `helper` are never used [INFO] [stdout] --> src/solution/s0213_house_robber_ii.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 40 | pub fn rob(nums: Vec) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | fn helper(nums: &Vec, l: usize, r: usize) -> i32 { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0214_shortest_palindrome.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `shortest_palindrome` is never used [INFO] [stdout] --> src/solution/s0214_shortest_palindrome.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn shortest_palindrome(s: String) -> String { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0215_kth_largest_element_in_an_array.rs:20:12 [INFO] [stdout] | [INFO] [stdout] 20 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `find_kth_largest` is never used [INFO] [stdout] --> src/solution/s0215_kth_largest_element_in_an_array.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 27 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 28 | pub fn find_kth_largest(nums: Vec, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0216_combination_sum_iii.rs:56:12 [INFO] [stdout] | [INFO] [stdout] 56 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `combination_sum3` and `dfs_helper` are never used [INFO] [stdout] --> src/solution/s0216_combination_sum_iii.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 63 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 64 | pub fn combination_sum3(k: i32, n: i32) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn dfs_helper(k: i32, n: i32, start: i32, comb: &mut Vec, res: &mut Vec>) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0217_contains_duplicate.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `contains_duplicate` is never used [INFO] [stdout] --> src/solution/s0217_contains_duplicate.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 30 | pub fn contains_duplicate(nums: Vec) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0218_the_skyline_problem.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `get_skyline` is never used [INFO] [stdout] --> src/solution/s0218_the_skyline_problem.rs:46:12 [INFO] [stdout] | [INFO] [stdout] 44 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 45 | // Credit: https://leetcode.com/problems/the-skyline-problem/discuss/954648/Rust-priority-queue-solution [INFO] [stdout] 46 | pub fn get_skyline(buildings: Vec>) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0219_contains_duplicate_ii.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `contains_nearby_duplicate` is never used [INFO] [stdout] --> src/solution/s0219_contains_duplicate_ii.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | pub fn contains_nearby_duplicate(nums: Vec, k: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0220_contains_duplicate_iii.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `contains_nearby_almost_duplicate` is never used [INFO] [stdout] --> src/solution/s0220_contains_duplicate_iii.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn contains_nearby_almost_duplicate(nums: Vec, k: i32, t: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0221_maximal_square.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 30 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `maximal_square` is never used [INFO] [stdout] --> src/solution/s0221_maximal_square.rs:38:12 [INFO] [stdout] | [INFO] [stdout] 37 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 38 | pub fn maximal_square(matrix: Vec>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0222_count_complete_tree_nodes.rs:31:12 [INFO] [stdout] | [INFO] [stdout] 31 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_nodes` is never used [INFO] [stdout] --> src/solution/s0222_count_complete_tree_nodes.rs:60:12 [INFO] [stdout] | [INFO] [stdout] 59 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 60 | pub fn count_nodes(root: Option>>) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0223_rectangle_area.rs:24:12 [INFO] [stdout] | [INFO] [stdout] 24 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `compute_area` is never used [INFO] [stdout] --> src/solution/s0223_rectangle_area.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 31 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 32 | pub fn compute_area( [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0224_basic_calculator.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `calculate` is never used [INFO] [stdout] --> src/solution/s0224_basic_calculator.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 40 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 41 | pub fn calculate(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:44:12 [INFO] [stdout] | [INFO] [stdout] 44 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyStack` is never constructed [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | struct MyStack { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `empty` are never used [INFO] [stdout] --> src/solution/s0225_implement_stack_using_queues.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 59 | impl MyStack { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 60 | /** Initialize your data structure here. */ [INFO] [stdout] 61 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn top(&self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0226_invert_binary_tree.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `invert_tree` is never used [INFO] [stdout] --> src/solution/s0226_invert_binary_tree.rs:57:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | pub fn invert_tree(root: Option>>) -> Option>> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0227_basic_calculator_ii.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `calculate` is never used [INFO] [stdout] --> src/solution/s0227_basic_calculator_ii.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 34 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 35 | pub fn calculate(s: String) -> i32 { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0228_summary_ranges.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `summary_ranges` is never used [INFO] [stdout] --> src/solution/s0228_summary_ranges.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 62 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 63 | pub fn summary_ranges(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0229_majority_element_ii.rs:29:12 [INFO] [stdout] | [INFO] [stdout] 29 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `majority_element` is never used [INFO] [stdout] --> src/solution/s0229_majority_element_ii.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 36 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 37 | pub fn majority_element(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0230_kth_smallest_element_in_a_bst.rs:26:12 [INFO] [stdout] | [INFO] [stdout] 26 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `kth_smallest` is never used [INFO] [stdout] --> src/solution/s0230_kth_smallest_element_in_a_bst.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 54 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 55 | pub fn kth_smallest(root: Option>>, k: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0231_power_of_two.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_power_of_two` is never used [INFO] [stdout] --> src/solution/s0231_power_of_two.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 50 | 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/solution/s0232_implement_queue_using_stacks.rs:42:12 [INFO] [stdout] | [INFO] [stdout] 42 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `MyQueue` is never constructed [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | struct MyQueue { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, and `empty` are never used [INFO] [stdout] --> src/solution/s0232_implement_queue_using_stacks.rs:60:8 [INFO] [stdout] | [INFO] [stdout] 58 | impl MyQueue { [INFO] [stdout] | ------------ associated items in this implementation [INFO] [stdout] 59 | /** Initialize your data structure here. */ [INFO] [stdout] 60 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn push(&mut self, x: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn pop(&mut self) -> i32 { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn peek(&mut self) -> i32 { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 89 | fn empty(&self) -> bool { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0233_number_of_digit_one.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `count_digit_one` is never used [INFO] [stdout] --> src/solution/s0233_number_of_digit_one.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 29 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 30 | pub fn count_digit_one(n: i32) -> i32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0234_palindrome_linked_list.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_palindrome` is never used [INFO] [stdout] --> src/solution/s0234_palindrome_linked_list.rs:50:12 [INFO] [stdout] | [INFO] [stdout] 49 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 50 | pub fn is_palindrome(head: Option>) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0235_lowest_common_ancestor_of_a_binary_search_tree.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used [INFO] [stdout] --> src/solution/s0235_lowest_common_ancestor_of_a_binary_search_tree.rs:63:12 [INFO] [stdout] | [INFO] [stdout] 62 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 63 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0236_lowest_common_ancestor_of_a_binary_tree.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `lowest_common_ancestor` and `helper` are never used [INFO] [stdout] --> src/solution/s0236_lowest_common_ancestor_of_a_binary_tree.rs:64:12 [INFO] [stdout] | [INFO] [stdout] 62 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 63 | // Credit: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/discuss/963346/Rust-recursive [INFO] [stdout] 64 | pub fn lowest_common_ancestor( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn helper(root: Rc>, v1: i32, v2: i32) -> Option>> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0238_product_of_array_except_self.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `product_except_self` is never used [INFO] [stdout] --> src/solution/s0238_product_of_array_except_self.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 32 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 33 | pub fn product_except_self(nums: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0239_sliding_window_maximum.rs:49:12 [INFO] [stdout] | [INFO] [stdout] 49 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `max_sliding_window` is never used [INFO] [stdout] --> src/solution/s0239_sliding_window_maximum.rs:58:12 [INFO] [stdout] | [INFO] [stdout] 56 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 57 | // Credit: https://leetcode.com/problems/sliding-window-maximum/discuss/267853/Rust-4ms-deque [INFO] [stdout] 58 | pub fn max_sliding_window(nums: Vec, k: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> src/solution/s0240_search_a_2d_matrix_ii.rs:32:12 [INFO] [stdout] | [INFO] [stdout] 32 | pub struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `search_matrix` is never used [WARN] too many lines in the log, truncating it