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

↓ 15 callersMethodget

(&mut self, key: i32)

src/problem_0146_lru_cache/map_to_doubly_linked_list.rs:33

↓ 15 callersFunctionmake_tree

(values: I)

src/test_utilities.rs:247

↓ 15 callersMethodnext

(s: &mut Vec<u8>)

src/problem_0535_encode_and_decode_tinyurl/hash_maps.rs:24

↓ 15 callersMethodnext

(&mut self)

src/problem_0173_binary_search_tree_iterator/iterative.rs:26

↓ 15 callersMethodpop

(&mut self)

src/problem_0895_maximum_frequency_stack/stack_of_stacks.rs:28

↓ 15 callersMethodpush_front

(&mut self, value: u32)

src/problem_1416_restore_the_array/dynamic_programming.rs:14

↓ 14 callersMethodinsert

(buckets: &mut Vec<usize>, value: u32)

src/problem_3217_delete_nodes_from_linked_list_present_in_array/bit_flags.rs:10

↓ 14 callersMethodpush

(&mut self, num: i32)

src/problem_3349_adjacent_increasing_subarrays_detection_i/iterative.rs:12

↓ 14 callersMethodremove

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

src/problem_2007_find_original_array_from_doubled_array/hash_map.rs:13

↓ 14 callersMethodstarts_with

(first_digit: u8, s: &[u8], head: u64)

src/problem_0306_additive_number/brute_force.rs:8

↓ 13 callersMethodbinary_search

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

src/problem_1095_find_in_mountain_array/binary_search.rs:24

↓ 13 callersMethodcmp

(&self, other: &Self)

src/problem_1090_largest_values_from_labels/greedy.rs:29

↓ 13 callersMethodkey

(&self)

src/problem_0855_exam_room/binary_heap.rs:27

↓ 12 callersMethodcmp

(&self, other: &Self)

src/problem_1514_path_with_maximum_probability/dijkstra.rs:28

↓ 12 callersMethodget

(&self, key: i32)

src/problem_0706_design_hashmap/store_by_buckets.rs:55

↓ 12 callersFunctioninner

(lhs: Option<&RefCell<TreeNode>>, rhs: Option<&RefCell<TreeNode>>)

src/test_utilities.rs:61

↓ 12 callersMethodinsert

(&mut self, word: String)

src/problem_0208_implement_trie_prefix_tree/canonical.rs:14

↓ 12 callersMethodsum

(&self, prefix: String)

src/problem_0677_map_sum_pairs/trie.rs:76

↓ 12 callersMethodupgrade

(&mut self, num: i32, user: i32)

src/problem_1993_operations_on_tree/iterative.rs:83

↓ 11 callersMethodadd_text

(&mut self, text: &str)

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

↓ 11 callersMethodcount

(&self, tot: i32)

src/problem_1865_finding_pairs_with_a_certain_sum/hash_map.rs:44

↓ 11 callersMethodfinish

(&self)

src/problem_2588_count_the_number_of_beautiful_subarrays/hash_map.rs:13

↓ 11 callersMethodget

(&mut self, c: u8)

src/problem_1358_number_of_substrings_containing_all_three_characters/sliding_window.rs:13

↓ 11 callersMethodpop

(&mut self)

src/problem_0659_split_array_into_consecutive_subsequences/two_optimized_binary_heaps.rs:23

↓ 11 callersMethodreplace

(iter: impl Iterator<Item = u8>, mut base: u32, source: u8, target: u8)

src/problem_1432_max_difference_you_can_get_from_changing_an_integer/greedy_2.rs:6

↓ 10 callersMethodfind

(&self, number: i32)

src/problem_2349_design_a_number_container_system/hash_map_and_btree_set.rs:34

↓ 10 callersFunctionlist

(tree: &Tree, mut f: impl FnMut(Solution))

tools/progress-tracker/src/solutions.rs:38

↓ 10 callersMethodparse

(s: &str)

src/problem_0972_equal_rational_numbers/convert_to_fraction.rs:6

↓ 10 callersMethodpeek

(&self)

src/problem_1172_dinner_plate_stacks/heap.rs:110

↓ 10 callersMethodpush_back

(&mut self, item: (u32, i32))

src/problem_1425_constrained_subsequence_sum/sliding_window_maximum.rs:20

↓ 9 callersFunctionclone_cell_inner

(cell: &Cell<T>)

src/problem_0707_design_linked_list/doubly_linked_list.rs:18

↓ 9 callersMethodcmp

(&self, other: &Self)

src/problem_1488_avoid_flood_in_the_city/binary_heap.rs:36

↓ 9 callersMethodcmp

(&self, other: &Self)

src/problem_0632_smallest_range_covering_elements_from_k_lists/binary_heap.rs:39

↓ 9 callersFunctionfind_node

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

src/test_utilities.rs:81

↓ 9 callersMethodpop

(&mut self)

src/problem_1381_design_a_stack_with_increment_operation/lazy.rs:24

↓ 9 callersMethodunion

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

src/problem_0803_bricks_falling_when_hit/reverse_time_and_union_find.rs:61

↓ 8 callersMethodclear

(&mut self)

src/problem_0659_split_array_into_consecutive_subsequences/two_optimized_binary_heaps.rs:45

↓ 8 callersMethodcmp

(&self, other: &Self)

src/problem_2065_maximum_path_quality_of_a_graph/brute_force_dfs.rs:36

↓ 8 callersMethodcmp

(&self, other: &Self)

src/problem_1631_path_with_minimum_effort/dijkstra.rs:28

↓ 7 callersMethodallocate

(&mut self, node: Node)

src/problem_0460_lfu_cache/map_to_nested_linked_lists.rs:28

↓ 7 callersMethodget

(&mut self, value: u32)

src/problem_1387_sort_integers_by_the_power_value/quick_select_and_memoized_dynamic_programming.rs:29

↓ 7 callersMethodinsert

(buffer: &mut [i32; 8], value: i32)

src/problem_1509_minimum_difference_between_largest_and_smallest_value_in_three_moves/sliding_window.rs:8

↓ 7 callersMethodinto_right

(self)

src/problem_0938_range_sum_of_bst/recursive_2.rs:17

↓ 7 callersMethoditer

(&self)

src/problem_0786_k_th_smallest_prime_fraction/divide_and_conquer.rs:32

↓ 7 callersMethodparent

(&self)

src/problem_0699_falling_squares/segment_tree.rs:24

↓ 7 callersMethodpop

(&mut self)

src/problem_1514_path_with_maximum_probability/dijkstra_2.rs:95

↓ 7 callersMethodpow

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

src/problem_1680_concatenation_of_consecutive_binary_numbers/matrix_multiplication.rs:25

↓ 7 callersMethodpush

(&mut self, x: i32)

src/problem_0232_implement_queue_using_stacks/double_ended_stack.rs:16

↓ 7 callersMethodrotate_right

(head: Option<Box<ListNode>>, k: i32)

src/problem_0061_rotate_list/measure_length.rs:10

↓ 6 callersMethodallocate_node

(&mut self, key: Rc<str>, value: usize, prev: usize, next: usize)

src/problem_0432_all_oone_data_structure/doubly_linked_list.rs:35

↓ 6 callersMethodcmp

(&self, other: &Self)

src/problem_1976_number_of_ways_to_arrive_at_destination/dijkstra.rs:28

↓ 6 callersMethodcmp

(&self, other: &Self)

src/problem_1797_design_authentication_manager/binary_heap.rs:30

↓ 6 callersMethodcmp

(&self, other: &Self)

src/problem_2251_number_of_flowers_in_full_bloom/sweep_line.rs:27

↓ 6 callersMethodcmp

(&self, other: &Self)

src/problem_1801_number_of_orders_in_the_backlog/binary_heap.rs:29

↓ 6 callersFunctionmake_list

(values: I)

src/test_utilities.rs:234

↓ 6 callersMethodmiddle

(&self)

src/problem_0850_rectangle_area_ii/sweep_line_with_segment_tree.rs:65

↓ 6 callersMethodremove

(&mut self, key: i32)

src/problem_0706_design_hashmap/store_by_buckets.rs:64

↓ 6 callersMethodrotate_left

( length: NonZeroUsize, k: usize, container: &mut C, mut get_mut: impl FnMut(&

src/problem_1914_cyclically_rotating_a_grid/iterative.rs:18

↓ 6 callersFunctionrun_command

(command: &mut Command)

xtask/src/utilities.rs:34

↓ 5 callersMethodcount

(&self)

src/problem_2276_count_integers_in_intervals/btree_map.rs:59

↓ 5 callersMethodcount

(&self)

src/problem_2166_design_bitset/dense_storage.rs:61

↓ 5 callersMethoderase

(&mut self, num: i32)

src/problem_1206_design_skiplist/vanilla.rs:194

↓ 5 callersMethodget

(&self, index: usize)

src/problem_1043_partition_array_for_maximum_sum/dynamic_programming.rs:27

↓ 5 callersMethodget

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

src/problem_0664_strange_printer/dynamic_programming.rs:18

↓ 5 callersMethodget

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

src/problem_1039_minimum_score_triangulation_of_polygon/dynamic_programming.rs:20

↓ 5 callersMethodhas_length_less_than_3

(&self)

src/problem_0659_split_array_into_consecutive_subsequences/two_optimized_binary_heaps.rs:51

↓ 5 callersMethodheap_sift_up

(&mut self, mut index: usize, value: Chunk)

src/problem_0855_exam_room/binary_heap.rs:68

↓ 5 callersMethodinsert

(&mut self, val: i32)

src/problem_0919_complete_binary_tree_inserter/queue.rs:45

↓ 5 callersMethodinto_left

(self)

src/problem_0938_range_sum_of_bst/recursive_2.rs:13

↓ 5 callersFunctionis_subsequence

(lhs: impl IntoIterator<Item = T>, rhs: impl IntoIterator<Item = U>)

src/test_utilities.rs:121

↓ 5 callersFunctioniter_list

(mut list: Option<Box<ListNode>>)

src/test_utilities.rs:136

↓ 5 callersMethodremove

(&mut self, key: u32)

src/problem_1001_grid_illumination/iterative.rs:23

↓ 5 callersMethodset_chunk

(&mut self, index: usize, value: Chunk)

src/problem_0855_exam_room/binary_heap.rs:62

↓ 5 callersMethodsum

(min_value: u32, max_value: u32)

src/problem_1648_sell_diminishing_valued_colored_balls/greedy_binary_heap.rs:34

↓ 4 callersMethodadd

(&mut self, key: u32)

src/problem_1001_grid_illumination/iterative.rs:12

↓ 4 callersMethodadd_element_with_attributes

( &mut self, name: &'c str, attributes: impl IntoIterator<Item = (impl AsRef<str>, imp

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

↓ 4 callersMethodaddress

(&self)

src/problem_1032_stream_of_characters/dfa.rs:15

↓ 4 callersMethodallocate

(&mut self, node: Node)

src/problem_1206_design_skiplist/vanilla_low_memory.rs:32

↓ 4 callersMethodallocate

(&mut self, node: Node)

src/problem_1206_design_skiplist/vanilla.rs:32

↓ 4 callersMethodallocate

(&mut self, node: Node)

src/problem_1206_design_skiplist/vanilla_rand.rs:32

↓ 4 callersMethodcmp

(&self, other: &Self)

src/problem_1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows/binary_heap.rs:28

↓ 4 callersMethodcmp

(&self, other: &Self)

src/problem_1320_minimum_distance_to_type_a_word_using_two_fingers/dijkstras_algorithm.rs:30

↓ 4 callersMethodcmp

(&self, other: &Self)

src/problem_1606_find_servers_that_handled_most_number_of_requests/binary_heap.rs:28

↓ 4 callersMethodcontains

(buckets: &[usize], value: u32)

src/problem_3217_delete_nodes_from_linked_list_present_in_array/bit_flags.rs:23

↓ 4 callersMethodempty

(&self)

src/problem_0225_implement_stack_using_queues/slow_pop.rs:41

↓ 4 callersFunctionencode_name

(name: &str)

src/problem_2353_design_a_food_rating_system/binary_heap.rs:8

↓ 4 callersMethodend

(&self)

src/problem_0850_rectangle_area_ii/sweep_line_with_segment_tree.rs:51

↓ 4 callersMethodfields

(&self)

src/problem_0488_zuma_game/bfs.rs:55

↓ 4 callersMethodget_mut

(&mut self, c: u8)

src/problem_3306_count_of_substrings_containing_every_vowel_and_k_consonants_ii/sliding_window.rs:15

↓ 4 callersFunctionget_stat

(stats: &[(u32, u64, u16)], index: u16)

src/problem_2353_design_a_food_rating_system/binary_heap.rs:38

↓ 4 callersMethodget_sum

(&self, row: usize, column: usize)

src/problem_0304_range_sum_query_2d_immutable/cumulative_sum.rs:29

↓ 4 callersMethodheap_sift_down

(&mut self, mut index: usize, value: Chunk)

src/problem_0855_exam_room/binary_heap.rs:88

↓ 4 callersMethodis_empty

(&self)

src/problem_0641_design_circular_deque/start_and_length.rs:94

↓ 4 callersMethodis_empty

(&self)

src/problem_0641_design_circular_deque/head_and_tail.rs:91

↓ 4 callersMethodis_left_child

(&self)

src/problem_0699_falling_squares/segment_tree.rs:28

↓ 4 callersMethodis_power_of_two

(n: i32)

src/problem_0231_power_of_two/division.rs:6

↓ 4 callersFunctionprint_command_line

(command: &Command)

xtask/src/utilities.rs:14

↓ 4 callersMethodpush_by_key

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

src/problem_1172_dinner_plate_stacks/heap.rs:36

↓ 4 callersMethodquery

(&self, key: u32)

src/problem_1001_grid_illumination/iterative.rs:33

↓ 4 callersMethodremove

(&mut self, num: u32)

src/problem_1825_finding_mk_average/btree_map.rs:29

← previous next →101–200 of 10,327, ranked by callers