Struct pegitan::Solution

pub struct Solution;

Implementations

impl Solution

pub fn single_number(nums: Vec<i32>) -> i32

impl Solution

pub fn max_product(nums: Vec<i32>) -> i32

impl Solution

pub fn max_area_5425(
    h: i32,
    w: i32,
    horizontal_cuts: Vec<i32>,
    vertical_cuts: Vec<i32>
) -> i32

impl Solution

pub fn min_reorder(n: i32, connections: Vec<Vec<i32>>) -> i32

impl Solution

pub fn remove_outer_parentheses(s: String) -> String

impl Solution

pub fn divisor_game(n: i32) -> bool

pub fn divisor_game_recursive(n: i32) -> bool

impl Solution

pub fn max_area_naive(height: Vec<i32>) -> i32

pub fn max_area_single_pass(height: Vec<i32>) -> i32

pub fn max_area(height: Vec<i32>) -> i32

impl Solution

pub fn defang_i_paddr<T>(address: T) -> String where
    T: Into<String>, 

impl Solution

pub fn roman_to_int<T>(_: T) -> i32 where
    T: Into<String>, 

impl Solution

pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>>

impl Solution

pub fn three_sum_closest(nums: Vec<i32>, target: i32) -> i32

impl Solution

pub fn remove_element(_nums: &mut Vec<i32>, _val: i32) -> i32

pub fn remove_element_two_pointer(nums: &mut Vec<i32>, val: i32) -> i32

impl Solution

pub fn coin_change_brute_force(coins: Vec<i32>, amount: i32) -> i32

pub fn coin_change_brute_force_recursion(
    coin_idx: usize,
    coins: &Vec<i32>,
    amount: i32
) -> i32

pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32

impl Solution

pub fn integer_break(n: i32) -> i32

pub fn integer_break_recursive(_: i32) -> i32

impl Solution

pub fn is_subsequence<T>(s: T, t: T) -> bool where
    T: Into<String>, 

impl Solution

pub fn can_partition_naive(nums: Vec<i32>) -> bool

pub fn can_partition_whats_left(nums: Vec<i32>) -> bool

pub fn can_partition_sort_and_try(nums: Vec<i32>) -> bool

pub fn can_partition_odd_even_counter(nums: Vec<i32>) -> bool

pub fn can_partition_dp_top_down(
    nums: &Vec<i32>,
    start_from: usize,
    whats_left: i32,
    goal_amount: i32
) -> bool

pub fn can_partition(nums: Vec<i32>) -> bool

impl Solution

pub fn longest_palindrome<T>(s: T) -> String where
    T: Into<String>, 

impl Solution

pub fn convert<T>(s: T, n: i32) -> String where
    T: Into<String>, 

impl Solution

pub fn reverse(input_value: i32) -> i32

impl Solution

pub fn simplify_path<T>(path: T) -> String where
    T: Into<String>, 

impl Solution

pub fn my_atoi<T>(_: T) -> i32 where
    T: Into<String>, 

impl Solution

pub fn is_palindrome(input_value: i32) -> bool

impl Solution

pub fn total_fruit(_: Vec<i32>) -> i32

impl Solution

pub fn sort_array_by_parity_ii(a: Vec<i32>) -> Vec<i32>

impl Solution

pub fn num_trees(n: i32) -> i32