[INFO] cloning repository https://github.com/biandc/ti_gr
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/biandc/ti_gr" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fbiandc%2Fti_gr", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fbiandc%2Fti_gr'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] bdaad32e699e3c8902af4618e9d2095d383c8e71
[INFO] checking biandc/ti_gr/bdaad32e699e3c8902af4618e9d2095d383c8e71 against master#a6acf0f07f0ed1c12e26dc0db3b9bf1d0504a0bb for pr-151109
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fbiandc%2Fti_gr" "/workspace/builds/worker-3-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc1/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/biandc/ti_gr
[INFO] finished tweaking git repo https://github.com/biandc/ti_gr
[INFO] tweaked toml for git repo https://github.com/biandc/ti_gr written to /workspace/builds/worker-3-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/biandc/ti_gr on toolchain a6acf0f07f0ed1c12e26dc0db3b9bf1d0504a0bb
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+a6acf0f07f0ed1c12e26dc0db3b9bf1d0504a0bb" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/biandc/ti_gr 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" "+a6acf0f07f0ed1c12e26dc0db3b9bf1d0504a0bb" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:98afbf2d16093dec2546ff8915fddc74e65664aa03fc460b3712b1c2c54a33e4" "/opt/rustwide/cargo-home/bin/cargo" "+a6acf0f07f0ed1c12e26dc0db3b9bf1d0504a0bb" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 3daf44f50304ff8a84a0500227b627f89e9d14ad0ee0e5641413a2d797726e90
[INFO] running `Command { std: "docker" "start" "-a" "3daf44f50304ff8a84a0500227b627f89e9d14ad0ee0e5641413a2d797726e90", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "3daf44f50304ff8a84a0500227b627f89e9d14ad0ee0e5641413a2d797726e90", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "3daf44f50304ff8a84a0500227b627f89e9d14ad0ee0e5641413a2d797726e90", kill_on_drop: false }`
[INFO] [stdout] 3daf44f50304ff8a84a0500227b627f89e9d14ad0ee0e5641413a2d797726e90
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:98afbf2d16093dec2546ff8915fddc74e65664aa03fc460b3712b1c2c54a33e4" "/opt/rustwide/cargo-home/bin/cargo" "+a6acf0f07f0ed1c12e26dc0db3b9bf1d0504a0bb" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 9cadbdb9871591394afb53016ed89f6874b7794fcccd50ac8ebb3deab1627c6e
[INFO] running `Command { std: "docker" "start" "-a" "9cadbdb9871591394afb53016ed89f6874b7794fcccd50ac8ebb3deab1627c6e", kill_on_drop: false }`
[INFO] [stderr]     Checking ti_gr v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] error: expected item after doc comment
[INFO] [stdout]   --> src/t_041_232_implement_queue_using_stacks/MyQueue.rs:33:1
[INFO] [stdout]    |
[INFO] [stdout] 33 | / /**
[INFO] [stdout] 34 | |  * Your MyQueue object will be instantiated and called as such:
[INFO] [stdout] 35 | |  * let obj = MyQueue::new();
[INFO] [stdout] 36 | |  * obj.push(x);
[INFO] [stdout] ...  |
[INFO] [stdout] 39 | |  * let ret_4: bool = obj.empty();
[INFO] [stdout] 40 | |  */
[INFO] [stdout]    | |___^ this doc comment doesn't document anything
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: expected item after doc comment
[INFO] [stdout]   --> src/t_042_225_implement_stack_using_queues/MyStack.rs:33:1
[INFO] [stdout]    |
[INFO] [stdout] 33 | / /**
[INFO] [stdout] 34 | |  * Your MyStack object will be instantiated and called as such:
[INFO] [stdout] 35 | |  * let obj = MyStack::new();
[INFO] [stdout] 36 | |  * obj.push(x);
[INFO] [stdout] ...  |
[INFO] [stdout] 39 | |  * let ret_4: bool = obj.empty();
[INFO] [stdout] 40 | |  */
[INFO] [stdout]    | |___^ this doc comment doesn't document anything
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: expected item after doc comment
[INFO] [stdout]   --> src/t_041_232_implement_queue_using_stacks/MyQueue.rs:33:1
[INFO] [stdout]    |
[INFO] [stdout] 33 | / /**
[INFO] [stdout] 34 | |  * Your MyQueue object will be instantiated and called as such:
[INFO] [stdout] 35 | |  * let obj = MyQueue::new();
[INFO] [stdout] 36 | |  * obj.push(x);
[INFO] [stdout] ...  |
[INFO] [stdout] 39 | |  * let ret_4: bool = obj.empty();
[INFO] [stdout] 40 | |  */
[INFO] [stdout]    | |___^ this doc comment doesn't document anything
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: expected item after doc comment
[INFO] [stdout]   --> src/t_042_225_implement_stack_using_queues/MyStack.rs:33:1
[INFO] [stdout]    |
[INFO] [stdout] 33 | / /**
[INFO] [stdout] 34 | |  * Your MyStack object will be instantiated and called as such:
[INFO] [stdout] 35 | |  * let obj = MyStack::new();
[INFO] [stdout] 36 | |  * obj.push(x);
[INFO] [stdout] ...  |
[INFO] [stdout] 39 | |  * let ret_4: bool = obj.empty();
[INFO] [stdout] 40 | |  */
[INFO] [stdout]    | |___^ this doc comment doesn't document anything
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_048_144_binary_tree_preorder_traversal/preorder_traversal.rs:24:55
[INFO] [stdout]    |
[INFO] [stdout] 24 |     pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |                                                       ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_049_94_binary_tree_inorder_traversal/inorder_traversal.rs:23:54
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |                                                      ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_050_145_binary_tree_postorder_traversal/postorder_traversal.rs:23:56
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |                                                        ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_051_102_binary_tree_level_order_traversal/level_order.rs:23:48
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {}
[INFO] [stdout]    |                                                ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_052_107_binary_tree_level_order_traversal_ii/level_order_bottom.rs:23:55
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn level_order_bottom(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {}
[INFO] [stdout]    |                                                       ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_053_199_binary_tree_right_side_view/right_side_view.rs:23:52
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |                                                    ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_054_637_average_of_levels_in_binary_tree/average_of_levels.rs:23:54
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn average_of_levels(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<f64> {}
[INFO] [stdout]    |                                                      ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_056_515_find_largest_value_in_each_tree_row/largest_values.rs:23:51
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn largest_values(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |                                                   ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_059_104_maximum_depth_of_binary_tree/max_depth.rs:23:46
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |                                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_060_111_minimum_depth_of_binary_tree/min_depth.rs:23:46
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn min_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |                                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_061_226_invert_binary_tree/invert_tree.rs:23:48
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_061_226_invert_binary_tree/invert_tree.rs:23:82
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                                                  ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_064_101_symmetric_tree/is_symmetric.rs:23:49
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {}
[INFO] [stdout]    |                                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_065_100_same_tree/is_same_tree.rs:24:30
[INFO] [stdout]    |
[INFO] [stdout] 24 |         p: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_065_100_same_tree/is_same_tree.rs:25:30
[INFO] [stdout]    |
[INFO] [stdout] 25 |         q: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_066_572_subtree_of_another_tree/is_subtree.rs:24:33
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_066_572_subtree_of_another_tree/is_subtree.rs:25:37
[INFO] [stdout]    |
[INFO] [stdout] 25 |         sub_root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                     ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_068_222_count_complete_tree_nodes/count_nodes.rs:23:48
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn count_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |                                                ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_069_110_balanced_binary_tree/is_balanced.rs:23:48
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_balanced(root: Option<Rc<RefCell<TreeNode>>>) -> bool {}
[INFO] [stdout]    |                                                ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_070_257_binary_tree_paths/binary_tree_paths.rs:23:54
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn binary_tree_paths(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<String> {}
[INFO] [stdout]    |                                                      ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_071_404_sum_of_left_leaves/sum_of_left_leaves.rs:23:55
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn sum_of_left_leaves(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |                                                       ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_072_513_find_bottom_left_tree_value/find_bottom_left_value.rs:23:59
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn find_bottom_left_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |                                                           ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_073_112_path_sum/has_path_sum.rs:23:49
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {}
[INFO] [stdout]    |                                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_074_113_path_sum_ii/path_sum.rs:23:45
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> Vec<Vec<i32>> {}
[INFO] [stdout]    |                                             ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_075_106_construct_binary_tree_from_inorder_and_postorder_traversal/build_tree.rs:23:84
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn build_tree(inorder: Vec<i32>, postorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                                                    ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `Solution` in this scope
[INFO] [stdout]   --> src/t_076_105_construct_binary_tree_from_preorder_and_inorder_traversal/build_tree.rs:22:6
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct SOlution {}
[INFO] [stdout]    | --------------- similarly named struct `SOlution` defined here
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    |      ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout] note: these structs exist but are inaccessible
[INFO] [stdout]   --> src/t_001_704_binary_search/search.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_001_704_binary_search::search::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_002_35_search_insert_position/search_insert.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_002_35_search_insert_position::search_insert::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_003_34_find_first_and_last_position_of_element_in_sorted_array/search_range.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_003_34_find_first_and_last_position_of_element_in_sorted_array::search_range::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_004_69_sqrtx/my_sqrt.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_004_69_sqrtx::my_sqrt::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_005_367_valid_perfect_square/is_perfect_square.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_005_367_valid_perfect_square::is_perfect_square::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_006_27_remove_element/remove_element.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_006_27_remove_element::remove_element::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_007_26_remove_duplicates_from_sorted_array/remove_duplicates.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_007_26_remove_duplicates_from_sorted_array::remove_duplicates::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_008_844_backspace_string_compare/backspace_compare.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_008_844_backspace_string_compare::backspace_compare::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_009_283_move_zeroes/move_zeroes.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_009_283_move_zeroes::move_zeroes::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_010_977_squares_of_a_sorted_array/sorted_squares.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_010_977_squares_of_a_sorted_array::sorted_squares::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_011_209_minimum_size_subarray_sum/min_sub_array_len.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_011_209_minimum_size_subarray_sum::min_sub_array_len::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_012_904_fruit_into_baskets/total_fruit.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_012_904_fruit_into_baskets::total_fruit::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_013_76_minimum_window_substring/min_window.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_013_76_minimum_window_substring::min_window::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_014_59_spiral_matrix_ii/generate_matrix.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_014_59_spiral_matrix_ii::generate_matrix::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_015_54_spiral_matrix/spiral_order.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_015_54_spiral_matrix::spiral_order::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_016_203_remove_linked_list_elements/remove_elements.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_016_203_remove_linked_list_elements::remove_elements::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_018_206_reverse_linked_list/reverse_list.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_018_206_reverse_linked_list::reverse_list::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_019_24_swap_nodes_in_pairs/swap_pairs.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_019_24_swap_nodes_in_pairs::swap_pairs::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_020_19_remove_nth_node_from_end_of_list/remove_nth_from_end.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_020_19_remove_nth_node_from_end_of_list::remove_nth_from_end::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_023_242_valid_anagram/is_anagram.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_023_242_valid_anagram::is_anagram::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_024_383_ransom_note/can_construct.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_024_383_ransom_note::can_construct::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_025_49_group_anagrams/group_anagrams.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_025_49_group_anagrams::group_anagrams::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_026_438_find_all_anagrams_in_a_string/find_anagrams.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_026_438_find_all_anagrams_in_a_string::find_anagrams::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_027_1002_find_common_characters/common_chars.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_027_1002_find_common_characters::common_chars::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_028_349_intersection_of_two_arrays/intersection.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_028_349_intersection_of_two_arrays::intersection::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_029_202_happy_number/is_happy.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_029_202_happy_number::is_happy::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_030_1_two_sum/two_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_030_1_two_sum::two_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_031_454_4sum_ii/four_sum_count.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_031_454_4sum_ii::four_sum_count::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_032_15_3sum/three_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_032_15_3sum::three_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_033_18_4sum/four_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_033_18_4sum::four_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_034_344_reverse_string/reverse_string.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_034_344_reverse_string::reverse_string::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_035_541_reverse_string_ii/reverse_str.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_035_541_reverse_string_ii::reverse_str::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_036_offer05_ti_huan_kong_ge_lcof/replace_space.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_036_offer05_ti_huan_kong_ge_lcof::replace_space::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_037_151_reverse_words_in_a_string/reverse_words.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_037_151_reverse_words_in_a_string::reverse_words::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_038_offer58ii_zuo_xuan_zhuan_zi_fu_chuan_lcof/reverse_left_words.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_038_offer58ii_zuo_xuan_zhuan_zi_fu_chuan_lcof::reverse_left_words::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_039_28_find_the_index_of_the_first_occurrence_in_a_string/str_str.rs:2:1
[INFO] [stdout]    |
[INFO] [stdout]  2 | struct Solution{}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_039_28_find_the_index_of_the_first_occurrence_in_a_string::str_str::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_040_459_repeated_substring_pattern/repeated_substring_pattern.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_040_459_repeated_substring_pattern::repeated_substring_pattern::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_043_20_valid_parentheses/is_valid.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution{}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_043_20_valid_parentheses::is_valid::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_044_1047_remove_all_adjacent_duplicates_in_string/remove_duplicates.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_044_1047_remove_all_adjacent_duplicates_in_string::remove_duplicates::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_045_150_evaluate_reverse_polish_notation/eval_rpn.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_045_150_evaluate_reverse_polish_notation::eval_rpn::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_046_239_sliding_window_maximum/max_sliding_window.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_046_239_sliding_window_maximum::max_sliding_window::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_047_347_top_k_frequent_elements/top_k_frequent.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_047_347_top_k_frequent_elements::top_k_frequent::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_048_144_binary_tree_preorder_traversal/preorder_traversal.rs:22:1
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_048_144_binary_tree_preorder_traversal::preorder_traversal::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_049_94_binary_tree_inorder_traversal/inorder_traversal.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_049_94_binary_tree_inorder_traversal::inorder_traversal::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_050_145_binary_tree_postorder_traversal/postorder_traversal.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_050_145_binary_tree_postorder_traversal::postorder_traversal::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_051_102_binary_tree_level_order_traversal/level_order.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_051_102_binary_tree_level_order_traversal::level_order::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_052_107_binary_tree_level_order_traversal_ii/level_order_bottom.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_052_107_binary_tree_level_order_traversal_ii::level_order_bottom::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_053_199_binary_tree_right_side_view/right_side_view.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_053_199_binary_tree_right_side_view::right_side_view::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_054_637_average_of_levels_in_binary_tree/average_of_levels.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_054_637_average_of_levels_in_binary_tree::average_of_levels::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_056_515_find_largest_value_in_each_tree_row/largest_values.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_056_515_find_largest_value_in_each_tree_row::largest_values::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_059_104_maximum_depth_of_binary_tree/max_depth.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_059_104_maximum_depth_of_binary_tree::max_depth::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_060_111_minimum_depth_of_binary_tree/min_depth.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_060_111_minimum_depth_of_binary_tree::min_depth::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_061_226_invert_binary_tree/invert_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_061_226_invert_binary_tree::invert_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_064_101_symmetric_tree/is_symmetric.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_064_101_symmetric_tree::is_symmetric::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_065_100_same_tree/is_same_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_065_100_same_tree::is_same_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_066_572_subtree_of_another_tree/is_subtree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_066_572_subtree_of_another_tree::is_subtree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_068_222_count_complete_tree_nodes/count_nodes.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_068_222_count_complete_tree_nodes::count_nodes::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_069_110_balanced_binary_tree/is_balanced.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_069_110_balanced_binary_tree::is_balanced::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_070_257_binary_tree_paths/binary_tree_paths.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_070_257_binary_tree_paths::binary_tree_paths::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_071_404_sum_of_left_leaves/sum_of_left_leaves.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_071_404_sum_of_left_leaves::sum_of_left_leaves::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_072_513_find_bottom_left_tree_value/find_bottom_left_value.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_072_513_find_bottom_left_tree_value::find_bottom_left_value::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_073_112_path_sum/has_path_sum.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_073_112_path_sum::has_path_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_074_113_path_sum_ii/path_sum.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_074_113_path_sum_ii::path_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_075_106_construct_binary_tree_from_inorder_and_postorder_traversal/build_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_075_106_construct_binary_tree_from_inorder_and_postorder_traversal::build_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_077_654_maximum_binary_tree/construct_maximum_binary_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_077_654_maximum_binary_tree::construct_maximum_binary_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_078_617_merge_two_binary_trees/merge_trees.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_078_617_merge_two_binary_trees::merge_trees::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_079_700_search_in_a_binary_search_tree/search_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_079_700_search_in_a_binary_search_tree::search_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_080_98_validate_binary_search_tree/is_valid_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_080_98_validate_binary_search_tree::is_valid_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_081_530_minimum_absolute_difference_in_bst/get_minimum_difference.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_081_530_minimum_absolute_difference_in_bst::get_minimum_difference::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_082_501_find_mode_in_binary_search_tree/find_mode.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_082_501_find_mode_in_binary_search_tree::find_mode::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_083_236_lowest_common_ancestor_of_a_binary_tree/lowest_common_ancestor.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_083_236_lowest_common_ancestor_of_a_binary_tree::lowest_common_ancestor::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_084_235_lowest_common_ancestor_of_a_binary_search_tree/lowest_common_ancestor.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_084_235_lowest_common_ancestor_of_a_binary_search_tree::lowest_common_ancestor::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_085_701_insert_into_a_binary_search_tree/insert_into_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_085_701_insert_into_a_binary_search_tree::insert_into_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_086_450_delete_node_in_a_bst/delete_node.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_086_450_delete_node_in_a_bst::delete_node::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_087_669_trim_a_binary_search_tree/trim_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_087_669_trim_a_binary_search_tree::trim_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_088_108_convert_sorted_array_to_binary_search_tree/sorted_array_to_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_088_108_convert_sorted_array_to_binary_search_tree::sorted_array_to_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_089_538_convert_bst_to_greater_tree/convert_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_089_538_convert_bst_to_greater_tree::convert_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_090_77_combinations/combine.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_090_77_combinations::combine::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_092_17_letter_combinations_of_a_phone_number/letter_combinations.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_092_17_letter_combinations_of_a_phone_number::letter_combinations::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_093_39_combination_sum/combination_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_093_39_combination_sum::combination_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_094_40_combination_sum_ii/combination_sum2.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_094_40_combination_sum_ii::combination_sum2::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_095_131_palindrome_partitioning/partition.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_095_131_palindrome_partitioning::partition::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_096_93_restore_ip_addresses/restore_ip_addresses.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_096_93_restore_ip_addresses::restore_ip_addresses::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_097_78_subsets/subsets.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_097_78_subsets::subsets::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_098_90_subsets_ii/subsets_with_dup.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_098_90_subsets_ii::subsets_with_dup::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_099_491_increasing_subsequences/find_subsequences.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_099_491_increasing_subsequences::find_subsequences::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_100_46_permutations/permute.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_100_46_permutations::permute::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_101_47_permutations_ii/permute_unique.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_101_47_permutations_ii::permute_unique::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_102_332_reconstruct_itinerary/find_itinerary.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_102_332_reconstruct_itinerary::find_itinerary::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_103_51_n_queens/solve_n_queens.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_103_51_n_queens::solve_n_queens::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_104_37_sudoku_solver/solve_sudoku.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_104_37_sudoku_solver::solve_sudoku::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_105_455_assign_cookies/find_content_children.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_105_455_assign_cookies::find_content_children::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_106_376_wiggle_subsequence/wiggle_max_length.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_106_376_wiggle_subsequence::wiggle_max_length::Solution`: not accessible
[INFO] [stdout] help: a struct with a similar name exists (notice the capitalization)
[INFO] [stdout]    |
[INFO] [stdout] 22 - impl Solution {
[INFO] [stdout] 22 + impl SOlution {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_076_105_construct_binary_tree_from_preorder_and_inorder_traversal/build_tree.rs:23:83
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn build_tree(preorder: Vec<i32>, inorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                                                   ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_077_654_maximum_binary_tree/construct_maximum_binary_tree.rs:23:79
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn construct_maximum_binary_tree(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                                               ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_078_617_merge_two_binary_trees/merge_trees.rs:24:34
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root1: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                  ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_078_617_merge_two_binary_trees/merge_trees.rs:25:34
[INFO] [stdout]    |
[INFO] [stdout] 25 |         root2: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                  ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_078_617_merge_two_binary_trees/merge_trees.rs:26:28
[INFO] [stdout]    |
[INFO] [stdout] 26 |     ) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |                            ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_079_700_search_in_a_binary_search_tree/search_bst.rs:24:33
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_079_700_search_in_a_binary_search_tree/search_bst.rs:26:28
[INFO] [stdout]    |
[INFO] [stdout] 26 |     ) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |                            ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_080_98_validate_binary_search_tree/is_valid_bst.rs:23:49
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {}
[INFO] [stdout]    |                                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_081_530_minimum_absolute_difference_in_bst/get_minimum_difference.rs:23:59
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |                                                           ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_082_501_find_mode_in_binary_search_tree/find_mode.rs:23:46
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn find_mode(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |                                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_083_236_lowest_common_ancestor_of_a_binary_tree/lowest_common_ancestor.rs:24:33
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_083_236_lowest_common_ancestor_of_a_binary_tree/lowest_common_ancestor.rs:25:30
[INFO] [stdout]    |
[INFO] [stdout] 25 |         p: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_083_236_lowest_common_ancestor_of_a_binary_tree/lowest_common_ancestor.rs:26:30
[INFO] [stdout]    |
[INFO] [stdout] 26 |         q: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_083_236_lowest_common_ancestor_of_a_binary_tree/lowest_common_ancestor.rs:27:28
[INFO] [stdout]    |
[INFO] [stdout] 27 |     ) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |                            ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_084_235_lowest_common_ancestor_of_a_binary_search_tree/lowest_common_ancestor.rs:24:33
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_084_235_lowest_common_ancestor_of_a_binary_search_tree/lowest_common_ancestor.rs:25:30
[INFO] [stdout]    |
[INFO] [stdout] 25 |         p: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_084_235_lowest_common_ancestor_of_a_binary_search_tree/lowest_common_ancestor.rs:26:30
[INFO] [stdout]    |
[INFO] [stdout] 26 |         q: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_084_235_lowest_common_ancestor_of_a_binary_search_tree/lowest_common_ancestor.rs:27:28
[INFO] [stdout]    |
[INFO] [stdout] 27 |     ) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |                            ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_085_701_insert_into_a_binary_search_tree/insert_into_bst.rs:24:33
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_085_701_insert_into_a_binary_search_tree/insert_into_bst.rs:26:28
[INFO] [stdout]    |
[INFO] [stdout] 26 |     ) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |                            ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_086_450_delete_node_in_a_bst/delete_node.rs:24:33
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_086_450_delete_node_in_a_bst/delete_node.rs:26:28
[INFO] [stdout]    |
[INFO] [stdout] 26 |     ) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |                            ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_087_669_trim_a_binary_search_tree/trim_bst.rs:24:33
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_087_669_trim_a_binary_search_tree/trim_bst.rs:27:28
[INFO] [stdout]    |
[INFO] [stdout] 27 |     ) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |                            ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_088_108_convert_sorted_array_to_binary_search_tree/sorted_array_to_bst.rs:23:69
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn sorted_array_to_bst(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                                     ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_089_538_convert_bst_to_greater_tree/convert_bst.rs:23:48
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn convert_bst(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_089_538_convert_bst_to_greater_tree/convert_bst.rs:23:82
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn convert_bst(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                                                  ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `Solution` in this scope
[INFO] [stdout]   --> src/t_091_216_combination_sum_iii/combination_sum3.rs:2:6
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct SOlution {}
[INFO] [stdout]    | --------------- similarly named struct `SOlution` defined here
[INFO] [stdout]  2 | impl Solution {
[INFO] [stdout]    |      ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout] note: these structs exist but are inaccessible
[INFO] [stdout]   --> src/t_001_704_binary_search/search.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_001_704_binary_search::search::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_002_35_search_insert_position/search_insert.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_002_35_search_insert_position::search_insert::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_003_34_find_first_and_last_position_of_element_in_sorted_array/search_range.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_003_34_find_first_and_last_position_of_element_in_sorted_array::search_range::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_004_69_sqrtx/my_sqrt.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_004_69_sqrtx::my_sqrt::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_005_367_valid_perfect_square/is_perfect_square.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_005_367_valid_perfect_square::is_perfect_square::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_006_27_remove_element/remove_element.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_006_27_remove_element::remove_element::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_007_26_remove_duplicates_from_sorted_array/remove_duplicates.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_007_26_remove_duplicates_from_sorted_array::remove_duplicates::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_008_844_backspace_string_compare/backspace_compare.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_008_844_backspace_string_compare::backspace_compare::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_009_283_move_zeroes/move_zeroes.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_009_283_move_zeroes::move_zeroes::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_010_977_squares_of_a_sorted_array/sorted_squares.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_010_977_squares_of_a_sorted_array::sorted_squares::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_011_209_minimum_size_subarray_sum/min_sub_array_len.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_011_209_minimum_size_subarray_sum::min_sub_array_len::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_012_904_fruit_into_baskets/total_fruit.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_012_904_fruit_into_baskets::total_fruit::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_013_76_minimum_window_substring/min_window.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_013_76_minimum_window_substring::min_window::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_014_59_spiral_matrix_ii/generate_matrix.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_014_59_spiral_matrix_ii::generate_matrix::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_015_54_spiral_matrix/spiral_order.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_015_54_spiral_matrix::spiral_order::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_016_203_remove_linked_list_elements/remove_elements.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_016_203_remove_linked_list_elements::remove_elements::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_018_206_reverse_linked_list/reverse_list.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_018_206_reverse_linked_list::reverse_list::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_019_24_swap_nodes_in_pairs/swap_pairs.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_019_24_swap_nodes_in_pairs::swap_pairs::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_020_19_remove_nth_node_from_end_of_list/remove_nth_from_end.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_020_19_remove_nth_node_from_end_of_list::remove_nth_from_end::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_023_242_valid_anagram/is_anagram.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_023_242_valid_anagram::is_anagram::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_024_383_ransom_note/can_construct.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_024_383_ransom_note::can_construct::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_025_49_group_anagrams/group_anagrams.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_025_49_group_anagrams::group_anagrams::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_026_438_find_all_anagrams_in_a_string/find_anagrams.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_026_438_find_all_anagrams_in_a_string::find_anagrams::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_027_1002_find_common_characters/common_chars.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_027_1002_find_common_characters::common_chars::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_028_349_intersection_of_two_arrays/intersection.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_028_349_intersection_of_two_arrays::intersection::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_029_202_happy_number/is_happy.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_029_202_happy_number::is_happy::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_030_1_two_sum/two_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_030_1_two_sum::two_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_031_454_4sum_ii/four_sum_count.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_031_454_4sum_ii::four_sum_count::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_032_15_3sum/three_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_032_15_3sum::three_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_033_18_4sum/four_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_033_18_4sum::four_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_034_344_reverse_string/reverse_string.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_034_344_reverse_string::reverse_string::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_035_541_reverse_string_ii/reverse_str.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_035_541_reverse_string_ii::reverse_str::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_036_offer05_ti_huan_kong_ge_lcof/replace_space.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_036_offer05_ti_huan_kong_ge_lcof::replace_space::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_037_151_reverse_words_in_a_string/reverse_words.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_037_151_reverse_words_in_a_string::reverse_words::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_038_offer58ii_zuo_xuan_zhuan_zi_fu_chuan_lcof/reverse_left_words.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_038_offer58ii_zuo_xuan_zhuan_zi_fu_chuan_lcof::reverse_left_words::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_039_28_find_the_index_of_the_first_occurrence_in_a_string/str_str.rs:2:1
[INFO] [stdout]    |
[INFO] [stdout]  2 | struct Solution{}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_039_28_find_the_index_of_the_first_occurrence_in_a_string::str_str::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_040_459_repeated_substring_pattern/repeated_substring_pattern.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_040_459_repeated_substring_pattern::repeated_substring_pattern::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_043_20_valid_parentheses/is_valid.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution{}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_043_20_valid_parentheses::is_valid::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_044_1047_remove_all_adjacent_duplicates_in_string/remove_duplicates.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_044_1047_remove_all_adjacent_duplicates_in_string::remove_duplicates::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_045_150_evaluate_reverse_polish_notation/eval_rpn.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_045_150_evaluate_reverse_polish_notation::eval_rpn::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_046_239_sliding_window_maximum/max_sliding_window.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_046_239_sliding_window_maximum::max_sliding_window::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_047_347_top_k_frequent_elements/top_k_frequent.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_047_347_top_k_frequent_elements::top_k_frequent::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_048_144_binary_tree_preorder_traversal/preorder_traversal.rs:22:1
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_048_144_binary_tree_preorder_traversal::preorder_traversal::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_049_94_binary_tree_inorder_traversal/inorder_traversal.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_049_94_binary_tree_inorder_traversal::inorder_traversal::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_050_145_binary_tree_postorder_traversal/postorder_traversal.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_050_145_binary_tree_postorder_traversal::postorder_traversal::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_051_102_binary_tree_level_order_traversal/level_order.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_051_102_binary_tree_level_order_traversal::level_order::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_052_107_binary_tree_level_order_traversal_ii/level_order_bottom.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_052_107_binary_tree_level_order_traversal_ii::level_order_bottom::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_053_199_binary_tree_right_side_view/right_side_view.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_053_199_binary_tree_right_side_view::right_side_view::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_054_637_average_of_levels_in_binary_tree/average_of_levels.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_054_637_average_of_levels_in_binary_tree::average_of_levels::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_056_515_find_largest_value_in_each_tree_row/largest_values.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_056_515_find_largest_value_in_each_tree_row::largest_values::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_059_104_maximum_depth_of_binary_tree/max_depth.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_059_104_maximum_depth_of_binary_tree::max_depth::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_060_111_minimum_depth_of_binary_tree/min_depth.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_060_111_minimum_depth_of_binary_tree::min_depth::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_061_226_invert_binary_tree/invert_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_061_226_invert_binary_tree::invert_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_064_101_symmetric_tree/is_symmetric.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_064_101_symmetric_tree::is_symmetric::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_065_100_same_tree/is_same_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_065_100_same_tree::is_same_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_066_572_subtree_of_another_tree/is_subtree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_066_572_subtree_of_another_tree::is_subtree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_068_222_count_complete_tree_nodes/count_nodes.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_068_222_count_complete_tree_nodes::count_nodes::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_069_110_balanced_binary_tree/is_balanced.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_069_110_balanced_binary_tree::is_balanced::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_070_257_binary_tree_paths/binary_tree_paths.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_070_257_binary_tree_paths::binary_tree_paths::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_071_404_sum_of_left_leaves/sum_of_left_leaves.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_071_404_sum_of_left_leaves::sum_of_left_leaves::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_072_513_find_bottom_left_tree_value/find_bottom_left_value.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_072_513_find_bottom_left_tree_value::find_bottom_left_value::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_073_112_path_sum/has_path_sum.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_073_112_path_sum::has_path_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_074_113_path_sum_ii/path_sum.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_074_113_path_sum_ii::path_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_075_106_construct_binary_tree_from_inorder_and_postorder_traversal/build_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_075_106_construct_binary_tree_from_inorder_and_postorder_traversal::build_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_077_654_maximum_binary_tree/construct_maximum_binary_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_077_654_maximum_binary_tree::construct_maximum_binary_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_078_617_merge_two_binary_trees/merge_trees.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_078_617_merge_two_binary_trees::merge_trees::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_079_700_search_in_a_binary_search_tree/search_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_079_700_search_in_a_binary_search_tree::search_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_080_98_validate_binary_search_tree/is_valid_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_080_98_validate_binary_search_tree::is_valid_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_081_530_minimum_absolute_difference_in_bst/get_minimum_difference.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_081_530_minimum_absolute_difference_in_bst::get_minimum_difference::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_082_501_find_mode_in_binary_search_tree/find_mode.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_082_501_find_mode_in_binary_search_tree::find_mode::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_083_236_lowest_common_ancestor_of_a_binary_tree/lowest_common_ancestor.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_083_236_lowest_common_ancestor_of_a_binary_tree::lowest_common_ancestor::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_084_235_lowest_common_ancestor_of_a_binary_search_tree/lowest_common_ancestor.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_084_235_lowest_common_ancestor_of_a_binary_search_tree::lowest_common_ancestor::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_085_701_insert_into_a_binary_search_tree/insert_into_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_085_701_insert_into_a_binary_search_tree::insert_into_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_086_450_delete_node_in_a_bst/delete_node.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_086_450_delete_node_in_a_bst::delete_node::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_087_669_trim_a_binary_search_tree/trim_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_087_669_trim_a_binary_search_tree::trim_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_088_108_convert_sorted_array_to_binary_search_tree/sorted_array_to_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_088_108_convert_sorted_array_to_binary_search_tree::sorted_array_to_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_089_538_convert_bst_to_greater_tree/convert_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_089_538_convert_bst_to_greater_tree::convert_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_090_77_combinations/combine.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_090_77_combinations::combine::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_092_17_letter_combinations_of_a_phone_number/letter_combinations.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_092_17_letter_combinations_of_a_phone_number::letter_combinations::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_093_39_combination_sum/combination_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_093_39_combination_sum::combination_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_094_40_combination_sum_ii/combination_sum2.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_094_40_combination_sum_ii::combination_sum2::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_095_131_palindrome_partitioning/partition.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_095_131_palindrome_partitioning::partition::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_096_93_restore_ip_addresses/restore_ip_addresses.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_096_93_restore_ip_addresses::restore_ip_addresses::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_097_78_subsets/subsets.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_097_78_subsets::subsets::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_098_90_subsets_ii/subsets_with_dup.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_098_90_subsets_ii::subsets_with_dup::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_099_491_increasing_subsequences/find_subsequences.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_099_491_increasing_subsequences::find_subsequences::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_100_46_permutations/permute.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_100_46_permutations::permute::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_101_47_permutations_ii/permute_unique.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_101_47_permutations_ii::permute_unique::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_102_332_reconstruct_itinerary/find_itinerary.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_102_332_reconstruct_itinerary::find_itinerary::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_103_51_n_queens/solve_n_queens.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_103_51_n_queens::solve_n_queens::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_104_37_sudoku_solver/solve_sudoku.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_104_37_sudoku_solver::solve_sudoku::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_105_455_assign_cookies/find_content_children.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_105_455_assign_cookies::find_content_children::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_106_376_wiggle_subsequence/wiggle_max_length.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_106_376_wiggle_subsequence::wiggle_max_length::Solution`: not accessible
[INFO] [stdout] help: a struct with a similar name exists (notice the capitalization)
[INFO] [stdout]    |
[INFO] [stdout]  2 - impl Solution {
[INFO] [stdout]  2 + impl SOlution {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_043_20_valid_parentheses/is_valid.rs:4:35
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn is_valid(s: String) -> bool {
[INFO] [stdout]   |            --------               ^^^^ expected `bool`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_044_1047_remove_all_adjacent_duplicates_in_string/remove_duplicates.rs:3:44
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn remove_duplicates(s: String) -> String {}
[INFO] [stdout]   |            -----------------               ^^^^^^ expected `String`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout] help: consider returning the local binding `s`
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn remove_duplicates(s: String) -> String { s }
[INFO] [stdout]   |                                                     +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_045_150_evaluate_reverse_polish_notation/eval_rpn.rs:3:45
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn eval_rpn(tokens: Vec<String>) -> i32 {}
[INFO] [stdout]   |            --------                         ^^^ expected `i32`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_046_239_sliding_window_maximum/max_sliding_window.rs:4:58
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn max_sliding_window(nums: Vec<i32>, k: i32) -> Vec<i32> {}
[INFO] [stdout]   |            ------------------                            ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<i32>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] help: consider returning the local binding `nums`
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn max_sliding_window(nums: Vec<i32>, k: i32) -> Vec<i32> { nums }
[INFO] [stdout]   |                                                                     ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_047_347_top_k_frequent_elements/top_k_frequent.rs:3:54
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> {}
[INFO] [stdout]   |            --------------                            ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<i32>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] help: consider returning the local binding `nums`
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> { nums }
[INFO] [stdout]   |                                                                 ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_048_144_binary_tree_preorder_traversal/preorder_traversal.rs:24:71
[INFO] [stdout]    |
[INFO] [stdout] 24 |     pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |            ------------------                                         ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<i32>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_049_94_binary_tree_inorder_traversal/inorder_traversal.rs:23:70
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |            -----------------                                         ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<i32>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_050_145_binary_tree_postorder_traversal/postorder_traversal.rs:23:72
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |            -------------------                                         ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<i32>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_051_102_binary_tree_level_order_traversal/level_order.rs:23:64
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {}
[INFO] [stdout]    |            -----------                                         ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_052_107_binary_tree_level_order_traversal_ii/level_order_bottom.rs:23:71
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn level_order_bottom(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {}
[INFO] [stdout]    |            ------------------                                         ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_053_199_binary_tree_right_side_view/right_side_view.rs:23:68
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |            ---------------                                         ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<i32>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_054_637_average_of_levels_in_binary_tree/average_of_levels.rs:23:70
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn average_of_levels(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<f64> {}
[INFO] [stdout]    |            -----------------                                         ^^^^^^^^ expected `Vec<f64>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<f64>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_056_515_find_largest_value_in_each_tree_row/largest_values.rs:23:67
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn largest_values(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |            --------------                                         ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<i32>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_059_104_maximum_depth_of_binary_tree/max_depth.rs:23:62
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |            ---------                                         ^^^ expected `i32`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_060_111_minimum_depth_of_binary_tree/min_depth.rs:23:62
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn min_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |            ---------                                         ^^^ expected `i32`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_064_101_symmetric_tree/is_symmetric.rs:23:65
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {}
[INFO] [stdout]    |            ------------                                         ^^^^ expected `bool`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_065_100_same_tree/is_same_tree.rs:26:10
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_same_tree(
[INFO] [stdout]    |            ------------ implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] ...
[INFO] [stdout] 26 |     ) -> bool {
[INFO] [stdout]    |          ^^^^ expected `bool`, found `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_066_572_subtree_of_another_tree/is_subtree.rs:26:10
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_subtree(
[INFO] [stdout]    |            ---------- implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] ...
[INFO] [stdout] 26 |     ) -> bool {
[INFO] [stdout]    |          ^^^^ expected `bool`, found `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_068_222_count_complete_tree_nodes/count_nodes.rs:23:64
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn count_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |            -----------                                         ^^^ expected `i32`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_069_110_balanced_binary_tree/is_balanced.rs:23:64
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_balanced(root: Option<Rc<RefCell<TreeNode>>>) -> bool {}
[INFO] [stdout]    |            -----------                                         ^^^^ expected `bool`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_070_257_binary_tree_paths/binary_tree_paths.rs:23:70
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn binary_tree_paths(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<String> {}
[INFO] [stdout]    |            -----------------                                         ^^^^^^^^^^^ expected `Vec<String>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<String>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_071_404_sum_of_left_leaves/sum_of_left_leaves.rs:23:71
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn sum_of_left_leaves(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |            ------------------                                         ^^^ expected `i32`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_072_513_find_bottom_left_tree_value/find_bottom_left_value.rs:23:75
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn find_bottom_left_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |            ----------------------                                         ^^^ expected `i32`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_073_112_path_sum/has_path_sum.rs:23:82
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {}
[INFO] [stdout]    |            ------------                                                          ^^^^ expected `bool`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_074_113_path_sum_ii/path_sum.rs:23:78
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> Vec<Vec<i32>> {}
[INFO] [stdout]    |            --------                                                          ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_080_98_validate_binary_search_tree/is_valid_bst.rs:23:65
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {}
[INFO] [stdout]    |            ------------                                         ^^^^ expected `bool`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_081_530_minimum_absolute_difference_in_bst/get_minimum_difference.rs:23:75
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |            ----------------------                                         ^^^ expected `i32`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_082_501_find_mode_in_binary_search_tree/find_mode.rs:23:62
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn find_mode(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |            ---------                                         ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<i32>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_090_77_combinations/combine.rs:3:39
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            -------                    ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_091_216_combination_sum_iii/combination_sum3.rs:3:48
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn combination_sum3(k: i32, n: i32) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            ----------------                    ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_092_17_letter_combinations_of_a_phone_number/letter_combinations.rs:3:51
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn letter_combinations(digits: String) -> Vec<String> {}
[INFO] [stdout]   |            -------------------                    ^^^^^^^^^^^ expected `Vec<String>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<String>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_093_39_combination_sum/combination_sum.rs:3:66
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn combination_sum(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            ---------------                                       ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_094_40_combination_sum_ii/combination_sum2.rs:3:67
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn combination_sum2(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            ----------------                                       ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_095_131_palindrome_partitioning/partition.rs:3:36
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn partition(s: String) -> Vec<Vec<String>> {}
[INFO] [stdout]   |            ---------               ^^^^^^^^^^^^^^^^ expected `Vec<Vec<String>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<String>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_096_93_restore_ip_addresses/restore_ip_addresses.rs:3:47
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn restore_ip_addresses(s: String) -> Vec<String> {}
[INFO] [stdout]   |            --------------------               ^^^^^^^^^^^ expected `Vec<String>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<String>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_097_78_subsets/subsets.rs:3:39
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            -------                    ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_098_90_subsets_ii/subsets_with_dup.rs:3:48
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn subsets_with_dup(nums: Vec<i32>) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            ----------------                    ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_099_491_increasing_subsequences/find_subsequences.rs:3:49
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn find_subsequences(nums: Vec<i32>) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            -----------------                    ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_100_46_permutations/permute.rs:3:39
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            -------                    ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_101_47_permutations_ii/permute_unique.rs:3:46
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn permute_unique(nums: Vec<i32>) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            --------------                    ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_102_332_reconstruct_itinerary/find_itinerary.rs:3:57
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn find_itinerary(tickets: Vec<Vec<String>>) -> Vec<String> {}
[INFO] [stdout]   |            --------------                               ^^^^^^^^^^^ expected `Vec<String>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<String>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_103_51_n_queens/solve_n_queens.rs:3:38
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn solve_n_queens(n: i32) -> Vec<Vec<String>> {}
[INFO] [stdout]   |            --------------            ^^^^^^^^^^^^^^^^ expected `Vec<Vec<String>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<String>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_105_455_assign_cookies/find_content_children.rs:3:63
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn find_content_children(g: Vec<i32>, s: Vec<i32>) -> i32 {}
[INFO] [stdout]   |            ---------------------                              ^^^ expected `i32`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_106_376_wiggle_subsequence/wiggle_max_length.rs:3:49
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn wiggle_max_length(nums: Vec<i32>) -> i32 {}
[INFO] [stdout]   |            -----------------                    ^^^ expected `i32`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_001_704_binary_search/search.rs:4:19
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |                   ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `target`
[INFO] [stdout]  --> src/t_001_704_binary_search/search.rs:4:35
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |                                   ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_002_35_search_insert_position/search_insert.rs:4:26
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |                          ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `target`
[INFO] [stdout]  --> src/t_002_35_search_insert_position/search_insert.rs:4:42
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |                                          ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_003_34_find_first_and_last_position_of_element_in_sorted_array/search_range.rs:4:25
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn search_range(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |                         ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `target`
[INFO] [stdout]  --> src/t_003_34_find_first_and_last_position_of_element_in_sorted_array/search_range.rs:4:41
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn search_range(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |                                         ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `x`
[INFO] [stdout]  --> src/t_004_69_sqrtx/my_sqrt.rs:4:20
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn my_sqrt(x: i32) -> i32 {
[INFO] [stdout]   |                    ^ help: if this is intentional, prefix it with an underscore: `_x`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `num`
[INFO] [stdout]  --> src/t_005_367_valid_perfect_square/is_perfect_square.rs:4:30
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn is_perfect_square(num: i32) -> bool {
[INFO] [stdout]   |                              ^^^ help: if this is intentional, prefix it with an underscore: `_num`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_006_27_remove_element/remove_element.rs:4:27
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
[INFO] [stdout]   |                           ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `val`
[INFO] [stdout]  --> src/t_006_27_remove_element/remove_element.rs:4:48
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
[INFO] [stdout]   |                                                ^^^ help: if this is intentional, prefix it with an underscore: `_val`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_007_26_remove_duplicates_from_sorted_array/remove_duplicates.rs:4:30
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |                              ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_008_844_backspace_string_compare/backspace_compare.rs:4:30
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn backspace_compare(s: String, t: String) -> bool {
[INFO] [stdout]   |                              ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `t`
[INFO] [stdout]  --> src/t_008_844_backspace_string_compare/backspace_compare.rs:4:41
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn backspace_compare(s: String, t: String) -> bool {
[INFO] [stdout]   |                                         ^ help: if this is intentional, prefix it with an underscore: `_t`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_009_283_move_zeroes/move_zeroes.rs:4:24
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn move_zeroes(nums: &mut Vec<i32>) {}
[INFO] [stdout]   |                        ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_010_977_squares_of_a_sorted_array/sorted_squares.rs:4:27
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn sorted_squares(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |                           ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `target`
[INFO] [stdout]  --> src/t_011_209_minimum_size_subarray_sum/min_sub_array_len.rs:4:30
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |                              ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_011_209_minimum_size_subarray_sum/min_sub_array_len.rs:4:43
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |                                           ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `fruits`
[INFO] [stdout]  --> src/t_012_904_fruit_into_baskets/total_fruit.rs:4:24
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn total_fruit(fruits: Vec<i32>) -> i32 {
[INFO] [stdout]   |                        ^^^^^^ help: if this is intentional, prefix it with an underscore: `_fruits`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_013_76_minimum_window_substring/min_window.rs:4:23
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn min_window(s: String, t: String) -> String {
[INFO] [stdout]   |                       ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `t`
[INFO] [stdout]  --> src/t_013_76_minimum_window_substring/min_window.rs:4:34
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn min_window(s: String, t: String) -> String {
[INFO] [stdout]   |                                  ^ help: if this is intentional, prefix it with an underscore: `_t`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/t_014_59_spiral_matrix_ii/generate_matrix.rs:4:28
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn generate_matrix(n: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |                            ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `matrix`
[INFO] [stdout]  --> src/t_015_54_spiral_matrix/spiral_order.rs:4:25
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn spiral_order(matrix: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]   |                         ^^^^^^ help: if this is intentional, prefix it with an underscore: `_matrix`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head`
[INFO] [stdout]   --> src/t_016_203_remove_linked_list_elements/remove_elements.rs:17:28
[INFO] [stdout]    |
[INFO] [stdout] 17 |     pub fn remove_elements(head: Option<Box<ListNode>>, val: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                            ^^^^ help: if this is intentional, prefix it with an underscore: `_head`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `val`
[INFO] [stdout]   --> src/t_016_203_remove_linked_list_elements/remove_elements.rs:17:57
[INFO] [stdout]    |
[INFO] [stdout] 17 |     pub fn remove_elements(head: Option<Box<ListNode>>, val: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                                                         ^^^ help: if this is intentional, prefix it with an underscore: `_val`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `index`
[INFO] [stdout]   --> src/t_017_707_design_linked_list/MyLinkedList.rs:12:19
[INFO] [stdout]    |
[INFO] [stdout] 12 |     fn get(&self, index: i32) -> i32 {
[INFO] [stdout]    |                   ^^^^^ help: if this is intentional, prefix it with an underscore: `_index`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `val`
[INFO] [stdout]   --> src/t_017_707_design_linked_list/MyLinkedList.rs:16:27
[INFO] [stdout]    |
[INFO] [stdout] 16 |     fn add_at_head(&self, val: i32) {}
[INFO] [stdout]    |                           ^^^ help: if this is intentional, prefix it with an underscore: `_val`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `val`
[INFO] [stdout]   --> src/t_017_707_design_linked_list/MyLinkedList.rs:18:27
[INFO] [stdout]    |
[INFO] [stdout] 18 |     fn add_at_tail(&self, val: i32) {}
[INFO] [stdout]    |                           ^^^ help: if this is intentional, prefix it with an underscore: `_val`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `index`
[INFO] [stdout]   --> src/t_017_707_design_linked_list/MyLinkedList.rs:20:28
[INFO] [stdout]    |
[INFO] [stdout] 20 |     fn add_at_index(&self, index: i32, val: i32) {}
[INFO] [stdout]    |                            ^^^^^ help: if this is intentional, prefix it with an underscore: `_index`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `val`
[INFO] [stdout]   --> src/t_017_707_design_linked_list/MyLinkedList.rs:20:40
[INFO] [stdout]    |
[INFO] [stdout] 20 |     fn add_at_index(&self, index: i32, val: i32) {}
[INFO] [stdout]    |                                        ^^^ help: if this is intentional, prefix it with an underscore: `_val`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `index`
[INFO] [stdout]   --> src/t_017_707_design_linked_list/MyLinkedList.rs:22:31
[INFO] [stdout]    |
[INFO] [stdout] 22 |     fn delete_at_index(&self, index: i32) {}
[INFO] [stdout]    |                               ^^^^^ help: if this is intentional, prefix it with an underscore: `_index`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head`
[INFO] [stdout]   --> src/t_018_206_reverse_linked_list/reverse_list.rs:17:25
[INFO] [stdout]    |
[INFO] [stdout] 17 |     pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                         ^^^^ help: if this is intentional, prefix it with an underscore: `_head`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head`
[INFO] [stdout]   --> src/t_019_24_swap_nodes_in_pairs/swap_pairs.rs:17:23
[INFO] [stdout]    |
[INFO] [stdout] 17 |     pub fn swap_pairs(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                       ^^^^ help: if this is intentional, prefix it with an underscore: `_head`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head`
[INFO] [stdout]   --> src/t_020_19_remove_nth_node_from_end_of_list/remove_nth_from_end.rs:17:32
[INFO] [stdout]    |
[INFO] [stdout] 17 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                                ^^^^ help: if this is intentional, prefix it with an underscore: `_head`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/t_020_19_remove_nth_node_from_end_of_list/remove_nth_from_end.rs:17:61
[INFO] [stdout]    |
[INFO] [stdout] 17 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                                                             ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_023_242_valid_anagram/is_anagram.rs:4:23
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn is_anagram(s: String, t: String) -> bool { true }
[INFO] [stdout]   |                       ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `t`
[INFO] [stdout]  --> src/t_023_242_valid_anagram/is_anagram.rs:4:34
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn is_anagram(s: String, t: String) -> bool { true }
[INFO] [stdout]   |                                  ^ help: if this is intentional, prefix it with an underscore: `_t`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `ransom_note`
[INFO] [stdout]  --> src/t_024_383_ransom_note/can_construct.rs:4:26
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn can_construct(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]   |                          ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_ransom_note`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `magazine`
[INFO] [stdout]  --> src/t_024_383_ransom_note/can_construct.rs:4:47
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn can_construct(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]   |                                               ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_magazine`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `strs`
[INFO] [stdout]  --> src/t_025_49_group_anagrams/group_anagrams.rs:4:27
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |                           ^^^^ help: if this is intentional, prefix it with an underscore: `_strs`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_026_438_find_all_anagrams_in_a_string/find_anagrams.rs:4:26
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn find_anagrams(s: String, p: String) -> Vec<i32> {
[INFO] [stdout]   |                          ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `p`
[INFO] [stdout]  --> src/t_026_438_find_all_anagrams_in_a_string/find_anagrams.rs:4:37
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn find_anagrams(s: String, p: String) -> Vec<i32> {
[INFO] [stdout]   |                                     ^ help: if this is intentional, prefix it with an underscore: `_p`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `words`
[INFO] [stdout]  --> src/t_027_1002_find_common_characters/common_chars.rs:4:25
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn common_chars(words: Vec<String>) -> Vec<String> {
[INFO] [stdout]   |                         ^^^^^ help: if this is intentional, prefix it with an underscore: `_words`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums1`
[INFO] [stdout]  --> src/t_028_349_intersection_of_two_arrays/intersection.rs:4:25
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn intersection(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |                         ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums2`
[INFO] [stdout]  --> src/t_028_349_intersection_of_two_arrays/intersection.rs:4:42
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn intersection(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |                                          ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/t_029_202_happy_number/is_happy.rs:4:21
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn is_happy(n: i32) -> bool {
[INFO] [stdout]   |                     ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_030_1_two_sum/two_sum.rs:4:20
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |                    ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `target`
[INFO] [stdout]  --> src/t_030_1_two_sum/two_sum.rs:4:36
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |                                    ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums1`
[INFO] [stdout]  --> src/t_031_454_4sum_ii/four_sum_count.rs:4:27
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn four_sum_count(nums1: Vec<i32>, nums2: Vec<i32>, nums3: Vec<i32>, nums4: Vec<i32>) -> i32 {
[INFO] [stdout]   |                           ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums2`
[INFO] [stdout]  --> src/t_031_454_4sum_ii/four_sum_count.rs:4:44
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn four_sum_count(nums1: Vec<i32>, nums2: Vec<i32>, nums3: Vec<i32>, nums4: Vec<i32>) -> i32 {
[INFO] [stdout]   |                                            ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums3`
[INFO] [stdout]  --> src/t_031_454_4sum_ii/four_sum_count.rs:4:61
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn four_sum_count(nums1: Vec<i32>, nums2: Vec<i32>, nums3: Vec<i32>, nums4: Vec<i32>) -> i32 {
[INFO] [stdout]   |                                                             ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums3`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums4`
[INFO] [stdout]  --> src/t_031_454_4sum_ii/four_sum_count.rs:4:78
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn four_sum_count(nums1: Vec<i32>, nums2: Vec<i32>, nums3: Vec<i32>, nums4: Vec<i32>) -> i32 {
[INFO] [stdout]   |                                                                              ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums4`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_032_15_3sum/three_sum.rs:4:22
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |                      ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_033_18_4sum/four_sum.rs:5:21
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub fn four_sum(nums: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |                     ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `target`
[INFO] [stdout]  --> src/t_033_18_4sum/four_sum.rs:5:37
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub fn four_sum(nums: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |                                     ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_034_344_reverse_string/reverse_string.rs:3:27
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn reverse_string(s: &mut Vec<char>) {}
[INFO] [stdout]   |                           ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_035_541_reverse_string_ii/reverse_str.rs:3:24
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn reverse_str(s: String, k: i32) -> String {
[INFO] [stdout]   |                        ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `k`
[INFO] [stdout]  --> src/t_035_541_reverse_string_ii/reverse_str.rs:3:35
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn reverse_str(s: String, k: i32) -> String {
[INFO] [stdout]   |                                   ^ help: if this is intentional, prefix it with an underscore: `_k`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_036_offer05_ti_huan_kong_ge_lcof/replace_space.rs:3:26
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn replace_space(s: String) -> String {
[INFO] [stdout]   |                          ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_037_151_reverse_words_in_a_string/reverse_words.rs:3:26
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn reverse_words(s: String) -> String {
[INFO] [stdout]   |                          ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_038_offer58ii_zuo_xuan_zhuan_zi_fu_chuan_lcof/reverse_left_words.rs:4:31
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn reverse_left_words(s: String, n: i32) -> String {
[INFO] [stdout]   |                               ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/t_038_offer58ii_zuo_xuan_zhuan_zi_fu_chuan_lcof/reverse_left_words.rs:4:42
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn reverse_left_words(s: String, n: i32) -> String {
[INFO] [stdout]   |                                          ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `haystack`
[INFO] [stdout]  --> src/t_039_28_find_the_index_of_the_first_occurrence_in_a_string/str_str.rs:4:20
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn str_str(haystack: String, needle: String) -> i32 {
[INFO] [stdout]   |                    ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_haystack`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `needle`
[INFO] [stdout]  --> src/t_039_28_find_the_index_of_the_first_occurrence_in_a_string/str_str.rs:4:38
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn str_str(haystack: String, needle: String) -> i32 {
[INFO] [stdout]   |                                      ^^^^^^ help: if this is intentional, prefix it with an underscore: `_needle`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_040_459_repeated_substring_pattern/repeated_substring_pattern.rs:3:39
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn repeated_substring_pattern(s: String) -> bool {
[INFO] [stdout]   |                                       ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `board`
[INFO] [stdout]  --> src/t_104_37_sudoku_solver/solve_sudoku.rs:3:25
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn solve_sudoku(board: &mut Vec<Vec<char>>) {}
[INFO] [stdout]   |                         ^^^^^ help: if this is intentional, prefix it with an underscore: `_board`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] Some errors have detailed explanations: E0308, E0425.
[INFO] [stdout] 
[INFO] [stdout] For more information about an error, try `rustc --explain E0308`.
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `ti_gr` (lib test) due to 100 previous errors; 65 warnings emitted
[INFO] [stderr] warning: build failed, waiting for other jobs to finish...
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_048_144_binary_tree_preorder_traversal/preorder_traversal.rs:24:55
[INFO] [stdout]    |
[INFO] [stdout] 24 |     pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |                                                       ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_049_94_binary_tree_inorder_traversal/inorder_traversal.rs:23:54
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |                                                      ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_050_145_binary_tree_postorder_traversal/postorder_traversal.rs:23:56
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |                                                        ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_051_102_binary_tree_level_order_traversal/level_order.rs:23:48
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {}
[INFO] [stdout]    |                                                ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_052_107_binary_tree_level_order_traversal_ii/level_order_bottom.rs:23:55
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn level_order_bottom(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {}
[INFO] [stdout]    |                                                       ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_053_199_binary_tree_right_side_view/right_side_view.rs:23:52
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |                                                    ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_054_637_average_of_levels_in_binary_tree/average_of_levels.rs:23:54
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn average_of_levels(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<f64> {}
[INFO] [stdout]    |                                                      ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_056_515_find_largest_value_in_each_tree_row/largest_values.rs:23:51
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn largest_values(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |                                                   ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_059_104_maximum_depth_of_binary_tree/max_depth.rs:23:46
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |                                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_060_111_minimum_depth_of_binary_tree/min_depth.rs:23:46
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn min_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |                                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_061_226_invert_binary_tree/invert_tree.rs:23:48
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_061_226_invert_binary_tree/invert_tree.rs:23:82
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                                                  ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_064_101_symmetric_tree/is_symmetric.rs:23:49
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {}
[INFO] [stdout]    |                                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_065_100_same_tree/is_same_tree.rs:24:30
[INFO] [stdout]    |
[INFO] [stdout] 24 |         p: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_065_100_same_tree/is_same_tree.rs:25:30
[INFO] [stdout]    |
[INFO] [stdout] 25 |         q: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_066_572_subtree_of_another_tree/is_subtree.rs:24:33
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_066_572_subtree_of_another_tree/is_subtree.rs:25:37
[INFO] [stdout]    |
[INFO] [stdout] 25 |         sub_root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                     ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_068_222_count_complete_tree_nodes/count_nodes.rs:23:48
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn count_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |                                                ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_069_110_balanced_binary_tree/is_balanced.rs:23:48
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_balanced(root: Option<Rc<RefCell<TreeNode>>>) -> bool {}
[INFO] [stdout]    |                                                ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_070_257_binary_tree_paths/binary_tree_paths.rs:23:54
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn binary_tree_paths(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<String> {}
[INFO] [stdout]    |                                                      ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_071_404_sum_of_left_leaves/sum_of_left_leaves.rs:23:55
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn sum_of_left_leaves(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |                                                       ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_072_513_find_bottom_left_tree_value/find_bottom_left_value.rs:23:59
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn find_bottom_left_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |                                                           ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_073_112_path_sum/has_path_sum.rs:23:49
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {}
[INFO] [stdout]    |                                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_074_113_path_sum_ii/path_sum.rs:23:45
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> Vec<Vec<i32>> {}
[INFO] [stdout]    |                                             ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_075_106_construct_binary_tree_from_inorder_and_postorder_traversal/build_tree.rs:23:84
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn build_tree(inorder: Vec<i32>, postorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                                                    ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `Solution` in this scope
[INFO] [stdout]   --> src/t_076_105_construct_binary_tree_from_preorder_and_inorder_traversal/build_tree.rs:22:6
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct SOlution {}
[INFO] [stdout]    | --------------- similarly named struct `SOlution` defined here
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    |      ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout] note: these structs exist but are inaccessible
[INFO] [stdout]   --> src/t_001_704_binary_search/search.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_001_704_binary_search::search::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_002_35_search_insert_position/search_insert.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_002_35_search_insert_position::search_insert::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_003_34_find_first_and_last_position_of_element_in_sorted_array/search_range.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_003_34_find_first_and_last_position_of_element_in_sorted_array::search_range::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_004_69_sqrtx/my_sqrt.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_004_69_sqrtx::my_sqrt::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_005_367_valid_perfect_square/is_perfect_square.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_005_367_valid_perfect_square::is_perfect_square::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_006_27_remove_element/remove_element.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_006_27_remove_element::remove_element::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_007_26_remove_duplicates_from_sorted_array/remove_duplicates.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_007_26_remove_duplicates_from_sorted_array::remove_duplicates::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_008_844_backspace_string_compare/backspace_compare.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_008_844_backspace_string_compare::backspace_compare::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_009_283_move_zeroes/move_zeroes.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_009_283_move_zeroes::move_zeroes::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_010_977_squares_of_a_sorted_array/sorted_squares.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_010_977_squares_of_a_sorted_array::sorted_squares::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_011_209_minimum_size_subarray_sum/min_sub_array_len.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_011_209_minimum_size_subarray_sum::min_sub_array_len::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_012_904_fruit_into_baskets/total_fruit.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_012_904_fruit_into_baskets::total_fruit::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_013_76_minimum_window_substring/min_window.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_013_76_minimum_window_substring::min_window::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_014_59_spiral_matrix_ii/generate_matrix.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_014_59_spiral_matrix_ii::generate_matrix::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_015_54_spiral_matrix/spiral_order.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_015_54_spiral_matrix::spiral_order::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_016_203_remove_linked_list_elements/remove_elements.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_016_203_remove_linked_list_elements::remove_elements::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_018_206_reverse_linked_list/reverse_list.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_018_206_reverse_linked_list::reverse_list::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_019_24_swap_nodes_in_pairs/swap_pairs.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_019_24_swap_nodes_in_pairs::swap_pairs::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_020_19_remove_nth_node_from_end_of_list/remove_nth_from_end.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_020_19_remove_nth_node_from_end_of_list::remove_nth_from_end::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_023_242_valid_anagram/is_anagram.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_023_242_valid_anagram::is_anagram::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_024_383_ransom_note/can_construct.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_024_383_ransom_note::can_construct::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_025_49_group_anagrams/group_anagrams.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_025_49_group_anagrams::group_anagrams::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_026_438_find_all_anagrams_in_a_string/find_anagrams.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_026_438_find_all_anagrams_in_a_string::find_anagrams::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_027_1002_find_common_characters/common_chars.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_027_1002_find_common_characters::common_chars::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_028_349_intersection_of_two_arrays/intersection.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_028_349_intersection_of_two_arrays::intersection::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_029_202_happy_number/is_happy.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_029_202_happy_number::is_happy::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_030_1_two_sum/two_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_030_1_two_sum::two_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_031_454_4sum_ii/four_sum_count.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_031_454_4sum_ii::four_sum_count::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_032_15_3sum/three_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_032_15_3sum::three_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_033_18_4sum/four_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_033_18_4sum::four_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_034_344_reverse_string/reverse_string.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_034_344_reverse_string::reverse_string::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_035_541_reverse_string_ii/reverse_str.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_035_541_reverse_string_ii::reverse_str::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_036_offer05_ti_huan_kong_ge_lcof/replace_space.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_036_offer05_ti_huan_kong_ge_lcof::replace_space::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_037_151_reverse_words_in_a_string/reverse_words.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_037_151_reverse_words_in_a_string::reverse_words::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_038_offer58ii_zuo_xuan_zhuan_zi_fu_chuan_lcof/reverse_left_words.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_038_offer58ii_zuo_xuan_zhuan_zi_fu_chuan_lcof::reverse_left_words::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_039_28_find_the_index_of_the_first_occurrence_in_a_string/str_str.rs:2:1
[INFO] [stdout]    |
[INFO] [stdout]  2 | struct Solution{}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_039_28_find_the_index_of_the_first_occurrence_in_a_string::str_str::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_040_459_repeated_substring_pattern/repeated_substring_pattern.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_040_459_repeated_substring_pattern::repeated_substring_pattern::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_043_20_valid_parentheses/is_valid.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution{}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_043_20_valid_parentheses::is_valid::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_044_1047_remove_all_adjacent_duplicates_in_string/remove_duplicates.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_044_1047_remove_all_adjacent_duplicates_in_string::remove_duplicates::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_045_150_evaluate_reverse_polish_notation/eval_rpn.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_045_150_evaluate_reverse_polish_notation::eval_rpn::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_046_239_sliding_window_maximum/max_sliding_window.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_046_239_sliding_window_maximum::max_sliding_window::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_047_347_top_k_frequent_elements/top_k_frequent.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_047_347_top_k_frequent_elements::top_k_frequent::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_048_144_binary_tree_preorder_traversal/preorder_traversal.rs:22:1
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_048_144_binary_tree_preorder_traversal::preorder_traversal::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_049_94_binary_tree_inorder_traversal/inorder_traversal.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_049_94_binary_tree_inorder_traversal::inorder_traversal::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_050_145_binary_tree_postorder_traversal/postorder_traversal.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_050_145_binary_tree_postorder_traversal::postorder_traversal::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_051_102_binary_tree_level_order_traversal/level_order.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_051_102_binary_tree_level_order_traversal::level_order::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_052_107_binary_tree_level_order_traversal_ii/level_order_bottom.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_052_107_binary_tree_level_order_traversal_ii::level_order_bottom::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_053_199_binary_tree_right_side_view/right_side_view.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_053_199_binary_tree_right_side_view::right_side_view::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_054_637_average_of_levels_in_binary_tree/average_of_levels.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_054_637_average_of_levels_in_binary_tree::average_of_levels::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_056_515_find_largest_value_in_each_tree_row/largest_values.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_056_515_find_largest_value_in_each_tree_row::largest_values::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_059_104_maximum_depth_of_binary_tree/max_depth.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_059_104_maximum_depth_of_binary_tree::max_depth::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_060_111_minimum_depth_of_binary_tree/min_depth.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_060_111_minimum_depth_of_binary_tree::min_depth::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_061_226_invert_binary_tree/invert_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_061_226_invert_binary_tree::invert_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_064_101_symmetric_tree/is_symmetric.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_064_101_symmetric_tree::is_symmetric::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_065_100_same_tree/is_same_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_065_100_same_tree::is_same_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_066_572_subtree_of_another_tree/is_subtree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_066_572_subtree_of_another_tree::is_subtree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_068_222_count_complete_tree_nodes/count_nodes.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_068_222_count_complete_tree_nodes::count_nodes::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_069_110_balanced_binary_tree/is_balanced.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_069_110_balanced_binary_tree::is_balanced::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_070_257_binary_tree_paths/binary_tree_paths.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_070_257_binary_tree_paths::binary_tree_paths::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_071_404_sum_of_left_leaves/sum_of_left_leaves.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_071_404_sum_of_left_leaves::sum_of_left_leaves::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_072_513_find_bottom_left_tree_value/find_bottom_left_value.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_072_513_find_bottom_left_tree_value::find_bottom_left_value::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_073_112_path_sum/has_path_sum.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_073_112_path_sum::has_path_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_074_113_path_sum_ii/path_sum.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_074_113_path_sum_ii::path_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_075_106_construct_binary_tree_from_inorder_and_postorder_traversal/build_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_075_106_construct_binary_tree_from_inorder_and_postorder_traversal::build_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_077_654_maximum_binary_tree/construct_maximum_binary_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_077_654_maximum_binary_tree::construct_maximum_binary_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_078_617_merge_two_binary_trees/merge_trees.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_078_617_merge_two_binary_trees::merge_trees::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_079_700_search_in_a_binary_search_tree/search_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_079_700_search_in_a_binary_search_tree::search_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_080_98_validate_binary_search_tree/is_valid_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_080_98_validate_binary_search_tree::is_valid_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_081_530_minimum_absolute_difference_in_bst/get_minimum_difference.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_081_530_minimum_absolute_difference_in_bst::get_minimum_difference::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_082_501_find_mode_in_binary_search_tree/find_mode.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_082_501_find_mode_in_binary_search_tree::find_mode::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_083_236_lowest_common_ancestor_of_a_binary_tree/lowest_common_ancestor.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_083_236_lowest_common_ancestor_of_a_binary_tree::lowest_common_ancestor::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_084_235_lowest_common_ancestor_of_a_binary_search_tree/lowest_common_ancestor.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_084_235_lowest_common_ancestor_of_a_binary_search_tree::lowest_common_ancestor::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_085_701_insert_into_a_binary_search_tree/insert_into_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_085_701_insert_into_a_binary_search_tree::insert_into_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_086_450_delete_node_in_a_bst/delete_node.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_086_450_delete_node_in_a_bst::delete_node::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_087_669_trim_a_binary_search_tree/trim_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_087_669_trim_a_binary_search_tree::trim_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_088_108_convert_sorted_array_to_binary_search_tree/sorted_array_to_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_088_108_convert_sorted_array_to_binary_search_tree::sorted_array_to_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_089_538_convert_bst_to_greater_tree/convert_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_089_538_convert_bst_to_greater_tree::convert_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_090_77_combinations/combine.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_090_77_combinations::combine::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_092_17_letter_combinations_of_a_phone_number/letter_combinations.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_092_17_letter_combinations_of_a_phone_number::letter_combinations::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_093_39_combination_sum/combination_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_093_39_combination_sum::combination_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_094_40_combination_sum_ii/combination_sum2.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_094_40_combination_sum_ii::combination_sum2::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_095_131_palindrome_partitioning/partition.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_095_131_palindrome_partitioning::partition::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_096_93_restore_ip_addresses/restore_ip_addresses.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_096_93_restore_ip_addresses::restore_ip_addresses::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_097_78_subsets/subsets.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_097_78_subsets::subsets::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_098_90_subsets_ii/subsets_with_dup.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_098_90_subsets_ii::subsets_with_dup::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_099_491_increasing_subsequences/find_subsequences.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_099_491_increasing_subsequences::find_subsequences::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_100_46_permutations/permute.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_100_46_permutations::permute::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_101_47_permutations_ii/permute_unique.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_101_47_permutations_ii::permute_unique::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_102_332_reconstruct_itinerary/find_itinerary.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_102_332_reconstruct_itinerary::find_itinerary::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_103_51_n_queens/solve_n_queens.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_103_51_n_queens::solve_n_queens::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_104_37_sudoku_solver/solve_sudoku.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_104_37_sudoku_solver::solve_sudoku::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_105_455_assign_cookies/find_content_children.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_105_455_assign_cookies::find_content_children::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_106_376_wiggle_subsequence/wiggle_max_length.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_106_376_wiggle_subsequence::wiggle_max_length::Solution`: not accessible
[INFO] [stdout] help: a struct with a similar name exists (notice the capitalization)
[INFO] [stdout]    |
[INFO] [stdout] 22 - impl Solution {
[INFO] [stdout] 22 + impl SOlution {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_076_105_construct_binary_tree_from_preorder_and_inorder_traversal/build_tree.rs:23:83
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn build_tree(preorder: Vec<i32>, inorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                                                   ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_077_654_maximum_binary_tree/construct_maximum_binary_tree.rs:23:79
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn construct_maximum_binary_tree(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                                               ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_078_617_merge_two_binary_trees/merge_trees.rs:24:34
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root1: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                  ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_078_617_merge_two_binary_trees/merge_trees.rs:25:34
[INFO] [stdout]    |
[INFO] [stdout] 25 |         root2: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                  ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_078_617_merge_two_binary_trees/merge_trees.rs:26:28
[INFO] [stdout]    |
[INFO] [stdout] 26 |     ) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |                            ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_079_700_search_in_a_binary_search_tree/search_bst.rs:24:33
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_079_700_search_in_a_binary_search_tree/search_bst.rs:26:28
[INFO] [stdout]    |
[INFO] [stdout] 26 |     ) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |                            ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_080_98_validate_binary_search_tree/is_valid_bst.rs:23:49
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {}
[INFO] [stdout]    |                                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_081_530_minimum_absolute_difference_in_bst/get_minimum_difference.rs:23:59
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |                                                           ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_082_501_find_mode_in_binary_search_tree/find_mode.rs:23:46
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn find_mode(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |                                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_083_236_lowest_common_ancestor_of_a_binary_tree/lowest_common_ancestor.rs:24:33
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_083_236_lowest_common_ancestor_of_a_binary_tree/lowest_common_ancestor.rs:25:30
[INFO] [stdout]    |
[INFO] [stdout] 25 |         p: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_083_236_lowest_common_ancestor_of_a_binary_tree/lowest_common_ancestor.rs:26:30
[INFO] [stdout]    |
[INFO] [stdout] 26 |         q: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_083_236_lowest_common_ancestor_of_a_binary_tree/lowest_common_ancestor.rs:27:28
[INFO] [stdout]    |
[INFO] [stdout] 27 |     ) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |                            ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_084_235_lowest_common_ancestor_of_a_binary_search_tree/lowest_common_ancestor.rs:24:33
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_084_235_lowest_common_ancestor_of_a_binary_search_tree/lowest_common_ancestor.rs:25:30
[INFO] [stdout]    |
[INFO] [stdout] 25 |         p: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_084_235_lowest_common_ancestor_of_a_binary_search_tree/lowest_common_ancestor.rs:26:30
[INFO] [stdout]    |
[INFO] [stdout] 26 |         q: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                              ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_084_235_lowest_common_ancestor_of_a_binary_search_tree/lowest_common_ancestor.rs:27:28
[INFO] [stdout]    |
[INFO] [stdout] 27 |     ) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |                            ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_085_701_insert_into_a_binary_search_tree/insert_into_bst.rs:24:33
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_085_701_insert_into_a_binary_search_tree/insert_into_bst.rs:26:28
[INFO] [stdout]    |
[INFO] [stdout] 26 |     ) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |                            ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_086_450_delete_node_in_a_bst/delete_node.rs:24:33
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_086_450_delete_node_in_a_bst/delete_node.rs:26:28
[INFO] [stdout]    |
[INFO] [stdout] 26 |     ) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |                            ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_087_669_trim_a_binary_search_tree/trim_bst.rs:24:33
[INFO] [stdout]    |
[INFO] [stdout] 24 |         root: Option<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |                                 ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_087_669_trim_a_binary_search_tree/trim_bst.rs:27:28
[INFO] [stdout]    |
[INFO] [stdout] 27 |     ) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |                            ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_088_108_convert_sorted_array_to_binary_search_tree/sorted_array_to_bst.rs:23:69
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn sorted_array_to_bst(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                                     ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_089_538_convert_bst_to_greater_tree/convert_bst.rs:23:48
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn convert_bst(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `TreeNode` in this scope
[INFO] [stdout]   --> src/t_089_538_convert_bst_to_greater_tree/convert_bst.rs:23:82
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn convert_bst(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {}
[INFO] [stdout]    |                                                                                  ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: you might be missing a type parameter
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl<TreeNode> Solution {
[INFO] [stdout]    |     ++++++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0425]: cannot find type `Solution` in this scope
[INFO] [stdout]   --> src/t_091_216_combination_sum_iii/combination_sum3.rs:2:6
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct SOlution {}
[INFO] [stdout]    | --------------- similarly named struct `SOlution` defined here
[INFO] [stdout]  2 | impl Solution {
[INFO] [stdout]    |      ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout] note: these structs exist but are inaccessible
[INFO] [stdout]   --> src/t_001_704_binary_search/search.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_001_704_binary_search::search::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_002_35_search_insert_position/search_insert.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_002_35_search_insert_position::search_insert::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_003_34_find_first_and_last_position_of_element_in_sorted_array/search_range.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_003_34_find_first_and_last_position_of_element_in_sorted_array::search_range::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_004_69_sqrtx/my_sqrt.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_004_69_sqrtx::my_sqrt::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_005_367_valid_perfect_square/is_perfect_square.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_005_367_valid_perfect_square::is_perfect_square::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_006_27_remove_element/remove_element.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_006_27_remove_element::remove_element::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_007_26_remove_duplicates_from_sorted_array/remove_duplicates.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_007_26_remove_duplicates_from_sorted_array::remove_duplicates::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_008_844_backspace_string_compare/backspace_compare.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_008_844_backspace_string_compare::backspace_compare::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_009_283_move_zeroes/move_zeroes.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_009_283_move_zeroes::move_zeroes::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_010_977_squares_of_a_sorted_array/sorted_squares.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_010_977_squares_of_a_sorted_array::sorted_squares::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_011_209_minimum_size_subarray_sum/min_sub_array_len.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_011_209_minimum_size_subarray_sum::min_sub_array_len::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_012_904_fruit_into_baskets/total_fruit.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_012_904_fruit_into_baskets::total_fruit::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_013_76_minimum_window_substring/min_window.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_013_76_minimum_window_substring::min_window::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_014_59_spiral_matrix_ii/generate_matrix.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_014_59_spiral_matrix_ii::generate_matrix::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_015_54_spiral_matrix/spiral_order.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_015_54_spiral_matrix::spiral_order::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_016_203_remove_linked_list_elements/remove_elements.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_016_203_remove_linked_list_elements::remove_elements::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_018_206_reverse_linked_list/reverse_list.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_018_206_reverse_linked_list::reverse_list::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_019_24_swap_nodes_in_pairs/swap_pairs.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_019_24_swap_nodes_in_pairs::swap_pairs::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_020_19_remove_nth_node_from_end_of_list/remove_nth_from_end.rs:14:1
[INFO] [stdout]    |
[INFO] [stdout] 14 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_020_19_remove_nth_node_from_end_of_list::remove_nth_from_end::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_023_242_valid_anagram/is_anagram.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_023_242_valid_anagram::is_anagram::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_024_383_ransom_note/can_construct.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_024_383_ransom_note::can_construct::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_025_49_group_anagrams/group_anagrams.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_025_49_group_anagrams::group_anagrams::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_026_438_find_all_anagrams_in_a_string/find_anagrams.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_026_438_find_all_anagrams_in_a_string::find_anagrams::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_027_1002_find_common_characters/common_chars.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_027_1002_find_common_characters::common_chars::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_028_349_intersection_of_two_arrays/intersection.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_028_349_intersection_of_two_arrays::intersection::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_029_202_happy_number/is_happy.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_029_202_happy_number::is_happy::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_030_1_two_sum/two_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_030_1_two_sum::two_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_031_454_4sum_ii/four_sum_count.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_031_454_4sum_ii::four_sum_count::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_032_15_3sum/three_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_032_15_3sum::three_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_033_18_4sum/four_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_033_18_4sum::four_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_034_344_reverse_string/reverse_string.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_034_344_reverse_string::reverse_string::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_035_541_reverse_string_ii/reverse_str.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_035_541_reverse_string_ii::reverse_str::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_036_offer05_ti_huan_kong_ge_lcof/replace_space.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_036_offer05_ti_huan_kong_ge_lcof::replace_space::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_037_151_reverse_words_in_a_string/reverse_words.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_037_151_reverse_words_in_a_string::reverse_words::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_038_offer58ii_zuo_xuan_zhuan_zi_fu_chuan_lcof/reverse_left_words.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_038_offer58ii_zuo_xuan_zhuan_zi_fu_chuan_lcof::reverse_left_words::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_039_28_find_the_index_of_the_first_occurrence_in_a_string/str_str.rs:2:1
[INFO] [stdout]    |
[INFO] [stdout]  2 | struct Solution{}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_039_28_find_the_index_of_the_first_occurrence_in_a_string::str_str::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_040_459_repeated_substring_pattern/repeated_substring_pattern.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_040_459_repeated_substring_pattern::repeated_substring_pattern::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_043_20_valid_parentheses/is_valid.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution{}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_043_20_valid_parentheses::is_valid::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_044_1047_remove_all_adjacent_duplicates_in_string/remove_duplicates.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_044_1047_remove_all_adjacent_duplicates_in_string::remove_duplicates::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_045_150_evaluate_reverse_polish_notation/eval_rpn.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_045_150_evaluate_reverse_polish_notation::eval_rpn::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_046_239_sliding_window_maximum/max_sliding_window.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_046_239_sliding_window_maximum::max_sliding_window::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_047_347_top_k_frequent_elements/top_k_frequent.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_047_347_top_k_frequent_elements::top_k_frequent::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_048_144_binary_tree_preorder_traversal/preorder_traversal.rs:22:1
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_048_144_binary_tree_preorder_traversal::preorder_traversal::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_049_94_binary_tree_inorder_traversal/inorder_traversal.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_049_94_binary_tree_inorder_traversal::inorder_traversal::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_050_145_binary_tree_postorder_traversal/postorder_traversal.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_050_145_binary_tree_postorder_traversal::postorder_traversal::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_051_102_binary_tree_level_order_traversal/level_order.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_051_102_binary_tree_level_order_traversal::level_order::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_052_107_binary_tree_level_order_traversal_ii/level_order_bottom.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_052_107_binary_tree_level_order_traversal_ii::level_order_bottom::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_053_199_binary_tree_right_side_view/right_side_view.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_053_199_binary_tree_right_side_view::right_side_view::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_054_637_average_of_levels_in_binary_tree/average_of_levels.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_054_637_average_of_levels_in_binary_tree::average_of_levels::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_056_515_find_largest_value_in_each_tree_row/largest_values.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_056_515_find_largest_value_in_each_tree_row::largest_values::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_059_104_maximum_depth_of_binary_tree/max_depth.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_059_104_maximum_depth_of_binary_tree::max_depth::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_060_111_minimum_depth_of_binary_tree/min_depth.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_060_111_minimum_depth_of_binary_tree::min_depth::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_061_226_invert_binary_tree/invert_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_061_226_invert_binary_tree::invert_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_064_101_symmetric_tree/is_symmetric.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_064_101_symmetric_tree::is_symmetric::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_065_100_same_tree/is_same_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_065_100_same_tree::is_same_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_066_572_subtree_of_another_tree/is_subtree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_066_572_subtree_of_another_tree::is_subtree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_068_222_count_complete_tree_nodes/count_nodes.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_068_222_count_complete_tree_nodes::count_nodes::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_069_110_balanced_binary_tree/is_balanced.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_069_110_balanced_binary_tree::is_balanced::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_070_257_binary_tree_paths/binary_tree_paths.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_070_257_binary_tree_paths::binary_tree_paths::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_071_404_sum_of_left_leaves/sum_of_left_leaves.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_071_404_sum_of_left_leaves::sum_of_left_leaves::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_072_513_find_bottom_left_tree_value/find_bottom_left_value.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_072_513_find_bottom_left_tree_value::find_bottom_left_value::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_073_112_path_sum/has_path_sum.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_073_112_path_sum::has_path_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_074_113_path_sum_ii/path_sum.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_074_113_path_sum_ii::path_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_075_106_construct_binary_tree_from_inorder_and_postorder_traversal/build_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_075_106_construct_binary_tree_from_inorder_and_postorder_traversal::build_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_077_654_maximum_binary_tree/construct_maximum_binary_tree.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_077_654_maximum_binary_tree::construct_maximum_binary_tree::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_078_617_merge_two_binary_trees/merge_trees.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_078_617_merge_two_binary_trees::merge_trees::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_079_700_search_in_a_binary_search_tree/search_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_079_700_search_in_a_binary_search_tree::search_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_080_98_validate_binary_search_tree/is_valid_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_080_98_validate_binary_search_tree::is_valid_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_081_530_minimum_absolute_difference_in_bst/get_minimum_difference.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_081_530_minimum_absolute_difference_in_bst::get_minimum_difference::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_082_501_find_mode_in_binary_search_tree/find_mode.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_082_501_find_mode_in_binary_search_tree::find_mode::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_083_236_lowest_common_ancestor_of_a_binary_tree/lowest_common_ancestor.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_083_236_lowest_common_ancestor_of_a_binary_tree::lowest_common_ancestor::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_084_235_lowest_common_ancestor_of_a_binary_search_tree/lowest_common_ancestor.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_084_235_lowest_common_ancestor_of_a_binary_search_tree::lowest_common_ancestor::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_085_701_insert_into_a_binary_search_tree/insert_into_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_085_701_insert_into_a_binary_search_tree::insert_into_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_086_450_delete_node_in_a_bst/delete_node.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_086_450_delete_node_in_a_bst::delete_node::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_087_669_trim_a_binary_search_tree/trim_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_087_669_trim_a_binary_search_tree::trim_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_088_108_convert_sorted_array_to_binary_search_tree/sorted_array_to_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_088_108_convert_sorted_array_to_binary_search_tree::sorted_array_to_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_089_538_convert_bst_to_greater_tree/convert_bst.rs:21:1
[INFO] [stdout]    |
[INFO] [stdout] 21 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_089_538_convert_bst_to_greater_tree::convert_bst::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_090_77_combinations/combine.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_090_77_combinations::combine::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_092_17_letter_combinations_of_a_phone_number/letter_combinations.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_092_17_letter_combinations_of_a_phone_number::letter_combinations::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_093_39_combination_sum/combination_sum.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_093_39_combination_sum::combination_sum::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_094_40_combination_sum_ii/combination_sum2.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_094_40_combination_sum_ii::combination_sum2::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_095_131_palindrome_partitioning/partition.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_095_131_palindrome_partitioning::partition::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_096_93_restore_ip_addresses/restore_ip_addresses.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_096_93_restore_ip_addresses::restore_ip_addresses::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_097_78_subsets/subsets.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_097_78_subsets::subsets::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_098_90_subsets_ii/subsets_with_dup.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_098_90_subsets_ii::subsets_with_dup::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_099_491_increasing_subsequences/find_subsequences.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_099_491_increasing_subsequences::find_subsequences::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_100_46_permutations/permute.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_100_46_permutations::permute::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_101_47_permutations_ii/permute_unique.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_101_47_permutations_ii::permute_unique::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_102_332_reconstruct_itinerary/find_itinerary.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_102_332_reconstruct_itinerary::find_itinerary::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_103_51_n_queens/solve_n_queens.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_103_51_n_queens::solve_n_queens::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_104_37_sudoku_solver/solve_sudoku.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_104_37_sudoku_solver::solve_sudoku::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_105_455_assign_cookies/find_content_children.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_105_455_assign_cookies::find_content_children::Solution`: not accessible
[INFO] [stdout]    |
[INFO] [stdout]   ::: src/t_106_376_wiggle_subsequence/wiggle_max_length.rs:1:1
[INFO] [stdout]    |
[INFO] [stdout]  1 | struct Solution {}
[INFO] [stdout]    | ^^^^^^^^^^^^^^^ `crate::t_106_376_wiggle_subsequence::wiggle_max_length::Solution`: not accessible
[INFO] [stdout] help: a struct with a similar name exists (notice the capitalization)
[INFO] [stdout]    |
[INFO] [stdout]  2 - impl Solution {
[INFO] [stdout]  2 + impl SOlution {
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_043_20_valid_parentheses/is_valid.rs:4:35
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn is_valid(s: String) -> bool {
[INFO] [stdout]   |            --------               ^^^^ expected `bool`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_044_1047_remove_all_adjacent_duplicates_in_string/remove_duplicates.rs:3:44
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn remove_duplicates(s: String) -> String {}
[INFO] [stdout]   |            -----------------               ^^^^^^ expected `String`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout] help: consider returning the local binding `s`
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn remove_duplicates(s: String) -> String { s }
[INFO] [stdout]   |                                                     +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_045_150_evaluate_reverse_polish_notation/eval_rpn.rs:3:45
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn eval_rpn(tokens: Vec<String>) -> i32 {}
[INFO] [stdout]   |            --------                         ^^^ expected `i32`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_046_239_sliding_window_maximum/max_sliding_window.rs:4:58
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn max_sliding_window(nums: Vec<i32>, k: i32) -> Vec<i32> {}
[INFO] [stdout]   |            ------------------                            ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<i32>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] help: consider returning the local binding `nums`
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn max_sliding_window(nums: Vec<i32>, k: i32) -> Vec<i32> { nums }
[INFO] [stdout]   |                                                                     ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_047_347_top_k_frequent_elements/top_k_frequent.rs:3:54
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> {}
[INFO] [stdout]   |            --------------                            ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<i32>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] help: consider returning the local binding `nums`
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> { nums }
[INFO] [stdout]   |                                                                 ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_048_144_binary_tree_preorder_traversal/preorder_traversal.rs:24:71
[INFO] [stdout]    |
[INFO] [stdout] 24 |     pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |            ------------------                                         ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<i32>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_049_94_binary_tree_inorder_traversal/inorder_traversal.rs:23:70
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |            -----------------                                         ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<i32>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_050_145_binary_tree_postorder_traversal/postorder_traversal.rs:23:72
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |            -------------------                                         ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<i32>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_051_102_binary_tree_level_order_traversal/level_order.rs:23:64
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {}
[INFO] [stdout]    |            -----------                                         ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_052_107_binary_tree_level_order_traversal_ii/level_order_bottom.rs:23:71
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn level_order_bottom(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {}
[INFO] [stdout]    |            ------------------                                         ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_053_199_binary_tree_right_side_view/right_side_view.rs:23:68
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |            ---------------                                         ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<i32>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_054_637_average_of_levels_in_binary_tree/average_of_levels.rs:23:70
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn average_of_levels(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<f64> {}
[INFO] [stdout]    |            -----------------                                         ^^^^^^^^ expected `Vec<f64>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<f64>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_056_515_find_largest_value_in_each_tree_row/largest_values.rs:23:67
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn largest_values(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |            --------------                                         ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<i32>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_059_104_maximum_depth_of_binary_tree/max_depth.rs:23:62
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |            ---------                                         ^^^ expected `i32`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_060_111_minimum_depth_of_binary_tree/min_depth.rs:23:62
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn min_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |            ---------                                         ^^^ expected `i32`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_064_101_symmetric_tree/is_symmetric.rs:23:65
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {}
[INFO] [stdout]    |            ------------                                         ^^^^ expected `bool`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_065_100_same_tree/is_same_tree.rs:26:10
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_same_tree(
[INFO] [stdout]    |            ------------ implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] ...
[INFO] [stdout] 26 |     ) -> bool {
[INFO] [stdout]    |          ^^^^ expected `bool`, found `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_066_572_subtree_of_another_tree/is_subtree.rs:26:10
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_subtree(
[INFO] [stdout]    |            ---------- implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] ...
[INFO] [stdout] 26 |     ) -> bool {
[INFO] [stdout]    |          ^^^^ expected `bool`, found `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_068_222_count_complete_tree_nodes/count_nodes.rs:23:64
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn count_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |            -----------                                         ^^^ expected `i32`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_069_110_balanced_binary_tree/is_balanced.rs:23:64
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_balanced(root: Option<Rc<RefCell<TreeNode>>>) -> bool {}
[INFO] [stdout]    |            -----------                                         ^^^^ expected `bool`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_070_257_binary_tree_paths/binary_tree_paths.rs:23:70
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn binary_tree_paths(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<String> {}
[INFO] [stdout]    |            -----------------                                         ^^^^^^^^^^^ expected `Vec<String>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<String>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_071_404_sum_of_left_leaves/sum_of_left_leaves.rs:23:71
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn sum_of_left_leaves(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |            ------------------                                         ^^^ expected `i32`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_072_513_find_bottom_left_tree_value/find_bottom_left_value.rs:23:75
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn find_bottom_left_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |            ----------------------                                         ^^^ expected `i32`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_073_112_path_sum/has_path_sum.rs:23:82
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {}
[INFO] [stdout]    |            ------------                                                          ^^^^ expected `bool`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_074_113_path_sum_ii/path_sum.rs:23:78
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> Vec<Vec<i32>> {}
[INFO] [stdout]    |            --------                                                          ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_080_98_validate_binary_search_tree/is_valid_bst.rs:23:65
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {}
[INFO] [stdout]    |            ------------                                         ^^^^ expected `bool`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_081_530_minimum_absolute_difference_in_bst/get_minimum_difference.rs:23:75
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn get_minimum_difference(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {}
[INFO] [stdout]    |            ----------------------                                         ^^^ expected `i32`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]   --> src/t_082_501_find_mode_in_binary_search_tree/find_mode.rs:23:62
[INFO] [stdout]    |
[INFO] [stdout] 23 |     pub fn find_mode(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {}
[INFO] [stdout]    |            ---------                                         ^^^^^^^^ expected `Vec<i32>`, found `()`
[INFO] [stdout]    |            |
[INFO] [stdout]    |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]    |
[INFO] [stdout]    = note: expected struct `Vec<i32>`
[INFO] [stdout]            found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_090_77_combinations/combine.rs:3:39
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            -------                    ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_091_216_combination_sum_iii/combination_sum3.rs:3:48
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn combination_sum3(k: i32, n: i32) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            ----------------                    ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_092_17_letter_combinations_of_a_phone_number/letter_combinations.rs:3:51
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn letter_combinations(digits: String) -> Vec<String> {}
[INFO] [stdout]   |            -------------------                    ^^^^^^^^^^^ expected `Vec<String>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<String>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_093_39_combination_sum/combination_sum.rs:3:66
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn combination_sum(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            ---------------                                       ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_094_40_combination_sum_ii/combination_sum2.rs:3:67
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn combination_sum2(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            ----------------                                       ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_095_131_palindrome_partitioning/partition.rs:3:36
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn partition(s: String) -> Vec<Vec<String>> {}
[INFO] [stdout]   |            ---------               ^^^^^^^^^^^^^^^^ expected `Vec<Vec<String>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<String>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_096_93_restore_ip_addresses/restore_ip_addresses.rs:3:47
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn restore_ip_addresses(s: String) -> Vec<String> {}
[INFO] [stdout]   |            --------------------               ^^^^^^^^^^^ expected `Vec<String>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<String>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_097_78_subsets/subsets.rs:3:39
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn subsets(nums: Vec<i32>) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            -------                    ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_098_90_subsets_ii/subsets_with_dup.rs:3:48
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn subsets_with_dup(nums: Vec<i32>) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            ----------------                    ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_099_491_increasing_subsequences/find_subsequences.rs:3:49
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn find_subsequences(nums: Vec<i32>) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            -----------------                    ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_100_46_permutations/permute.rs:3:39
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn permute(nums: Vec<i32>) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            -------                    ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_101_47_permutations_ii/permute_unique.rs:3:46
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn permute_unique(nums: Vec<i32>) -> Vec<Vec<i32>> {}
[INFO] [stdout]   |            --------------                    ^^^^^^^^^^^^^ expected `Vec<Vec<i32>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<i32>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_102_332_reconstruct_itinerary/find_itinerary.rs:3:57
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn find_itinerary(tickets: Vec<Vec<String>>) -> Vec<String> {}
[INFO] [stdout]   |            --------------                               ^^^^^^^^^^^ expected `Vec<String>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<String>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_103_51_n_queens/solve_n_queens.rs:3:38
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn solve_n_queens(n: i32) -> Vec<Vec<String>> {}
[INFO] [stdout]   |            --------------            ^^^^^^^^^^^^^^^^ expected `Vec<Vec<String>>`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout]   |
[INFO] [stdout]   = note: expected struct `Vec<Vec<String>>`
[INFO] [stdout]           found unit type `()`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_105_455_assign_cookies/find_content_children.rs:3:63
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn find_content_children(g: Vec<i32>, s: Vec<i32>) -> i32 {}
[INFO] [stdout]   |            ---------------------                              ^^^ expected `i32`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]  --> src/t_106_376_wiggle_subsequence/wiggle_max_length.rs:3:49
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn wiggle_max_length(nums: Vec<i32>) -> i32 {}
[INFO] [stdout]   |            -----------------                    ^^^ expected `i32`, found `()`
[INFO] [stdout]   |            |
[INFO] [stdout]   |            implicitly returns `()` as its body has no tail or `return` expression
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_001_704_binary_search/search.rs:4:19
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |                   ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `target`
[INFO] [stdout]  --> src/t_001_704_binary_search/search.rs:4:35
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |                                   ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_002_35_search_insert_position/search_insert.rs:4:26
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |                          ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `target`
[INFO] [stdout]  --> src/t_002_35_search_insert_position/search_insert.rs:4:42
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |                                          ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_003_34_find_first_and_last_position_of_element_in_sorted_array/search_range.rs:4:25
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn search_range(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |                         ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `target`
[INFO] [stdout]  --> src/t_003_34_find_first_and_last_position_of_element_in_sorted_array/search_range.rs:4:41
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn search_range(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |                                         ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `x`
[INFO] [stdout]  --> src/t_004_69_sqrtx/my_sqrt.rs:4:20
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn my_sqrt(x: i32) -> i32 {
[INFO] [stdout]   |                    ^ help: if this is intentional, prefix it with an underscore: `_x`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `num`
[INFO] [stdout]  --> src/t_005_367_valid_perfect_square/is_perfect_square.rs:4:30
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn is_perfect_square(num: i32) -> bool {
[INFO] [stdout]   |                              ^^^ help: if this is intentional, prefix it with an underscore: `_num`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_006_27_remove_element/remove_element.rs:4:27
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
[INFO] [stdout]   |                           ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `val`
[INFO] [stdout]  --> src/t_006_27_remove_element/remove_element.rs:4:48
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
[INFO] [stdout]   |                                                ^^^ help: if this is intentional, prefix it with an underscore: `_val`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_007_26_remove_duplicates_from_sorted_array/remove_duplicates.rs:4:30
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
[INFO] [stdout]   |                              ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_008_844_backspace_string_compare/backspace_compare.rs:4:30
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn backspace_compare(s: String, t: String) -> bool {
[INFO] [stdout]   |                              ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `t`
[INFO] [stdout]  --> src/t_008_844_backspace_string_compare/backspace_compare.rs:4:41
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn backspace_compare(s: String, t: String) -> bool {
[INFO] [stdout]   |                                         ^ help: if this is intentional, prefix it with an underscore: `_t`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_009_283_move_zeroes/move_zeroes.rs:4:24
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn move_zeroes(nums: &mut Vec<i32>) {}
[INFO] [stdout]   |                        ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_010_977_squares_of_a_sorted_array/sorted_squares.rs:4:27
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn sorted_squares(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |                           ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `target`
[INFO] [stdout]  --> src/t_011_209_minimum_size_subarray_sum/min_sub_array_len.rs:4:30
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |                              ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_011_209_minimum_size_subarray_sum/min_sub_array_len.rs:4:43
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |                                           ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `fruits`
[INFO] [stdout]  --> src/t_012_904_fruit_into_baskets/total_fruit.rs:4:24
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn total_fruit(fruits: Vec<i32>) -> i32 {
[INFO] [stdout]   |                        ^^^^^^ help: if this is intentional, prefix it with an underscore: `_fruits`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_013_76_minimum_window_substring/min_window.rs:4:23
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn min_window(s: String, t: String) -> String {
[INFO] [stdout]   |                       ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `t`
[INFO] [stdout]  --> src/t_013_76_minimum_window_substring/min_window.rs:4:34
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn min_window(s: String, t: String) -> String {
[INFO] [stdout]   |                                  ^ help: if this is intentional, prefix it with an underscore: `_t`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/t_014_59_spiral_matrix_ii/generate_matrix.rs:4:28
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn generate_matrix(n: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |                            ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `matrix`
[INFO] [stdout]  --> src/t_015_54_spiral_matrix/spiral_order.rs:4:25
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn spiral_order(matrix: Vec<Vec<i32>>) -> Vec<i32> {
[INFO] [stdout]   |                         ^^^^^^ help: if this is intentional, prefix it with an underscore: `_matrix`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head`
[INFO] [stdout]   --> src/t_016_203_remove_linked_list_elements/remove_elements.rs:17:28
[INFO] [stdout]    |
[INFO] [stdout] 17 |     pub fn remove_elements(head: Option<Box<ListNode>>, val: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                            ^^^^ help: if this is intentional, prefix it with an underscore: `_head`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `val`
[INFO] [stdout]   --> src/t_016_203_remove_linked_list_elements/remove_elements.rs:17:57
[INFO] [stdout]    |
[INFO] [stdout] 17 |     pub fn remove_elements(head: Option<Box<ListNode>>, val: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                                                         ^^^ help: if this is intentional, prefix it with an underscore: `_val`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `index`
[INFO] [stdout]   --> src/t_017_707_design_linked_list/MyLinkedList.rs:12:19
[INFO] [stdout]    |
[INFO] [stdout] 12 |     fn get(&self, index: i32) -> i32 {
[INFO] [stdout]    |                   ^^^^^ help: if this is intentional, prefix it with an underscore: `_index`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `val`
[INFO] [stdout]   --> src/t_017_707_design_linked_list/MyLinkedList.rs:16:27
[INFO] [stdout]    |
[INFO] [stdout] 16 |     fn add_at_head(&self, val: i32) {}
[INFO] [stdout]    |                           ^^^ help: if this is intentional, prefix it with an underscore: `_val`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `val`
[INFO] [stdout]   --> src/t_017_707_design_linked_list/MyLinkedList.rs:18:27
[INFO] [stdout]    |
[INFO] [stdout] 18 |     fn add_at_tail(&self, val: i32) {}
[INFO] [stdout]    |                           ^^^ help: if this is intentional, prefix it with an underscore: `_val`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `index`
[INFO] [stdout]   --> src/t_017_707_design_linked_list/MyLinkedList.rs:20:28
[INFO] [stdout]    |
[INFO] [stdout] 20 |     fn add_at_index(&self, index: i32, val: i32) {}
[INFO] [stdout]    |                            ^^^^^ help: if this is intentional, prefix it with an underscore: `_index`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `val`
[INFO] [stdout]   --> src/t_017_707_design_linked_list/MyLinkedList.rs:20:40
[INFO] [stdout]    |
[INFO] [stdout] 20 |     fn add_at_index(&self, index: i32, val: i32) {}
[INFO] [stdout]    |                                        ^^^ help: if this is intentional, prefix it with an underscore: `_val`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `index`
[INFO] [stdout]   --> src/t_017_707_design_linked_list/MyLinkedList.rs:22:31
[INFO] [stdout]    |
[INFO] [stdout] 22 |     fn delete_at_index(&self, index: i32) {}
[INFO] [stdout]    |                               ^^^^^ help: if this is intentional, prefix it with an underscore: `_index`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head`
[INFO] [stdout]   --> src/t_018_206_reverse_linked_list/reverse_list.rs:17:25
[INFO] [stdout]    |
[INFO] [stdout] 17 |     pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                         ^^^^ help: if this is intentional, prefix it with an underscore: `_head`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head`
[INFO] [stdout]   --> src/t_019_24_swap_nodes_in_pairs/swap_pairs.rs:17:23
[INFO] [stdout]    |
[INFO] [stdout] 17 |     pub fn swap_pairs(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                       ^^^^ help: if this is intentional, prefix it with an underscore: `_head`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `head`
[INFO] [stdout]   --> src/t_020_19_remove_nth_node_from_end_of_list/remove_nth_from_end.rs:17:32
[INFO] [stdout]    |
[INFO] [stdout] 17 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                                ^^^^ help: if this is intentional, prefix it with an underscore: `_head`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `ti_gr` (lib) due to 100 previous errors; 65 warnings emitted
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/t_020_19_remove_nth_node_from_end_of_list/remove_nth_from_end.rs:17:61
[INFO] [stdout]    |
[INFO] [stdout] 17 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |                                                             ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_023_242_valid_anagram/is_anagram.rs:4:23
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn is_anagram(s: String, t: String) -> bool { true }
[INFO] [stdout]   |                       ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `t`
[INFO] [stdout]  --> src/t_023_242_valid_anagram/is_anagram.rs:4:34
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn is_anagram(s: String, t: String) -> bool { true }
[INFO] [stdout]   |                                  ^ help: if this is intentional, prefix it with an underscore: `_t`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `ransom_note`
[INFO] [stdout]  --> src/t_024_383_ransom_note/can_construct.rs:4:26
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn can_construct(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]   |                          ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_ransom_note`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `magazine`
[INFO] [stdout]  --> src/t_024_383_ransom_note/can_construct.rs:4:47
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn can_construct(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]   |                                               ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_magazine`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `strs`
[INFO] [stdout]  --> src/t_025_49_group_anagrams/group_anagrams.rs:4:27
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |                           ^^^^ help: if this is intentional, prefix it with an underscore: `_strs`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_026_438_find_all_anagrams_in_a_string/find_anagrams.rs:4:26
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn find_anagrams(s: String, p: String) -> Vec<i32> {
[INFO] [stdout]   |                          ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `p`
[INFO] [stdout]  --> src/t_026_438_find_all_anagrams_in_a_string/find_anagrams.rs:4:37
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn find_anagrams(s: String, p: String) -> Vec<i32> {
[INFO] [stdout]   |                                     ^ help: if this is intentional, prefix it with an underscore: `_p`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `words`
[INFO] [stdout]  --> src/t_027_1002_find_common_characters/common_chars.rs:4:25
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn common_chars(words: Vec<String>) -> Vec<String> {
[INFO] [stdout]   |                         ^^^^^ help: if this is intentional, prefix it with an underscore: `_words`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums1`
[INFO] [stdout]  --> src/t_028_349_intersection_of_two_arrays/intersection.rs:4:25
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn intersection(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |                         ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums2`
[INFO] [stdout]  --> src/t_028_349_intersection_of_two_arrays/intersection.rs:4:42
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn intersection(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |                                          ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/t_029_202_happy_number/is_happy.rs:4:21
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn is_happy(n: i32) -> bool {
[INFO] [stdout]   |                     ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_030_1_two_sum/two_sum.rs:4:20
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |                    ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `target`
[INFO] [stdout]  --> src/t_030_1_two_sum/two_sum.rs:4:36
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |                                    ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums1`
[INFO] [stdout]  --> src/t_031_454_4sum_ii/four_sum_count.rs:4:27
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn four_sum_count(nums1: Vec<i32>, nums2: Vec<i32>, nums3: Vec<i32>, nums4: Vec<i32>) -> i32 {
[INFO] [stdout]   |                           ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums1`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums2`
[INFO] [stdout]  --> src/t_031_454_4sum_ii/four_sum_count.rs:4:44
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn four_sum_count(nums1: Vec<i32>, nums2: Vec<i32>, nums3: Vec<i32>, nums4: Vec<i32>) -> i32 {
[INFO] [stdout]   |                                            ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums2`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums3`
[INFO] [stdout]  --> src/t_031_454_4sum_ii/four_sum_count.rs:4:61
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn four_sum_count(nums1: Vec<i32>, nums2: Vec<i32>, nums3: Vec<i32>, nums4: Vec<i32>) -> i32 {
[INFO] [stdout]   |                                                             ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums3`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums4`
[INFO] [stdout]  --> src/t_031_454_4sum_ii/four_sum_count.rs:4:78
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn four_sum_count(nums1: Vec<i32>, nums2: Vec<i32>, nums3: Vec<i32>, nums4: Vec<i32>) -> i32 {
[INFO] [stdout]   |                                                                              ^^^^^ help: if this is intentional, prefix it with an underscore: `_nums4`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_032_15_3sum/three_sum.rs:4:22
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |                      ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nums`
[INFO] [stdout]  --> src/t_033_18_4sum/four_sum.rs:5:21
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub fn four_sum(nums: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |                     ^^^^ help: if this is intentional, prefix it with an underscore: `_nums`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `target`
[INFO] [stdout]  --> src/t_033_18_4sum/four_sum.rs:5:37
[INFO] [stdout]   |
[INFO] [stdout] 5 |     pub fn four_sum(nums: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |                                     ^^^^^^ help: if this is intentional, prefix it with an underscore: `_target`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_034_344_reverse_string/reverse_string.rs:3:27
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn reverse_string(s: &mut Vec<char>) {}
[INFO] [stdout]   |                           ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_035_541_reverse_string_ii/reverse_str.rs:3:24
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn reverse_str(s: String, k: i32) -> String {
[INFO] [stdout]   |                        ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `k`
[INFO] [stdout]  --> src/t_035_541_reverse_string_ii/reverse_str.rs:3:35
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn reverse_str(s: String, k: i32) -> String {
[INFO] [stdout]   |                                   ^ help: if this is intentional, prefix it with an underscore: `_k`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_036_offer05_ti_huan_kong_ge_lcof/replace_space.rs:3:26
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn replace_space(s: String) -> String {
[INFO] [stdout]   |                          ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_037_151_reverse_words_in_a_string/reverse_words.rs:3:26
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn reverse_words(s: String) -> String {
[INFO] [stdout]   |                          ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_038_offer58ii_zuo_xuan_zhuan_zi_fu_chuan_lcof/reverse_left_words.rs:4:31
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn reverse_left_words(s: String, n: i32) -> String {
[INFO] [stdout]   |                               ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]  --> src/t_038_offer58ii_zuo_xuan_zhuan_zi_fu_chuan_lcof/reverse_left_words.rs:4:42
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn reverse_left_words(s: String, n: i32) -> String {
[INFO] [stdout]   |                                          ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `haystack`
[INFO] [stdout]  --> src/t_039_28_find_the_index_of_the_first_occurrence_in_a_string/str_str.rs:4:20
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn str_str(haystack: String, needle: String) -> i32 {
[INFO] [stdout]   |                    ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_haystack`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `needle`
[INFO] [stdout]  --> src/t_039_28_find_the_index_of_the_first_occurrence_in_a_string/str_str.rs:4:38
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn str_str(haystack: String, needle: String) -> i32 {
[INFO] [stdout]   |                                      ^^^^^^ help: if this is intentional, prefix it with an underscore: `_needle`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `s`
[INFO] [stdout]  --> src/t_040_459_repeated_substring_pattern/repeated_substring_pattern.rs:3:39
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn repeated_substring_pattern(s: String) -> bool {
[INFO] [stdout]   |                                       ^ help: if this is intentional, prefix it with an underscore: `_s`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `board`
[INFO] [stdout]  --> src/t_104_37_sudoku_solver/solve_sudoku.rs:3:25
[INFO] [stdout]   |
[INFO] [stdout] 3 |     pub fn solve_sudoku(board: &mut Vec<Vec<char>>) {}
[INFO] [stdout]   |                         ^^^^^ help: if this is intentional, prefix it with an underscore: `_board`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] Some errors have detailed explanations: E0308, E0425.
[INFO] [stdout] 
[INFO] [stdout] For more information about an error, try `rustc --explain E0308`.
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "9cadbdb9871591394afb53016ed89f6874b7794fcccd50ac8ebb3deab1627c6e", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "9cadbdb9871591394afb53016ed89f6874b7794fcccd50ac8ebb3deab1627c6e", kill_on_drop: false }`
[INFO] [stdout] 9cadbdb9871591394afb53016ed89f6874b7794fcccd50ac8ebb3deab1627c6e