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

Methodadd_operators

(num: String, target: i32)

src/problem_0282_expression_add_operators/backtracking.rs:45

Methodadd_operators_helper

( lhs: i64, rhs: i64, mut iter: Iter<u8>, target: i64, base: &mut Vec<

src/problem_0282_expression_add_operators/backtracking_2.rs:8

Methodadd_operators_helper

( first: i64, second: i64, third: i64, mut iter: Iter<u8>, target: i64

src/problem_0282_expression_add_operators/backtracking.rs:8

Methodadd_rungs

(rungs: Vec<i32>, dist: i32)

src/problem_1936_add_minimum_number_of_rungs/iterative.rs:8

Methodadd_spaces

(s: String, indices: Vec<i32>)

src/problem_2109_adding_spaces_to_a_string/iterative.rs:6

Methodadd_strings

(num1: String, num2: String)

src/problem_0415_add_strings/implicit_carry_2.rs:6

Methodadd_strings

(num1: String, num2: String)

src/problem_0415_add_strings/implicit_carry.rs:6

Methodadd_strings

(num1: String, num2: String)

src/problem_0415_add_strings/naive.rs:6

Methodadd_subsequence

(counts: &mut ([u32; 10], [u32; 100]), c: u8)

src/problem_2484_count_palindromic_subsequences/dynamic_programming.rs:13

Methodadd_to_array_form

(num: Vec<i32>, k: i32)

src/problem_0989_add_to_array_form_of_integer/iterative.rs:6

Methodadd_to_graph

(graph: &mut HashMap<i32, Vec<usize>>, (index, value): (usize, i32))

src/problem_1345_jump_game_iv/bfs.rs:8

Methodadd_to_result

(result: &mut i32, value: i32)

src/problem_1315_sum_of_nodes_with_even_valued_grandparent/recursive.rs:13

Methodadd_to_stack

(stack: &mut Vec<(u32, u32)>, room: (u32, u32))

src/problem_1847_closest_room/monotonic_stack.rs:12

Methodadd_two_numbers

(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>)

src/problem_0002_add_two_numbers/simple.rs:8

Methodadd_two_numbers

(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>)

src/problem_0445_add_two_numbers_ii/reverse_output.rs:10

Methodadded_integer

(nums1: Vec<i32>, nums2: Vec<i32>)

src/problem_3131_find_the_integer_added_to_array_i/greedy.rs:6

Methodaddress

(value: &i64)

src/problem_2121_intervals_between_identical_elements/iterative.rs:10

Methodadjacent_sum

(&self, value: i32)

src/problem_3242_design_neighbor_sum_service/precomputed.rs:27

Methodadvantage_count

(nums1: Vec<i32>, nums2: Vec<i32>)

src/problem_0870_advantage_shuffle/sort_and_merge.rs:6

Methodalert_names

(key_name: Vec<String>, key_time: Vec<String>)

src/problem_1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period/sliding_window.rs:8

Methodall_cells_dist_order

(rows: i32, cols: i32, r_center: i32, c_center: i32)

src/problem_1030_matrix_cells_in_distance_order/bfs.rs:8

Methodall_paths_source_target

(graph: Vec<Vec<i32>>)

src/problem_0797_all_paths_from_source_to_target/dfs.rs:31

Methodall_possible_fbt

(n: i32)

src/problem_0894_all_possible_full_binary_trees/dynamic_programming.rs:11

Methodalphabet_board_path

(target: String)

src/problem_1138_alphabet_board_path/iterative.rs:8

Methodalternate_digit_sum

(n: i32)

src/problem_2544_alternating_digit_sum/mathematical.rs:6

Methodalternating_subarray

(nums: Vec<i32>)

src/problem_2765_longest_alternating_subarray/sliding_window.rs:6

Methodalternating_sum

(nums: Vec<i32>)

src/problem_3701_compute_alternating_sum/iterative.rs:6

Methodambiguous_coordinates

(s: String)

src/problem_0816_ambiguous_coordinates/brute_force.rs:41

Methodamount_of_time

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

src/problem_2385_amount_of_time_for_binary_tree_to_be_infected/recursive.rs:59

Methodanalyze

(diffs: &[Box<[Ordering]>], i: usize)

src/problem_0955_delete_columns_to_make_sorted_ii/greedy.rs:8

Methodanalyze

(nums: &[u32])

src/problem_2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros/greedy.rs:6

Methodangle_clock

(hour: i32, minutes: i32)

src/problem_1344_angle_between_hands_of_a_clock/mathematical.rs:6

Methodanswer_queries

(nums: Vec<i32>, queries: Vec<i32>)

src/problem_2389_longest_subsequence_with_limited_sum/binary_search.rs:6

Methodanswer_string

(word: String, num_friends: i32)

src/problem_3403_find_the_lexicographically_largest_string_from_the_box_i/iterative.rs:8

Methodappeal_sum

(s: String)

src/problem_2262_total_appeal_of_a_string/dynamic_programming.rs:8

Methodappend

(&mut self, val: i32)

src/problem_1622_fancy_sequence/mod_inverse.rs:40

Methodappend

(&mut self, val: i32)

src/problem_1622_fancy_sequence/mod_inverse_2.rs:42

Methodappend

(mut tail: &mut Option<Box<ListNode>>, mut head: Option<Box<ListNode>>)

src/problem_2074_reverse_nodes_in_even_length_groups/iterative.rs:21

Methodappend_characters

(s: String, t: String)

src/problem_2486_append_characters_to_string_to_make_subsequence/greedy.rs:6

Methodapplication

( input: &'a str, context: &mut HashMap<&'a str, i32>, bindings_buffer: &mut Vec<(&'a

src/problem_0736_parse_lisp_expression/recursive_descent.rs:14

Methodapply

(matrix: (u64, u64, u64, u64), state: (u64, u64))

src/problem_1680_concatenation_of_consecutive_binary_numbers/matrix_multiplication.rs:40

Methodapply_operations

(nums: Vec<i32>)

src/problem_2460_apply_operations_to_an_array/iterative.rs:6

Methodare_almost_equal

(s1: String, s2: String)

src/problem_1790_check_if_one_string_swap_can_make_strings_equal/iterative.rs:6

Methodare_connected

(n: i32, threshold: i32, queries: Vec<Vec<i32>>)

src/problem_1627_graph_connectivity_with_threshold/union_find.rs:41

Methodare_numbers_ascending

(s: String)

src/problem_2042_check_if_numbers_are_ascending_in_a_sentence/iterative.rs:6

Methodare_occurrences_equal

(s: String)

src/problem_1941_check_if_all_characters_have_equal_number_of_occurrences/iterative.rs:6

Methodare_sentences_similar

(sentence1: String, sentence2: String)

src/problem_1813_sentence_similarity_iii/iterative.rs:35

Methodare_similar

(mat: Vec<Vec<i32>>, k: i32)

src/problem_2946_matrix_similarity_after_cyclic_shifts/brute_force.rs:6

Methodarea_of_max_diagonal

(dimensions: Vec<Vec<i32>>)

src/problem_3000_maximum_area_of_longest_diagonal_rectangle/iterative.rs:6

Methodarithmetic_triplets

(nums: Vec<i32>, diff: i32)

src/problem_2367_number_of_arithmetic_triplets/iterative.rs:6

Methodarrange_coins

(n: i32)

src/problem_0441_arranging_coins/newtons_method.rs:6

Methodarrange_coins

(n: i32)

src/problem_0441_arranging_coins/smarter_newtons_method.rs:6

Methodarrange_coins

(n: i32)

src/problem_0441_arranging_coins/smart_newtons_method.rs:6

Methodarrange_words

(text: String)

src/problem_1451_rearrange_words_in_a_sentence/iterative.rs:6

Methodarrangements

(mut m: u32, n: u32)

src/problem_1012_numbers_with_repeated_digits/iterative.rs:18

Methodarray_change

(nums: Vec<i32>, operations: Vec<Vec<i32>>)

src/problem_2295_replace_elements_in_an_array/hash_map.rs:8

Methodarray_nesting

(nums: Vec<i32>)

src/problem_0565_array_nesting/iterative.rs:8

Methodarray_pair_sum

(nums: Vec<i32>)

src/problem_0561_array_partition/sorting.rs:6

Methodarray_rank_transform

(arr: Vec<i32>)

src/problem_1331_rank_transform_of_an_array/hash_map.rs:8

Methodarray_sign

(nums: Vec<i32>)

src/problem_1822_sign_of_the_product_of_an_array/iterative.rs:8

Methodarray_strings_are_equal

(word1: Vec<String>, word2: Vec<String>)

src/problem_1662_check_if_two_string_arrays_are_equivalent/flatten_iterator.rs:10

Methodas_bit

(c: u8)

src/problem_1684_count_the_number_of_consistent_strings/bit_manipulation.rs:6

Methodassign

((target, source): (&mut i32, i32))

src/problem_2426_number_of_pairs_satisfying_inequality/merge_sort.rs:6

Methodassign_add

(lhs: &mut u32, rhs: u32)

src/problem_0923_3sum_with_multiplicity/dynamic_programming.rs:6

Methodassign_add

(target: &mut u32, value: u32)

src/problem_1987_number_of_unique_good_subsequences/dynamic_programming.rs:12

Methodassign_add

(target: &mut u32, value: u32)

src/problem_2328_number_of_increasing_paths_in_a_grid/bfs.rs:9

Methodassign_add

(target: &mut u32, value: u32)

src/problem_3583_count_special_triplets/hash_map.rs:8

Methodassign_add

(target: &mut u32, value: u32)

src/problem_2484_count_palindromic_subsequences/dynamic_programming.rs:8

Methodassign_add

(target: &mut u32, value: u32)

src/problem_1994_the_number_of_good_subsets/dynamic_programming.rs:31

Methodassign_add

(value: &mut usize, x: usize, n: NonZeroUsize)

src/problem_2682_find_the_losers_of_the_circular_game/brute_force.rs:8

Methodassign_add

(target: &mut u8, value: u8)

src/problem_2381_shifting_letters_ii/sweep_line.rs:6

Methodassign_add_sub

(target: &mut u32, add: u32, subtract: u32)

src/problem_2327_number_of_people_aware_of_a_secret/sliding_window.rs:8

Methodassign_elements

(groups: Vec<i32>, elements: Vec<i32>)

src/problem_3447_assign_elements_to_groups_with_constraints/sieve.rs:6

Methodassign_min

(target: &mut i32, value: u32)

src/problem_3488_closest_equal_element_queries/hash_map.rs:9

Methodassign_sub

(target: &mut u8, value: u8)

src/problem_2381_shifting_letters_ii/sweep_line.rs:14

Methodassign_tasks

(servers: Vec<i32>, tasks: Vec<i32>)

src/problem_1882_process_tasks_using_servers/binary_heap.rs:9

Methodasteroid_collision

(asteroids: Vec<i32>)

src/problem_0735_asteroid_collision/stack.rs:8

Methodasteroids_destroyed

(mass: i32, asteroids: Vec<i32>)

src/problem_2126_destroying_asteroids/greedy.rs:6

Methodat_most_n_given_digit_set

(digits: Vec<String>, n: i32)

src/problem_0902_numbers_at_most_n_given_digit_set/iterative.rs:40

Methodatom

(input: &[u8])

src/problem_0726_number_of_atoms/right_to_left_recursive_descent.rs:26

Methodatom

(symbol_map: &mut SymbolMap<'a>, input: &'a str, values: &[i32])

src/problem_0770_basic_calculator_iv/recursive.rs:37

Methodaverage

(salary: Vec<i32>)

src/problem_1491_average_salary_excluding_the_minimum_and_maximum_salary/iterative.rs:6

Methodaverage_of_levels

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

src/problem_0637_average_of_levels_in_binary_tree/bfs.rs:12

Methodaverage_of_subtree

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

src/problem_2265_count_nodes_equal_to_average_of_subtree/recursive.rs:27

Methodaverage_value

(nums: Vec<i32>)

src/problem_2455_average_value_of_even_numbers_that_are_divisible_by_three/iterative.rs:6

Methodaverage_waiting_time

(customers: Vec<Vec<i32>>)

src/problem_1701_average_waiting_time/greedy.rs:6

Methodavoid_flood

(rains: Vec<i32>)

src/problem_1488_avoid_flood_in_the_city/btree_set.rs:10

Methodavoid_flood

(rains: Vec<i32>)

src/problem_1488_avoid_flood_in_the_city/binary_heap.rs:42

Methodbackspace_compare

(s: String, t: String)

src/problem_0844_backspace_string_compare/stack.rs:27

Methodbackspace_compare

(s: String, t: String)

src/problem_0844_backspace_string_compare/reversed_iterator.rs:27

Methodbag_of_tokens_score

(tokens: Vec<i32>, power: i32)

src/problem_0948_bag_of_tokens/greedy.rs:6

Methodbalance

(iter: &mut impl Iterator<Item = Rc<RefCell<TreeNode>>>, count: u32)

src/problem_1382_balance_a_binary_search_tree/iterator.rs:39

Methodbalance_bst

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

src/problem_1382_balance_a_binary_search_tree/rebuild_from_scratch.rs:47

Methodbalance_bst

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

src/problem_1382_balance_a_binary_search_tree/iterator.rs:59

Methodbalanced_string

(s: String)

src/problem_1234_replace_the_substring_for_balanced_string/sliding_window.rs:6

Methodbalanced_string_split

(s: String)

src/problem_1221_split_a_string_in_balanced_strings/greedy.rs:6

Methodbase_neg2

(n: i32)

src/problem_1017_convert_to_base_2/iterative.rs:8

Methodbase_neg2

(n: i32)

src/problem_1017_convert_to_base_2/iterative_2.rs:8

Methodbase_neg2

(n: i32)

src/problem_1017_convert_to_base_2/iterative_3.rs:8

Methodbase_unit_conversions

(conversions: Vec<Vec<i32>>)

src/problem_3528_unit_conversion_i/dfs.rs:6

← previous next →601–700 of 10,327, ranked by callers