[INFO] cloning repository https://github.com/marverlous811/100-days-rust-agorithms
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/marverlous811/100-days-rust-agorithms" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fmarverlous811%2F100-days-rust-agorithms", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fmarverlous811%2F100-days-rust-agorithms'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] c4076129b8c28b929eb0419020952ebf8ef7d215
[INFO] testing marverlous811/100-days-rust-agorithms against master#733b47ea4b1b86216f14ef56e49440c33933f230+rustflags=-Copt-level=3 for pr-138759-retry
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fmarverlous811%2F100-days-rust-agorithms" "/workspace/builds/worker-3-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/marverlous811/100-days-rust-agorithms
[INFO] finished tweaking git repo https://github.com/marverlous811/100-days-rust-agorithms
[INFO] tweaked toml for git repo https://github.com/marverlous811/100-days-rust-agorithms written to /workspace/builds/worker-3-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/marverlous811/100-days-rust-agorithms on toolchain 733b47ea4b1b86216f14ef56e49440c33933f230
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+733b47ea4b1b86216f14ef56e49440c33933f230" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/marverlous811/100-days-rust-agorithms 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" "+733b47ea4b1b86216f14ef56e49440c33933f230" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+733b47ea4b1b86216f14ef56e49440c33933f230" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 0504881203b33da93c3f8689f9e8433b8c28ee7de0b84e9d90312ecc188e84f6
[INFO] running `Command { std: "docker" "start" "-a" "0504881203b33da93c3f8689f9e8433b8c28ee7de0b84e9d90312ecc188e84f6", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "0504881203b33da93c3f8689f9e8433b8c28ee7de0b84e9d90312ecc188e84f6", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "0504881203b33da93c3f8689f9e8433b8c28ee7de0b84e9d90312ecc188e84f6", kill_on_drop: false }`
[INFO] [stdout] 0504881203b33da93c3f8689f9e8433b8c28ee7de0b84e9d90312ecc188e84f6
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid -Copt-level=3" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+733b47ea4b1b86216f14ef56e49440c33933f230" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 898e9cdb324fa0b7544614bc9f81c9f5b466da97b471c72459e8485d80204869
[INFO] running `Command { std: "docker" "start" "-a" "898e9cdb324fa0b7544614bc9f81c9f5b466da97b471c72459e8485d80204869", kill_on_drop: false }`
[INFO] [stderr]    Compiling leetcode-100-days-challenge v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused imports: `borrow::Borrow` and `clone`
[INFO] [stdout]  --> src/common/binary_tree.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, clone, rc::Rc};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^                 ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::cell::RefCell`
[INFO] [stdout]  --> src/day_13/mod.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::RefCell;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::vec`
[INFO] [stdout]  --> src/day_16/mod.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::vec;
[INFO] [stdout]   |     ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashSet`
[INFO] [stdout]  --> src/day_34/mod.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::collections::HashSet;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `collections::HashMap`
[INFO] [stdout]  --> src/day_39/mod.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{cell::RefCell, collections::HashMap, rc::Rc};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::BorrowMut`
[INFO] [stdout]  --> src/day_34/mod.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::BorrowMut;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `borrow::Borrow`
[INFO] [stdout]  --> src/day_38/mod.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, rc::Rc};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/day_26/mod.rs:51:7
[INFO] [stdout]    |
[INFO] [stdout] 51 |   let mut target = word.clone().chars().collect::<Vec<char>>();
[INFO] [stdout]    |       ----^^^^^^
[INFO] [stdout]    |       |
[INFO] [stdout]    |       help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `res` is never read
[INFO] [stdout]  --> src/day_48/mod.rs:5:11
[INFO] [stdout]   |
[INFO] [stdout] 5 |   let mut res = 1;
[INFO] [stdout]   |           ^^^
[INFO] [stdout]   |
[INFO] [stdout]   = help: maybe it is overwritten before being read?
[INFO] [stdout]   = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/common/binary_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `array_to_bst` is never used
[INFO] [stdout]   --> src/common/binary_tree.rs:10:4
[INFO] [stdout]    |
[INFO] [stdout] 10 | fn array_to_bst(nums: Vec<i32>, start: usize, end: usize) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `new_with_children`, `from_arr`, and `to_arr` are never used
[INFO] [stdout]   --> src/common/binary_tree.rs:25:10
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl TreeNode {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 24 |   #[inline]
[INFO] [stdout] 25 |   pub fn new(val: i32) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |   pub fn new_with_children(
[INFO] [stdout]    |          ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |   pub fn from_arr(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |   pub fn to_arr(&self, data: &mut Vec<i32>) {
[INFO] [stdout]    |          ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/common/link_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `new_with_next`, `from_vec`, `add_node`, and `to_vec` are never used
[INFO] [stdout]   --> src/common/link_list.rs:8:10
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl ListNode {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 8  |   pub fn new(val: i32) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 12 |   pub fn new_with_next(val: i32, next: Option<Box<ListNode>>) -> Self {
[INFO] [stdout]    |          ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |   pub fn from_vec(vals: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |   pub fn add_node(&mut self, node: Option<Box<ListNode>>) {
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |   pub fn to_vec(&self) -> Vec<i32> {
[INFO] [stdout]    |          ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LinkedListNode` is never constructed
[INFO] [stdout]  --> src/common/linked_list.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct LinkedListNode {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `new_with_next`, `from_vec`, and `to_vec` are never used
[INFO] [stdout]   --> src/common/linked_list.rs:10:10
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl LinkedListNode {
[INFO] [stdout]    | ------------------- associated items in this implementation
[INFO] [stdout] 10 |   pub fn new(val: i32) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |   pub fn new_with_next(val: i32, next: Option<Rc<RefCell<LinkedListNode>>>) -> Self {
[INFO] [stdout]    |          ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |   pub fn from_vec(vals: Vec<i32>) -> Option<Rc<RefCell<LinkedListNode>>> {
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |   pub fn to_vec(&self, acc: &mut Vec<i32>) {
[INFO] [stdout]    |          ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search` is never used
[INFO] [stdout]  --> src/common/search.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn binary_search(nums: &Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `read_i32_input_from_file` is never used
[INFO] [stdout]  --> src/helper/mod.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn read_i32_input_from_file(file_path: &str) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_insert` is never used
[INFO] [stdout]  --> src/day_1/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_profit` is never used
[INFO] [stdout]  --> src/day_10/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]  --> src/day_11/mod.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_two_lists` is never used
[INFO] [stdout]  --> src/day_12/mod.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn merge_two_lists(list1: Option<Box<ListNode>>, list2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `has_cycle` is never used
[INFO] [stdout]  --> src/day_13/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn has_cycle(root: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_intersection_node` is never used
[INFO] [stdout]  --> src/day_14/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn get_intersection_node(
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reserve_linked_list` is never used
[INFO] [stdout]  --> src/day_15/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn reserve_linked_list(root: Option<Rc<RefCell<LinkedListNode>>>) -> Option<Rc<RefCell<LinkedListNode>>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]  --> src/day_16/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid` is never used
[INFO] [stdout]  --> src/day_17/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn is_valid(s: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `move_zeroes` is never used
[INFO] [stdout]  --> src/day_18/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn move_zeroes(nums: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `move_zeroes_optz` is never used
[INFO] [stdout]   --> src/day_18/mod.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn move_zeroes_optz(nums: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number` is never used
[INFO] [stdout]  --> src/day_19/mod.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn single_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number_optz` is never used
[INFO] [stdout]   --> src/day_19/mod.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub fn single_number_optz(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `inorder_traversal_vec` is never used
[INFO] [stdout]  --> src/day_2/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn inorder_traversal_vec(root: Option<Rc<RefCell<TreeNode>>>, data: &mut Vec<i32>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `inorder_traversal` is never used
[INFO] [stdout]   --> src/day_2/mod.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `majority_element` is never used
[INFO] [stdout]  --> src/day_20/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `ez_majority_element` is never used
[INFO] [stdout]   --> src/day_20/mod.rs:32:4
[INFO] [stdout]    |
[INFO] [stdout] 32 | fn ez_majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `letter_combinations` is never used
[INFO] [stdout]  --> src/day_21/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `parenthesis_dfs` is never used
[INFO] [stdout]  --> src/day_22/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn parenthesis_dfs(left: i32, right: i32, s: &mut String, res: &mut Vec<String>) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `generate_parenthesis` is never used
[INFO] [stdout]   --> src/day_22/mod.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn generate_parenthesis(n: i32) -> Vec<String> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `generator` is never used
[INFO] [stdout]  --> src/day_23/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn generator(candidates: Vec<i32>, target: i32, start: i32, path: &mut Vec<i32>, res: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `combination_sum` is never used
[INFO] [stdout]   --> src/day_23/mod.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn combination_sum(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `backtrack` is never used
[INFO] [stdout]  --> src/day_24/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn backtrack(nums: &mut Vec<i32>, left: usize, right: usize, result: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `permute` is never used
[INFO] [stdout]   --> src/day_24/mod.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `backtrack` is never used
[INFO] [stdout]  --> src/day_25/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn backtrack(nums: Vec<i32>, size: usize, start: usize, tmp: &mut Vec<i32>, res: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `subsets` is never used
[INFO] [stdout]   --> src/day_25/mod.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `backtrack` is never used
[INFO] [stdout]  --> src/day_26/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn backtrack(
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `exist` is never used
[INFO] [stdout]   --> src/day_26/mod.rs:50:8
[INFO] [stdout]    |
[INFO] [stdout] 50 | pub fn exist(board: Vec<Vec<char>>, word: String) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_str_palindrome` is never used
[INFO] [stdout]  --> src/day_27/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn is_str_palindrome(s: &str) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `backtrack_partition` is never used
[INFO] [stdout]   --> src/day_27/mod.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn backtrack_partition(s: &str, start: usize, path: &mut Vec<String>, res: &mut Vec<Vec<String>>) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `partition` is never used
[INFO] [stdout]   --> src/day_27/mod.rs:35:8
[INFO] [stdout]    |
[INFO] [stdout] 35 | pub fn partition(s: String) -> Vec<Vec<String>> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search` is never used
[INFO] [stdout]  --> src/day_28/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn binary_search(nums: &Vec<i32>, target: i32, low: i32, high: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_pivot` is never used
[INFO] [stdout]   --> src/day_28/mod.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn find_pivot(nums: &Vec<i32>, low: i32, high: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search` is never used
[INFO] [stdout]   --> src/day_28/mod.rs:43:8
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_range` is never used
[INFO] [stdout]  --> src/day_29/mod.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn search_range(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_mirror` is never used
[INFO] [stdout]  --> src/day_3/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn is_mirror(left: Option<Rc<RefCell<TreeNode>>>, right: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_symmetric` is never used
[INFO] [stdout]   --> src/day_3/mod.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_matrix` is never used
[INFO] [stdout]  --> src/day_30/mod.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_pivot` is never used
[INFO] [stdout]  --> src/day_31/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn find_pivot(nums: &Vec<i32>, left: i32, right: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_min` is never used
[INFO] [stdout]   --> src/day_31/mod.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bst_dfs_validate` is never used
[INFO] [stdout]  --> src/day_32/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn bst_dfs_validate(root: Option<Rc<RefCell<TreeNode>>>, left: Option<i32>, right: Option<i32>) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid_bst` is never used
[INFO] [stdout]   --> src/day_32/mod.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `dfs_level_travesal` is never used
[INFO] [stdout]  --> src/day_33/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn dfs_level_travesal(root: Option<Rc<RefCell<TreeNode>>>, level: i32, res: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `level_order` is never used
[INFO] [stdout]   --> src/day_33/mod.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: static `PRE_IDX` is never used
[INFO] [stdout]  --> src/day_34/mod.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | static mut PRE_IDX: i32 = 0;
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_tree_helper` is never used
[INFO] [stdout]  --> src/day_34/mod.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn build_tree_helper(
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_tree` is never used
[INFO] [stdout]   --> src/day_34/mod.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub fn build_tree(preorder: Vec<i32>, inorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `preorder_traverse` is never used
[INFO] [stdout]  --> src/day_35/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn preorder_traverse(root: Option<Rc<RefCell<TreeNode>>>, v: &mut Vec<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `flatten` is never used
[INFO] [stdout]   --> src/day_35/mod.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `right_side_view_tranversal` is never used
[INFO] [stdout]  --> src/day_36/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn right_side_view_tranversal(root: Option<Rc<RefCell<TreeNode>>>, level: usize, result: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `right_side_view` is never used
[INFO] [stdout]   --> src/day_36/mod.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `inorder_traversal` is never used
[INFO] [stdout]  --> src/day_37/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>, res: &mut Vec<i32>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `kth_smallest` is never used
[INFO] [stdout]   --> src/day_37/mod.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_path` is never used
[INFO] [stdout]  --> src/day_38/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn find_path(
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `debug_print` is never used
[INFO] [stdout]   --> src/day_38/mod.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn debug_print(test: &Vec<Option<Rc<RefCell<TreeNode>>>>) {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lowest_common_ancestor` is never used
[INFO] [stdout]   --> src/day_38/mod.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 | pub fn lowest_common_ancestor(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sum_traversal` is never used
[INFO] [stdout]  --> src/day_39/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn sum_traversal(root: Option<Rc<RefCell<TreeNode>>>, target: i64, sum: &mut i64, res: &mut i32) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `path_sum` is never used
[INFO] [stdout]   --> src/day_39/mod.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_depth` is never used
[INFO] [stdout]  --> src/day_4/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_palindrome` is never used
[INFO] [stdout]  --> src/day_40/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn longest_palindrome(s: String) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `number_unique_paths` is never used
[INFO] [stdout]  --> src/day_41/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn number_unique_paths(m: i32, n: i32, cache: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `unique_paths` is never used
[INFO] [stdout]   --> src/day_41/mod.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn unique_paths(m: i32, n: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_cost_path` is never used
[INFO] [stdout]  --> src/day_42/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn min_cost_path(grid: Vec<Vec<i32>>, m: i32, n: i32, memo: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_path_sum` is never used
[INFO] [stdout]   --> src/day_42/mod.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn min_path_sum(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `edit_distance` is never used
[INFO] [stdout]  --> src/day_43/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn edit_distance(word1: String, word2: String, m: i32, n: i32, cache: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_distance` is never used
[INFO] [stdout]   --> src/day_43/mod.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn min_distance(word1: String, word2: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `word_break` is never used
[INFO] [stdout]  --> src/day_44/mod.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn word_break(s: String, word_dict: Vec<String>) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_product` is never used
[INFO] [stdout]  --> src/day_45/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_product(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rob_through` is never used
[INFO] [stdout]  --> src/day_46/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn rob_through(nums: &Vec<i32>, n: i32, dp: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rob` is never used
[INFO] [stdout]   --> src/day_46/mod.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_squares` is never used
[INFO] [stdout]  --> src/day_47/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn num_squares(n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recursive` is never used
[INFO] [stdout]  --> src/day_48/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn recursive(nums: &Vec<i32>, end: usize, max: &mut i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `memoization` is never used
[INFO] [stdout]   --> src/day_48/mod.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn memoization(nums: &Vec<i32>, idx: i32, prev_idx: i32, dp: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_lis` is never used
[INFO] [stdout]   --> src/day_48/mod.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub fn length_of_lis(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `coin_change` is never used
[INFO] [stdout]  --> src/day_49/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sorted_array_to_bst_helper` is never used
[INFO] [stdout]  --> src/day_5/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn sorted_array_to_bst_helper(nums: Vec<i32>, start: usize, end: usize) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sorted_array_to_bst` is never used
[INFO] [stdout]   --> src/day_5/mod.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub fn sorted_array_to_bst(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `subset_sum` is never used
[INFO] [stdout]  --> src/day_50/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn subset_sum(nums: &Vec<i32>, target: i32, idx: i32, dp: &mut Vec<Vec<i32>>) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `can_partition` is never used
[INFO] [stdout]   --> src/day_50/mod.rs:29:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | pub fn can_partition(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lcs` is never used
[INFO] [stdout]  --> src/day_51/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn lcs(t1: &String, t2: &String, i: usize, j: usize, dp: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_common_subsequence` is never used
[INFO] [stdout]   --> src/day_51/mod.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_safe` is never used
[INFO] [stdout]  --> src/day_52/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn is_safe(grid: &Vec<Vec<char>>, row: i32, col: i32, visited: &mut Vec<Vec<bool>>) -> bool {
[INFO] [stdout]   |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `dfs` is never used
[INFO] [stdout]   --> src/day_52/mod.rs:10:4
[INFO] [stdout]    |
[INFO] [stdout] 10 | fn dfs(grid: &Vec<Vec<char>>, row: i32, col: i32, visited: &mut Vec<Vec<bool>>) {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_islands` is never used
[INFO] [stdout]   --> src/day_52/mod.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn num_islands(grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_cyclic` is never used
[INFO] [stdout]  --> src/day_53/mod.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn is_cyclic(course: i32, graph: &HashMap<i32, Vec<i32>>, visited: &mut Vec<bool>, rec_stack: &mut Vec<bool>) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `can_finish` is never used
[INFO] [stdout]   --> src/day_53/mod.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | pub fn can_finish(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `oranges_rotting` is never used
[INFO] [stdout]  --> src/day_54/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn oranges_rotting(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `jump_through` is never used
[INFO] [stdout]  --> src/day_55/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn jump_through(nums: &Vec<i32>, curr: usize, dp: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `jump` is never used
[INFO] [stdout]   --> src/day_55/mod.rs:29:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | pub fn jump(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `invert_tree` is never used
[INFO] [stdout]  --> src/day_6/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `diameter_of_binary_tree` is never used
[INFO] [stdout]  --> src/day_7/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn diameter_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fibonachi` is never used
[INFO] [stdout]  --> src/day_8/mod.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn fibonachi(n: i32, memo: &mut HashMap<i32, i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `climb_stairs` is never used
[INFO] [stdout]   --> src/day_8/mod.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `next_vec` is never used
[INFO] [stdout]  --> src/day_9/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn next_vec(pre_vec: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `generate` is never used
[INFO] [stdout]   --> src/day_9/mod.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn generate(num_rows: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.50s
[INFO] running `Command { std: "docker" "inspect" "898e9cdb324fa0b7544614bc9f81c9f5b466da97b471c72459e8485d80204869", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "898e9cdb324fa0b7544614bc9f81c9f5b466da97b471c72459e8485d80204869", kill_on_drop: false }`
[INFO] [stdout] 898e9cdb324fa0b7544614bc9f81c9f5b466da97b471c72459e8485d80204869
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid -Copt-level=3" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+733b47ea4b1b86216f14ef56e49440c33933f230" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 7cd861bd0b299c47196b47971770b2e1fcb7bea10f5e02c9b198377e83224509
[INFO] running `Command { std: "docker" "start" "-a" "7cd861bd0b299c47196b47971770b2e1fcb7bea10f5e02c9b198377e83224509", kill_on_drop: false }`
[INFO] [stdout] warning: unused imports: `borrow::Borrow` and `clone`
[INFO] [stdout]  --> src/common/binary_tree.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, clone, rc::Rc};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^                 ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::cell::RefCell`
[INFO] [stdout]  --> src/day_13/mod.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::RefCell;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::vec`
[INFO] [stdout]  --> src/day_16/mod.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::vec;
[INFO] [stdout]   |     ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashSet`
[INFO] [stdout]  --> src/day_34/mod.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::collections::HashSet;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `collections::HashMap`
[INFO] [stdout]  --> src/day_39/mod.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{cell::RefCell, collections::HashMap, rc::Rc};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::BorrowMut`
[INFO] [stdout]  --> src/day_34/mod.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::BorrowMut;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `borrow::Borrow`
[INFO] [stdout]  --> src/day_38/mod.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, rc::Rc};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/day_26/mod.rs:51:7
[INFO] [stdout]    |
[INFO] [stdout] 51 |   let mut target = word.clone().chars().collect::<Vec<char>>();
[INFO] [stdout]    |       ----^^^^^^
[INFO] [stdout]    |       |
[INFO] [stdout]    |       help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `res` is never read
[INFO] [stdout]  --> src/day_48/mod.rs:5:11
[INFO] [stdout]   |
[INFO] [stdout] 5 |   let mut res = 1;
[INFO] [stdout]   |           ^^^
[INFO] [stdout]   |
[INFO] [stdout]   = help: maybe it is overwritten before being read?
[INFO] [stdout]   = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/common/binary_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `array_to_bst` is never used
[INFO] [stdout]   --> src/common/binary_tree.rs:10:4
[INFO] [stdout]    |
[INFO] [stdout] 10 | fn array_to_bst(nums: Vec<i32>, start: usize, end: usize) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `new_with_children`, `from_arr`, and `to_arr` are never used
[INFO] [stdout]   --> src/common/binary_tree.rs:25:10
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl TreeNode {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 24 |   #[inline]
[INFO] [stdout] 25 |   pub fn new(val: i32) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |   pub fn new_with_children(
[INFO] [stdout]    |          ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |   pub fn from_arr(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |   pub fn to_arr(&self, data: &mut Vec<i32>) {
[INFO] [stdout]    |          ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/common/link_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `new_with_next`, `from_vec`, `add_node`, and `to_vec` are never used
[INFO] [stdout]   --> src/common/link_list.rs:8:10
[INFO] [stdout]    |
[INFO] [stdout] 7  | impl ListNode {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout] 8  |   pub fn new(val: i32) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 12 |   pub fn new_with_next(val: i32, next: Option<Box<ListNode>>) -> Self {
[INFO] [stdout]    |          ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |   pub fn from_vec(vals: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |   pub fn add_node(&mut self, node: Option<Box<ListNode>>) {
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |   pub fn to_vec(&self) -> Vec<i32> {
[INFO] [stdout]    |          ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LinkedListNode` is never constructed
[INFO] [stdout]  --> src/common/linked_list.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct LinkedListNode {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `new_with_next`, `from_vec`, and `to_vec` are never used
[INFO] [stdout]   --> src/common/linked_list.rs:10:10
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl LinkedListNode {
[INFO] [stdout]    | ------------------- associated items in this implementation
[INFO] [stdout] 10 |   pub fn new(val: i32) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 14 |   pub fn new_with_next(val: i32, next: Option<Rc<RefCell<LinkedListNode>>>) -> Self {
[INFO] [stdout]    |          ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 18 |   pub fn from_vec(vals: Vec<i32>) -> Option<Rc<RefCell<LinkedListNode>>> {
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |   pub fn to_vec(&self, acc: &mut Vec<i32>) {
[INFO] [stdout]    |          ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search` is never used
[INFO] [stdout]  --> src/common/search.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn binary_search(nums: &Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `read_i32_input_from_file` is never used
[INFO] [stdout]  --> src/helper/mod.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn read_i32_input_from_file(file_path: &str) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_insert` is never used
[INFO] [stdout]  --> src/day_1/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_profit` is never used
[INFO] [stdout]  --> src/day_10/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[INFO] [stdout]  --> src/day_11/mod.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_two_lists` is never used
[INFO] [stdout]  --> src/day_12/mod.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn merge_two_lists(list1: Option<Box<ListNode>>, list2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `has_cycle` is never used
[INFO] [stdout]  --> src/day_13/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn has_cycle(root: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_intersection_node` is never used
[INFO] [stdout]  --> src/day_14/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn get_intersection_node(
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reserve_linked_list` is never used
[INFO] [stdout]  --> src/day_15/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn reserve_linked_list(root: Option<Rc<RefCell<LinkedListNode>>>) -> Option<Rc<RefCell<LinkedListNode>>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_palindrome` is never used
[INFO] [stdout]  --> src/day_16/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid` is never used
[INFO] [stdout]  --> src/day_17/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn is_valid(s: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `move_zeroes` is never used
[INFO] [stdout]  --> src/day_18/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn move_zeroes(nums: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `move_zeroes_optz` is never used
[INFO] [stdout]   --> src/day_18/mod.rs:25:8
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn move_zeroes_optz(nums: &mut Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number` is never used
[INFO] [stdout]  --> src/day_19/mod.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn single_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number_optz` is never used
[INFO] [stdout]   --> src/day_19/mod.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub fn single_number_optz(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `inorder_traversal_vec` is never used
[INFO] [stdout]  --> src/day_2/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn inorder_traversal_vec(root: Option<Rc<RefCell<TreeNode>>>, data: &mut Vec<i32>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `inorder_traversal` is never used
[INFO] [stdout]   --> src/day_2/mod.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `majority_element` is never used
[INFO] [stdout]  --> src/day_20/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `ez_majority_element` is never used
[INFO] [stdout]   --> src/day_20/mod.rs:32:4
[INFO] [stdout]    |
[INFO] [stdout] 32 | fn ez_majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `letter_combinations` is never used
[INFO] [stdout]  --> src/day_21/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `parenthesis_dfs` is never used
[INFO] [stdout]  --> src/day_22/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn parenthesis_dfs(left: i32, right: i32, s: &mut String, res: &mut Vec<String>) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `generate_parenthesis` is never used
[INFO] [stdout]   --> src/day_22/mod.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn generate_parenthesis(n: i32) -> Vec<String> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `generator` is never used
[INFO] [stdout]  --> src/day_23/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn generator(candidates: Vec<i32>, target: i32, start: i32, path: &mut Vec<i32>, res: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `combination_sum` is never used
[INFO] [stdout]   --> src/day_23/mod.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn combination_sum(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `backtrack` is never used
[INFO] [stdout]  --> src/day_24/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn backtrack(nums: &mut Vec<i32>, left: usize, right: usize, result: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `permute` is never used
[INFO] [stdout]   --> src/day_24/mod.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `backtrack` is never used
[INFO] [stdout]  --> src/day_25/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn backtrack(nums: Vec<i32>, size: usize, start: usize, tmp: &mut Vec<i32>, res: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `subsets` is never used
[INFO] [stdout]   --> src/day_25/mod.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `backtrack` is never used
[INFO] [stdout]  --> src/day_26/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn backtrack(
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `exist` is never used
[INFO] [stdout]   --> src/day_26/mod.rs:50:8
[INFO] [stdout]    |
[INFO] [stdout] 50 | pub fn exist(board: Vec<Vec<char>>, word: String) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_str_palindrome` is never used
[INFO] [stdout]  --> src/day_27/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn is_str_palindrome(s: &str) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `backtrack_partition` is never used
[INFO] [stdout]   --> src/day_27/mod.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn backtrack_partition(s: &str, start: usize, path: &mut Vec<String>, res: &mut Vec<Vec<String>>) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `partition` is never used
[INFO] [stdout]   --> src/day_27/mod.rs:35:8
[INFO] [stdout]    |
[INFO] [stdout] 35 | pub fn partition(s: String) -> Vec<Vec<String>> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `binary_search` is never used
[INFO] [stdout]  --> src/day_28/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn binary_search(nums: &Vec<i32>, target: i32, low: i32, high: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_pivot` is never used
[INFO] [stdout]   --> src/day_28/mod.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn find_pivot(nums: &Vec<i32>, low: i32, high: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search` is never used
[INFO] [stdout]   --> src/day_28/mod.rs:43:8
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_range` is never used
[INFO] [stdout]  --> src/day_29/mod.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn search_range(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_mirror` is never used
[INFO] [stdout]  --> src/day_3/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn is_mirror(left: Option<Rc<RefCell<TreeNode>>>, right: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_symmetric` is never used
[INFO] [stdout]   --> src/day_3/mod.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_matrix` is never used
[INFO] [stdout]  --> src/day_30/mod.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_pivot` is never used
[INFO] [stdout]  --> src/day_31/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn find_pivot(nums: &Vec<i32>, left: i32, right: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_min` is never used
[INFO] [stdout]   --> src/day_31/mod.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bst_dfs_validate` is never used
[INFO] [stdout]  --> src/day_32/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn bst_dfs_validate(root: Option<Rc<RefCell<TreeNode>>>, left: Option<i32>, right: Option<i32>) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_valid_bst` is never used
[INFO] [stdout]   --> src/day_32/mod.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `dfs_level_travesal` is never used
[INFO] [stdout]  --> src/day_33/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn dfs_level_travesal(root: Option<Rc<RefCell<TreeNode>>>, level: i32, res: &mut Vec<Vec<i32>>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `level_order` is never used
[INFO] [stdout]   --> src/day_33/mod.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: static `PRE_IDX` is never used
[INFO] [stdout]  --> src/day_34/mod.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | static mut PRE_IDX: i32 = 0;
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_tree_helper` is never used
[INFO] [stdout]  --> src/day_34/mod.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn build_tree_helper(
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_tree` is never used
[INFO] [stdout]   --> src/day_34/mod.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub fn build_tree(preorder: Vec<i32>, inorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `preorder_traverse` is never used
[INFO] [stdout]  --> src/day_35/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn preorder_traverse(root: Option<Rc<RefCell<TreeNode>>>, v: &mut Vec<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `flatten` is never used
[INFO] [stdout]   --> src/day_35/mod.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `right_side_view_tranversal` is never used
[INFO] [stdout]  --> src/day_36/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn right_side_view_tranversal(root: Option<Rc<RefCell<TreeNode>>>, level: usize, result: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `right_side_view` is never used
[INFO] [stdout]   --> src/day_36/mod.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `inorder_traversal` is never used
[INFO] [stdout]  --> src/day_37/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>, res: &mut Vec<i32>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `kth_smallest` is never used
[INFO] [stdout]   --> src/day_37/mod.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_path` is never used
[INFO] [stdout]  --> src/day_38/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn find_path(
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `debug_print` is never used
[INFO] [stdout]   --> src/day_38/mod.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn debug_print(test: &Vec<Option<Rc<RefCell<TreeNode>>>>) {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lowest_common_ancestor` is never used
[INFO] [stdout]   --> src/day_38/mod.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 | pub fn lowest_common_ancestor(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling leetcode-100-days-challenge v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: function `sum_traversal` is never used
[INFO] [stdout]  --> src/day_39/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn sum_traversal(root: Option<Rc<RefCell<TreeNode>>>, target: i64, sum: &mut i64, res: &mut i32) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `path_sum` is never used
[INFO] [stdout]   --> src/day_39/mod.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_depth` is never used
[INFO] [stdout]  --> src/day_4/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_palindrome` is never used
[INFO] [stdout]  --> src/day_40/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn longest_palindrome(s: String) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `number_unique_paths` is never used
[INFO] [stdout]  --> src/day_41/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn number_unique_paths(m: i32, n: i32, cache: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `unique_paths` is never used
[INFO] [stdout]   --> src/day_41/mod.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn unique_paths(m: i32, n: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_cost_path` is never used
[INFO] [stdout]  --> src/day_42/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn min_cost_path(grid: Vec<Vec<i32>>, m: i32, n: i32, memo: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_path_sum` is never used
[INFO] [stdout]   --> src/day_42/mod.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn min_path_sum(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `edit_distance` is never used
[INFO] [stdout]  --> src/day_43/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn edit_distance(word1: String, word2: String, m: i32, n: i32, cache: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_distance` is never used
[INFO] [stdout]   --> src/day_43/mod.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn min_distance(word1: String, word2: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `word_break` is never used
[INFO] [stdout]  --> src/day_44/mod.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn word_break(s: String, word_dict: Vec<String>) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_product` is never used
[INFO] [stdout]  --> src/day_45/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn max_product(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rob_through` is never used
[INFO] [stdout]  --> src/day_46/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn rob_through(nums: &Vec<i32>, n: i32, dp: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rob` is never used
[INFO] [stdout]   --> src/day_46/mod.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_squares` is never used
[INFO] [stdout]  --> src/day_47/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn num_squares(n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recursive` is never used
[INFO] [stdout]  --> src/day_48/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn recursive(nums: &Vec<i32>, end: usize, max: &mut i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `memoization` is never used
[INFO] [stdout]   --> src/day_48/mod.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn memoization(nums: &Vec<i32>, idx: i32, prev_idx: i32, dp: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_lis` is never used
[INFO] [stdout]   --> src/day_48/mod.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub fn length_of_lis(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `coin_change` is never used
[INFO] [stdout]  --> src/day_49/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sorted_array_to_bst_helper` is never used
[INFO] [stdout]  --> src/day_5/mod.rs:5:4
[INFO] [stdout]   |
[INFO] [stdout] 5 | fn sorted_array_to_bst_helper(nums: Vec<i32>, start: usize, end: usize) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sorted_array_to_bst` is never used
[INFO] [stdout]   --> src/day_5/mod.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub fn sorted_array_to_bst(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `subset_sum` is never used
[INFO] [stdout]  --> src/day_50/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn subset_sum(nums: &Vec<i32>, target: i32, idx: i32, dp: &mut Vec<Vec<i32>>) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `can_partition` is never used
[INFO] [stdout]   --> src/day_50/mod.rs:29:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | pub fn can_partition(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lcs` is never used
[INFO] [stdout]  --> src/day_51/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn lcs(t1: &String, t2: &String, i: usize, j: usize, dp: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_common_subsequence` is never used
[INFO] [stdout]   --> src/day_51/mod.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_safe` is never used
[INFO] [stdout]  --> src/day_52/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn is_safe(grid: &Vec<Vec<char>>, row: i32, col: i32, visited: &mut Vec<Vec<bool>>) -> bool {
[INFO] [stdout]   |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `dfs` is never used
[INFO] [stdout]   --> src/day_52/mod.rs:10:4
[INFO] [stdout]    |
[INFO] [stdout] 10 | fn dfs(grid: &Vec<Vec<char>>, row: i32, col: i32, visited: &mut Vec<Vec<bool>>) {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_islands` is never used
[INFO] [stdout]   --> src/day_52/mod.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn num_islands(grid: Vec<Vec<char>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_cyclic` is never used
[INFO] [stdout]  --> src/day_53/mod.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn is_cyclic(course: i32, graph: &HashMap<i32, Vec<i32>>, visited: &mut Vec<bool>, rec_stack: &mut Vec<bool>) -> bool {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `can_finish` is never used
[INFO] [stdout]   --> src/day_53/mod.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | pub fn can_finish(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `oranges_rotting` is never used
[INFO] [stdout]  --> src/day_54/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn oranges_rotting(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `jump_through` is never used
[INFO] [stdout]  --> src/day_55/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn jump_through(nums: &Vec<i32>, curr: usize, dp: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `jump` is never used
[INFO] [stdout]   --> src/day_55/mod.rs:29:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | pub fn jump(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `invert_tree` is never used
[INFO] [stdout]  --> src/day_6/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `diameter_of_binary_tree` is never used
[INFO] [stdout]  --> src/day_7/mod.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn diameter_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `fibonachi` is never used
[INFO] [stdout]  --> src/day_8/mod.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn fibonachi(n: i32, memo: &mut HashMap<i32, i32>) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `climb_stairs` is never used
[INFO] [stdout]   --> src/day_8/mod.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `next_vec` is never used
[INFO] [stdout]  --> src/day_9/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn next_vec(pre_vec: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `generate` is never used
[INFO] [stdout]   --> src/day_9/mod.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn generate(num_rows: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `borrow::Borrow` and `clone`
[INFO] [stdout]  --> src/common/binary_tree.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, clone, rc::Rc};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^                 ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `env` and `path::Path`
[INFO] [stdout]   --> src/day_10/mod.rs:19:13
[INFO] [stdout]    |
[INFO] [stdout] 19 |   use std::{env, fs::read_to_string, path::Path};
[INFO] [stdout]    |             ^^^                      ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::cell::RefCell`
[INFO] [stdout]  --> src/day_13/mod.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::cell::RefCell;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashSet`
[INFO] [stdout]  --> src/day_34/mod.rs:2:5
[INFO] [stdout]   |
[INFO] [stdout] 2 | use std::collections::HashSet;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `collections::HashMap`
[INFO] [stdout]  --> src/day_39/mod.rs:1:26
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{cell::RefCell, collections::HashMap, rc::Rc};
[INFO] [stdout]   |                          ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `borrow::Borrow`
[INFO] [stdout]   --> src/day_6/mod.rs:21:13
[INFO] [stdout]    |
[INFO] [stdout] 21 |   use std::{borrow::Borrow, cell::RefCell, rc::Rc};
[INFO] [stdout]    |             ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::BorrowMut`
[INFO] [stdout]  --> src/day_34/mod.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::BorrowMut;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `borrow::Borrow`
[INFO] [stdout]  --> src/day_38/mod.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::{borrow::Borrow, cell::RefCell, rc::Rc};
[INFO] [stdout]   |           ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/day_26/mod.rs:51:7
[INFO] [stdout]    |
[INFO] [stdout] 51 |   let mut target = word.clone().chars().collect::<Vec<char>>();
[INFO] [stdout]    |       ----^^^^^^
[INFO] [stdout]    |       |
[INFO] [stdout]    |       help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `res` is never read
[INFO] [stdout]  --> src/day_48/mod.rs:5:11
[INFO] [stdout]   |
[INFO] [stdout] 5 |   let mut res = 1;
[INFO] [stdout]   |           ^^^
[INFO] [stdout]   |
[INFO] [stdout]   = help: maybe it is overwritten before being read?
[INFO] [stdout]   = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `array_to_bst` is never used
[INFO] [stdout]   --> src/common/binary_tree.rs:10:4
[INFO] [stdout]    |
[INFO] [stdout] 10 | fn array_to_bst(nums: Vec<i32>, start: usize, end: usize) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `from_arr` is never used
[INFO] [stdout]   --> src/common/binary_tree.rs:41:10
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 41 |   pub fn from_arr(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new_with_next` and `to_vec` are never used
[INFO] [stdout]   --> src/common/linked_list.rs:14:10
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl LinkedListNode {
[INFO] [stdout]    | ------------------- associated items in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 14 |   pub fn new_with_next(val: i32, next: Option<Rc<RefCell<LinkedListNode>>>) -> Self {
[INFO] [stdout]    |          ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 34 |   pub fn to_vec(&self, acc: &mut Vec<i32>) {
[INFO] [stdout]    |          ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `ez_majority_element` is never used
[INFO] [stdout]   --> src/day_20/mod.rs:32:4
[INFO] [stdout]    |
[INFO] [stdout] 32 | fn ez_majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `debug_print` is never used
[INFO] [stdout]   --> src/day_38/mod.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn debug_print(test: &Vec<Option<Rc<RefCell<TreeNode>>>>) {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `recursive` is never used
[INFO] [stdout]  --> src/day_48/mod.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn recursive(nums: &Vec<i32>, end: usize, max: &mut i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lcs` is never used
[INFO] [stdout]  --> src/day_51/mod.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn lcs(t1: &String, t2: &String, i: usize, j: usize, dp: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]   |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 5.73s
[INFO] running `Command { std: "docker" "inspect" "7cd861bd0b299c47196b47971770b2e1fcb7bea10f5e02c9b198377e83224509", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "7cd861bd0b299c47196b47971770b2e1fcb7bea10f5e02c9b198377e83224509", kill_on_drop: false }`
[INFO] [stdout] 7cd861bd0b299c47196b47971770b2e1fcb7bea10f5e02c9b198377e83224509
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid -Copt-level=3" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+733b47ea4b1b86216f14ef56e49440c33933f230" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] bb293294f45c5a30a66c441298949e5b2b7736bcd0575d944de38e8b330d6d17
[INFO] running `Command { std: "docker" "start" "-a" "bb293294f45c5a30a66c441298949e5b2b7736bcd0575d944de38e8b330d6d17", kill_on_drop: false }`
[INFO] [stderr] warning: unused imports: `borrow::Borrow` and `clone`
[INFO] [stderr]  --> src/common/binary_tree.rs:1:11
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::{borrow::Borrow, cell::RefCell, clone, rc::Rc};
[INFO] [stderr]   |           ^^^^^^^^^^^^^^                 ^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::cell::RefCell`
[INFO] [stderr]  --> src/day_13/mod.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::cell::RefCell;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::vec`
[INFO] [stderr]  --> src/day_16/mod.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::vec;
[INFO] [stderr]   |     ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::collections::HashSet`
[INFO] [stderr]  --> src/day_34/mod.rs:2:5
[INFO] [stderr]   |
[INFO] [stderr] 2 | use std::collections::HashSet;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `collections::HashMap`
[INFO] [stderr]  --> src/day_39/mod.rs:1:26
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::{cell::RefCell, collections::HashMap, rc::Rc};
[INFO] [stderr]   |                          ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::borrow::BorrowMut`
[INFO] [stderr]  --> src/day_34/mod.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::borrow::BorrowMut;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `borrow::Borrow`
[INFO] [stderr]  --> src/day_38/mod.rs:1:11
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::{borrow::Borrow, cell::RefCell, rc::Rc};
[INFO] [stderr]   |           ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/day_26/mod.rs:51:7
[INFO] [stderr]    |
[INFO] [stderr] 51 |   let mut target = word.clone().chars().collect::<Vec<char>>();
[INFO] [stderr]    |       ----^^^^^^
[INFO] [stderr]    |       |
[INFO] [stderr]    |       help: remove this `mut`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `res` is never read
[INFO] [stderr]  --> src/day_48/mod.rs:5:11
[INFO] [stderr]   |
[INFO] [stderr] 5 |   let mut res = 1;
[INFO] [stderr]   |           ^^^
[INFO] [stderr]   |
[INFO] [stderr]   = help: maybe it is overwritten before being read?
[INFO] [stderr]   = note: `#[warn(unused_assignments)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/common/binary_tree.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 4 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function `array_to_bst` is never used
[INFO] [stderr]   --> src/common/binary_tree.rs:10:4
[INFO] [stderr]    |
[INFO] [stderr] 10 | fn array_to_bst(nums: Vec<i32>, start: usize, end: usize) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]    |    ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `new_with_children`, `from_arr`, and `to_arr` are never used
[INFO] [stderr]   --> src/common/binary_tree.rs:25:10
[INFO] [stderr]    |
[INFO] [stderr] 23 | impl TreeNode {
[INFO] [stderr]    | ------------- associated items in this implementation
[INFO] [stderr] 24 |   #[inline]
[INFO] [stderr] 25 |   pub fn new(val: i32) -> Self {
[INFO] [stderr]    |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 33 |   pub fn new_with_children(
[INFO] [stderr]    |          ^^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 41 |   pub fn from_arr(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]    |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 45 |   pub fn to_arr(&self, data: &mut Vec<i32>) {
[INFO] [stderr]    |          ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `ListNode` is never constructed
[INFO] [stderr]  --> src/common/link_list.rs:2:12
[INFO] [stderr]   |
[INFO] [stderr] 2 | pub struct ListNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `new_with_next`, `from_vec`, `add_node`, and `to_vec` are never used
[INFO] [stderr]   --> src/common/link_list.rs:8:10
[INFO] [stderr]    |
[INFO] [stderr] 7  | impl ListNode {
[INFO] [stderr]    | ------------- associated items in this implementation
[INFO] [stderr] 8  |   pub fn new(val: i32) -> Self {
[INFO] [stderr]    |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 12 |   pub fn new_with_next(val: i32, next: Option<Box<ListNode>>) -> Self {
[INFO] [stderr]    |          ^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 16 |   pub fn from_vec(vals: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stderr]    |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 29 |   pub fn add_node(&mut self, node: Option<Box<ListNode>>) {
[INFO] [stderr]    |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 33 |   pub fn to_vec(&self) -> Vec<i32> {
[INFO] [stderr]    |          ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `LinkedListNode` is never constructed
[INFO] [stderr]  --> src/common/linked_list.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 4 | pub struct LinkedListNode {
[INFO] [stderr]   |            ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `new_with_next`, `from_vec`, and `to_vec` are never used
[INFO] [stderr]   --> src/common/linked_list.rs:10:10
[INFO] [stderr]    |
[INFO] [stderr] 9  | impl LinkedListNode {
[INFO] [stderr]    | ------------------- associated items in this implementation
[INFO] [stderr] 10 |   pub fn new(val: i32) -> Self {
[INFO] [stderr]    |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 14 |   pub fn new_with_next(val: i32, next: Option<Rc<RefCell<LinkedListNode>>>) -> Self {
[INFO] [stderr]    |          ^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 18 |   pub fn from_vec(vals: Vec<i32>) -> Option<Rc<RefCell<LinkedListNode>>> {
[INFO] [stderr]    |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 34 |   pub fn to_vec(&self, acc: &mut Vec<i32>) {
[INFO] [stderr]    |          ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `binary_search` is never used
[INFO] [stderr]  --> src/common/search.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn binary_search(nums: &Vec<i32>, target: i32) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `read_i32_input_from_file` is never used
[INFO] [stderr]  --> src/helper/mod.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub fn read_i32_input_from_file(file_path: &str) -> Vec<i32> {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `search_insert` is never used
[INFO] [stderr]  --> src/day_1/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max_profit` is never used
[INFO] [stderr]  --> src/day_10/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `two_sum` is never used
[INFO] [stderr]  --> src/day_11/mod.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stderr]   |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `merge_two_lists` is never used
[INFO] [stderr]  --> src/day_12/mod.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub fn merge_two_lists(list1: Option<Box<ListNode>>, list2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `has_cycle` is never used
[INFO] [stderr]  --> src/day_13/mod.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub fn has_cycle(root: Option<Box<ListNode>>) -> bool {
[INFO] [stderr]   |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `get_intersection_node` is never used
[INFO] [stderr]  --> src/day_14/mod.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub fn get_intersection_node(
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `reserve_linked_list` is never used
[INFO] [stderr]  --> src/day_15/mod.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub fn reserve_linked_list(root: Option<Rc<RefCell<LinkedListNode>>>) -> Option<Rc<RefCell<LinkedListNode>>> {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `is_palindrome` is never used
[INFO] [stderr]  --> src/day_16/mod.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `is_valid` is never used
[INFO] [stderr]  --> src/day_17/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn is_valid(s: String) -> bool {
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `move_zeroes` is never used
[INFO] [stderr]  --> src/day_18/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn move_zeroes(nums: &mut Vec<i32>) {
[INFO] [stderr]   |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `move_zeroes_optz` is never used
[INFO] [stderr]   --> src/day_18/mod.rs:25:8
[INFO] [stderr]    |
[INFO] [stderr] 25 | pub fn move_zeroes_optz(nums: &mut Vec<i32>) {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `single_number` is never used
[INFO] [stderr]  --> src/day_19/mod.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub fn single_number(nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `single_number_optz` is never used
[INFO] [stderr]   --> src/day_19/mod.rs:18:8
[INFO] [stderr]    |
[INFO] [stderr] 18 | pub fn single_number_optz(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `inorder_traversal_vec` is never used
[INFO] [stderr]  --> src/day_2/mod.rs:5:4
[INFO] [stderr]   |
[INFO] [stderr] 5 | fn inorder_traversal_vec(root: Option<Rc<RefCell<TreeNode>>>, data: &mut Vec<i32>) {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `inorder_traversal` is never used
[INFO] [stderr]   --> src/day_2/mod.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 13 | pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `majority_element` is never used
[INFO] [stderr]  --> src/day_20/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `ez_majority_element` is never used
[INFO] [stderr]   --> src/day_20/mod.rs:32:4
[INFO] [stderr]    |
[INFO] [stderr] 32 | fn ez_majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `letter_combinations` is never used
[INFO] [stderr]  --> src/day_21/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `parenthesis_dfs` is never used
[INFO] [stderr]  --> src/day_22/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn parenthesis_dfs(left: i32, right: i32, s: &mut String, res: &mut Vec<String>) {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `generate_parenthesis` is never used
[INFO] [stderr]   --> src/day_22/mod.rs:19:8
[INFO] [stderr]    |
[INFO] [stderr] 19 | pub fn generate_parenthesis(n: i32) -> Vec<String> {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `generator` is never used
[INFO] [stderr]  --> src/day_23/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn generator(candidates: Vec<i32>, target: i32, start: i32, path: &mut Vec<i32>, res: &mut Vec<Vec<i32>>) {
[INFO] [stderr]   |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `combination_sum` is never used
[INFO] [stderr]   --> src/day_23/mod.rs:22:8
[INFO] [stderr]    |
[INFO] [stderr] 22 | pub fn combination_sum(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `backtrack` is never used
[INFO] [stderr]  --> src/day_24/mod.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn backtrack(nums: &mut Vec<i32>, left: usize, right: usize, result: &mut Vec<Vec<i32>>) {
[INFO] [stderr]   |    ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `permute` is never used
[INFO] [stderr]   --> src/day_24/mod.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 13 | pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `backtrack` is never used
[INFO] [stderr]  --> src/day_25/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn backtrack(nums: Vec<i32>, size: usize, start: usize, tmp: &mut Vec<i32>, res: &mut Vec<Vec<i32>>) {
[INFO] [stderr]   |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `subsets` is never used
[INFO] [stderr]   --> src/day_25/mod.rs:17:8
[INFO] [stderr]    |
[INFO] [stderr] 17 | pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `backtrack` is never used
[INFO] [stderr]  --> src/day_26/mod.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn backtrack(
[INFO] [stderr]   |    ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `exist` is never used
[INFO] [stderr]   --> src/day_26/mod.rs:50:8
[INFO] [stderr]    |
[INFO] [stderr] 50 | pub fn exist(board: Vec<Vec<char>>, word: String) -> bool {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `is_str_palindrome` is never used
[INFO] [stderr]  --> src/day_27/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn is_str_palindrome(s: &str) -> bool {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `backtrack_partition` is never used
[INFO] [stderr]   --> src/day_27/mod.rs:17:8
[INFO] [stderr]    |
[INFO] [stderr] 17 | pub fn backtrack_partition(s: &str, start: usize, path: &mut Vec<String>, res: &mut Vec<Vec<String>>) {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `partition` is never used
[INFO] [stderr]   --> src/day_27/mod.rs:35:8
[INFO] [stderr]    |
[INFO] [stderr] 35 | pub fn partition(s: String) -> Vec<Vec<String>> {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `binary_search` is never used
[INFO] [stderr]  --> src/day_28/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn binary_search(nums: &Vec<i32>, target: i32, low: i32, high: i32) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_pivot` is never used
[INFO] [stderr]   --> src/day_28/mod.rs:19:8
[INFO] [stderr]    |
[INFO] [stderr] 19 | pub fn find_pivot(nums: &Vec<i32>, low: i32, high: i32) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `search` is never used
[INFO] [stderr]   --> src/day_28/mod.rs:43:8
[INFO] [stderr]    |
[INFO] [stderr] 43 | pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stderr]    |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `search_range` is never used
[INFO] [stderr]  --> src/day_29/mod.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub fn search_range(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stderr]   |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `is_mirror` is never used
[INFO] [stderr]  --> src/day_3/mod.rs:5:4
[INFO] [stderr]   |
[INFO] [stderr] 5 | fn is_mirror(left: Option<Rc<RefCell<TreeNode>>>, right: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stderr]   |    ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `is_symmetric` is never used
[INFO] [stderr]   --> src/day_3/mod.rs:19:8
[INFO] [stderr]    |
[INFO] [stderr] 19 | pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `search_matrix` is never used
[INFO] [stderr]  --> src/day_30/mod.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_pivot` is never used
[INFO] [stderr]  --> src/day_31/mod.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn find_pivot(nums: &Vec<i32>, left: i32, right: i32) -> i32 {
[INFO] [stderr]   |    ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_min` is never used
[INFO] [stderr]   --> src/day_31/mod.rs:31:8
[INFO] [stderr]    |
[INFO] [stderr] 31 | pub fn find_min(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `bst_dfs_validate` is never used
[INFO] [stderr]  --> src/day_32/mod.rs:5:4
[INFO] [stderr]   |
[INFO] [stderr] 5 | fn bst_dfs_validate(root: Option<Rc<RefCell<TreeNode>>>, left: Option<i32>, right: Option<i32>) -> bool {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `is_valid_bst` is never used
[INFO] [stderr]   --> src/day_32/mod.rs:28:8
[INFO] [stderr]    |
[INFO] [stderr] 28 | pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `dfs_level_travesal` is never used
[INFO] [stderr]  --> src/day_33/mod.rs:5:4
[INFO] [stderr]   |
[INFO] [stderr] 5 | fn dfs_level_travesal(root: Option<Rc<RefCell<TreeNode>>>, level: i32, res: &mut Vec<Vec<i32>>) {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `level_order` is never used
[INFO] [stderr]   --> src/day_33/mod.rs:21:8
[INFO] [stderr]    |
[INFO] [stderr] 21 | pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stderr]    |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: static `PRE_IDX` is never used
[INFO] [stderr]  --> src/day_34/mod.rs:7:12
[INFO] [stderr]   |
[INFO] [stderr] 7 | static mut PRE_IDX: i32 = 0;
[INFO] [stderr]   |            ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `build_tree_helper` is never used
[INFO] [stderr]  --> src/day_34/mod.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub fn build_tree_helper(
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `build_tree` is never used
[INFO] [stderr]   --> src/day_34/mod.rs:42:8
[INFO] [stderr]    |
[INFO] [stderr] 42 | pub fn build_tree(preorder: Vec<i32>, inorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]    |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `preorder_traverse` is never used
[INFO] [stderr]  --> src/day_35/mod.rs:5:4
[INFO] [stderr]   |
[INFO] [stderr] 5 | fn preorder_traverse(root: Option<Rc<RefCell<TreeNode>>>, v: &mut Vec<Rc<RefCell<TreeNode>>>) {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `flatten` is never used
[INFO] [stderr]   --> src/day_35/mod.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 13 | pub fn flatten(root: &mut Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `right_side_view_tranversal` is never used
[INFO] [stderr]  --> src/day_36/mod.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub fn right_side_view_tranversal(root: Option<Rc<RefCell<TreeNode>>>, level: usize, result: &mut Vec<i32>) {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `right_side_view` is never used
[INFO] [stderr]   --> src/day_36/mod.rs:16:8
[INFO] [stderr]    |
[INFO] [stderr] 16 | pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `inorder_traversal` is never used
[INFO] [stderr]  --> src/day_37/mod.rs:5:4
[INFO] [stderr]   |
[INFO] [stderr] 5 | fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>, res: &mut Vec<i32>) {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `kth_smallest` is never used
[INFO] [stderr]   --> src/day_37/mod.rs:17:8
[INFO] [stderr]    |
[INFO] [stderr] 17 | pub fn kth_smallest(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_path` is never used
[INFO] [stderr]  --> src/day_38/mod.rs:5:4
[INFO] [stderr]   |
[INFO] [stderr] 5 | fn find_path(
[INFO] [stderr]   |    ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `debug_print` is never used
[INFO] [stderr]   --> src/day_38/mod.rs:30:8
[INFO] [stderr]    |
[INFO] [stderr] 30 | pub fn debug_print(test: &Vec<Option<Rc<RefCell<TreeNode>>>>) {
[INFO] [stderr]    |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `lowest_common_ancestor` is never used
[INFO] [stderr]   --> src/day_38/mod.rs:46:8
[INFO] [stderr]    |
[INFO] [stderr] 46 | pub fn lowest_common_ancestor(
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `sum_traversal` is never used
[INFO] [stderr]  --> src/day_39/mod.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub fn sum_traversal(root: Option<Rc<RefCell<TreeNode>>>, target: i64, sum: &mut i64, res: &mut i32) {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `path_sum` is never used
[INFO] [stderr]   --> src/day_39/mod.rs:21:8
[INFO] [stderr]    |
[INFO] [stderr] 21 | pub fn path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max_depth` is never used
[INFO] [stderr]  --> src/day_4/mod.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `longest_palindrome` is never used
[INFO] [stderr]  --> src/day_40/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn longest_palindrome(s: String) -> String {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `number_unique_paths` is never used
[INFO] [stderr]  --> src/day_41/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn number_unique_paths(m: i32, n: i32, cache: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `unique_paths` is never used
[INFO] [stderr]   --> src/day_41/mod.rs:14:8
[INFO] [stderr]    |
[INFO] [stderr] 14 | pub fn unique_paths(m: i32, n: i32) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `min_cost_path` is never used
[INFO] [stderr]  --> src/day_42/mod.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn min_cost_path(grid: Vec<Vec<i32>>, m: i32, n: i32, memo: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stderr]   |    ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `min_path_sum` is never used
[INFO] [stderr]   --> src/day_42/mod.rs:21:8
[INFO] [stderr]    |
[INFO] [stderr] 21 | pub fn min_path_sum(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `edit_distance` is never used
[INFO] [stderr]  --> src/day_43/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn edit_distance(word1: String, word2: String, m: i32, n: i32, cache: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `min_distance` is never used
[INFO] [stderr]   --> src/day_43/mod.rs:30:8
[INFO] [stderr]    |
[INFO] [stderr] 30 | pub fn min_distance(word1: String, word2: String) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `word_break` is never used
[INFO] [stderr]  --> src/day_44/mod.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub fn word_break(s: String, word_dict: Vec<String>) -> bool {
[INFO] [stderr]   |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max_product` is never used
[INFO] [stderr]  --> src/day_45/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn max_product(nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `rob_through` is never used
[INFO] [stderr]  --> src/day_46/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn rob_through(nums: &Vec<i32>, n: i32, dp: &mut Vec<i32>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `rob` is never used
[INFO] [stderr]   --> src/day_46/mod.rs:21:8
[INFO] [stderr]    |
[INFO] [stderr] 21 | pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `num_squares` is never used
[INFO] [stderr]  --> src/day_47/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn num_squares(n: i32) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `recursive` is never used
[INFO] [stderr]  --> src/day_48/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn recursive(nums: &Vec<i32>, end: usize, max: &mut i32) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `memoization` is never used
[INFO] [stderr]   --> src/day_48/mod.rs:22:8
[INFO] [stderr]    |
[INFO] [stderr] 22 | pub fn memoization(nums: &Vec<i32>, idx: i32, prev_idx: i32, dp: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `length_of_lis` is never used
[INFO] [stderr]   --> src/day_48/mod.rs:42:8
[INFO] [stderr]    |
[INFO] [stderr] 42 | pub fn length_of_lis(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `coin_change` is never used
[INFO] [stderr]  --> src/day_49/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `sorted_array_to_bst_helper` is never used
[INFO] [stderr]  --> src/day_5/mod.rs:5:4
[INFO] [stderr]   |
[INFO] [stderr] 5 | fn sorted_array_to_bst_helper(nums: Vec<i32>, start: usize, end: usize) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `sorted_array_to_bst` is never used
[INFO] [stderr]   --> src/day_5/mod.rs:18:8
[INFO] [stderr]    |
[INFO] [stderr] 18 | pub fn sorted_array_to_bst(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `subset_sum` is never used
[INFO] [stderr]  --> src/day_50/mod.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn subset_sum(nums: &Vec<i32>, target: i32, idx: i32, dp: &mut Vec<Vec<i32>>) -> bool {
[INFO] [stderr]   |    ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `can_partition` is never used
[INFO] [stderr]   --> src/day_50/mod.rs:29:8
[INFO] [stderr]    |
[INFO] [stderr] 29 | pub fn can_partition(nums: Vec<i32>) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `lcs` is never used
[INFO] [stderr]  --> src/day_51/mod.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn lcs(t1: &String, t2: &String, i: usize, j: usize, dp: &mut Vec<Vec<i32>>) -> i32 {
[INFO] [stderr]   |    ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `longest_common_subsequence` is never used
[INFO] [stderr]   --> src/day_51/mod.rs:19:8
[INFO] [stderr]    |
[INFO] [stderr] 19 | pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `is_safe` is never used
[INFO] [stderr]  --> src/day_52/mod.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn is_safe(grid: &Vec<Vec<char>>, row: i32, col: i32, visited: &mut Vec<Vec<bool>>) -> bool {
[INFO] [stderr]   |    ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `dfs` is never used
[INFO] [stderr]   --> src/day_52/mod.rs:10:4
[INFO] [stderr]    |
[INFO] [stderr] 10 | fn dfs(grid: &Vec<Vec<char>>, row: i32, col: i32, visited: &mut Vec<Vec<bool>>) {
[INFO] [stderr]    |    ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `num_islands` is never used
[INFO] [stderr]   --> src/day_52/mod.rs:21:8
[INFO] [stderr]    |
[INFO] [stderr] 21 | pub fn num_islands(grid: Vec<Vec<char>>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `is_cyclic` is never used
[INFO] [stderr]  --> src/day_53/mod.rs:3:4
[INFO] [stderr]   |
[INFO] [stderr] 3 | fn is_cyclic(course: i32, graph: &HashMap<i32, Vec<i32>>, visited: &mut Vec<bool>, rec_stack: &mut Vec<bool>) -> bool {
[INFO] [stderr]   |    ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `can_finish` is never used
[INFO] [stderr]   --> src/day_53/mod.rs:23:8
[INFO] [stderr]    |
[INFO] [stderr] 23 | pub fn can_finish(num_courses: i32, prerequisites: Vec<Vec<i32>>) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `oranges_rotting` is never used
[INFO] [stderr]  --> src/day_54/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn oranges_rotting(grid: Vec<Vec<i32>>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `jump_through` is never used
[INFO] [stderr]  --> src/day_55/mod.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn jump_through(nums: &Vec<i32>, curr: usize, dp: &mut Vec<i32>) -> i32 {
[INFO] [stderr]   |    ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `jump` is never used
[INFO] [stderr]   --> src/day_55/mod.rs:29:8
[INFO] [stderr]    |
[INFO] [stderr] 29 | pub fn jump(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `invert_tree` is never used
[INFO] [stderr]  --> src/day_6/mod.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]   |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `diameter_of_binary_tree` is never used
[INFO] [stderr]  --> src/day_7/mod.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub fn diameter_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `fibonachi` is never used
[INFO] [stderr]  --> src/day_8/mod.rs:3:4
[INFO] [stderr]   |
[INFO] [stderr] 3 | fn fibonachi(n: i32, memo: &mut HashMap<i32, i32>) -> i32 {
[INFO] [stderr]   |    ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `climb_stairs` is never used
[INFO] [stderr]   --> src/day_8/mod.rs:17:8
[INFO] [stderr]    |
[INFO] [stderr] 17 | pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `next_vec` is never used
[INFO] [stderr]  --> src/day_9/mod.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn next_vec(pre_vec: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `generate` is never used
[INFO] [stderr]   --> src/day_9/mod.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub fn generate(num_rows: i32) -> Vec<Vec<i32>> {
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `leetcode-100-days-challenge` (lib) generated 113 warnings (run `cargo fix --lib -p leetcode-100-days-challenge` to apply 6 suggestions)
[INFO] [stderr] warning: unused imports: `env` and `path::Path`
[INFO] [stderr]   --> src/day_10/mod.rs:19:13
[INFO] [stderr]    |
[INFO] [stderr] 19 |   use std::{env, fs::read_to_string, path::Path};
[INFO] [stderr]    |             ^^^                      ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `borrow::Borrow`
[INFO] [stderr]   --> src/day_6/mod.rs:21:13
[INFO] [stderr]    |
[INFO] [stderr] 21 |   use std::{borrow::Borrow, cell::RefCell, rc::Rc};
[INFO] [stderr]    |             ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `array_to_bst` is never used
[INFO] [stderr]   --> src/common/binary_tree.rs:10:4
[INFO] [stderr]    |
[INFO] [stderr] 10 | fn array_to_bst(nums: Vec<i32>, start: usize, end: usize) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]    |    ^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `from_arr` is never used
[INFO] [stderr]   --> src/common/binary_tree.rs:41:10
[INFO] [stderr]    |
[INFO] [stderr] 23 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 41 |   pub fn from_arr(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stderr]    |          ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new_with_next` and `to_vec` are never used
[INFO] [stderr]   --> src/common/linked_list.rs:14:10
[INFO] [stderr]    |
[INFO] [stderr] 9  | impl LinkedListNode {
[INFO] [stderr]    | ------------------- associated items in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 14 |   pub fn new_with_next(val: i32, next: Option<Rc<RefCell<LinkedListNode>>>) -> Self {
[INFO] [stderr]    |          ^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 34 |   pub fn to_vec(&self, acc: &mut Vec<i32>) {
[INFO] [stderr]    |          ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `leetcode-100-days-challenge` (lib test) generated 17 warnings (12 duplicates) (run `cargo fix --lib -p leetcode-100-days-challenge --tests` to apply 2 suggestions)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.06s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/leetcode_100_days_challenge-c1257db1f20d57cf)
[INFO] [stdout] 
[INFO] [stdout] running 164 tests
[INFO] [stdout] test day_10::test::max_profit_example_1 ... ok
[INFO] [stdout] test day_10::test::max_profit_example_2 ... ok
[INFO] [stdout] test day_11::tests::example_3_two_sum ... ok
[INFO] [stdout] test day_11::tests::example_2_two_sum ... ok
[INFO] [stdout] test day_11::tests::example_1_two_sum ... ok
[INFO] [stdout] test day_12::test::merge_two_lists_example_3 ... ok
[INFO] [stdout] test day_12::test::merge_two_lists_example_2 ... ok
[INFO] [stdout] test day_13::test::has_cycle_example_1 ... ok
[INFO] [stdout] test day_14::test::get_intersection_node_example_2 ... ok
[INFO] [stdout] test day_13::test::has_cycle_example_3 ... ok
[INFO] [stdout] test day_14::test::get_intersection_node_example_1 ... ok
[INFO] [stdout] test day_14::test::get_intersection_node_example_3 ... ok
[INFO] [stdout] test day_15::test::reserve_linked_list_test_1 ... ok
[INFO] [stdout] test day_18::tests::test_move_zeroes_2 ... ok
[INFO] [stdout] test day_17::test::test_is_valid ... ok
[INFO] [stdout] test day_15::test::reserve_linked_list_test_2 ... ok
[INFO] [stdout] test day_12::test::merge_two_lists_example_1 ... ok
[INFO] [stdout] test day_1::tests::example_5_search_insert ... ok
[INFO] [stdout] test day_20::test::majority_element_test ... ok
[INFO] [stdout] test day_1::tests::example_2_search_insert ... ok
[INFO] [stdout] test day_21::test::test_letter_combinations ... ok
[INFO] [stdout] test day_22::test::test_generate_parenthesis ... ok
[INFO] [stdout] test day_23::test::example_1 ... ok
[INFO] [stdout] test day_23::test::example_3 ... ok
[INFO] [stdout] test day_23::test::example_2 ... ok
[INFO] [stdout] test day_24::tests::test_permute_1 ... ok
[INFO] [stdout] test day_16::test::test_is_palindrome_1 ... ok
[INFO] [stdout] test day_16::test::test_is_palindrome_2 ... ok
[INFO] [stdout] test day_18::tests::test_move_zeroes_1 ... ok
[INFO] [stdout] test day_1::tests::example_3_search_insert ... ok
[INFO] [stdout] test day_19::test::single_number_test_2 ... ok
[INFO] [stdout] test day_1::tests::example_4_search_insert ... ok
[INFO] [stdout] test day_24::tests::test_permute_2 ... ok
[INFO] [stdout] test day_24::tests::test_permute_3 ... ok
[INFO] [stdout] test day_25::test::test_subsets ... ok
[INFO] [stdout] test day_26::test::test_exist_3 ... ok
[INFO] [stdout] test day_25::test::test_subsets_2 ... ok
[INFO] [stdout] test day_27::test::test_partition_1 ... ok
[INFO] [stdout] test day_27::test::test_partition_2 ... ok
[INFO] [stdout] test day_26::test::test_exist_2 ... ok
[INFO] [stdout] test day_26::test::test_exist_1 ... ok
[INFO] [stdout] test day_26::test::test_exist_4 ... ok
[INFO] [stdout] test day_19::test::single_number_test_1 ... ok
[INFO] [stdout] test day_1::tests::example_1_search_insert ... ok
[INFO] [stdout] test day_15::test::reserve_linked_list_test_3 ... ok
[INFO] [stdout] test day_19::test::single_number_test_3 ... ok
[INFO] [stdout] test day_28::tests::test_search ... ok
[INFO] [stdout] test day_28::tests::test_search_2 ... ok
[INFO] [stdout] test day_28::tests::test_search_4 ... ok
[INFO] [stdout] test day_28::tests::test_search_5 ... ok
[INFO] [stdout] test day_29::test::test_search_range ... ok
[INFO] [stdout] test day_2::test::example_1_inorder_traversal ... ok
[INFO] [stdout] test day_2::test::example_2_inorder_traversal ... ok
[INFO] [stdout] test day_30::test::test_search_matrix_2 ... ok
[INFO] [stdout] test day_31::test::test_find_min ... ok
[INFO] [stdout] test day_28::tests::test_search_3 ... ok
[INFO] [stdout] test day_31::test::test_find_min_2 ... ok
[INFO] [stdout] test day_30::test::test_search_matrix_3 ... ok
[INFO] [stdout] test day_30::test::test_search_matrix_4 ... ok
[INFO] [stdout] test day_2::test::example_3_inorder_traversal ... ok
[INFO] [stdout] test day_30::test::test_search_matrix ... ok
[INFO] [stdout] test day_31::test::test_find_min_3 ... ok
[INFO] [stdout] test day_31::test::test_find_min_4 ... ok
[INFO] [stdout] test day_32::test::test_is_valid_bst ... ok
[INFO] [stdout] test day_32::test::test_is_valid_bst_3 ... ok
[INFO] [stdout] test day_10::test::max_profit_example_3 ... ok
[INFO] [stdout] test day_33::test::test_level_order ... ok
[INFO] [stdout] test day_33::test::test_level_order_2 ... ok
[INFO] [stdout] test day_33::test::test_level_order_3 ... ok
[INFO] [stdout] test day_32::test::test_is_valid_bst_5 ... ok
[INFO] [stdout] test day_35::test::test_flatten ... ok
[INFO] [stdout] test day_32::test::test_is_valid_bst_2 ... ok
[INFO] [stdout] test day_35::test::test_flatten_2 ... ok
[INFO] [stdout] test day_34::test::test_build_tree ... ok
[INFO] [stdout] test day_35::test::test_flatten_3 ... ok
[INFO] [stdout] test day_36::test::example_1 ... ok
[INFO] [stdout] test day_36::test::example_2 ... ok
[INFO] [stdout] test day_32::test::test_is_valid_bst_4 ... ok
[INFO] [stdout] test day_31::test::test_find_min_5 ... ok
[INFO] [stdout] test day_34::test::test_build_tree_2 ... ok
[INFO] [stdout] test day_36::test::example_3 ... ok
[INFO] [stdout] test day_36::test::example_4 ... ok
[INFO] [stdout] test day_37::test::example_1 ... ok
[INFO] [stdout] test day_37::test::example_2 ... ok
[INFO] [stdout] test day_38::test::example_1 ... ok
[INFO] [stdout] test day_39::test::example_2 ... ok
[INFO] [stdout] test day_39::test::example_1 ... ok
[INFO] [stdout] test day_39::test::example_3 ... ok
[INFO] [stdout] test day_38::test::example_2 ... ok
[INFO] [stdout] test day_3::test::example_2_is_symmetric ... ok
[INFO] [stdout] test day_3::test::example_1_is_symmetric ... ok
[INFO] [stdout] test day_40::test::example_2 ... ok
[INFO] [stdout] test day_38::test::example_3 ... ok
[INFO] [stdout] test day_40::test::exmaple_3 ... ok
[INFO] [stdout] test day_42::test::test_min_path_sum_2 ... ok
[INFO] [stdout] test day_42::test::test_min_path_sum_3 ... ok
[INFO] [stdout] test day_41::test::example_2 ... ok
[INFO] [stdout] test day_40::test::example_5 ... ok
[INFO] [stdout] test day_41::test::example_1 ... ok
[INFO] [stdout] test day_43::test::test_min_distance ... ok
[INFO] [stdout] test day_41::test::example_3 ... ok
[INFO] [stdout] test day_43::test::test_min_distance_2 ... ok
[INFO] [stdout] test day_41::test::example_4 ... ok
[INFO] [stdout] test day_44::test::example_1 ... ok
[INFO] [stdout] test day_44::test::example_2 ... ok
[INFO] [stdout] test day_44::test::example_3 ... ok
[INFO] [stdout] test day_45::test::example_1 ... ok
[INFO] [stdout] test day_43::test::test_min_distance_3 ... ok
[INFO] [stdout] test day_45::test::example_2 ... ok
[INFO] [stdout] test day_41::test::example_5 ... ok
[INFO] [stdout] test day_42::test::test_min_path_sum ... ok
[INFO] [stdout] test day_40::test::example_4 ... ok
[INFO] [stdout] test day_46::test::example_1 ... ok
[INFO] [stdout] test day_46::test::example_3 ... ok
[INFO] [stdout] test day_46::test::example_4 ... ok
[INFO] [stdout] test day_46::test::example_5 ... ok
[INFO] [stdout] test day_47::test::example_1 ... ok
[INFO] [stdout] test day_47::test::example_2 ... ok
[INFO] [stdout] test day_47::test::example_3 ... ok
[INFO] [stdout] test day_47::test::example_4 ... ok
[INFO] [stdout] test day_45::test::example_3 ... ok
[INFO] [stdout] test day_45::test::example_4 ... ok
[INFO] [stdout] test day_45::test::example_6 ... ok
[INFO] [stdout] test day_46::test::example_2 ... ok
[INFO] [stdout] test day_47::test::example_5 ... ok
[INFO] [stdout] test day_48::test::example_2 ... ok
[INFO] [stdout] test day_48::test::example_1 ... ok
[INFO] [stdout] test day_49::test::example_2 ... ok
[INFO] [stdout] test day_48::test::example_3 ... ok
[INFO] [stdout] test day_4::test::example_1_max_depth ... ok
[INFO] [stdout] test day_4::test::example_2_max_depth ... ok
[INFO] [stdout] test day_45::test::example_5 ... ok
[INFO] [stdout] test day_50::tests::example_1 ... ok
[INFO] [stdout] test day_50::tests::example_2 ... ok
[INFO] [stdout] test day_49::test::example_1 ... ok
[INFO] [stdout] test day_49::test::example_4 ... ok
[INFO] [stdout] test day_51::test::example_2 ... ok
[INFO] [stdout] test day_51::test::example_3 ... ok
[INFO] [stdout] test day_52::test::example_1 ... ok
[INFO] [stdout] test day_52::test::example_2 ... ok
[INFO] [stdout] test day_51::test::example_1 ... ok
[INFO] [stdout] test day_52::test::example_3 ... ok
[INFO] [stdout] test day_53::test::example_2 ... ok
[INFO] [stdout] test day_54::test::example_2 ... ok
[INFO] [stdout] test day_54::test::example_1 ... ok
[INFO] [stdout] test day_49::test::example_3 ... ok
[INFO] [stdout] test day_53::test::example_1 ... ok
[INFO] [stdout] test day_55::test::example_1 ... ok
[INFO] [stdout] test day_55::test::example_2 ... ok
[INFO] [stdout] test day_5::test::example_1_sorted_array_to_bst ... ok
[INFO] [stdout] test day_6::test::example_3_invert_tree ... ok
[INFO] [stdout] test day_7::test::example_1 ... ok
[INFO] [stdout] test day_5::test::example_2_sorted_array_to_bst ... ok
[INFO] [stdout] test day_7::test::example_2 ... ok
[INFO] [stdout] test day_6::test::example_1_invert_tree ... ok
[INFO] [stdout] test day_8::tests::test_climb_stairs_2 ... ok
[INFO] [stdout] test day_6::test::example_2_invert_tree ... ok
[INFO] [stdout] test day_8::tests::test_climb_stairs ... ok
[INFO] [stdout] test day_9::test::test_2_generate ... ok
[INFO] [stdout] test day_9::test::test_1_generate ... ok
[INFO] [stdout] test day_40::test::example_1 ... ok
[INFO] [stdout] test day_54::test::example_3 ... ok
[INFO] [stdout] test day_48::test::example_4 ... ok
[INFO] [stdout] test day_51::test::example_4 ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 164 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.35s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests leetcode_100_days_challenge
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "bb293294f45c5a30a66c441298949e5b2b7736bcd0575d944de38e8b330d6d17", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "bb293294f45c5a30a66c441298949e5b2b7736bcd0575d944de38e8b330d6d17", kill_on_drop: false }`
[INFO] [stdout] bb293294f45c5a30a66c441298949e5b2b7736bcd0575d944de38e8b330d6d17
