MCPcopy Create free account

hub / github.com/EFanZh/LeetCode / functions

Functions10,327 in github.com/EFanZh/LeetCode

↓ 4 callersMethodremove
(&mut self, value: u32)
src/problem_2461_maximum_sum_of_distinct_subarrays_with_length_k/sliding_window.rs:25
↓ 4 callersMethodreverse
(mut value: u64)
src/problem_0906_super_palindromes/brute_force.rs:40
↓ 3 callersMethodappend_to_block
(&mut self, node_index: usize, block_index: usize)
src/problem_0460_lfu_cache/map_to_nested_linked_lists.rs:161
↓ 3 callersMethodbuffer
(&self)
src/problem_0854_k_similar_strings/bfs.rs:26
↓ 3 callersFunctioncheck_regex
(re: &str, text: &str)
tools/check-cpp-code-format/src/main.rs:34
↓ 3 callersMethodcmp
(&self, other: &Self)
src/problem_1976_number_of_ways_to_arrive_at_destination/dijkstra_2.rs:30
↓ 3 callersMethodcmp
(&self, other: &Self)
src/problem_0787_cheapest_flights_within_k_stops/dijkstra.rs:30
↓ 3 callersMethodcmp
(&self, other: &Self)
src/problem_1508_range_sum_of_sorted_subarray_sums/binary_heap.rs:29
↓ 3 callersMethodcmp
(&self, other: &Self)
src/problem_1584_min_cost_to_connect_all_points/greedy_kruskal.rs:29
↓ 3 callersMethodcmp
(&self, other: &Self)
src/problem_1710_maximum_units_on_a_truck/greedy_binary_heap.rs:28
↓ 3 callersMethodfind_root
(&mut self, x: u32)
src/problem_0803_bricks_falling_when_hit/reverse_time_and_union_find.rs:31
↓ 3 callersMethodfree_node
(&mut self, handle: usize)
src/problem_0432_all_oone_data_structure/doubly_linked_list.rs:59
↓ 3 callersMethodget
(&self, word: &[u8])
src/problem_0676_implement_magic_dictionary/trie_2.rs:22
↓ 3 callersMethodget
(&self, word: &[u8])
src/problem_0676_implement_magic_dictionary/trie_3.rs:22
↓ 3 callersMethodget_node
(&self, index: i32)
src/problem_0707_design_linked_list/doubly_linked_list.rs:36
↓ 3 callersMethodguess
(&self, word: String)
src/problem_0843_guess_the_word/mod.rs:22
↓ 3 callersFunctionhash_key
(key: i32)
src/problem_0706_design_hashmap/store_by_buckets.rs:8
↓ 3 callersFunctionhash_key
(key: i32)
src/problem_0705_design_hashset/store_by_buckets.rs:8
↓ 3 callersFunctionheap_build
(heap: &mut Box<[u16]>, stats: &mut [(u32, u64, u16)])
src/problem_2353_design_a_food_rating_system/binary_heap.rs:120
↓ 3 callersMethodinsert
(&mut self, id_key: i32, value: String)
src/problem_1656_design_an_ordered_stream/vec_deque.rs:19
↓ 3 callersMethodis_empty
(&self)
src/problem_0622_design_circular_queue/start_and_length.rs:67
↓ 3 callersMethodis_empty
(&self)
src/problem_0622_design_circular_queue/head_and_tail.rs:61
↓ 3 callersMethodlength
(&self)
src/problem_1095_find_in_mountain_array/mod.rs:19
↓ 3 callersMethodmake_iter
(&self, slice: &'a mut [i32])
src/problem_0542_01_matrix/dynamic_programming.rs:18
↓ 3 callersMethodnow
(&mut self)
src/problem_1568_minimum_number_of_days_to_disconnect_island/articulation_point.rs:8
↓ 3 callersMethodpush_front
(&mut self, val: i32)
src/problem_1670_design_front_middle_back_queue/two_deques.rs:18
↓ 3 callersMethodreplace_first
(&mut self, num: u32)
src/problem_1825_finding_mk_average/btree_map.rs:40
↓ 3 callersMethodreplace_last
(&mut self, num: u32)
src/problem_1825_finding_mk_average/btree_map.rs:55
↓ 3 callersMethodreverse
(mut value: u64)
src/problem_0564_find_the_closest_palindrome/brute_force.rs:8
↓ 3 callersMethodshift_start
(&mut self, boxes: &[(u32, u32)])
src/problem_1687_delivering_boxes_from_storage_to_ports/dynamic_programming_and_sliding_window.rs:12
↓ 3 callersMethodsum
(self)
src/problem_0552_student_attendance_record_ii/matrix_multiplication.rs:52
↓ 3 callersFunctiontrim_leading_zeros
(values: &[i32])
src/problem_0927_three_equal_parts/mod.rs:11
↓ 3 callersMethodwrite
(&mut self, value: (u32, u32, u32))
src/problem_1649_create_sorted_array_through_instructions/merge_sort.rs:24
↓ 3 callersFunctionwrite_hyper_link
(writer: &mut ElementWriter<W>, href: &str, text: &str)
tools/progress-tracker/src/report.rs:28
↓ 2 callersMethodadd
(&mut self, value: u32)
src/problem_2461_maximum_sum_of_distinct_subarrays_with_length_k/sliding_window.rs:14
↓ 2 callersMethodadd_at_head
(&mut self, val: i32)
src/problem_0707_design_linked_list/doubly_linked_list.rs:75
↓ 2 callersMethodadd_at_tail
(&mut self, val: i32)
src/problem_0707_design_linked_list/doubly_linked_list.rs:92
↓ 2 callersFunctionadd_cmake_variable
(command: &mut Command, variable: &str, value: &OsStr)
xtask/src/coverage/mod.rs:83
↓ 2 callersMethodadd_empty
(&mut self, val: i32)
src/problem_0707_design_linked_list/doubly_linked_list.rs:64
↓ 2 callersMethodadd_empty_element_with_attributes
( &mut self, name: &str, attributes: impl IntoIterator<Item = (impl AsRef<str>, impl A
tools/progress-tracker/src/html.rs:76
↓ 2 callersMethodadvance
(&mut self, current_time: u32)
src/problem_1797_design_authentication_manager/binary_heap_2.rs:69
↓ 2 callersMethodallocate
(&mut self, arrival: u32)
src/problem_1942_the_number_of_the_smallest_unoccupied_chair/binary_heap.rs:41
↓ 2 callersMethodallocate
(&mut self, item: usize)
src/problem_1044_longest_duplicate_substring/binary_search_and_rolling_hash.rs:14
↓ 2 callersMethodas_usize
(self)
tools/progress-tracker/src/solutions.rs:16
↓ 2 callersMethodboard_length
(&self)
src/problem_0488_zuma_game/bfs.rs:47
↓ 2 callersMethodboth_unknown
(&mut self)
src/problem_1537_get_the_maximum_score/tail_recursive.rs:22
↓ 2 callersMethodbucket_index
(&self, key: i32)
src/problem_0706_design_hashmap/store_by_buckets.rs:49
↓ 2 callersMethodbucket_index
(&self, key: i32)
src/problem_0705_design_hashset/store_by_buckets.rs:47
↓ 2 callersMethodbuffer_index
(&self, index: usize)
src/problem_0622_design_circular_queue/start_and_length.rs:18
↓ 2 callersMethodbuffer_index
(&self, index: usize)
src/problem_0641_design_circular_deque/start_and_length.rs:18
↓ 2 callersMethodchildren_and_amount
(&self, node: u32, parent: u32)
src/problem_2467_most_profitable_path_in_a_tree/recursive.rs:14
↓ 2 callersMethodcmp
(&self, other: &Self)
src/problem_1928_minimum_cost_to_reach_destination_in_time/dijkstra.rs:29
↓ 2 callersMethodcmp
(&self, other: &Self)
src/problem_1705_maximum_number_of_eaten_apples/greedy_binary_heap.rs:29
↓ 2 callersMethodcmp
(&self, other: &Self)
src/problem_1942_the_number_of_the_smallest_unoccupied_chair/binary_heap.rs:29
↓ 2 callersMethodcmp
(&self, other: &Self)
src/problem_2034_stock_price_fluctuation/binary_heap_and_hash_map.rs:35
↓ 2 callersMethodcmp
(&self, other: &Self)
src/problem_1648_sell_diminishing_valued_colored_balls/greedy_binary_heap.rs:28
↓ 2 callersMethodcmp
(&self, other: &Self)
src/problem_2931_maximum_spending_after_buying_items/greedy_binary_heap.rs:29
↓ 2 callersMethodcmp
(&self, other: &Self)
src/problem_2931_maximum_spending_after_buying_items/greedy_binary_heap_2.rs:28
↓ 2 callersMethodcmp
(&self, other: &Self)
src/problem_1792_maximum_average_pass_ratio/greedy_binary_heap.rs:28
↓ 2 callersMethodcmp
(&self, other: &Self)
src/problem_2208_minimum_operations_to_halve_array_sum/greedy_binary_heap.rs:25
↓ 2 callersMethodcmp
(&self, other: &Self)
src/problem_1851_minimum_interval_to_include_each_query/binary_heap_and_binary_search.rs:28
↓ 2 callersMethodcmp
(&self, other: &Self)
src/problem_2203_minimum_weighted_subgraph_with_the_required_paths/dijkstra.rs:29
↓ 2 callersMethodcmp
(&self, other: &Self)
src/problem_1786_number_of_restricted_paths_from_first_to_last_node/dijkstra.rs:28
↓ 2 callersMethodconnect
c++/include/leet-code/problem-0116-populating-next-right-pointers-in-each-node/recursive.h:29
↓ 2 callersMethoddot
(self, rhs: Self)
src/problem_0552_student_attendance_record_ii/matrix_multiplication.rs:59
↓ 2 callersMethodemit
(&mut self)
src/problem_3211_generate_binary_strings_without_adjacent_zeros/dfs.rs:12
↓ 2 callersMethodempty
(&mut self)
src/problem_2086_minimum_number_of_food_buckets_to_feed_the_hamsters/state_machine_2.rs:22
↓ 2 callersMethodenter_path
(&mut self, name: &'a Name, f: impl FnOnce(&mut Self))
src/problem_1948_delete_duplicate_folders_in_system/interning.rs:29
↓ 2 callersMethodeq
(&self, other: &Self)
src/problem_0854_k_similar_strings/bfs.rs:42
↓ 2 callersMethodextend
(&mut self, iter: I)
src/problem_0030_substring_with_concatenation_of_all_words/interleaving_sliding_window_sets.rs:60
↓ 2 callersFunctionfind_visual_studio
()
xtask/src/tools/windows.rs:6
↓ 2 callersMethodfood
(&mut self)
src/problem_2086_minimum_number_of_food_buckets_to_feed_the_hamsters/state_machine_2.rs:51
↓ 2 callersMethodfree
(&mut self, value: T)
src/problem_0749_contain_virus/bfs_2.rs:27
↓ 2 callersMethodfree
(&mut self, value: T)
src/problem_0749_contain_virus/bfs_3.rs:27
↓ 2 callersMethodfree
(&mut self, value: T)
src/problem_0749_contain_virus/bfs.rs:27
↓ 2 callersMethodfree
(&mut self, address: u32)
src/problem_1206_design_skiplist/vanilla_low_memory.rs:53
↓ 2 callersMethodfree
(&mut self, address: usize)
src/problem_1206_design_skiplist/vanilla.rs:53
↓ 2 callersMethodfree
(&mut self, address: usize)
src/problem_1206_design_skiplist/vanilla_rand.rs:53
↓ 2 callersFunctiongenerate
(problems: &[Problem], tree: &Tree, progress_chart: &str, output: &Path)
tools/progress-tracker/src/report.rs:174
↓ 2 callersMethodget_id
(&self)
tools/progress-tracker/src/problems.rs:25
↓ 2 callersMethodget_index
(&mut self, symbol: &'a str)
src/problem_0770_basic_calculator_iv/recursive.rs:16
↓ 2 callersMethodget_median
(&self)
src/problem_0480_sliding_window_median/two_sets.rs:106
↓ 2 callersMethodget_or_insert
(&'a mut self, word: &[u8])
src/problem_0676_implement_magic_dictionary/trie_2.rs:12
↓ 2 callersMethodget_or_insert
(&'a mut self, word: &[u8])
src/problem_0676_implement_magic_dictionary/trie_3.rs:12
↓ 2 callersMethodget_or_insert
(&'a mut self, word: &[u8])
src/problem_0676_implement_magic_dictionary/trie.rs:12
↓ 2 callersMethodget_root_size
(&mut self)
src/problem_0803_bricks_falling_when_hit/reverse_time_and_union_find.rs:82
↓ 2 callersMethodgo_to
(&mut self, cursor: usize)
src/problem_1472_design_browser_history/stack.rs:23
↓ 2 callersMethodhamster
(&mut self)
src/problem_2086_minimum_number_of_food_buckets_to_feed_the_hamsters/state_machine_2.rs:30
↓ 2 callersMethodhas_both
(&mut self)
src/problem_1537_get_the_maximum_score/tail_recursive.rs:55
↓ 2 callersMethodhas_left
(&mut self)
src/problem_1537_get_the_maximum_score/tail_recursive.rs:34
↓ 2 callersMethodhash
(&self, state: &mut H)
src/problem_1032_stream_of_characters/dfa.rs:38
↓ 2 callersMethodhash
(&self, state: &mut H)
src/problem_0488_zuma_game/bfs.rs:148
↓ 2 callersMethodheap_insert
(&mut self, value: Chunk)
src/problem_0855_exam_room/binary_heap.rs:149
↓ 2 callersMethodheap_remove
(&mut self, index: usize)
src/problem_0855_exam_room/binary_heap.rs:126
↓ 2 callersFunctionheap_sift_down
( heap: &mut [u16], stats: &mut [(u32, u64, u16)], stat_index: usize, rating: u32, food_na
src/problem_2353_design_a_food_rating_system/binary_heap.rs:44
↓ 2 callersMethodheap_sift_down
(&mut self, index: usize, new_expiration_time: u32)
src/problem_1797_design_authentication_manager/binary_heap_2.rs:29
↓ 2 callersMethodincrement_frequency
(&mut self, node_index: usize)
src/problem_0460_lfu_cache/map_to_nested_linked_lists.rs:174
↓ 2 callersMethodinsert
(&mut self, value: T)
src/problem_0030_substring_with_concatenation_of_all_words/sliding_window_sets.rs:22
↓ 2 callersMethodinsert
(&mut self, value: T)
src/problem_0030_substring_with_concatenation_of_all_words/interleaving_sliding_window_sets.rs:22
↓ 2 callersFunctioninvert_tree
(root: &RefCell<TreeNode>)
src/test_utilities.rs:93
← previousnext →201–300 of 10,327, ranked by callers