[INFO] cloning repository https://github.com/sonmessia/leetcode_by_night
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/sonmessia/leetcode_by_night" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fsonmessia%2Fleetcode_by_night", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fsonmessia%2Fleetcode_by_night'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 64f6ca40bbad8aa037a1dd97fb9b9184361daa82
[INFO] checking sonmessia/leetcode_by_night/64f6ca40bbad8aa037a1dd97fb9b9184361daa82 against ed77b7b8699e342c2dc842c83cb5fe4025252ee8 for pr-158915-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fsonmessia%2Fleetcode_by_night" "/workspace/builds/worker-4-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-4-tc1/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/sonmessia/leetcode_by_night
[INFO] finished tweaking git repo https://github.com/sonmessia/leetcode_by_night
[INFO] tweaked toml for git repo https://github.com/sonmessia/leetcode_by_night written to /workspace/builds/worker-4-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/sonmessia/leetcode_by_night on toolchain ed77b7b8699e342c2dc842c83cb5fe4025252ee8
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ed77b7b8699e342c2dc842c83cb5fe4025252ee8" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/sonmessia/leetcode_by_night already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ed77b7b8699e342c2dc842c83cb5fe4025252ee8" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr] warning: binary `LeetCodeByNight` should have a kebab-case name
[INFO] [stderr]    |
[INFO] [stderr]  1 | /workspace/builds/worker-4-tc1/source/target/.../LeetCodeByNight
[INFO] [stderr]    |                                                  ^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `cargo::non_kebab_case_bins` is set to `warn` by default
[INFO] [stderr] help: to change the binary name to `leet-code-by-night`, convert `package.name`
[INFO] [stderr]   --> Cargo.toml:7:8
[INFO] [stderr]    |
[INFO] [stderr]  7 - name = "LeetCodeByNight"
[INFO] [stderr]  7 + name = "leet-code-by-night"
[INFO] [stderr]    |
[INFO] [stderr] help: to change the binary name to `leet-code-by-night`, specify `bin.name`
[INFO] [stderr]   --> Cargo.toml:8:19
[INFO] [stderr]    |
[INFO] [stderr]  8 ~ version = "0.1.0"
[INFO] [stderr]  9 + [[bin]]
[INFO] [stderr] 10 + name = "leet-code-by-night"
[INFO] [stderr] 11 + path = "src/main.rs"
[INFO] [stderr]    |
[INFO] [stderr] warning: `LeetCodeByNight` (manifest) generated 1 warning
[INFO] [stderr]     Updating crates.io index
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded ran v2.0.1
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-m" "1610612736" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:8683fc1fc2eb5c9ac98e0d076ab094b2ffac7f99da555d2b6a2e27f346de2ec7" "sleep" "infinity", kill_on_drop: false }`
[INFO] [stdout] 68bce365134e02c9b5a02bfcbf918bb53f0e184ccecf84a2e20ac0ea21872fcf
[INFO] running `Command { std: "docker" "start" "68bce365134e02c9b5a02bfcbf918bb53f0e184ccecf84a2e20ac0ea21872fcf", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "68bce365134e02c9b5a02bfcbf918bb53f0e184ccecf84a2e20ac0ea21872fcf", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-w" "/opt/rustwide/workdir" "--user" "0:0" "68bce365134e02c9b5a02bfcbf918bb53f0e184ccecf84a2e20ac0ea21872fcf" "/opt/rustwide/cargo-home/bin/cargo" "+ed77b7b8699e342c2dc842c83cb5fe4025252ee8" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "68bce365134e02c9b5a02bfcbf918bb53f0e184ccecf84a2e20ac0ea21872fcf", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-w" "/opt/rustwide/workdir" "--user" "0:0" "68bce365134e02c9b5a02bfcbf918bb53f0e184ccecf84a2e20ac0ea21872fcf" "/opt/rustwide/cargo-home/bin/cargo" "+ed77b7b8699e342c2dc842c83cb5fe4025252ee8" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stderr] warning: binary `LeetCodeByNight` should have a kebab-case name
[INFO] [stderr]    |
[INFO] [stderr]  1 | /opt/rustwide/target/.../LeetCodeByNight
[INFO] [stderr]    |                          ^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `cargo::non_kebab_case_bins` is set to `warn` by default
[INFO] [stderr] help: to change the binary name to `leet-code-by-night`, convert `package.name`
[INFO] [stderr]   --> Cargo.toml:7:8
[INFO] [stderr]    |
[INFO] [stderr]  7 - name = "LeetCodeByNight"
[INFO] [stderr]  7 + name = "leet-code-by-night"
[INFO] [stderr]    |
[INFO] [stderr] help: to change the binary name to `leet-code-by-night`, specify `bin.name`
[INFO] [stderr]   --> Cargo.toml:8:19
[INFO] [stderr]    |
[INFO] [stderr]  8 ~ version = "0.1.0"
[INFO] [stderr]  9 + [[bin]]
[INFO] [stderr] 10 + name = "leet-code-by-night"
[INFO] [stderr] 11 + path = "src/main.rs"
[INFO] [stderr]    |
[INFO] [stderr] warning: `LeetCodeByNight` (manifest) generated 1 warning
[INFO] [stderr]     Checking ran v2.0.1
[INFO] [stderr]     Checking getrandom v0.3.4
[INFO] [stderr]     Checking rand_core v0.9.5
[INFO] [stderr]     Checking rand_chacha v0.9.0
[INFO] [stderr]     Checking rand v0.9.4
[INFO] [stderr]     Checking LeetCodeByNight v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] error[E0425]: cannot find type `Solution` in this scope
[INFO] [stdout]    --> src/daily_problem/maximum_product_of_splitted_binary_tree.rs:22:6
[INFO] [stdout]     |
[INFO] [stdout]  22 | impl Solution {
[INFO] [stdout]     |      ^^^^^^^^ not found in this scope
[INFO] [stdout]     |
[INFO] [stdout] note: these structs exist but are inaccessible
[INFO] [stdout]    --> src/daily_problem/adjacent_increasing_subarrays_detection_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::adjacent_increasing_subarrays_detection_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/add_strings.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::add_strings::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/adjacent_increasing_subarrays_detection_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::adjacent_increasing_subarrays_detection_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/alice_and_bob_playing_flower_game.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::alice_and_bob_playing_flower_game::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/all_divisions_with_the_highest_score_of_a_binary_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::all_divisions_with_the_highest_score_of_a_binary_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/alternating_digit_sum.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::alternating_digit_sum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/angle_between_hands_of_a_clock.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::angle_between_hands_of_a_clock::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/apple_redistribution_into_boxes.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::apple_redistribution_into_boxes::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/avoid_flood_in_the_city.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::avoid_flood_in_the_city::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/balance_a_binary_search_tree.rs:21:1
[INFO] [stdout]     |
[INFO] [stdout]  21 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::balance_a_binary_search_tree::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/balanced_binary_tree.rs:23:1
[INFO] [stdout]     |
[INFO] [stdout]  23 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::balanced_binary_tree::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/battleship_in_a_board.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::battleship_in_a_board::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/best_time_to_buy_and_sell_stock_using_strategy.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::best_time_to_buy_and_sell_stock_using_strategy::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/best_time_to_buy_and_sell_stock_v.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::best_time_to_buy_and_sell_stock_v::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/binary_gap.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::binary_gap::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/binary_number_with_alternating_bits.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::binary_number_with_alternating_bits::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/binary_prefix_divisible_by_5.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::binary_prefix_divisible_by_5::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/binary_subarrays_with_sum.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::binary_subarrays_with_sum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/binary_watch.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::binary_watch::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/block_placement_queries.rs:49:1
[INFO] [stdout]     |
[INFO] [stdout]  49 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::block_placement_queries::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/calculate_money_in_leetcode_bank.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::calculate_money_in_leetcode_bank::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/can_convert_string_in_k_moves.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::can_convert_string_in_k_moves::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/can_i_win.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::can_i_win::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/car_fleet.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::car_fleet::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/champagne_tower.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::champagne_tower::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/check_array_formation_through_concatenation.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_array_formation_through_concatenation::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/check_balanced_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_balanced_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_divisibility_by_digit_sum_and_product.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_divisibility_by_digit_sum_and_product::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_a_string_contains_all_binary_codes_of_size_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_a_string_contains_all_binary_codes_of_size_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_all_1s_are_at_least_length_k_places_away.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_all_1s_are_at_least_length_k_places_away::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_array_is_good.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_array_is_good::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_array_is_sorted_and_rotated.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_array_is_sorted_and_rotated::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_binary_string_has_at_most_one_segment_of_ones.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_binary_string_has_at_most_one_segment_of_ones::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_digits_are_equal_in_string_after_operations_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_digits_are_equal_in_string_after_operations_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_strings_can_be_made_equal_with_operations_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_strings_can_be_made_equal_with_operations_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_strings_can_be_made_equal_with_operations_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_strings_can_be_made_equal_with_operations_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/check_if_there_is_a_valid_parentheses_string_path.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_there_is_a_valid_parentheses_string_path::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/cinema_seat_allocation.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::cinema_seat_allocation::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/circle_and_rectangle_overlapping.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::circle_and_rectangle_overlapping::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/closest_dessert_cost.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::closest_dessert_cost::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/closest_equal_element_queries.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::closest_equal_element_queries::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/compare_version_numbers.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::compare_version_numbers::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/complement_of_base_10_integer.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::complement_of_base_10_integer::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/concatenate_non_zero_digits_and_multiply_by_sum_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::concatenate_non_zero_digits_and_multiply_by_sum_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/concatenate_non_zero_digits_and_multiply_by_sum_ii.rs:16:1
[INFO] [stdout]     |
[INFO] [stdout]  16 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::concatenate_non_zero_digits_and_multiply_by_sum_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/concatenation_of_consecutive_binary_numbers.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::concatenation_of_consecutive_binary_numbers::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/construct_product_matrix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::construct_product_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/construct_target_array_with_multiple_sums.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::construct_target_array_with_multiple_sums::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/construct_the_minimum_bitwise_array_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::construct_the_minimum_bitwise_array_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/construct_the_minimum_bitwise_array_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::construct_the_minimum_bitwise_array_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/construct_uniform_parity_array_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::construct_uniform_parity_array_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/construct_uniform_parity_array_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::construct_uniform_parity_array_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/container_with_most_water.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::container_with_most_water::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/contains_duplicate_iii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::contains_duplicate_iii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/contigous_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::contigous_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/convert_integer_to_the_sum_of_two_no_zero_integers.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::convert_integer_to_the_sum_of_two_no_zero_integers::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/count_binary_substrings.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_binary_substrings::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_collisions_on_a_road.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_collisions_on_a_road::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_commas_range_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_commas_range_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_covered_buildings.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_covered_buildings::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_elements_with_maximum_frequency.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_elements_with_maximum_frequency::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_mentions_per_user.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_mentions_per_user::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_negative_numbers_in_a_sorted_matrix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_negative_numbers_in_a_sorted_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/count_nice_pairs_in_an_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_nice_pairs_in_an_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_nodes_equal_to_average_of_subtree.rs:22:1
[INFO] [stdout]     |
[INFO] [stdout]  22 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_nodes_equal_to_average_of_subtree::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/count_number_of_texts.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_number_of_texts::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_number_of_trapezoids_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_number_of_trapezoids_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_number_of_trapezoids_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_number_of_trapezoids_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_odd_numbers_in_an_interval_range.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_odd_numbers_in_an_interval_range::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_operations_to_obtain_zero.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_operations_to_obtain_zero::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_partitions_with_even_sum_difference.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_partitions_with_even_sum_difference::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_partitions_with_max_min_difference_at_most_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_partitions_with_max_min_difference_at_most_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/count_primes.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_primes::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_special_triplets.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_special_triplets::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_square_submatrices_with_all_ones.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_square_submatrices_with_all_ones::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_square_sum_triples.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_square_sum_triples::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_subarrays_with_majority_element_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_subarrays_with_majority_element_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_subarrays_with_majority_element_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_subarrays_with_majority_element_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_submatrices_with_all_ones.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_submatrices_with_all_ones::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_submatrices_with_equal_frequence_of_x_and_y.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_submatrices_with_equal_frequence_of_x_and_y::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_submatrices_with_top_left_element_and_sum_less_than_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_submatrices_with_top_left_element_and_sum_less_than_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_the_number_of_complete_components.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_the_number_of_complete_components::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_the_number_of_computer_unlocking_permutations.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_the_number_of_computer_unlocking_permutations::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/count_the_number_of_incremovable_subarrays_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_the_number_of_incremovable_subarrays_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_the_number_of_special_characters_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_the_number_of_special_characters_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_the_number_of_special_characters_ii.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_the_number_of_special_characters_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_the_number_of_substrings_with_dominant_ones.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_the_number_of_substrings_with_dominant_ones::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_unguarded_cells_in_the_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_unguarded_cells_in_the_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/coupon_code_validator.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::coupon_code_validator::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/create_binary_tree_from_descriptions.rs:23:1
[INFO] [stdout]     |
[INFO] [stdout]  23 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::create_binary_tree_from_descriptions::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/create_components_with_same_value.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::create_components_with_same_value::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/cyclically_rotating_a_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::cyclically_rotating_a_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/daily_temperatures.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::daily_temperatures::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/decode_ways.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::decode_ways::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/decode_xored_permutation.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::decode_xored_permutation::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/delete_column_to_make_sorted.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::delete_column_to_make_sorted::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/delete_column_to_make_sorted_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::delete_column_to_make_sorted_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/delete_column_to_make_sorted_iii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::delete_column_to_make_sorted_iii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/delete_nodes_from_linked_list_present_in_array.rs:14:1
[INFO] [stdout]     |
[INFO] [stdout]  14 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::delete_nodes_from_linked_list_present_in_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/delete_the_middle_node_of_a_linked_list.rs:15:1
[INFO] [stdout]     |
[INFO] [stdout]  15 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::delete_the_middle_node_of_a_linked_list::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/destination_city.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::destination_city::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/destroying_asteroids.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::destroying_asteroids::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/detect_cycles_in_2d_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::detect_cycles_in_2d_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/determine_the_winner_of_a_bowling_game.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::determine_the_winner_of_a_bowling_game::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/diagonal_traverse.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::diagonal_traverse::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/difference_between_ones_and_zeros_in_row_and_column.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::difference_between_ones_and_zeros_in_row_and_column::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/distinct_subsequences.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::distinct_subsequences::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/distribute_elements_into_two_arrays_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::distribute_elements_into_two_arrays_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/distribute_money_to_maximum_children.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::distribute_money_to_maximum_children::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/divide_an_array_into_subarrays_with_minimum_cost_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::divide_an_array_into_subarrays_with_minimum_cost_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/double_modular_exponentiation.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::double_modular_exponentiation::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/earliest_finish_time_for_land_and_water_rides_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::earliest_finish_time_for_land_and_water_rides_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/earliest_finish_time_for_land_and_water_rides_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::earliest_finish_time_for_land_and_water_rides_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/edit_distance.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::edit_distance::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/equal_sum_grid_partition_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::equal_sum_grid_partition_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/excel_sheet_column_number.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::excel_sheet_column_number::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/excel_sheet_column_title.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::excel_sheet_column_title::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/final_value_of_variable_after_performing_operations.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::final_value_of_variable_after_performing_operations::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_a_safe_walk_through_a_grid.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_a_safe_walk_through_a_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_all_possible_stable_binary_arrays_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_all_possible_stable_binary_arrays_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_all_possible_stable_binary_arrays_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_all_possible_stable_binary_arrays_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_first_and_last_position_of_element_in_sorted_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_first_and_last_position_of_element_in_sorted_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_greatest_common_divisor_of_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_greatest_common_divisor_of_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_kth_bit_in_nth_binary_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_kth_bit_in_nth_binary_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_largest_group_size_of_m.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_largest_group_size_of_m::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_minimum_in_rotated_sorted_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_minimum_in_rotated_sorted_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_minimum_in_rotated_sorted_array_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_minimum_in_rotated_sorted_array_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_minimum_operations_to_make_all_elements_divisible_by_three.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_minimum_operations_to_make_all_elements_divisible_by_three::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_missing_elements.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_missing_elements::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_most_frequent_vowel_and_consonant.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_most_frequent_vowel_and_consonant::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_n_unique_integers_sum_up_to_zero.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_n_unique_integers_sum_up_to_zero::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_polygon_with_the_largest_perimeter.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_polygon_with_the_largest_perimeter::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_resultant_array_after_removing_anagrams.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_resultant_array_after_removing_anagrams::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_smallest_letter_greater_than_target.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_smallest_letter_greater_than_target::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_subtree_sizes_after_change.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_subtree_sizes_after_change::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_the_divisibility_array_of_a_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_divisibility_array_of_a_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_highest_altitude.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_highest_altitude::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_largest_almost_missing_integer.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_largest_almost_missing_integer::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_largest_area_of_square_inside_two_rectangle.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_largest_area_of_square_inside_two_rectangle::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_length_of_the_longest_common_prefix.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_length_of_the_longest_common_prefix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_the_maximum_divisibility_score.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_maximum_divisibility_score::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_minimum_amount_of_time_to_brew_potions.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_minimum_amount_of_time_to_brew_potions::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_minimum_and_maximum_number_of_nodes_between_critical_points.rs:15:1
[INFO] [stdout]     |
[INFO] [stdout]  15 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_minimum_and_maximum_number_of_nodes_between_critical_points::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_number_of_ways_to_place_people.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_number_of_ways_to_place_people::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_number_of_ways_to_place_people_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_number_of_ways_to_place_people_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_prefix_common_array_of_two_arrays.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_prefix_common_array_of_two_arrays::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_the_safest_path_in_a_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_safest_path_in_a_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_saftest_path_in_a_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_saftest_path_in_a_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_the_width_of_columns_of_a_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_width_of_columns_of_a_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_the_winning_player_in_coin_game.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_winning_player_in_coin_game::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_three_consecutive_integers_that_sum_to_a_given_number.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_three_consecutive_integers_that_sum_to_a_given_number::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_triangular_sum_of_an_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_triangular_sum_of_an_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_two_non_overlapping_sub_arrays_each_with_target_sum.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_two_non_overlapping_sub_arrays_each_with_target_sum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_unique_binary_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_unique_binary_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_winner_on_a_tic_tac_toe_game.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_winner_on_a_tic_tac_toe_game::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_x_sum_of_all_k_long_subarrays_i.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_x_sum_of_all_k_long_subarrays_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_x_sum_of_all_k_long_subarrays_ii.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_x_sum_of_all_k_long_subarrays_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_xor_beauty_of_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_xor_beauty_of_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/flip_square_submatrix_vertically.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::flip_square_submatrix_vertically::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/four_divisor.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::four_divisor::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/fraction_to_recurring_decimal.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::fraction_to_recurring_decimal::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/frequency_of_the_most_frequent_element.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::frequency_of_the_most_frequent_element::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/gcd_of_odd_and_even_sums.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::gcd_of_odd_and_even_sums::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/get_biggest_three_rhombus_sums_in_a_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::get_biggest_three_rhombus_sums_in_a_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/greatest_sum_divisible_by_three.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::greatest_sum_divisible_by_three::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/hash_divided_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::hash_divided_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/image_overlap.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::image_overlap::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/increment_submatrices_by_one.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::increment_submatrices_by_one::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/intersection_of_multiple_arrays.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::intersection_of_multiple_arrays::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/jewels_and_stones.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::jewels_and_stones::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/jump_game_iii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::jump_game_iii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/jump_game_iv.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::jump_game_iv::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/jump_game_ix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::jump_game_ix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/jump_game_v.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::jump_game_v::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/jump_game_vii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::jump_game_vii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/k_diff_pairs_in_an_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::k_diff_pairs_in_an_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/k_th_largest_perfect_subtree_size_in_binary_tree.rs:22:1
[INFO] [stdout]     |
[INFO] [stdout]  22 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::k_th_largest_perfect_subtree_size_in_binary_tree::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/keep_multiplying_found_values_by_two.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::keep_multiplying_found_values_by_two::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/largest_magic_square.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::largest_magic_square::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/largest_number_at_least_twice_of_others.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::largest_number_at_least_twice_of_others::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/largest_palindromic_number.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::largest_palindromic_number::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/largest_perimeter_triangle.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::largest_perimeter_triangle::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/largest_submatrix_with_rearrangements.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::largest_submatrix_with_rearrangements::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/largest_triangle_area.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::largest_triangle_area::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/last_day_where_you_can_still_cross.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::last_day_where_you_can_still_cross::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/least_number_of_unique_integers_after_k_removals.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::least_number_of_unique_integers_after_k_removals::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/left_and_right_sum_differences.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::left_and_right_sum_differences::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/length_of_longest_subarray_with_at_most_k_frequency.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::length_of_longest_subarray_with_at_most_k_frequency::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/lexicographically_smallest_negated_permutation_that_sums_to_target.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::lexicographically_smallest_negated_permutation_that_sums_to_target::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/lexicographically_smallest_permutation_greater_than_target.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::lexicographically_smallest_permutation_greater_than_target::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/lexicographically_smallest_string_after_applying_operations.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::lexicographically_smallest_string_after_applying_operations::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/license_key_formatting.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::license_key_formatting::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/longest_balanced_string_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_balanced_string_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/longest_balanced_string_ii.rs:4:1
[INFO] [stdout]     |
[INFO] [stdout]   4 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_balanced_string_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/longest_balanced_subarray_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_balanced_subarray_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_balanced_subarray_ii.rs:145:1
[INFO] [stdout]     |
[INFO] [stdout] 145 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_balanced_subarray_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_common_suffix_queries.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_common_suffix_queries::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_non_decreasing_subarray_from_two_arrays.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_non_decreasing_subarray_from_two_arrays::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_palindrome.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_palindrome::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_palindromic_subsequence.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_palindromic_subsequence::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_palindromic_subsequence_after_at_most_k_operations.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_palindromic_subsequence_after_at_most_k_operations::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_repeating_character_replacement.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_repeating_character_replacement::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/longest_subsequence_with_non_zero_bitwise_xor.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_subsequence_with_non_zero_bitwise_xor::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_substring_with_at_least_k_repeating_characters.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_substring_with_at_least_k_repeating_characters::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_uncommon_subsequence_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_uncommon_subsequence_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_valid_parentheses.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_valid_parentheses::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/magic_squares_in_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::magic_squares_in_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/make_array_elements_equal_to_zero.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::make_array_elements_equal_to_zero::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/make_lexicographically_smallest_array_by_swapping_elements.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::make_lexicographically_smallest_array_by_swapping_elements::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/make_sum_divisible_by_p.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::make_sum_divisible_by_p::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/max_area_of_island.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::max_area_of_island::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/max_dot_product_of_two_subsequences.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::max_dot_product_of_two_subsequences::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximal_rectangle.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximal_rectangle::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximize_active_section_with_trade_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximize_active_section_with_trade_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximize_area_of_square_hole_in_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximize_area_of_square_hole_in_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximize_spanning_tree_stability_with_upgrades.rs:42:1
[INFO] [stdout]     |
[INFO] [stdout]  42 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximize_spanning_tree_stability_with_upgrades::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_amount_of_money_robot_can_earn.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_amount_of_money_robot_can_earn::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_area_of_longest_diagonal_rectangle.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_area_of_longest_diagonal_rectangle::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_average_pass_ratio.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_average_pass_ratio::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_distance_between_a_pair_of_values.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_distance_between_a_pair_of_values::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_element_after_decreasing_and_rearranging.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_element_after_decreasing_and_rearranging::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_frequency_of_an_element_after_performing_operations_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_frequency_of_an_element_after_performing_operations_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_frequency_of_an_element_after_performing_operations_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_frequency_of_an_element_after_performing_operations_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_ice_cream_bars.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_ice_cream_bars::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_length_of_pair_chain.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_length_of_pair_chain::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_length_substring_with_two_occurrences.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_length_substring_with_two_occurrences::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_level_sum_of_a_binary_tree.rs:23:1
[INFO] [stdout]     |
[INFO] [stdout]  23 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_level_sum_of_a_binary_tree::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_matrix_sum.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_matrix_sum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_non_negative_product_in_a_matrix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_non_negative_product_in_a_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_number_of_balloons.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_number_of_balloons::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_number_of_distinct_elements_after_operations.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_number_of_distinct_elements_after_operations::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_number_of_jumps_to_reach_the_last_index.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_number_of_jumps_to_reach_the_last_index::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_number_of_non_overlapping_palindrome_substrings.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_number_of_non_overlapping_palindrome_substrings::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_number_of_operations_to_move_ones_to_the_end.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_number_of_operations_to_move_ones_to_the_end::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_number_of_words_you_can_type.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_number_of_words_you_can_type::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_path_score_in_a_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_path_score_in_a_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_points_inside_the_square.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_points_inside_the_square::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_points_you_can_obtain_from_cards.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_points_you_can_obtain_from_cards::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_prime_difference.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_prime_difference::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_product_of_two_digits.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_product_of_two_digits::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_product_of_two_elements_in_an_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_product_of_two_elements_in_an_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_product_subarray.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_product_subarray::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_square_area_by_removing_fences_from_a_field.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_square_area_by_removing_fences_from_a_field::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_strenght_of_a_group.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_strenght_of_a_group::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_subarray.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_subarray::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_subarray_sum_with_length_divisible_by_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_subarray_sum_with_length_divisible_by_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_total_damage_with_spell_casting.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_total_damage_with_spell_casting::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_total_subarray_value_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_total_subarray_value_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_twin_sum_of_a_linked_list.rs:15:1
[INFO] [stdout]     |
[INFO] [stdout]  15 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_twin_sum_of_a_linked_list::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/meeting_room_iii.rs:4:1
[INFO] [stdout]     |
[INFO] [stdout]   4 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::meeting_room_iii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimize_hamming_distance_after_swap_operations.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimize_hamming_distance_after_swap_operations::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimize_maximum_pair_sum_in_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimize_maximum_pair_sum_in_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_absolute_difference.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_absolute_difference::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_absolute_difference_in_sliding_submatrix.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_absolute_difference_in_sliding_submatrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_absolute_distance_between_mirror_pairs.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_absolute_distance_between_mirror_pairs::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_amount_of_time_to_fill_cups.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_amount_of_time_to_fill_cups::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_ascii_delete_sum_for_two_strings.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_ascii_delete_sum_for_two_strings::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_changes_to_make_alternating_binary_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_changes_to_make_alternating_binary_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_common_value.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_common_value::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_cost_of_buying_candies_with_discount.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_cost_of_buying_candies_with_discount::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_cost_path_with_edge_reversals.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_cost_path_with_edge_reversals::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_cost_path_with_teleportations.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_cost_path_with_teleportations::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_cost_to_convert_string_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_cost_to_convert_string_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_cost_to_set_cooking_time.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_cost_to_set_cooking_time::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_deletions_for_at_most_k_distinct_characters.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_deletions_for_at_most_k_distinct_characters::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_deletions_to_make_string_balanced.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_deletions_to_make_string_balanced::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_difference_between_highest_and_lowest_of_k_scores.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_difference_between_highest_and_lowest_of_k_scores::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_distance_to_the_target_element.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_distance_to_the_target_element::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_element_after_replacement_with_digit_sum.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_element_after_replacement_with_digit_sum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_initial_energy_to_finish_tasks.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_initial_energy_to_finish_tasks::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_jumps_to_reach_end_via_prime_teleportation.rs:6:1
[INFO] [stdout]     |
[INFO] [stdout]   6 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_jumps_to_reach_end_via_prime_teleportation::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_k_to_reduce_array_within_limit.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_k_to_reduce_array_within_limit::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_moves_to_balance_circular_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_moves_to_balance_circular_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_moves_to_clean_the_classroom.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_moves_to_clean_the_classroom::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_moves_to_equal_array_elements.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_moves_to_equal_array_elements::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_moves_to_equal_array_elements_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_moves_to_equal_array_elements_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_moves_to_make_array_complementary.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_moves_to_make_array_complementary::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_moves_to_spread_stones_over_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_moves_to_spread_stones_over_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_number_of_flips_to_make_the_binary_string_alternating.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_flips_to_make_the_binary_string_alternating::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_number_of_increments_on_subarrays_to_form_a_target_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_increments_on_subarrays_to_form_a_target_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_number_of_operations_to_convert_time.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_operations_to_convert_time::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_number_of_operations_to_make_all_array_elements_equal_to_1.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_operations_to_make_all_array_elements_equal_to_1::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_number_of_people_to_teach.rs:5:1
[INFO] [stdout]     |
[INFO] [stdout]   5 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_people_to_teach::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_number_of_pushes_to_type_word_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_pushes_to_type_word_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_number_of_pushes_to_type_word_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_pushes_to_type_word_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_number_of_seconds_to_make_mountian_height_zero.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_seconds_to_make_mountian_height_zero::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_operations_to_convert_all_elements_to_zero.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_operations_to_convert_all_elements_to_zero::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_operations_to_make_a_uni_value_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_operations_to_make_a_uni_value_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_operations_to_make_the_integer_zero.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_operations_to_make_the_integer_zero::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_pair_removal_to_sort_array_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_pair_removal_to_sort_array_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_pair_removal_to_sort_array_ii.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_pair_removal_to_sort_array_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_removals_to_balance_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_removals_to_balance_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_score_of_a_path_between_two_cities.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_score_of_a_path_between_two_cities::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_score_triangulation_of_polygon.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_score_triangulation_of_polygon::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_swaps_to_arrange_a_binary_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_swaps_to_arrange_a_binary_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_time_difference.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_time_difference::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_time_to_complete_trips.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_time_to_complete_trips::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_time_to_make_rope_colorful.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_time_to_make_rope_colorful::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_time_visiting_all_points.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_time_visiting_all_points::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_total_distance_traveled.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_total_distance_traveled::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/mirror_distance_of_an_integer.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::mirror_distance_of_an_integer::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/most_popular_video_creator.rs:11:1
[INFO] [stdout]     |
[INFO] [stdout]  11 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::most_popular_video_creator::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/multiply_strings.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::multiply_strings::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/n_repeated_element_in_size_2n_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::n_repeated_element_in_size_2n_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/network_recovery_pathways.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::network_recovery_pathways::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/next_greater_numerically_balanced_number.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::next_greater_numerically_balanced_number::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/non_decreasing_subsequences.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::non_decreasing_subsequences::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/number_of_enclaves.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_enclaves::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_laser_beams_in_a_bank.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_laser_beams_in_a_bank::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/number_of_pairs_of_interchangeable_rectangles.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_pairs_of_interchangeable_rectangles::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_people_aware_of_a_secret.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_people_aware_of_a_secret::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_smooth_descent_period_of_a_stock.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_smooth_descent_period_of_a_stock::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_steps_to_reduce_a_number_in_binary_representation_to_one.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_steps_to_reduce_a_number_in_binary_representation_to_one::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/number_of_students_doing_homework_at_a_given_time.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_students_doing_homework_at_a_given_time::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/number_of_subarrays_that_match_a_pattern_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_subarrays_that_match_a_pattern_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_substrings_containing_all_three_characters.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_substrings_containing_all_three_characters::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_substrings_with_only_1s.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_substrings_with_only_1s::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_unique_xor_triplets_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_unique_xor_triplets_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_unique_xor_triplets_ii.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_unique_xor_triplets_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/number_of_ways_to_assign_edge_weights_i.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_ways_to_assign_edge_weights_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/number_of_ways_to_assign_edge_weights_ii.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_ways_to_assign_edge_weights_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_ways_to_divide_a_long_corridor.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_ways_to_divide_a_long_corridor::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_ways_to_paint_n_3_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_ways_to_paint_n_3_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_zero_filled_subarrays.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution {}
[INFO] [stdout]     | ^^^^^^^^^^^^^^^ `crate::number_of_zero_filled_subarrays::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/o1_matrix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::o1_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/one_bit_and_2_bit_characters.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::one_bit_and_2_bit_characters::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/ones_and_zeroes.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::ones_and_zeroes::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/optimal_partition_of_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::optimal_partition_of_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/pacific_atlantic_water_flow.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::pacific_atlantic_water_flow::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/painting_a_grid_with_three_different_colors.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::painting_a_grid_with_three_different_colors::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/palindrome_partitioning.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::palindrome_partitioning::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/palindrome_partitioning_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::palindrome_partitioning_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/pancake_sorting.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::pancake_sorting::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/parallels_courses_ii.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::parallels_courses_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/partition_array_according_to_given_pivot.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::partition_array_according_to_given_pivot::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/partitioning_into_minimum_number_of_deci_binary_numbers.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::partitioning_into_minimum_number_of_deci_binary_numbers::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/path_existence_queries_in_a_graph_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::path_existence_queries_in_a_graph_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/path_existence_queries_in_a_graph_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::path_existence_queries_in_a_graph_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/path_with_minimum_effort.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::path_with_minimum_effort::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/paths_in_matrix_whose_sum_is_divisible_by_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::paths_in_matrix_whose_sum_is_divisible_by_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/plates_between_candles.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::plates_between_candles::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/plus_one.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::plus_one::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/power_grid_maintenance.rs:57:1
[INFO] [stdout]     |
[INFO] [stdout]  57 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::power_grid_maintenance::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/predict_the_winner.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::predict_the_winner::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/prime_number_of_set_bits_in_binary_representation.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::prime_number_of_set_bits_in_binary_representation::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/prime_pair_with_target_sum.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::prime_pair_with_target_sum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/prison_cells_after_n_days.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::prison_cells_after_n_days::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/process_string_with_special_operations_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::process_string_with_special_operations_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/process_string_with_special_operations_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::process_string_with_special_operations_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/pyramid_transition_matrix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::pyramid_transition_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/check_if_binary_string_has_at_most_one_segment_of_ones.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::check_if_binary_string_has_at_most_one_segment_of_ones::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/check_if_strings_can_be_made_equal_with_operations_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::check_if_strings_can_be_made_equal_with_operations_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/construct_the_minimum_bitwise_array_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::construct_the_minimum_bitwise_array_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/earliest_finish_time_for_land_and_water_rides_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::earliest_finish_time_for_land_and_water_rides_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/largest_magic_square.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::largest_magic_square::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/number_of_unique_xor_triplets_ii.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::number_of_unique_xor_triplets_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/predict_the_winner.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::predict_the_winner::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/prime_number_of_set_bits_in_binary_representation.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::prime_number_of_set_bits_in_binary_representation::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/shift_2d_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::shift_2d_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/rank_teams_by_votes.rs:4:1
[INFO] [stdout]     |
[INFO] [stdout]   4 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rank_teams_by_votes::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/rank_transform_of_an_array.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rank_transform_of_an_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/rearrange_characters_to_make_target_string.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rearrange_characters_to_make_target_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/rectangle_area.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rectangle_area::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/rectangle_overlap.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rectangle_overlap::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/remove_all_adjacent_duplicates_in_string_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::remove_all_adjacent_duplicates_in_string_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/remove_covered_intervals.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::remove_covered_intervals::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/remove_duplicate_letters.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::remove_duplicate_letters::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/remove_methods_from_project.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::remove_methods_from_project::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/removing_minimum_and_maximum_from_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::removing_minimum_and_maximum_from_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/replace_non_coprime_numbers_in_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::replace_non_coprime_numbers_in_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/reverse_bits.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::reverse_bits::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/reverse_degree_of_a_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::reverse_degree_of_a_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/rotate_function.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rotate_function::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/rotate_image.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rotate_image::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/rotate_list.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rotate_list::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/rotate_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rotate_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/rotated_digits.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rotated_digits::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/rotating_the_box.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rotating_the_box::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/search_in_rotated_sorted_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::search_in_rotated_sorted_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/search_in_rotated_sorted_array_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::search_in_rotated_sorted_array_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/separate_squares_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::separate_squares_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/separate_the_digits_in_an_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::separate_the_digits_in_an_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sequential_digits.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sequential_digits::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/set_intersection_size_at_least_two.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::set_intersection_size_at_least_two::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/set_matrix_zeroes.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::set_matrix_zeroes::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/shift_2d_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::shift_2d_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/shortest_and_lexicographically_smallest_beautiful_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::shortest_and_lexicographically_smallest_beautiful_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/shortest_distance_to_target_string_in_a_circular_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::shortest_distance_to_target_string_in_a_circular_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/shortest_path_in_binary_matrix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::shortest_path_in_binary_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/simplify_path.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::simplify_path::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/sliding_window_maximum.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sliding_window_maximum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_divisible_digit_product_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_divisible_digit_product_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_integer_divisible_by_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_integer_divisible_by_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_missing_integer_greater_than_sequential_prefix_sum.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_missing_integer_greater_than_sequential_prefix_sum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_missing_multiple_of_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_missing_multiple_of_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_number_with_all_set_bits.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_number_with_all_set_bits::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_palindromic_rearrangement_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_palindromic_rearrangement_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_stable_index_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_stable_index_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_stable_index_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_stable_index_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_subsequence_of_distinct_characters.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_subsequence_of_distinct_characters::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_subtree_with_all_the_deepest_nodes.rs:19:1
[INFO] [stdout]     |
[INFO] [stdout]  19 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_subtree_with_all_the_deepest_nodes::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sort_integers_by_the_number_of_1_bits.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sort_integers_by_the_number_of_1_bits::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sort_matrix_by_diagonals.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution {}
[INFO] [stdout]     | ^^^^^^^^^^^^^^^ `crate::sort_matrix_by_diagonals::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sort_vowels_in_a_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sort_vowels_in_a_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/special_binary_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::special_binary_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/special_positions_in_a_binary_matrix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::special_positions_in_a_binary_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/stone_game.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::stone_game::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/stone_game_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::stone_game_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/stone_game_iii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::stone_game_iii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/stone_game_iv.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::stone_game_iv::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/stone_game_ix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::stone_game_ix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/stone_game_viii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::stone_game_viii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/subarray_product_less_than_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::subarray_product_less_than_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/substring_matching_pattern.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::substring_matching_pattern::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/successful_pairs_of_spells_and_potions.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::successful_pairs_of_spells_and_potions::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sudoku_solver.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution {}
[INFO] [stdout]     | ^^^^^^^^^^^^^^^ `crate::sudoku_solver::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sum_game.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sum_game::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sum_of_distances.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sum_of_distances::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sum_of_gcd_of_formed_pairs.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sum_of_gcd_of_formed_pairs::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sum_of_root_to_leaf_binary_numbers.rs:22:1
[INFO] [stdout]     |
[INFO] [stdout]  22 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sum_of_root_to_leaf_binary_numbers::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/swim_in_rising_water.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::swim_in_rising_water::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/taking_maximum_energy_from_the_mystic_dungeon.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::taking_maximum_energy_from_the_mystic_dungeon::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/the_k_th_lexicographical_string_of_all_happy_strings_of_length_n.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::the_k_th_lexicographical_string_of_all_happy_strings_of_length_n::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/the_two_sneaky_numbers_of_digitville.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::the_two_sneaky_numbers_of_digitville::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/top_k_frequent_words.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::top_k_frequent_words::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/total_waviness_of_numbers_in_range_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::total_waviness_of_numbers_in_range_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/transformed_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::transformed_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/transpose_matrix.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::transpose_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/trapping_rain_water.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::trapping_rain_water::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/triangle.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::triangle::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/trionic_array_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::trionic_array_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/trionic_array_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::trionic_array_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/twenty_four_game.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::twenty_four_game::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/two_best_non_overlapping_events.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::two_best_non_overlapping_events::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/two_furthest_houses_with_different_colors.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::two_furthest_houses_with_different_colors::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/unique_3_digit_even_numbers.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::unique_3_digit_even_numbers::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/unique_binary_search_trees_ii.rs:22:1
[INFO] [stdout]     |
[INFO] [stdout]  22 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::unique_binary_search_trees_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/unique_length_3_palindromic_subsequences.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::unique_length_3_palindromic_subsequences::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/valid_sudoku.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution {}
[INFO] [stdout]     | ^^^^^^^^^^^^^^^ `crate::valid_sudoku::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/valid_triangle_number.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::valid_triangle_number::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/vowel_spellchecker.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::vowel_spellchecker::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/vowels_game_in_a_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::vowels_game_in_a_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/water_bottles.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::water_bottles::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/water_bottles_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::water_bottles_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/weighted_word_mapping.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::weighted_word_mapping::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/words_within_two_edits_of_dictionary.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::words_within_two_edits_of_dictionary::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/xor_after_range_multiplication_queries_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::xor_after_range_multiplication_queries_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/xor_after_range_multiplication_queries_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::xor_after_range_multiplication_queries_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/zero_array_transformation_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::zero_array_transformation_ii::Solution`: not accessible
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::cmp::Reverse`
[INFO] [stdout]  --> src/daily_problem/design_movie_rental_system.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cmp::Reverse;
[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: `HashSet`
[INFO] [stdout]  --> src/daily_problem/design_movie_rental_system.rs:2:43
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::collections::{BTreeSet, HashMap, HashSet};
[INFO] [stdout]   |                                           ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]  --> src/daily_problem/find_the_minimum_amount_of_time_to_brew_potions.rs:9:21
[INFO] [stdout]   |
[INFO] [stdout] 9 |             dp[i] = (skill[i] as i64 * mana[0] as i64);
[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] 9 -             dp[i] = (skill[i] as i64 * mana[0] as i64);
[INFO] [stdout] 9 +             dp[i] = skill[i] as i64 * mana[0] as i64;
[INFO] [stdout]   |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around index expression
[INFO] [stdout]   --> src/daily_problem/maximum_subarray_sum_with_length_divisible_by_k.rs:15:47
[INFO] [stdout]    |
[INFO] [stdout] 15 |             ans = ans.max(prefix_sums - k_sum[(i% k)]);
[INFO] [stdout]    |                                               ^    ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 15 -             ans = ans.max(prefix_sums - k_sum[(i% k)]);
[INFO] [stdout] 15 +             ans = ans.max(prefix_sums - k_sum[i% k]);
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around index expression
[INFO] [stdout]   --> src/daily_problem/maximum_subarray_sum_with_length_divisible_by_k.rs:16:19
[INFO] [stdout]    |
[INFO] [stdout] 16 |             k_sum[(i % k)] = k_sum[(i % k)].min(prefix_sums);
[INFO] [stdout]    |                   ^     ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 16 -             k_sum[(i % k)] = k_sum[(i % k)].min(prefix_sums);
[INFO] [stdout] 16 +             k_sum[i % k] = k_sum[(i % k)].min(prefix_sums);
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around index expression
[INFO] [stdout]   --> src/daily_problem/maximum_subarray_sum_with_length_divisible_by_k.rs:16:36
[INFO] [stdout]    |
[INFO] [stdout] 16 |             k_sum[(i % k)] = k_sum[(i % k)].min(prefix_sums);
[INFO] [stdout]    |                                    ^     ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 16 -             k_sum[(i % k)] = k_sum[(i % k)].min(prefix_sums);
[INFO] [stdout] 16 +             k_sum[(i % k)] = k_sum[i % k].min(prefix_sums);
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::BTreeSet`
[INFO] [stdout]  --> src/daily_problem/minimum_absolute_difference_in_sliding_submatrix.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::BTreeSet;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `HashMap`
[INFO] [stdout]  --> src/daily_problem/minimum_number_of_people_to_teach.rs:2:19
[INFO] [stdout]   |
[INFO] [stdout] 2 |     collections::{HashMap, HashSet},
[INFO] [stdout]   |                   ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/random_problem/find_polygon_with_the_largest_perimeter.rs:11:23
[INFO] [stdout]    |
[INFO] [stdout] 11 |                 ans = (ans.max(curr_sum + num as i64));
[INFO] [stdout]    |                       ^                              ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 11 -                 ans = (ans.max(curr_sum + num as i64));
[INFO] [stdout] 11 +                 ans = ans.max(curr_sum + num as i64);
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BTreeSet`
[INFO] [stdout]  --> src/random_problem/most_popular_video_creator.rs:2:24
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::collections::{BTreeSet, HashMap};
[INFO] [stdout]   |                        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::VecDeque`
[INFO] [stdout]  --> src/random_problem/network_recovery_pathways.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::VecDeque;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Deref`
[INFO] [stdout]  --> src/random_problem/transpose_matrix.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::ops::Deref;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `daily_problem::*`
[INFO] [stdout]  --> src/main.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use daily_problem::*;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout] note: the lint level is defined here
[INFO] [stdout]  --> src/main.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | #[warn(unused_imports)]
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `random_problem::*`
[INFO] [stdout]  --> src/main.rs:8:5
[INFO] [stdout]   |
[INFO] [stdout] 8 | use random_problem::*;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout] note: the lint level is defined here
[INFO] [stdout]  --> src/main.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | #[warn(unused_imports)]
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated constant `std::i32::MIN`: replaced by the `MIN` associated constant on this type
[INFO] [stdout]  --> src/daily_problem/max_dot_product_of_two_subsequences.rs:7:42
[INFO] [stdout]   |
[INFO] [stdout] 7 |         let mut dp = vec![vec![std::i32::MIN; m + 1]; n + 1];
[INFO] [stdout]   |                                          ^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(deprecated)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated module `std::usize`: all constants in this module replaced by associated constants on the type
[INFO] [stdout]  --> src/daily_problem/minimum_number_of_people_to_teach.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 |     usize,
[INFO] [stdout]   |     ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `Solution` in this scope
[INFO] [stdout]    --> src/daily_problem/maximum_product_of_splitted_binary_tree.rs:22:6
[INFO] [stdout]     |
[INFO] [stdout]  22 | impl Solution {
[INFO] [stdout]     |      ^^^^^^^^ not found in this scope
[INFO] [stdout]     |
[INFO] [stdout] note: these structs exist but are inaccessible
[INFO] [stdout]    --> src/daily_problem/adjacent_increasing_subarrays_detection_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::adjacent_increasing_subarrays_detection_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/add_strings.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::add_strings::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/adjacent_increasing_subarrays_detection_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::adjacent_increasing_subarrays_detection_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/alice_and_bob_playing_flower_game.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::alice_and_bob_playing_flower_game::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/all_divisions_with_the_highest_score_of_a_binary_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::all_divisions_with_the_highest_score_of_a_binary_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/alternating_digit_sum.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::alternating_digit_sum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/angle_between_hands_of_a_clock.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::angle_between_hands_of_a_clock::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/apple_redistribution_into_boxes.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::apple_redistribution_into_boxes::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/avoid_flood_in_the_city.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::avoid_flood_in_the_city::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/balance_a_binary_search_tree.rs:21:1
[INFO] [stdout]     |
[INFO] [stdout]  21 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::balance_a_binary_search_tree::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/balanced_binary_tree.rs:23:1
[INFO] [stdout]     |
[INFO] [stdout]  23 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::balanced_binary_tree::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/battleship_in_a_board.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::battleship_in_a_board::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/best_time_to_buy_and_sell_stock_using_strategy.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::best_time_to_buy_and_sell_stock_using_strategy::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/best_time_to_buy_and_sell_stock_v.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::best_time_to_buy_and_sell_stock_v::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/binary_gap.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::binary_gap::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/binary_number_with_alternating_bits.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::binary_number_with_alternating_bits::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/binary_prefix_divisible_by_5.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::binary_prefix_divisible_by_5::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/binary_subarrays_with_sum.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::binary_subarrays_with_sum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/binary_watch.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::binary_watch::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/block_placement_queries.rs:49:1
[INFO] [stdout]     |
[INFO] [stdout]  49 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::block_placement_queries::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/calculate_money_in_leetcode_bank.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::calculate_money_in_leetcode_bank::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/can_convert_string_in_k_moves.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::can_convert_string_in_k_moves::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/can_i_win.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::can_i_win::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/car_fleet.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::car_fleet::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/champagne_tower.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::champagne_tower::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/check_array_formation_through_concatenation.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_array_formation_through_concatenation::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/check_balanced_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_balanced_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_divisibility_by_digit_sum_and_product.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_divisibility_by_digit_sum_and_product::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_a_string_contains_all_binary_codes_of_size_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_a_string_contains_all_binary_codes_of_size_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_all_1s_are_at_least_length_k_places_away.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_all_1s_are_at_least_length_k_places_away::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_array_is_good.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_array_is_good::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_array_is_sorted_and_rotated.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_array_is_sorted_and_rotated::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_binary_string_has_at_most_one_segment_of_ones.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_binary_string_has_at_most_one_segment_of_ones::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_digits_are_equal_in_string_after_operations_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_digits_are_equal_in_string_after_operations_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_strings_can_be_made_equal_with_operations_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_strings_can_be_made_equal_with_operations_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/check_if_strings_can_be_made_equal_with_operations_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_strings_can_be_made_equal_with_operations_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/check_if_there_is_a_valid_parentheses_string_path.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::check_if_there_is_a_valid_parentheses_string_path::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/cinema_seat_allocation.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::cinema_seat_allocation::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/circle_and_rectangle_overlapping.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::circle_and_rectangle_overlapping::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/closest_dessert_cost.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::closest_dessert_cost::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/closest_equal_element_queries.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::closest_equal_element_queries::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/compare_version_numbers.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::compare_version_numbers::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/complement_of_base_10_integer.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::complement_of_base_10_integer::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/concatenate_non_zero_digits_and_multiply_by_sum_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::concatenate_non_zero_digits_and_multiply_by_sum_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/concatenate_non_zero_digits_and_multiply_by_sum_ii.rs:16:1
[INFO] [stdout]     |
[INFO] [stdout]  16 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::concatenate_non_zero_digits_and_multiply_by_sum_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/concatenation_of_consecutive_binary_numbers.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::concatenation_of_consecutive_binary_numbers::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/construct_product_matrix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::construct_product_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/construct_target_array_with_multiple_sums.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::construct_target_array_with_multiple_sums::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/construct_the_minimum_bitwise_array_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::construct_the_minimum_bitwise_array_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/construct_the_minimum_bitwise_array_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::construct_the_minimum_bitwise_array_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/construct_uniform_parity_array_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::construct_uniform_parity_array_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/construct_uniform_parity_array_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::construct_uniform_parity_array_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/container_with_most_water.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::container_with_most_water::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/contains_duplicate_iii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::contains_duplicate_iii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/contigous_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::contigous_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/convert_integer_to_the_sum_of_two_no_zero_integers.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::convert_integer_to_the_sum_of_two_no_zero_integers::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/count_binary_substrings.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_binary_substrings::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_collisions_on_a_road.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_collisions_on_a_road::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_commas_range_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_commas_range_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_covered_buildings.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_covered_buildings::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_elements_with_maximum_frequency.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_elements_with_maximum_frequency::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_mentions_per_user.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_mentions_per_user::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_negative_numbers_in_a_sorted_matrix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_negative_numbers_in_a_sorted_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/count_nice_pairs_in_an_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_nice_pairs_in_an_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_nodes_equal_to_average_of_subtree.rs:22:1
[INFO] [stdout]     |
[INFO] [stdout]  22 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_nodes_equal_to_average_of_subtree::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/count_number_of_texts.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_number_of_texts::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_number_of_trapezoids_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_number_of_trapezoids_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_number_of_trapezoids_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_number_of_trapezoids_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_odd_numbers_in_an_interval_range.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_odd_numbers_in_an_interval_range::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_operations_to_obtain_zero.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_operations_to_obtain_zero::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_partitions_with_even_sum_difference.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_partitions_with_even_sum_difference::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_partitions_with_max_min_difference_at_most_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_partitions_with_max_min_difference_at_most_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/count_primes.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_primes::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_special_triplets.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_special_triplets::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_square_submatrices_with_all_ones.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_square_submatrices_with_all_ones::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_square_sum_triples.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_square_sum_triples::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_subarrays_with_majority_element_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_subarrays_with_majority_element_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_subarrays_with_majority_element_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_subarrays_with_majority_element_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_submatrices_with_all_ones.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_submatrices_with_all_ones::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_submatrices_with_equal_frequence_of_x_and_y.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_submatrices_with_equal_frequence_of_x_and_y::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_submatrices_with_top_left_element_and_sum_less_than_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_submatrices_with_top_left_element_and_sum_less_than_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_the_number_of_complete_components.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_the_number_of_complete_components::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_the_number_of_computer_unlocking_permutations.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_the_number_of_computer_unlocking_permutations::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/count_the_number_of_incremovable_subarrays_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_the_number_of_incremovable_subarrays_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_the_number_of_special_characters_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_the_number_of_special_characters_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_the_number_of_special_characters_ii.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_the_number_of_special_characters_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_the_number_of_substrings_with_dominant_ones.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_the_number_of_substrings_with_dominant_ones::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/count_unguarded_cells_in_the_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::count_unguarded_cells_in_the_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/coupon_code_validator.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::coupon_code_validator::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/create_binary_tree_from_descriptions.rs:23:1
[INFO] [stdout]     |
[INFO] [stdout]  23 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::create_binary_tree_from_descriptions::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/create_components_with_same_value.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::create_components_with_same_value::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/cyclically_rotating_a_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::cyclically_rotating_a_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/daily_temperatures.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::daily_temperatures::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/decode_ways.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::decode_ways::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/decode_xored_permutation.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::decode_xored_permutation::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/delete_column_to_make_sorted.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::delete_column_to_make_sorted::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/delete_column_to_make_sorted_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::delete_column_to_make_sorted_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/delete_column_to_make_sorted_iii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::delete_column_to_make_sorted_iii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/delete_nodes_from_linked_list_present_in_array.rs:14:1
[INFO] [stdout]     |
[INFO] [stdout]  14 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::delete_nodes_from_linked_list_present_in_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/delete_the_middle_node_of_a_linked_list.rs:15:1
[INFO] [stdout]     |
[INFO] [stdout]  15 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::delete_the_middle_node_of_a_linked_list::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/destination_city.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::destination_city::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/destroying_asteroids.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::destroying_asteroids::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/detect_cycles_in_2d_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::detect_cycles_in_2d_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/determine_the_winner_of_a_bowling_game.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::determine_the_winner_of_a_bowling_game::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/diagonal_traverse.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::diagonal_traverse::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/difference_between_ones_and_zeros_in_row_and_column.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::difference_between_ones_and_zeros_in_row_and_column::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/distinct_subsequences.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::distinct_subsequences::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/distribute_elements_into_two_arrays_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::distribute_elements_into_two_arrays_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/distribute_money_to_maximum_children.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::distribute_money_to_maximum_children::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/divide_an_array_into_subarrays_with_minimum_cost_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::divide_an_array_into_subarrays_with_minimum_cost_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/double_modular_exponentiation.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::double_modular_exponentiation::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/earliest_finish_time_for_land_and_water_rides_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::earliest_finish_time_for_land_and_water_rides_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/earliest_finish_time_for_land_and_water_rides_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::earliest_finish_time_for_land_and_water_rides_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/edit_distance.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::edit_distance::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/equal_sum_grid_partition_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::equal_sum_grid_partition_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/excel_sheet_column_number.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::excel_sheet_column_number::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/excel_sheet_column_title.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::excel_sheet_column_title::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/final_value_of_variable_after_performing_operations.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::final_value_of_variable_after_performing_operations::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_a_safe_walk_through_a_grid.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_a_safe_walk_through_a_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_all_possible_stable_binary_arrays_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_all_possible_stable_binary_arrays_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_all_possible_stable_binary_arrays_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_all_possible_stable_binary_arrays_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_first_and_last_position_of_element_in_sorted_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_first_and_last_position_of_element_in_sorted_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_greatest_common_divisor_of_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_greatest_common_divisor_of_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_kth_bit_in_nth_binary_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_kth_bit_in_nth_binary_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_largest_group_size_of_m.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_largest_group_size_of_m::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_minimum_in_rotated_sorted_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_minimum_in_rotated_sorted_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_minimum_in_rotated_sorted_array_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_minimum_in_rotated_sorted_array_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_minimum_operations_to_make_all_elements_divisible_by_three.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_minimum_operations_to_make_all_elements_divisible_by_three::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_missing_elements.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_missing_elements::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_most_frequent_vowel_and_consonant.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_most_frequent_vowel_and_consonant::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_n_unique_integers_sum_up_to_zero.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_n_unique_integers_sum_up_to_zero::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_polygon_with_the_largest_perimeter.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_polygon_with_the_largest_perimeter::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_resultant_array_after_removing_anagrams.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_resultant_array_after_removing_anagrams::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_smallest_letter_greater_than_target.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_smallest_letter_greater_than_target::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_subtree_sizes_after_change.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_subtree_sizes_after_change::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_the_divisibility_array_of_a_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_divisibility_array_of_a_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_highest_altitude.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_highest_altitude::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_largest_almost_missing_integer.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_largest_almost_missing_integer::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_largest_area_of_square_inside_two_rectangle.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_largest_area_of_square_inside_two_rectangle::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_length_of_the_longest_common_prefix.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_length_of_the_longest_common_prefix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_the_maximum_divisibility_score.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_maximum_divisibility_score::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_minimum_amount_of_time_to_brew_potions.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_minimum_amount_of_time_to_brew_potions::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_minimum_and_maximum_number_of_nodes_between_critical_points.rs:15:1
[INFO] [stdout]     |
[INFO] [stdout]  15 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_minimum_and_maximum_number_of_nodes_between_critical_points::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_number_of_ways_to_place_people.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_number_of_ways_to_place_people::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_number_of_ways_to_place_people_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_number_of_ways_to_place_people_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_prefix_common_array_of_two_arrays.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_prefix_common_array_of_two_arrays::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_the_safest_path_in_a_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_safest_path_in_a_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_the_saftest_path_in_a_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_saftest_path_in_a_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_the_width_of_columns_of_a_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_width_of_columns_of_a_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_the_winning_player_in_coin_game.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_the_winning_player_in_coin_game::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_three_consecutive_integers_that_sum_to_a_given_number.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_three_consecutive_integers_that_sum_to_a_given_number::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_triangular_sum_of_an_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_triangular_sum_of_an_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_two_non_overlapping_sub_arrays_each_with_target_sum.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_two_non_overlapping_sub_arrays_each_with_target_sum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_unique_binary_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_unique_binary_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_winner_on_a_tic_tac_toe_game.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_winner_on_a_tic_tac_toe_game::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_x_sum_of_all_k_long_subarrays_i.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_x_sum_of_all_k_long_subarrays_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/find_x_sum_of_all_k_long_subarrays_ii.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_x_sum_of_all_k_long_subarrays_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/find_xor_beauty_of_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::find_xor_beauty_of_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/flip_square_submatrix_vertically.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::flip_square_submatrix_vertically::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/four_divisor.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::four_divisor::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/fraction_to_recurring_decimal.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::fraction_to_recurring_decimal::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/frequency_of_the_most_frequent_element.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::frequency_of_the_most_frequent_element::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/gcd_of_odd_and_even_sums.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::gcd_of_odd_and_even_sums::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/get_biggest_three_rhombus_sums_in_a_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::get_biggest_three_rhombus_sums_in_a_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/greatest_sum_divisible_by_three.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::greatest_sum_divisible_by_three::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/hash_divided_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::hash_divided_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/image_overlap.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::image_overlap::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/increment_submatrices_by_one.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::increment_submatrices_by_one::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/intersection_of_multiple_arrays.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::intersection_of_multiple_arrays::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/jewels_and_stones.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::jewels_and_stones::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/jump_game_iii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::jump_game_iii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/jump_game_iv.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::jump_game_iv::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/jump_game_ix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::jump_game_ix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/jump_game_v.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::jump_game_v::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/jump_game_vii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::jump_game_vii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/k_diff_pairs_in_an_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::k_diff_pairs_in_an_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/k_th_largest_perfect_subtree_size_in_binary_tree.rs:22:1
[INFO] [stdout]     |
[INFO] [stdout]  22 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::k_th_largest_perfect_subtree_size_in_binary_tree::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/keep_multiplying_found_values_by_two.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::keep_multiplying_found_values_by_two::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/largest_magic_square.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::largest_magic_square::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/largest_number_at_least_twice_of_others.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::largest_number_at_least_twice_of_others::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/largest_palindromic_number.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::largest_palindromic_number::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/largest_perimeter_triangle.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::largest_perimeter_triangle::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/largest_submatrix_with_rearrangements.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::largest_submatrix_with_rearrangements::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/largest_triangle_area.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::largest_triangle_area::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/last_day_where_you_can_still_cross.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::last_day_where_you_can_still_cross::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/least_number_of_unique_integers_after_k_removals.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::least_number_of_unique_integers_after_k_removals::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/left_and_right_sum_differences.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::left_and_right_sum_differences::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/length_of_longest_subarray_with_at_most_k_frequency.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::length_of_longest_subarray_with_at_most_k_frequency::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/lexicographically_smallest_negated_permutation_that_sums_to_target.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::lexicographically_smallest_negated_permutation_that_sums_to_target::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/lexicographically_smallest_permutation_greater_than_target.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::lexicographically_smallest_permutation_greater_than_target::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/lexicographically_smallest_string_after_applying_operations.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::lexicographically_smallest_string_after_applying_operations::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/license_key_formatting.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::license_key_formatting::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/longest_balanced_string_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_balanced_string_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/longest_balanced_string_ii.rs:4:1
[INFO] [stdout]     |
[INFO] [stdout]   4 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_balanced_string_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/longest_balanced_subarray_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_balanced_subarray_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_balanced_subarray_ii.rs:145:1
[INFO] [stdout]     |
[INFO] [stdout] 145 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_balanced_subarray_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_common_suffix_queries.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_common_suffix_queries::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_non_decreasing_subarray_from_two_arrays.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_non_decreasing_subarray_from_two_arrays::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_palindrome.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_palindrome::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_palindromic_subsequence.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_palindromic_subsequence::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_palindromic_subsequence_after_at_most_k_operations.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_palindromic_subsequence_after_at_most_k_operations::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_repeating_character_replacement.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_repeating_character_replacement::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/longest_subsequence_with_non_zero_bitwise_xor.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_subsequence_with_non_zero_bitwise_xor::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_substring_with_at_least_k_repeating_characters.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_substring_with_at_least_k_repeating_characters::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_uncommon_subsequence_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_uncommon_subsequence_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/longest_valid_parentheses.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::longest_valid_parentheses::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/magic_squares_in_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::magic_squares_in_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/make_array_elements_equal_to_zero.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::make_array_elements_equal_to_zero::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/make_lexicographically_smallest_array_by_swapping_elements.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::make_lexicographically_smallest_array_by_swapping_elements::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/make_sum_divisible_by_p.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::make_sum_divisible_by_p::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/max_area_of_island.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::max_area_of_island::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/max_dot_product_of_two_subsequences.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::max_dot_product_of_two_subsequences::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximal_rectangle.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximal_rectangle::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximize_active_section_with_trade_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximize_active_section_with_trade_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximize_area_of_square_hole_in_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximize_area_of_square_hole_in_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximize_spanning_tree_stability_with_upgrades.rs:42:1
[INFO] [stdout]     |
[INFO] [stdout]  42 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximize_spanning_tree_stability_with_upgrades::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_amount_of_money_robot_can_earn.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_amount_of_money_robot_can_earn::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_area_of_longest_diagonal_rectangle.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_area_of_longest_diagonal_rectangle::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_average_pass_ratio.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_average_pass_ratio::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_distance_between_a_pair_of_values.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_distance_between_a_pair_of_values::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_element_after_decreasing_and_rearranging.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_element_after_decreasing_and_rearranging::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_frequency_of_an_element_after_performing_operations_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_frequency_of_an_element_after_performing_operations_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_frequency_of_an_element_after_performing_operations_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_frequency_of_an_element_after_performing_operations_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_ice_cream_bars.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_ice_cream_bars::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_length_of_pair_chain.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_length_of_pair_chain::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_length_substring_with_two_occurrences.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_length_substring_with_two_occurrences::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_level_sum_of_a_binary_tree.rs:23:1
[INFO] [stdout]     |
[INFO] [stdout]  23 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_level_sum_of_a_binary_tree::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_matrix_sum.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_matrix_sum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_non_negative_product_in_a_matrix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_non_negative_product_in_a_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_number_of_balloons.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_number_of_balloons::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_number_of_distinct_elements_after_operations.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_number_of_distinct_elements_after_operations::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_number_of_jumps_to_reach_the_last_index.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_number_of_jumps_to_reach_the_last_index::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_number_of_non_overlapping_palindrome_substrings.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_number_of_non_overlapping_palindrome_substrings::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_number_of_operations_to_move_ones_to_the_end.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_number_of_operations_to_move_ones_to_the_end::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_number_of_words_you_can_type.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_number_of_words_you_can_type::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_path_score_in_a_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_path_score_in_a_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_points_inside_the_square.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_points_inside_the_square::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_points_you_can_obtain_from_cards.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_points_you_can_obtain_from_cards::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_prime_difference.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_prime_difference::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_product_of_two_digits.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_product_of_two_digits::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_product_of_two_elements_in_an_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_product_of_two_elements_in_an_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_product_subarray.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_product_subarray::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_square_area_by_removing_fences_from_a_field.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_square_area_by_removing_fences_from_a_field::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_strenght_of_a_group.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_strenght_of_a_group::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_subarray.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_subarray::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_subarray_sum_with_length_divisible_by_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_subarray_sum_with_length_divisible_by_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/maximum_total_damage_with_spell_casting.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_total_damage_with_spell_casting::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_total_subarray_value_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_total_subarray_value_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/maximum_twin_sum_of_a_linked_list.rs:15:1
[INFO] [stdout]     |
[INFO] [stdout]  15 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::maximum_twin_sum_of_a_linked_list::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/meeting_room_iii.rs:4:1
[INFO] [stdout]     |
[INFO] [stdout]   4 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::meeting_room_iii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimize_hamming_distance_after_swap_operations.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimize_hamming_distance_after_swap_operations::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimize_maximum_pair_sum_in_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimize_maximum_pair_sum_in_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_absolute_difference.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_absolute_difference::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_absolute_difference_in_sliding_submatrix.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_absolute_difference_in_sliding_submatrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_absolute_distance_between_mirror_pairs.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_absolute_distance_between_mirror_pairs::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_amount_of_time_to_fill_cups.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_amount_of_time_to_fill_cups::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_ascii_delete_sum_for_two_strings.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_ascii_delete_sum_for_two_strings::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_changes_to_make_alternating_binary_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_changes_to_make_alternating_binary_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_common_value.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_common_value::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_cost_of_buying_candies_with_discount.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_cost_of_buying_candies_with_discount::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_cost_path_with_edge_reversals.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_cost_path_with_edge_reversals::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_cost_path_with_teleportations.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_cost_path_with_teleportations::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_cost_to_convert_string_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_cost_to_convert_string_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_cost_to_set_cooking_time.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_cost_to_set_cooking_time::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_deletions_for_at_most_k_distinct_characters.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_deletions_for_at_most_k_distinct_characters::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_deletions_to_make_string_balanced.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_deletions_to_make_string_balanced::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_difference_between_highest_and_lowest_of_k_scores.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_difference_between_highest_and_lowest_of_k_scores::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_distance_to_the_target_element.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_distance_to_the_target_element::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_element_after_replacement_with_digit_sum.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_element_after_replacement_with_digit_sum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_initial_energy_to_finish_tasks.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_initial_energy_to_finish_tasks::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_jumps_to_reach_end_via_prime_teleportation.rs:6:1
[INFO] [stdout]     |
[INFO] [stdout]   6 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_jumps_to_reach_end_via_prime_teleportation::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_k_to_reduce_array_within_limit.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_k_to_reduce_array_within_limit::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_moves_to_balance_circular_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_moves_to_balance_circular_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_moves_to_clean_the_classroom.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_moves_to_clean_the_classroom::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_moves_to_equal_array_elements.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_moves_to_equal_array_elements::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_moves_to_equal_array_elements_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_moves_to_equal_array_elements_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_moves_to_make_array_complementary.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_moves_to_make_array_complementary::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_moves_to_spread_stones_over_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_moves_to_spread_stones_over_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_number_of_flips_to_make_the_binary_string_alternating.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_flips_to_make_the_binary_string_alternating::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_number_of_increments_on_subarrays_to_form_a_target_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_increments_on_subarrays_to_form_a_target_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_number_of_operations_to_convert_time.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_operations_to_convert_time::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_number_of_operations_to_make_all_array_elements_equal_to_1.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_operations_to_make_all_array_elements_equal_to_1::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_number_of_people_to_teach.rs:5:1
[INFO] [stdout]     |
[INFO] [stdout]   5 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_people_to_teach::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_number_of_pushes_to_type_word_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_pushes_to_type_word_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_number_of_pushes_to_type_word_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_pushes_to_type_word_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_number_of_seconds_to_make_mountian_height_zero.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_number_of_seconds_to_make_mountian_height_zero::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_operations_to_convert_all_elements_to_zero.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_operations_to_convert_all_elements_to_zero::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_operations_to_make_a_uni_value_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_operations_to_make_a_uni_value_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_operations_to_make_the_integer_zero.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_operations_to_make_the_integer_zero::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_pair_removal_to_sort_array_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_pair_removal_to_sort_array_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_pair_removal_to_sort_array_ii.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_pair_removal_to_sort_array_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_removals_to_balance_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_removals_to_balance_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_score_of_a_path_between_two_cities.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_score_of_a_path_between_two_cities::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_score_triangulation_of_polygon.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_score_triangulation_of_polygon::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_swaps_to_arrange_a_binary_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_swaps_to_arrange_a_binary_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_time_difference.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_time_difference::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/minimum_time_to_complete_trips.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_time_to_complete_trips::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_time_to_make_rope_colorful.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_time_to_make_rope_colorful::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_time_visiting_all_points.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_time_visiting_all_points::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/minimum_total_distance_traveled.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::minimum_total_distance_traveled::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/mirror_distance_of_an_integer.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::mirror_distance_of_an_integer::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/most_popular_video_creator.rs:11:1
[INFO] [stdout]     |
[INFO] [stdout]  11 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::most_popular_video_creator::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/multiply_strings.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::multiply_strings::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/n_repeated_element_in_size_2n_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::n_repeated_element_in_size_2n_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/network_recovery_pathways.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::network_recovery_pathways::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/next_greater_numerically_balanced_number.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::next_greater_numerically_balanced_number::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/non_decreasing_subsequences.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::non_decreasing_subsequences::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/number_of_enclaves.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_enclaves::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_laser_beams_in_a_bank.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_laser_beams_in_a_bank::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/number_of_pairs_of_interchangeable_rectangles.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_pairs_of_interchangeable_rectangles::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_people_aware_of_a_secret.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_people_aware_of_a_secret::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_smooth_descent_period_of_a_stock.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_smooth_descent_period_of_a_stock::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_steps_to_reduce_a_number_in_binary_representation_to_one.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_steps_to_reduce_a_number_in_binary_representation_to_one::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/number_of_students_doing_homework_at_a_given_time.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_students_doing_homework_at_a_given_time::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/number_of_subarrays_that_match_a_pattern_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_subarrays_that_match_a_pattern_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_substrings_containing_all_three_characters.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_substrings_containing_all_three_characters::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_substrings_with_only_1s.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_substrings_with_only_1s::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_unique_xor_triplets_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_unique_xor_triplets_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_unique_xor_triplets_ii.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_unique_xor_triplets_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/number_of_ways_to_assign_edge_weights_i.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_ways_to_assign_edge_weights_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/number_of_ways_to_assign_edge_weights_ii.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_ways_to_assign_edge_weights_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_ways_to_divide_a_long_corridor.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_ways_to_divide_a_long_corridor::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_ways_to_paint_n_3_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::number_of_ways_to_paint_n_3_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/number_of_zero_filled_subarrays.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution {}
[INFO] [stdout]     | ^^^^^^^^^^^^^^^ `crate::number_of_zero_filled_subarrays::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/o1_matrix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::o1_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/one_bit_and_2_bit_characters.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::one_bit_and_2_bit_characters::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/ones_and_zeroes.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::ones_and_zeroes::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/optimal_partition_of_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::optimal_partition_of_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/pacific_atlantic_water_flow.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::pacific_atlantic_water_flow::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/painting_a_grid_with_three_different_colors.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::painting_a_grid_with_three_different_colors::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/palindrome_partitioning.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::palindrome_partitioning::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/palindrome_partitioning_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::palindrome_partitioning_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/pancake_sorting.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::pancake_sorting::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/parallels_courses_ii.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::parallels_courses_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/partition_array_according_to_given_pivot.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::partition_array_according_to_given_pivot::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/partitioning_into_minimum_number_of_deci_binary_numbers.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::partitioning_into_minimum_number_of_deci_binary_numbers::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/path_existence_queries_in_a_graph_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::path_existence_queries_in_a_graph_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/path_existence_queries_in_a_graph_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::path_existence_queries_in_a_graph_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/path_with_minimum_effort.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::path_with_minimum_effort::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/paths_in_matrix_whose_sum_is_divisible_by_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::paths_in_matrix_whose_sum_is_divisible_by_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/plates_between_candles.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::plates_between_candles::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/plus_one.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::plus_one::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/power_grid_maintenance.rs:57:1
[INFO] [stdout]     |
[INFO] [stdout]  57 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::power_grid_maintenance::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/predict_the_winner.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::predict_the_winner::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/prime_number_of_set_bits_in_binary_representation.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::prime_number_of_set_bits_in_binary_representation::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/prime_pair_with_target_sum.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::prime_pair_with_target_sum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/prison_cells_after_n_days.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::prison_cells_after_n_days::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/process_string_with_special_operations_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::process_string_with_special_operations_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/process_string_with_special_operations_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::process_string_with_special_operations_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/pyramid_transition_matrix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::pyramid_transition_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/check_if_binary_string_has_at_most_one_segment_of_ones.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::check_if_binary_string_has_at_most_one_segment_of_ones::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/check_if_strings_can_be_made_equal_with_operations_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::check_if_strings_can_be_made_equal_with_operations_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/construct_the_minimum_bitwise_array_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::construct_the_minimum_bitwise_array_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/earliest_finish_time_for_land_and_water_rides_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::earliest_finish_time_for_land_and_water_rides_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/largest_magic_square.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::largest_magic_square::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/number_of_unique_xor_triplets_ii.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::number_of_unique_xor_triplets_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/predict_the_winner.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::predict_the_winner::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/prime_number_of_set_bits_in_binary_representation.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::prime_number_of_set_bits_in_binary_representation::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/shift_2d_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::random_problem::shift_2d_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/rank_teams_by_votes.rs:4:1
[INFO] [stdout]     |
[INFO] [stdout]   4 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rank_teams_by_votes::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/rank_transform_of_an_array.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rank_transform_of_an_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/rearrange_characters_to_make_target_string.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rearrange_characters_to_make_target_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/rectangle_area.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rectangle_area::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/rectangle_overlap.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rectangle_overlap::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/remove_all_adjacent_duplicates_in_string_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::remove_all_adjacent_duplicates_in_string_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/remove_covered_intervals.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::remove_covered_intervals::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/remove_duplicate_letters.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::remove_duplicate_letters::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/remove_methods_from_project.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::remove_methods_from_project::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/removing_minimum_and_maximum_from_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::removing_minimum_and_maximum_from_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/replace_non_coprime_numbers_in_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::replace_non_coprime_numbers_in_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/reverse_bits.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::reverse_bits::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/reverse_degree_of_a_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::reverse_degree_of_a_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/rotate_function.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rotate_function::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/rotate_image.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rotate_image::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/rotate_list.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rotate_list::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/rotate_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rotate_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/rotated_digits.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rotated_digits::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/rotating_the_box.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::rotating_the_box::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/search_in_rotated_sorted_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::search_in_rotated_sorted_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/search_in_rotated_sorted_array_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::search_in_rotated_sorted_array_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/separate_squares_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::separate_squares_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/separate_the_digits_in_an_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::separate_the_digits_in_an_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sequential_digits.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sequential_digits::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/set_intersection_size_at_least_two.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::set_intersection_size_at_least_two::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/set_matrix_zeroes.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::set_matrix_zeroes::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/shift_2d_grid.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::shift_2d_grid::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/shortest_and_lexicographically_smallest_beautiful_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::shortest_and_lexicographically_smallest_beautiful_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/shortest_distance_to_target_string_in_a_circular_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::shortest_distance_to_target_string_in_a_circular_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/shortest_path_in_binary_matrix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::shortest_path_in_binary_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/simplify_path.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::simplify_path::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/sliding_window_maximum.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sliding_window_maximum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_divisible_digit_product_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_divisible_digit_product_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_integer_divisible_by_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_integer_divisible_by_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_missing_integer_greater_than_sequential_prefix_sum.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_missing_integer_greater_than_sequential_prefix_sum::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_missing_multiple_of_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_missing_multiple_of_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_number_with_all_set_bits.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_number_with_all_set_bits::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_palindromic_rearrangement_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_palindromic_rearrangement_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_stable_index_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_stable_index_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_stable_index_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_stable_index_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_subsequence_of_distinct_characters.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_subsequence_of_distinct_characters::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/smallest_subtree_with_all_the_deepest_nodes.rs:19:1
[INFO] [stdout]     |
[INFO] [stdout]  19 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::smallest_subtree_with_all_the_deepest_nodes::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sort_integers_by_the_number_of_1_bits.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sort_integers_by_the_number_of_1_bits::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sort_matrix_by_diagonals.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution {}
[INFO] [stdout]     | ^^^^^^^^^^^^^^^ `crate::sort_matrix_by_diagonals::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sort_vowels_in_a_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sort_vowels_in_a_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/special_binary_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::special_binary_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/special_positions_in_a_binary_matrix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::special_positions_in_a_binary_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/stone_game.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::stone_game::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/stone_game_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::stone_game_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/stone_game_iii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::stone_game_iii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/stone_game_iv.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::stone_game_iv::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/stone_game_ix.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::stone_game_ix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/stone_game_viii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::stone_game_viii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/subarray_product_less_than_k.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::subarray_product_less_than_k::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/substring_matching_pattern.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::substring_matching_pattern::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/successful_pairs_of_spells_and_potions.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::successful_pairs_of_spells_and_potions::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sudoku_solver.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution {}
[INFO] [stdout]     | ^^^^^^^^^^^^^^^ `crate::sudoku_solver::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sum_game.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sum_game::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sum_of_distances.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sum_of_distances::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sum_of_gcd_of_formed_pairs.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sum_of_gcd_of_formed_pairs::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/sum_of_root_to_leaf_binary_numbers.rs:22:1
[INFO] [stdout]     |
[INFO] [stdout]  22 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::sum_of_root_to_leaf_binary_numbers::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/swim_in_rising_water.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::swim_in_rising_water::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/taking_maximum_energy_from_the_mystic_dungeon.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::taking_maximum_energy_from_the_mystic_dungeon::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/the_k_th_lexicographical_string_of_all_happy_strings_of_length_n.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::the_k_th_lexicographical_string_of_all_happy_strings_of_length_n::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/the_two_sneaky_numbers_of_digitville.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::the_two_sneaky_numbers_of_digitville::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/top_k_frequent_words.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::top_k_frequent_words::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/total_waviness_of_numbers_in_range_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::total_waviness_of_numbers_in_range_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/transformed_array.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::transformed_array::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/transpose_matrix.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::transpose_matrix::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/trapping_rain_water.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::trapping_rain_water::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/triangle.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::triangle::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/trionic_array_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::trionic_array_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/trionic_array_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::trionic_array_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/twenty_four_game.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::twenty_four_game::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/two_best_non_overlapping_events.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::two_best_non_overlapping_events::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/two_furthest_houses_with_different_colors.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::two_furthest_houses_with_different_colors::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/unique_3_digit_even_numbers.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::unique_3_digit_even_numbers::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/unique_binary_search_trees_ii.rs:22:1
[INFO] [stdout]     |
[INFO] [stdout]  22 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::unique_binary_search_trees_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/unique_length_3_palindromic_subsequences.rs:2:1
[INFO] [stdout]     |
[INFO] [stdout]   2 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::unique_length_3_palindromic_subsequences::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/valid_sudoku.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution {}
[INFO] [stdout]     | ^^^^^^^^^^^^^^^ `crate::valid_sudoku::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/valid_triangle_number.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::valid_triangle_number::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/vowel_spellchecker.rs:3:1
[INFO] [stdout]     |
[INFO] [stdout]   3 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::vowel_spellchecker::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/vowels_game_in_a_string.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::vowels_game_in_a_string::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/water_bottles.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::water_bottles::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/water_bottles_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::water_bottles_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/weighted_word_mapping.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::weighted_word_mapping::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/words_within_two_edits_of_dictionary.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::words_within_two_edits_of_dictionary::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/daily_problem/xor_after_range_multiplication_queries_i.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::xor_after_range_multiplication_queries_i::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/xor_after_range_multiplication_queries_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::xor_after_range_multiplication_queries_ii::Solution`: not accessible
[INFO] [stdout]     |
[INFO] [stdout]    ::: src/random_problem/zero_array_transformation_ii.rs:1:1
[INFO] [stdout]     |
[INFO] [stdout]   1 | struct Solution;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^ `crate::zero_array_transformation_ii::Solution`: not accessible
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::cmp::Reverse`
[INFO] [stdout]  --> src/daily_problem/design_movie_rental_system.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cmp::Reverse;
[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: `HashSet`
[INFO] [stdout]  --> src/daily_problem/design_movie_rental_system.rs:2:43
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::collections::{BTreeSet, HashMap, HashSet};
[INFO] [stdout]   |                                           ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]  --> src/daily_problem/find_the_minimum_amount_of_time_to_brew_potions.rs:9:21
[INFO] [stdout]   |
[INFO] [stdout] 9 |             dp[i] = (skill[i] as i64 * mana[0] as i64);
[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] 9 -             dp[i] = (skill[i] as i64 * mana[0] as i64);
[INFO] [stdout] 9 +             dp[i] = skill[i] as i64 * mana[0] as i64;
[INFO] [stdout]   |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around index expression
[INFO] [stdout]   --> src/daily_problem/maximum_subarray_sum_with_length_divisible_by_k.rs:15:47
[INFO] [stdout]    |
[INFO] [stdout] 15 |             ans = ans.max(prefix_sums - k_sum[(i% k)]);
[INFO] [stdout]    |                                               ^    ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 15 -             ans = ans.max(prefix_sums - k_sum[(i% k)]);
[INFO] [stdout] 15 +             ans = ans.max(prefix_sums - k_sum[i% k]);
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around index expression
[INFO] [stdout]   --> src/daily_problem/maximum_subarray_sum_with_length_divisible_by_k.rs:16:19
[INFO] [stdout]    |
[INFO] [stdout] 16 |             k_sum[(i % k)] = k_sum[(i % k)].min(prefix_sums);
[INFO] [stdout]    |                   ^     ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 16 -             k_sum[(i % k)] = k_sum[(i % k)].min(prefix_sums);
[INFO] [stdout] 16 +             k_sum[i % k] = k_sum[(i % k)].min(prefix_sums);
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around index expression
[INFO] [stdout]   --> src/daily_problem/maximum_subarray_sum_with_length_divisible_by_k.rs:16:36
[INFO] [stdout]    |
[INFO] [stdout] 16 |             k_sum[(i % k)] = k_sum[(i % k)].min(prefix_sums);
[INFO] [stdout]    |                                    ^     ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 16 -             k_sum[(i % k)] = k_sum[(i % k)].min(prefix_sums);
[INFO] [stdout] 16 +             k_sum[(i % k)] = k_sum[i % k].min(prefix_sums);
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::BTreeSet`
[INFO] [stdout]  --> src/daily_problem/minimum_absolute_difference_in_sliding_submatrix.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::BTreeSet;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `HashMap`
[INFO] [stdout]  --> src/daily_problem/minimum_number_of_people_to_teach.rs:2:19
[INFO] [stdout]   |
[INFO] [stdout] 2 |     collections::{HashMap, HashSet},
[INFO] [stdout]   |                   ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around assigned value
[INFO] [stdout]   --> src/random_problem/find_polygon_with_the_largest_perimeter.rs:11:23
[INFO] [stdout]    |
[INFO] [stdout] 11 |                 ans = (ans.max(curr_sum + num as i64));
[INFO] [stdout]    |                       ^                              ^
[INFO] [stdout]    |
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 11 -                 ans = (ans.max(curr_sum + num as i64));
[INFO] [stdout] 11 +                 ans = ans.max(curr_sum + num as i64);
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `BTreeSet`
[INFO] [stdout]  --> src/random_problem/most_popular_video_creator.rs:2:24
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::collections::{BTreeSet, HashMap};
[INFO] [stdout]   |                        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::VecDeque`
[INFO] [stdout]  --> src/random_problem/network_recovery_pathways.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::VecDeque;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::ops::Deref`
[INFO] [stdout]  --> src/random_problem/transpose_matrix.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::ops::Deref;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `daily_problem::*`
[INFO] [stdout]  --> src/main.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | use daily_problem::*;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout] note: the lint level is defined here
[INFO] [stdout]  --> src/main.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | #[warn(unused_imports)]
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `random_problem::*`
[INFO] [stdout]  --> src/main.rs:8:5
[INFO] [stdout]   |
[INFO] [stdout] 8 | use random_problem::*;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout] note: the lint level is defined here
[INFO] [stdout]  --> src/main.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | #[warn(unused_imports)]
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated constant `std::i32::MIN`: replaced by the `MIN` associated constant on this type
[INFO] [stdout]  --> src/daily_problem/max_dot_product_of_two_subsequences.rs:7:42
[INFO] [stdout]   |
[INFO] [stdout] 7 |         let mut dp = vec![vec![std::i32::MIN; m + 1]; n + 1];
[INFO] [stdout]   |                                          ^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(deprecated)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated module `std::usize`: all constants in this module replaced by associated constants on the type
[INFO] [stdout]  --> src/daily_problem/minimum_number_of_people_to_teach.rs:3:5
[INFO] [stdout]   |
[INFO] [stdout] 3 |     usize,
[INFO] [stdout]   |     ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums1`
[INFO] [stdout]  --> src/daily_problem/construct_uniform_parity_array_i.rs:4:26
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn uniform_array(nums1: Vec<i32>) -> bool {
[INFO] [stdout]   |                          ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `points`
[INFO] [stdout]  --> src/daily_problem/count_number_of_trapezoids_ii.rs:4:29
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn count_trapezoids(points: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |                             ^^^^^^ help: if this is intentional, prefix it with an underscore: `_points`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/daily_problem/delete_nodes_from_linked_list_present_in_array.rs:24:24
[INFO] [stdout]    |
[INFO] [stdout] 24 |         while let Some(mut boxed_node) = node {
[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: unused variable: `n`
[INFO] [stdout]   --> src/daily_problem/design_movie_rental_system.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 18 |     fn new(n: i32, entries: Vec<Vec<i32>>) -> Self {
[INFO] [stdout]    |            ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `price`
[INFO] [stdout]   --> src/daily_problem/design_movie_rental_system.rs:73:21
[INFO] [stdout]    |
[INFO] [stdout] 73 |             .map(|&(price, shop, movie)| vec![shop, movie])
[INFO] [stdout]    |                     ^^^^^ help: if this is intentional, prefix it with an underscore: `_price`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `rows`
[INFO] [stdout]   --> src/daily_problem/design_spreadsheet.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 11 |     fn new(rows: i32) -> Self {
[INFO] [stdout]    |            ^^^^ help: if this is intentional, prefix it with an underscore: `_rows`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `v`
[INFO] [stdout]   --> src/daily_problem/design_spreadsheet.rs:21:21
[INFO] [stdout]    |
[INFO] [stdout] 21 |         if let Some(v) = self.sheet.get(&cell) {
[INFO] [stdout]    |                     ^ help: if this is intentional, prefix it with an underscore: `_v`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `m`
[INFO] [stdout]  --> src/daily_problem/find_the_minimum_amount_of_time_to_brew_potions.rs:6:13
[INFO] [stdout]   |
[INFO] [stdout] 6 |         let m = mana.len();
[INFO] [stdout]   |             ^ help: if this is intentional, prefix it with an underscore: `_m`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/daily_problem/find_triangular_sum_of_an_array.rs:5:13
[INFO] [stdout]   |
[INFO] [stdout] 5 |         let mut n = nums.len();
[INFO] [stdout]   |             ----^
[INFO] [stdout]   |             |
[INFO] [stdout]   |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/daily_problem/lexicographically_smallest_string_after_applying_operations.rs:6:13
[INFO] [stdout]   |
[INFO] [stdout] 6 |         let n = s.len();
[INFO] [stdout]   |             ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/daily_problem/maximize_area_of_square_hole_in_grid.rs:5:9
[INFO] [stdout]   |
[INFO] [stdout] 5 |         n: i32,
[INFO] [stdout]   |         ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `m`
[INFO] [stdout]  --> src/daily_problem/maximize_area_of_square_hole_in_grid.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 |         m: i32,
[INFO] [stdout]   |         ^ help: if this is intentional, prefix it with an underscore: `_m`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0596]: cannot borrow `tasks` as mutable, as it is not declared as mutable
[INFO] [stdout]  --> src/daily_problem/minimum_initial_energy_to_finish_tasks.rs:5:9
[INFO] [stdout]   |
[INFO] [stdout] 5 |         tasks.sort_unstable_by_key(|task| task[1] - task[0]);
[INFO] [stdout]   |         ^^^^^ cannot borrow as mutable
[INFO] [stdout]   |
[INFO] [stdout] help: consider changing this to be mutable
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn minimum_effort(mut tasks: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/daily_problem/minimum_number_of_people_to_teach.rs:11:13
[INFO] [stdout]    |
[INFO] [stdout] 11 |         let mut lang_map: Vec<HashSet<i32>> = languages
[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/daily_problem/minimum_operations_to_convert_all_elements_to_zero.rs:5:13
[INFO] [stdout]   |
[INFO] [stdout] 5 |         let mut s: Vec<i32> = 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/daily_problem/minimum_operations_to_convert_all_elements_to_zero.rs:6:13
[INFO] [stdout]   |
[INFO] [stdout] 6 |         let mut ans = 0;
[INFO] [stdout]   |             ----^^^
[INFO] [stdout]   |             |
[INFO] [stdout]   |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/daily_problem/minimum_operations_to_convert_all_elements_to_zero.rs:5:13
[INFO] [stdout]   |
[INFO] [stdout] 5 |         let mut s: Vec<i32> = Vec::new();
[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/daily_problem/minimum_operations_to_convert_all_elements_to_zero.rs:8:13
[INFO] [stdout]   |
[INFO] [stdout] 8 |         for num in nums {}
[INFO] [stdout]   |             ^^^ help: if this is intentional, prefix it with an underscore: `_num`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/daily_problem/minimum_operations_to_make_the_integer_zero.rs:6:17
[INFO] [stdout]   |
[INFO] [stdout] 6 |             let mut x: i64 = num1 as i64 - k * num2 as i64;
[INFO] [stdout]   |                 ----^
[INFO] [stdout]   |                 |
[INFO] [stdout]   |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/daily_problem/minimum_score_of_a_path_between_two_cities.rs:4:22
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn min_score(n: i32, roads: Vec<Vec<i32>>) -> i32 {
[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/daily_problem/separate_squares_i.rs:20:13
[INFO] [stdout]    |
[INFO] [stdout] 20 |         let mut max_y: f64 = squares
[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/daily_problem/water_bottles.rs:4:30
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn num_water_bottles(mut num_bottles: i32, mut num_exchange: i32) -> i32 {
[INFO] [stdout]   |                              ----^^^^^^^^^^^
[INFO] [stdout]   |                              |
[INFO] [stdout]   |                              help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/daily_problem/water_bottles.rs:4:52
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn num_water_bottles(mut num_bottles: i32, mut num_exchange: i32) -> i32 {
[INFO] [stdout]   |                                                    ----^^^^^^^^^^^^
[INFO] [stdout]   |                                                    |
[INFO] [stdout]   |                                                    help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/random_problem/closest_dessert_cost.rs:51:14
[INFO] [stdout]    |
[INFO] [stdout] 51 |         let (mut left_found, mut right_found) = (false, false);
[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/random_problem/closest_dessert_cost.rs:51:30
[INFO] [stdout]    |
[INFO] [stdout] 51 |         let (mut left_found, mut right_found) = (false, false);
[INFO] [stdout]    |                              ----^^^^^^^^^^^
[INFO] [stdout]    |                              |
[INFO] [stdout]    |                              help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `left_found`
[INFO] [stdout]   --> src/random_problem/closest_dessert_cost.rs:51:14
[INFO] [stdout]    |
[INFO] [stdout] 51 |         let (mut left_found, mut right_found) = (false, false);
[INFO] [stdout]    |              ^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_left_found`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `right_found`
[INFO] [stdout]   --> src/random_problem/closest_dessert_cost.rs:51:30
[INFO] [stdout]    |
[INFO] [stdout] 51 |         let (mut left_found, mut right_found) = (false, false);
[INFO] [stdout]    |                              ^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_right_found`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `grid`
[INFO] [stdout]  --> src/random_problem/find_the_safest_path_in_a_grid.rs:4:36
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn maximum_safeness_FACTOR(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |                                    ^^^^ help: if this is intentional, prefix it with an underscore: `_grid`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums1`
[INFO] [stdout]  --> src/daily_problem/construct_uniform_parity_array_i.rs:4:26
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn uniform_array(nums1: Vec<i32>) -> bool {
[INFO] [stdout]   |                          ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `ret_2`
[INFO] [stdout]   --> src/random_problem/implement_trie_prefix_tree.rs:81:9
[INFO] [stdout]    |
[INFO] [stdout] 81 |     let ret_2: bool = obj.search("word".to_string());
[INFO] [stdout]    |         ^^^^^ help: if this is intentional, prefix it with an underscore: `_ret_2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `ret_3`
[INFO] [stdout]   --> src/random_problem/implement_trie_prefix_tree.rs:82:9
[INFO] [stdout]    |
[INFO] [stdout] 82 |     let ret_3: bool = obj.starts_with("wor".to_string());
[INFO] [stdout]    |         ^^^^^ help: if this is intentional, prefix it with an underscore: `_ret_3`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `points`
[INFO] [stdout]  --> src/daily_problem/count_number_of_trapezoids_ii.rs:4:29
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn count_trapezoids(points: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |                             ^^^^^^ help: if this is intentional, prefix it with an underscore: `_points`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/random_problem/least_number_of_unique_integers_after_k_removals.rs:9:13
[INFO] [stdout]   |
[INFO] [stdout] 9 |         let n = arr.len();
[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/random_problem/longest_balanced_subarray_ii.rs:49:13
[INFO] [stdout]    |
[INFO] [stdout] 49 |         let mut tree = vec![Node::new(); 4 * n + 5];
[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/daily_problem/delete_nodes_from_linked_list_present_in_array.rs:24:24
[INFO] [stdout]    |
[INFO] [stdout] 24 |         while let Some(mut boxed_node) = node {
[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: unused variable: `n`
[INFO] [stdout]   --> src/daily_problem/design_movie_rental_system.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 18 |     fn new(n: i32, entries: Vec<Vec<i32>>) -> Self {
[INFO] [stdout]    |            ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `s` is never read
[INFO] [stdout]   --> src/random_problem/minimum_moves_to_balance_circular_array.rs:31:25
[INFO] [stdout]    |
[INFO] [stdout] 31 |             let mut s = 0;
[INFO] [stdout]    |                         ^ this value is reassigned later and never used
[INFO] [stdout] ...
[INFO] [stdout] 35 |                 s = balance[left] + balance[right];
[INFO] [stdout]    |                 ---------------------------------- `s` is overwritten here before the previous value is read
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `price`
[INFO] [stdout]   --> src/daily_problem/design_movie_rental_system.rs:73:21
[INFO] [stdout]    |
[INFO] [stdout] 73 |             .map(|&(price, shop, movie)| vec![shop, movie])
[INFO] [stdout]    |                     ^^^^^ help: if this is intentional, prefix it with an underscore: `_price`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `rows`
[INFO] [stdout]   --> src/daily_problem/design_spreadsheet.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 11 |     fn new(rows: i32) -> Self {
[INFO] [stdout]    |            ^^^^ help: if this is intentional, prefix it with an underscore: `_rows`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `v`
[INFO] [stdout]   --> src/daily_problem/design_spreadsheet.rs:21:21
[INFO] [stdout]    |
[INFO] [stdout] 21 |         if let Some(v) = self.sheet.get(&cell) {
[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/random_problem/prison_cells_after_n_days.rs:29:9
[INFO] [stdout]    |
[INFO] [stdout] 29 |     let mut cells = vec![0,1,0,1,1,0,0,1];
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `m`
[INFO] [stdout]  --> src/daily_problem/find_the_minimum_amount_of_time_to_brew_potions.rs:6:13
[INFO] [stdout]   |
[INFO] [stdout] 6 |         let m = mana.len();
[INFO] [stdout]   |             ^ help: if this is intentional, prefix it with an underscore: `_m`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] Some errors have detailed explanations: E0425, E0596.
[INFO] [stdout] 
[INFO] [stdout] For more information about an error, try `rustc --explain E0425`.
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/daily_problem/find_triangular_sum_of_an_array.rs:5:13
[INFO] [stdout]   |
[INFO] [stdout] 5 |         let mut n = nums.len();
[INFO] [stdout]   |             ----^
[INFO] [stdout]   |             |
[INFO] [stdout]   |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `LeetCodeByNight` (bin "LeetCodeByNight") due to 2 previous errors; 49 warnings emitted
[INFO] [stderr] warning: build failed, waiting for other jobs to finish...
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/daily_problem/lexicographically_smallest_string_after_applying_operations.rs:6:13
[INFO] [stdout]   |
[INFO] [stdout] 6 |         let n = s.len();
[INFO] [stdout]   |             ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/daily_problem/maximize_area_of_square_hole_in_grid.rs:5:9
[INFO] [stdout]   |
[INFO] [stdout] 5 |         n: i32,
[INFO] [stdout]   |         ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `m`
[INFO] [stdout]  --> src/daily_problem/maximize_area_of_square_hole_in_grid.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 |         m: i32,
[INFO] [stdout]   |         ^ help: if this is intentional, prefix it with an underscore: `_m`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0596]: cannot borrow `tasks` as mutable, as it is not declared as mutable
[INFO] [stdout]  --> src/daily_problem/minimum_initial_energy_to_finish_tasks.rs:5:9
[INFO] [stdout]   |
[INFO] [stdout] 5 |         tasks.sort_unstable_by_key(|task| task[1] - task[0]);
[INFO] [stdout]   |         ^^^^^ cannot borrow as mutable
[INFO] [stdout]   |
[INFO] [stdout] help: consider changing this to be mutable
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn minimum_effort(mut tasks: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/daily_problem/minimum_number_of_people_to_teach.rs:11:13
[INFO] [stdout]    |
[INFO] [stdout] 11 |         let mut lang_map: Vec<HashSet<i32>> = languages
[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/daily_problem/minimum_operations_to_convert_all_elements_to_zero.rs:5:13
[INFO] [stdout]   |
[INFO] [stdout] 5 |         let mut s: Vec<i32> = 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/daily_problem/minimum_operations_to_convert_all_elements_to_zero.rs:6:13
[INFO] [stdout]   |
[INFO] [stdout] 6 |         let mut ans = 0;
[INFO] [stdout]   |             ----^^^
[INFO] [stdout]   |             |
[INFO] [stdout]   |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/daily_problem/minimum_operations_to_convert_all_elements_to_zero.rs:5:13
[INFO] [stdout]   |
[INFO] [stdout] 5 |         let mut s: Vec<i32> = Vec::new();
[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/daily_problem/minimum_operations_to_convert_all_elements_to_zero.rs:8:13
[INFO] [stdout]   |
[INFO] [stdout] 8 |         for num in nums {}
[INFO] [stdout]   |             ^^^ help: if this is intentional, prefix it with an underscore: `_num`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/daily_problem/minimum_operations_to_make_the_integer_zero.rs:6:17
[INFO] [stdout]   |
[INFO] [stdout] 6 |             let mut x: i64 = num1 as i64 - k * num2 as i64;
[INFO] [stdout]   |                 ----^
[INFO] [stdout]   |                 |
[INFO] [stdout]   |                 help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/daily_problem/minimum_score_of_a_path_between_two_cities.rs:4:22
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn min_score(n: i32, roads: Vec<Vec<i32>>) -> i32 {
[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/daily_problem/separate_squares_i.rs:20:13
[INFO] [stdout]    |
[INFO] [stdout] 20 |         let mut max_y: f64 = squares
[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/daily_problem/water_bottles.rs:4:30
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn num_water_bottles(mut num_bottles: i32, mut num_exchange: i32) -> i32 {
[INFO] [stdout]   |                              ----^^^^^^^^^^^
[INFO] [stdout]   |                              |
[INFO] [stdout]   |                              help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]  --> src/daily_problem/water_bottles.rs:4:52
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn num_water_bottles(mut num_bottles: i32, mut num_exchange: i32) -> i32 {
[INFO] [stdout]   |                                                    ----^^^^^^^^^^^^
[INFO] [stdout]   |                                                    |
[INFO] [stdout]   |                                                    help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/random_problem/closest_dessert_cost.rs:51:14
[INFO] [stdout]    |
[INFO] [stdout] 51 |         let (mut left_found, mut right_found) = (false, false);
[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/random_problem/closest_dessert_cost.rs:51:30
[INFO] [stdout]    |
[INFO] [stdout] 51 |         let (mut left_found, mut right_found) = (false, false);
[INFO] [stdout]    |                              ----^^^^^^^^^^^
[INFO] [stdout]    |                              |
[INFO] [stdout]    |                              help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `left_found`
[INFO] [stdout]   --> src/random_problem/closest_dessert_cost.rs:51:14
[INFO] [stdout]    |
[INFO] [stdout] 51 |         let (mut left_found, mut right_found) = (false, false);
[INFO] [stdout]    |              ^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_left_found`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `right_found`
[INFO] [stdout]   --> src/random_problem/closest_dessert_cost.rs:51:30
[INFO] [stdout]    |
[INFO] [stdout] 51 |         let (mut left_found, mut right_found) = (false, false);
[INFO] [stdout]    |                              ^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_right_found`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `grid`
[INFO] [stdout]  --> src/random_problem/find_the_safest_path_in_a_grid.rs:4:36
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn maximum_safeness_FACTOR(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |                                    ^^^^ help: if this is intentional, prefix it with an underscore: `_grid`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `ret_2`
[INFO] [stdout]   --> src/random_problem/implement_trie_prefix_tree.rs:81:9
[INFO] [stdout]    |
[INFO] [stdout] 81 |     let ret_2: bool = obj.search("word".to_string());
[INFO] [stdout]    |         ^^^^^ help: if this is intentional, prefix it with an underscore: `_ret_2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `ret_3`
[INFO] [stdout]   --> src/random_problem/implement_trie_prefix_tree.rs:82:9
[INFO] [stdout]    |
[INFO] [stdout] 82 |     let ret_3: bool = obj.starts_with("wor".to_string());
[INFO] [stdout]    |         ^^^^^ help: if this is intentional, prefix it with an underscore: `_ret_3`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/random_problem/least_number_of_unique_integers_after_k_removals.rs:9:13
[INFO] [stdout]   |
[INFO] [stdout] 9 |         let n = arr.len();
[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/random_problem/longest_balanced_subarray_ii.rs:49:13
[INFO] [stdout]    |
[INFO] [stdout] 49 |         let mut tree = vec![Node::new(); 4 * n + 5];
[INFO] [stdout]    |             ----^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `s` is never read
[INFO] [stdout]   --> src/random_problem/minimum_moves_to_balance_circular_array.rs:31:25
[INFO] [stdout]    |
[INFO] [stdout] 31 |             let mut s = 0;
[INFO] [stdout]    |                         ^ this value is reassigned later and never used
[INFO] [stdout] ...
[INFO] [stdout] 35 |                 s = balance[left] + balance[right];
[INFO] [stdout]    |                 ---------------------------------- `s` is overwritten here before the previous value is read
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/random_problem/prison_cells_after_n_days.rs:29:9
[INFO] [stdout]    |
[INFO] [stdout] 29 |     let mut cells = vec![0,1,0,1,1,0,0,1];
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] Some errors have detailed explanations: E0425, E0596.
[INFO] [stdout] 
[INFO] [stdout] For more information about an error, try `rustc --explain E0425`.
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `LeetCodeByNight` (bin "LeetCodeByNight" test) due to 2 previous errors; 49 warnings emitted
[INFO] [stderr] warning: unused dependency `ran`
[INFO] [stderr]  --> Cargo.toml:2:1
[INFO] [stderr]   |
[INFO] [stderr] 2 | ran = "2.0.1"
[INFO] [stderr]   | ^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `cargo::unused_dependencies` is set to `warn` by default
[INFO] [stderr] help: consider removing the dependency on `ran`
[INFO] [stderr] warning: `LeetCodeByNight` (manifest) generated 1 warning
[INFO] running `Command { std: "docker" "inspect" "68bce365134e02c9b5a02bfcbf918bb53f0e184ccecf84a2e20ac0ea21872fcf", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "68bce365134e02c9b5a02bfcbf918bb53f0e184ccecf84a2e20ac0ea21872fcf", kill_on_drop: false }`
[INFO] [stdout] 68bce365134e02c9b5a02bfcbf918bb53f0e184ccecf84a2e20ac0ea21872fcf
