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

↓ 1,542 callersMethodlen

(&self)

src/problem_0480_sliding_window_median/two_sets.rs:15

↓ 1,006 callersMethodmap

(self, mut f: impl FnMut(T) -> U)

src/problem_0552_student_attendance_record_ii/matrix_multiplication.rs:37

↓ 986 callersMethoditer

(node: Rc<RefCell<TreeNode>>)

src/problem_0872_leaf_similar_trees/iterator.rs:12

↓ 890 callersMethodzip

(self, rhs: Vec6<U>)

src/problem_0552_student_attendance_record_ii/matrix_multiplication.rs:41

↓ 542 callersMethodmin

(nums: &[i32])

src/problem_3131_find_the_integer_added_to_array_i/greedy.rs:7

↓ 372 callersMethoditer

(&self)

src/problem_1416_restore_the_array/dynamic_programming.rs:19

↓ 341 callersMethodextend

(&mut self, iter: I)

src/problem_0030_substring_with_concatenation_of_all_words/sliding_window_sets.rs:60

↓ 339 callersMethodpush

(&mut self, x: i32)

src/problem_0155_min_stack/one_stack.rs:12

↓ 302 callersMethodget

(&self, index: i32)

src/problem_1095_find_in_mountain_array/mod.rs:11

↓ 280 callersMethodnext

(&mut self)

src/problem_1286_iterator_for_combination/iterative.rs:23

↓ 271 callersMethodpush

(&mut self, val: i32)

src/problem_1172_dinner_plate_stacks/heap.rs:132

↓ 232 callersMethodget_mut

(&mut self, handle: usize)

src/problem_0460_lfu_cache/map_to_nested_linked_lists.rs:36

↓ 228 callersMethodget

(&mut self)

src/problem_2102_sequentially_ordinal_rank_tracker/binary_heap.rs:45

↓ 202 callersMethodcast_unsigned

(x: Vec<Vec<i32>>)

src/problem_3332_maximum_points_tourist_can_earn/dynamic_programming.rs:8

↓ 194 callersMethodas_slice

(&self)

src/problem_1487_making_file_names_unique/hash_map.rs:34

↓ 186 callersMethodnext

(&mut self, n: i32)

src/problem_0900_rle_iterator/iterative.rs:13

↓ 183 callersMethodpop_front

(&mut self)

src/problem_1670_design_front_middle_back_queue/two_deques.rs:42

↓ 183 callersMethodpush_back

(&mut self, value: i32)

src/problem_0239_sliding_window_maximum/deque_2.rs:20

↓ 165 callersMethodget

(&self, word: &[u8])

src/problem_0676_implement_magic_dictionary/trie.rs:22

↓ 146 callersMethodinsert

(intervals: Vec<Vec<i32>>, new_interval: Vec<i32>)

src/problem_0057_insert_interval/binary_search.rs:6

↓ 144 callersMethodclear

(&mut self)

src/problem_0030_substring_with_concatenation_of_all_words/sliding_window_sets.rs:44

↓ 137 callersMethodpush

(lengths: &mut (u32, u32, u32), length: u32)

src/problem_2981_find_longest_special_substring_that_occurs_thrice_i/greedy.rs:6

↓ 134 callersMethodis_empty

(&self)

src/problem_0691_stickers_to_spell_word/bfs.rs:24

↓ 133 callersMethodlen

(&self)

src/problem_0378_kth_smallest_element_in_a_sorted_matrix/divide_and_conquer.rs:18

↓ 131 callersMethodpop

(&mut self)

src/problem_0155_min_stack/one_stack.rs:18

↓ 122 callersMethodfilter

(item: &Item)

src/problem_2382_maximum_segment_sum_after_removals/reversed_iteration.rs:14

↓ 120 callersMethodnext

(&mut self, seed: usize)

src/problem_2333_minimum_sum_of_squared_difference/quick_select.rs:10

↓ 117 callersMethodsplit_at

(mut head: Option<Box<ListNode>>, n: usize)

src/problem_0148_sort_list/merge_sort.rs:10

↓ 115 callersMethodfirst

(&self)

src/problem_0480_sliding_window_median/two_sets.rs:42

↓ 111 callersMethodall

(&self)

src/problem_2166_design_bitset/dense_storage.rs:45

↓ 105 callersMethodlast

(&self)

src/problem_0480_sliding_window_median/two_sets.rs:46

↓ 101 callersMethodto_string

(&self)

src/problem_2166_design_bitset/dense_storage.rs:66

↓ 101 callersMethodto_vec

(&self)

src/test_utilities.rs:22

↓ 93 callersMethodpush

(&mut self, value: T)

src/problem_0084_largest_rectangle_in_histogram/stack_2.rs:17

↓ 91 callersMethodlen

(&self)

src/problem_0786_k_th_smallest_prime_fraction/divide_and_conquer.rs:28

↓ 86 callersMethodinsert

(&mut self, num: u32)

src/problem_1825_finding_mk_average/btree_map.rs:12

↓ 85 callersMethodpush

(&mut self, x: i32)

src/problem_0225_implement_stack_using_queues/slow_pop.rs:19

↓ 80 callersMethodsaturating_sub

(&self, other: &Self)

src/problem_0691_stickers_to_spell_word/bfs.rs:28

↓ 73 callersMethodset

(&mut self, index: i32, val: i32)

src/problem_1146_snapshot_array/binary_search.rs:16

↓ 72 callersMethodcontains

(&self, key: i32)

src/problem_0705_design_hashset/store_by_buckets.rs:64

↓ 68 callersMethodcmp

(&self, other: &Self)

src/problem_0778_swim_in_rising_water/bfs.rs:30

↓ 67 callersMethodpartition_point

(mut left: u32, mut right: u32, mut f: impl FnMut(u32) -> bool)

src/problem_1095_find_in_mountain_array/binary_search.rs:10

↓ 63 callersMethodfirst

(&self)

src/problem_1416_restore_the_array/dynamic_programming.rs:23

↓ 63 callersMethodpop

(&mut self)

src/problem_1172_dinner_plate_stacks/heap.rs:175

↓ 61 callersMethodinsert

(values: &mut HashMap<i32, u32>, value: i32)

src/problem_2007_find_original_array_from_doubled_array/hash_map.rs:9

↓ 60 callersMethodpush_back

(&mut self, val: i32)

src/problem_1670_design_front_middle_back_queue/two_deques.rs:34

↓ 59 callersMethodnext

(mut n: i32)

src/problem_0202_happy_number/two_runners.rs:6

↓ 58 callersMethodcount

(&self, point: Vec<i32>)

src/problem_2013_detect_squares/hash_map.rs:33

↓ 56 callersMethodlast

(&self)

src/problem_1043_partition_array_for_maximum_sum/dynamic_programming.rs:31

↓ 55 callersMethodget

(&self, handle: usize)

src/problem_0460_lfu_cache/map_to_nested_linked_lists.rs:97

↓ 55 callersMethoditer

(&self)

src/problem_0378_kth_smallest_element_in_a_sorted_matrix/divide_and_conquer.rs:22

↓ 50 callersMethoditer

(&self)

src/problem_0761_special_binary_string/recursive.rs:40

↓ 49 callersMethodnext

(&mut self)

src/problem_0481_magical_string/state_machine.rs:17

↓ 48 callersMethodpush

(&mut self, val: i32)

src/problem_0895_maximum_frequency_stack/stack_of_stacks.rs:18

↓ 47 callersMethodremove

(&mut self, value: i32)

src/problem_0480_sliding_window_median/two_sets.rs:25

↓ 43 callersMethoddiv_ceil

(lhs: u64, rhs: u64)

src/problem_0878_nth_magical_number/mathematical.rs:24

↓ 43 callersMethodget

(&self, key: String, timestamp: i32)

src/problem_0981_time_based_key_value_store/binary_search.rs:26

↓ 42 callersMethodnext

(&mut self)

src/problem_0341_flatten_nested_list_iterator/stack.rs:39

↓ 39 callersMethodpush

(&mut self, length: u16)

src/problem_0659_split_array_into_consecutive_subsequences/two_optimized_binary_heaps.rs:15

↓ 37 callersMethodfront

(&self)

src/problem_0622_design_circular_queue/head_and_tail.rs:47

↓ 36 callersMethodcmp

(&self, other: &Self)

src/problem_2386_find_the_k_sum_of_an_array/binary_heap.rs:28

↓ 34 callersMethodpow

(self, n: u32)

src/problem_0552_student_attendance_record_ii/matrix_multiplication.rs:89

↓ 33 callersMethodpop

(&mut self)

src/problem_0084_largest_rectangle_in_histogram/stack_2.rs:21

↓ 33 callersMethodpush

(&mut self, x: i32)

src/problem_1381_design_a_stack_with_increment_operation/lazy.rs:16

↓ 32 callersMethodget

(&self, index: usize)

src/problem_1615_maximal_network_rank/brute_force.rs:12

↓ 31 callersMethodend

(&self)

src/problem_0855_exam_room/binary_heap.rs:13

↓ 31 callersMethodget

(&mut self, c: u8)

src/problem_1307_verbal_arithmetic_puzzle/brute_force.rs:12

↓ 31 callersMethodremove

(&mut self, value: usize, mut key_fn: impl FnMut(usize) -> T + Copy)

src/problem_1172_dinner_plate_stacks/heap.rs:95

↓ 28 callersMethodinsert

(&mut self, value: i32)

src/problem_0480_sliding_window_median/two_sets.rs:19

↓ 28 callersMethodpeek

(&self)

src/problem_0232_implement_queue_using_stacks/double_ended_stack.rs:36

↓ 27 callersMethodadd_element

(&mut self, name: &'c str)

tools/progress-tracker/src/html.rs:72

↓ 27 callersMethodnot_and

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:13

↓ 26 callersMethodas_non_leaf_tree

(&mut self)

src/problem_0850_rectangle_area_ii/sweep_line_with_segment_tree.rs:39

↓ 26 callersMethodpush

(&mut self, value: u32)

src/problem_1043_partition_array_for_maximum_sum/dynamic_programming.rs:22

↓ 25 callersMethodback

(&mut self, steps: i32)

src/problem_1472_design_browser_history/stack.rs:35

↓ 25 callersMethodpush

(&mut self, f: impl FnOnce(&mut Self))

src/problem_3211_generate_binary_strings_without_adjacent_zeros/dfs.rs:16

↓ 24 callersMethodfind

(&self, target: i32)

src/problem_1261_find_elements_in_a_contaminated_binary_tree/iterative.rs:17

↓ 24 callersMethodnext

(&mut self)

src/problem_0773_sliding_puzzle/bidirectional_bfs.rs:19

↓ 22 callersMethodpop_back

(&mut self)

src/problem_1670_design_front_middle_back_queue/two_deques.rs:59

↓ 21 callersMethodpop

(&mut self)

src/problem_0225_implement_stack_using_queues/slow_pop.rs:27

↓ 20 callersMethodand

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:24

↓ 20 callersMethodinsert

(&mut self, key: String, val: i32)

src/problem_0677_map_sum_pairs/trie.rs:26

↓ 20 callersMethodpow

(result: &mut u64, mut base: u64, mut exponent: u32)

src/problem_2233_maximum_product_after_k_increments/quick_select.rs:62

↓ 19 callersMethodcmp

(&self, other: &Self)

src/problem_0023_merge_k_sorted_lists/heap.rs:27

↓ 19 callersMethodget

(&self, index: i32, snap_id: i32)

src/problem_1146_snapshot_array/binary_search.rs:38

↓ 19 callersFunctionpartition

(values: &mut [T], mut f: F)

src/problem_0018_4sum/reduce_to_three_sum.rs:7

↓ 19 callersMethodset

(&mut self, length: usize, start: usize, k: usize, value: i32)

src/problem_0546_remove_boxes/dynamic_programming.rs:30

↓ 19 callersMethodsum

(num1: i32, num2: i32)

src/problem_2235_add_two_integers/obvious.rs:6

↓ 18 callersMethodget

(&self, length: usize, start: usize, k: usize)

src/problem_0546_remove_boxes/dynamic_programming.rs:22

↓ 18 callersMethodget_mut

(&mut self, c: u8)

src/problem_3305_count_of_substrings_containing_every_vowel_and_k_consonants_i/sliding_window.rs:15

↓ 18 callersMethodnext

( stack: &mut Vec<(i32, Option<Rc<RefCell<TreeNode>>>)>, node: &mut Option<Rc<RefCell<

src/problem_0653_two_sum_iv_input_is_a_bst/bst_iterator.rs:16

↓ 18 callersMethodreserve

(&mut self)

src/problem_1845_seat_reservation_manager/binary_heap.rs:17

↓ 18 callersMethodreverse

(x: i32)

src/problem_0007_reverse_integer/brute_force.rs:6

↓ 17 callersMethodcmp

(&self, other: &Self)

src/problem_3264_final_array_state_after_k_multiplication_operations_i/binary_heap.rs:25

↓ 17 callersMethodflatten

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

src/problem_0114_flatten_binary_tree_to_linked_list/iterative.rs:12

↓ 17 callersMethodnext

(&mut self)

src/problem_2233_maximum_product_after_k_increments/quick_select.rs:21

↓ 17 callersMethodpush

(&mut self, node: usize, probability: f64)

src/problem_1514_path_with_maximum_probability/dijkstra_2.rs:77

↓ 15 callersMethodcmp

(&self, other: &Self)

src/problem_0407_trapping_rain_water_ii/bfs.rs:29

↓ 15 callersMethodcmp

(&self, other: &Self)

src/problem_0882_reachable_nodes_in_subdivided_graph/dijkstra.rs:28

↓ 15 callersMethodget

(&self, index: usize)

src/problem_0786_k_th_smallest_prime_fraction/divide_and_conquer.rs:16

next →1–100 of 10,327, ranked by callers