Functions — github.com/EFanZh/LeetCode

hub / github.com/EFanZh/LeetCode / functions

Functions10,327 in github.com/EFanZh/LeetCode

⨍ Functions 10,327◇ Types & classes 5,558

Methodbasic_calculator_iv

(expression: String, evalvars: Vec<String>, evalints: Vec<i32>)

src/problem_0770_basic_calculator_iv/recursive.rs:189

Methodbeautiful_array

(n: i32)

src/problem_0932_beautiful_array/dynamic_programming.rs:16

Methodbeautiful_subarrays

(nums: Vec<i32>)

src/problem_2588_count_the_number_of_beautiful_subarrays/hash_map.rs:28

Methodbeauty_sum

(s: String)

src/problem_1781_sum_of_beauty_of_all_substrings/brute_force.rs:6

Methodbest_closing_time

(customers: String)

src/problem_2483_minimum_penalty_for_a_shop/iterative.rs:6

Methodbest_coordinate

(towers: Vec<Vec<i32>>, radius: i32)

src/problem_1620_coordinate_with_maximum_network_quality/brute_force.rs:6

Methodbest_hand

(ranks: Vec<i32>, suits: Vec<char>)

src/problem_2347_best_poker_hand/brute_force.rs:39

Methodbest_rotation

(nums: Vec<i32>)

src/problem_0798_smallest_rotation_with_highest_score/count_interval_intersections.rs:6

Methodbest_team_score

(scores: Vec<i32>, ages: Vec<i32>)

src/problem_1626_best_team_with_no_conflicts/dynamic_programming.rs:6

Methodbfs

(grid: &mut [Vec<i32>], mut i: usize, mut j: usize, queue: &mut VecDeque<(usize, usize)>)

src/problem_0695_max_area_of_island/bfs.rs:8

Methodbfs

(grid: &mut [Vec<char>], mut current: (usize, usize), queue: &mut VecDeque<(usize, usize)>)

src/problem_0200_number_of_islands/bfs.rs:8

Methodbfs

(board: &mut [Vec<char>], mut i: usize, mut j: usize, queue: &mut VecDeque<(usize, usize)>)

src/problem_0130_surrounded_regions/bfs_2.rs:8

Methodbfs

( source: (usize, usize), target: (usize, usize), forest: &[Vec<i32>], columns

src/problem_0675_cut_off_trees_for_golf_event/bfs.rs:8

Methodbfs

( Context { grid, rows, columns, cat_jump,

src/problem_1728_cat_and_mouse_ii/bfs.rs:112

Methodbfs

(pool: &'a [Node], queue: &mut VecDeque<&'a Node>, first: u8, mut state: u32)

src/problem_1178_number_of_valid_words_for_each_puzzle/trie.rs:24

Methodbfs

( states: &mut [State], rows: usize, columns: usize, queue: &mut VecDeque<(usi

src/problem_0749_contain_virus/bfs_2.rs:33

Methodbfs

( states: &mut [State], rows: usize, columns: usize, queue: &mut VecDeque<(usi

src/problem_0749_contain_virus/bfs_3.rs:33

Methodbfs

( states: &mut [State], rows: usize, columns: usize, queue: &mut VecDeque<(usi

src/problem_0749_contain_virus/bfs.rs:33

Methodbi_select

( matrix: MatrixRef, depth: u32, low_rank: usize, high_rank: usize, bu

src/problem_0786_k_th_smallest_prime_fraction/divide_and_conquer.rs:184

Methodbi_select

( matrix: MatrixRef, depth: u32, low_rank: usize, high_rank: usize, bu

src/problem_0378_kth_smallest_element_in_a_sorted_matrix/divide_and_conquer.rs:166

Methodbinary_gap

(n: i32)

src/problem_0868_binary_gap/iterative.rs:6

Methodbinary_tree_paths

(root: Option<Rc<RefCell<TreeNode>>>)

src/problem_0257_binary_tree_paths/recursive_2.rs:36

Methodbinary_tree_paths

(root: Option<Rc<RefCell<TreeNode>>>)

src/problem_0257_binary_tree_paths/recursive.rs:33

Methodbinary_tree_paths_helper

(node: &TreeNode, base: &mut String, result: &mut Vec<String>)

src/problem_0257_binary_tree_paths/recursive_2.rs:11

Methodbinary_tree_paths_helper

(node: &TreeNode, base: &mut String, result: &mut Vec<String>)

src/problem_0257_binary_tree_paths/recursive.rs:11

Methodbinomial

(n: i32, k: i32)

src/problem_0062_unique_paths/binomial.rs:6

Methodbinomial

(n: u64, k: u64)

src/problem_3179_find_the_n_th_value_after_k_seconds/mathematical.rs:32

Methodbitwise_complement

(n: i32)

src/problem_1009_complement_of_base_10_integer/bit_manipulation_3.rs:6

Methodbitwise_complement

(n: i32)

src/problem_1009_complement_of_base_10_integer/bit_manipulation_2.rs:6

Methodbitwise_complement

(n: i32)

src/problem_1009_complement_of_base_10_integer/bit_manipulation.rs:6

Methodbook

(&mut self, left: i32, right: i32)

src/problem_0731_my_calendar_ii/sweep_line.rs:16

Methodbook

(&mut self, left: i32, right: i32)

src/problem_0732_my_calendar_iii/sweep_line.rs:18

Methodbook

(&mut self, left: i32, right: i32)

src/problem_0729_my_calendar_i/btree_map.rs:17

Methodbowl_subarrays

(nums: Vec<i32>)

src/problem_3676_count_bowl_subarrays/monotonic_stack.rs:8

Methodbox_delivering

(boxes: Vec<Vec<i32>>, ports_count: i32, max_boxes: i32, max_weight: i32)

src/problem_1687_delivering_boxes_from_storage_to_ports/dynamic_programming_and_sliding_window.rs:22

Methodbrace_expansion_ii

(expression: String)

src/problem_1096_brace_expansion_ii/parse_and_expand.rs:60

Methodbreak_palindrome

(palindrome: String)

src/problem_1328_break_a_palindrome/greedy.rs:6

Methodbroadcast_in_time_frame

(union_find: &[State], time_frame: &mut Vec<(&State, &State)>)

src/problem_2092_find_all_people_with_secret/union_find.rs:47

Methodbroken_calc

(start_value: i32, target: i32)

src/problem_0991_broken_calculator/greedy.rs:6

Methodbst_from_preorder

(preorder: Vec<i32>)

src/problem_1008_construct_binary_search_tree_from_preorder_traversal/recursive.rs:24

Methodbst_to_gst

(root: Option<Rc<RefCell<TreeNode>>>)

src/problem_1038_binary_search_tree_to_greater_sum_tree/recursive.rs:22

Methodbtree_game_winning_move

(root: Option<Rc<RefCell<TreeNode>>>, n: i32, x: i32)

src/problem_1145_binary_tree_coloring_game/recursive.rs:36

Methodbuddy_strings

(s: String, goal: String)

src/problem_0859_buddy_strings/brute_force.rs:6

Methodbuild

(nodes: &mut Vec<Rc<RefCell<TreeNode>>>, count: usize)

src/problem_1382_balance_a_binary_search_tree/rebuild_from_scratch.rs:27

Methodbuild_array

(target: Vec<i32>, n: i32)

src/problem_1441_build_an_array_with_stack_operations/iterative.rs:8

Methodbuild_array

(target: Vec<i32>, n: i32)

src/problem_1441_build_an_array_with_stack_operations/iterative_2.rs:6

Methodbuild_array

(nums: Vec<i32>)

src/problem_1920_build_array_from_permutation/utilize_higher_bits.rs:6

Methodbuild_connection_graph

( begin_word: &'a [u8], end_word: &'a [u8], connections: &HashMap<ConnectionKey<'a>, V

src/problem_0126_word_ladder_ii/bidirectional_search.rs:26

Methodbuild_connection_table

(word_list: &[String])

src/problem_0126_word_ladder_ii/bidirectional_search.rs:11

Methodbuild_dict

(&mut self, dictionary: Vec<String>)

src/problem_0676_implement_magic_dictionary/hash_map.rs:22

Methodbuild_dict

(&mut self, dictionary: Vec<String>)

src/problem_0676_implement_magic_dictionary/trie_2.rs:54

Methodbuild_dict

(&mut self, dictionary: Vec<String>)

src/problem_0676_implement_magic_dictionary/trie_3.rs:46

Methodbuild_dict

(&mut self, dictionary: Vec<String>)

src/problem_0676_implement_magic_dictionary/hash_map_2.rs:24

Methodbuild_expression

( nums: &[i32], cache: &[(f64, usize, f64, usize)], start: usize, length: usiz

src/problem_0553_optimal_division/dynamic_programming.rs:14

Methodbuild_integer

(iter: &mut Peekable<impl Iterator<Item = u8>>)

src/problem_0385_mini_parser/recursive.rs:11

Methodbuild_kmp_table

(values: &[i32], target: &mut [usize])

src/problem_1764_form_array_by_concatenating_subarrays_of_another_array/kmp.rs:6

Methodbuild_lookup_table

(s: &str)

src/problem_1397_find_all_good_strings/memoized_dynamic_programming_with_kmp.rs:14

Methodbuild_map

(s: &str, length: u32)

src/problem_2564_substring_xor_queries/sliding_window.rs:8

Methodbuild_map

(node: Option<&RefCell<TreeNode>>, map: &mut HashMap<(i32, usize, usize), usize>)

src/problem_0572_subtree_of_another_tree/hash_map.rs:18

Methodbuild_matrix

(m: u8, result: &mut [u64; 64])

src/problem_1931_painting_a_grid_with_three_different_colors/matrix_multiplication.rs:10

Methodbuild_matrix

(k: i32, row_conditions: Vec<Vec<i32>>, col_conditions: Vec<Vec<i32>>)

src/problem_2392_build_a_matrix_with_conditions/topological_sorting_bfs.rs:52

Methodbuild_matrix

(k: i32, row_conditions: Vec<Vec<i32>>, col_conditions: Vec<Vec<i32>>)

src/problem_2392_build_a_matrix_with_conditions/topological_sorting_dfs.rs:57

Methodbuild_tree

(preorder: Vec<i32>, inorder: Vec<i32>)

src/problem_0105_construct_binary_tree_from_preorder_and_inorder_traversal/recursive_cached.rs:40

Methodbuild_tree

(preorder: Vec<i32>, inorder: Vec<i32>)

src/problem_0105_construct_binary_tree_from_preorder_and_inorder_traversal/recursive.rs:21

Methodbuild_tree

(preorder: Vec<i32>, inorder: Vec<i32>)

src/problem_0105_construct_binary_tree_from_preorder_and_inorder_traversal/recursive_smart_2.rs:45

Methodbuild_tree

(preorder: Vec<i32>, inorder: Vec<i32>)

src/problem_0105_construct_binary_tree_from_preorder_and_inorder_traversal/recursive_smart.rs:46

Methodbuild_tree

(inorder: Vec<i32>, postorder: Vec<i32>)

src/problem_0106_construct_binary_tree_from_inorder_and_postorder_traversal/recursive_cached.rs:40

Methodbuild_tree

(inorder: Vec<i32>, postorder: Vec<i32>)

src/problem_0106_construct_binary_tree_from_inorder_and_postorder_traversal/recursive.rs:21

Methodbuild_tree

(inorder: Vec<i32>, postorder: Vec<i32>)

src/problem_0106_construct_binary_tree_from_inorder_and_postorder_traversal/recursive_smart_2.rs:45

Methodbuild_tree

(inorder: Vec<i32>, postorder: Vec<i32>)

src/problem_0106_construct_binary_tree_from_inorder_and_postorder_traversal/recursive_smart.rs:46

Methodbuild_tree

(nums: &[i32], tree: &mut Vec<i32>)

src/problem_0307_range_sum_query_mutable/segment_tree_2.rs:11

Methodbuild_tree_helper

( preorder: &[i32], inorder: &[i32], inorder_base: usize, inorder_val_to_index

src/problem_0105_construct_binary_tree_from_preorder_and_inorder_traversal/recursive_cached.rs:12

Methodbuild_tree_helper

(preorder: &[i32], inorder: &[i32])

src/problem_0105_construct_binary_tree_from_preorder_and_inorder_traversal/recursive.rs:11

Methodbuild_tree_helper

(preorder: &[i32], inorder: &[i32])

src/problem_0105_construct_binary_tree_from_preorder_and_inorder_traversal/recursive_smart_2.rs:34

Methodbuild_tree_helper

(preorder: &[i32], inorder: &[i32])

src/problem_0105_construct_binary_tree_from_preorder_and_inorder_traversal/recursive_smart.rs:37

Methodbuild_tree_helper

( inorder: &[i32], postorder: &[i32], inorder_base: usize, inorder_val_to_inde

src/problem_0106_construct_binary_tree_from_inorder_and_postorder_traversal/recursive_cached.rs:12

Methodbuild_tree_helper

(inorder: &[i32], postorder: &[i32])

src/problem_0106_construct_binary_tree_from_inorder_and_postorder_traversal/recursive.rs:11

Methodbuild_tree_helper

(inorder: &[i32], postorder: &[i32])

src/problem_0106_construct_binary_tree_from_inorder_and_postorder_traversal/recursive_smart_2.rs:34

Methodbuild_tree_helper

(inorder: &[i32], postorder: &[i32])

src/problem_0106_construct_binary_tree_from_inorder_and_postorder_traversal/recursive_smart.rs:37

Methodbuild_tree_helper_left

( preorder: &mut &[i32], inorder: &mut &[i32], root_val: i32, )

src/problem_0105_construct_binary_tree_from_preorder_and_inorder_traversal/recursive_smart_2.rs:11

Methodbuild_tree_helper_left

( preorder: &'a [i32], inorder: &'b [i32], root_val: i32, )

src/problem_0105_construct_binary_tree_from_preorder_and_inorder_traversal/recursive_smart.rs:13

Methodbuild_tree_helper_right

( inorder: &mut &[i32], postorder: &mut &[i32], root_val: i32, )

src/problem_0106_construct_binary_tree_from_inorder_and_postorder_traversal/recursive_smart_2.rs:11

Methodbuild_tree_helper_right

( inorder: &'a [i32], postorder: &'b [i32], root_val: i32, )

src/problem_0106_construct_binary_tree_from_inorder_and_postorder_traversal/recursive_smart.rs:13

Methodbuild_trie

(words: Vec<String>)

src/problem_0212_word_search_ii/trie_dfs.rs:15

Methodbuild_trie

(s: &[u8])

src/problem_0522_longest_uncommon_subsequence_ii/trie.rs:14

Methodbuild_window

(nums: &[i32])

src/problem_0480_sliding_window_median/two_binary_heaps.rs:12

Methodbulb_switch

(n: i32)

src/problem_0319_bulb_switcher/mathematical.rs:6

Methodbusiest_servers

(k: i32, arrival: Vec<i32>, load: Vec<i32>)

src/problem_1606_find_servers_that_handled_most_number_of_requests/binary_heap.rs:34

Methodbusy_student

(start_time: Vec<i32>, end_time: Vec<i32>, query_time: i32)

src/problem_1450_number_of_students_doing_homework_at_a_given_time/iterative.rs:6

Methodbutton_with_longest_time

(events: Vec<Vec<i32>>)

src/problem_3386_button_with_longest_push_time/iterative.rs:8

Methodbuy_choco

(prices: Vec<i32>, money: i32)

src/problem_2706_buy_two_chocolates/greedy.rs:6

Methodcal_points

(ops: Vec<String>)

src/problem_0682_baseball_game/stack.rs:6

Methodcalc_equation

(equations: Vec<Vec<String>>, values: Vec<f64>, queries: Vec<Vec<String>>)

src/problem_0399_evaluate_division/bfs.rs:14

Methodcalculate

(s: String)

src/problem_0227_basic_calculator_ii/iterative.rs:36

Methodcalculate

(s: String)

src/problem_0227_basic_calculator_ii/stack.rs:6

Methodcalculate

(s: String)

src/problem_0227_basic_calculator_ii/recursive_descent.rs:77

Methodcalculate

(s: String)

src/problem_0224_basic_calculator/stack.rs:6

Methodcalculate

(s: String)

src/problem_0224_basic_calculator/recursive_descent.rs:68

Methodcalculate_convex_hull

(points: Vec<Vec<i32>>)

src/problem_0812_largest_triangle_area/convex_hull.rs:76

Methodcalculate_cost

(lhs: &[i32], rhs: &[i32])

src/problem_3424_minimum_cost_to_make_arrays_identical/greedy.rs:6

← previous next →701–800 of 10,327, ranked by callers