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

↓ 2 callersMethodis_full

(&self)

src/problem_0641_design_circular_deque/start_and_length.rs:98

↓ 2 callersMethodis_full

(&self)

src/problem_0641_design_circular_deque/head_and_tail.rs:95

↓ 2 callersFunctionlist_tree_levels_with_next_right_pointers

c++/tests/leet-code/test-utilities.cpp:20

↓ 2 callersMethodlock

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

src/problem_1993_operations_on_tree/iterative.rs:71

↓ 2 callersMethodmul_mat

(self, rhs: Self)

src/problem_0552_student_attendance_record_ii/matrix_multiplication.rs:79

↓ 2 callersMethodparse

(iter: &mut Bytes)

src/problem_1096_brace_expansion_ii/parse_and_expand.rs:13

↓ 2 callersMethodpartial_cmp

(&self, other: &Self)

src/problem_1631_path_with_minimum_effort/dijkstra.rs:22

↓ 2 callersMethodpartial_sift_up_by_key

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

src/problem_1172_dinner_plate_stacks/heap.rs:13

↓ 2 callersMethodpop_at

(&mut self, index: usize)

src/problem_1172_dinner_plate_stacks/heap.rs:160

↓ 2 callersMethodrandom_bool

(&mut self)

src/problem_1206_design_skiplist/vanilla_low_memory.rs:72

↓ 2 callersMethodrandom_bool

(&mut self)

src/problem_1206_design_skiplist/vanilla.rs:72

↓ 2 callersMethodrandom_bool

(&mut self)

src/problem_1206_design_skiplist/vanilla_rand.rs:73

↓ 2 callersMethodreverse

(mut n: u64)

src/problem_0479_largest_palindrome_product/iterative.rs:6

↓ 2 callersFunctionrun_command_and_stream_output

(command: &mut Command, callback: impl FnOnce(&mut dyn Read) -> R)

xtask/src/utilities.rs:52

↓ 2 callersFunctionrun_coverage_tests

(test_executable: &Path, llvm_profdata: &Path, output: &Path)

xtask/src/coverage/mod.rs:69

↓ 2 callersMethodsearch_helper

(&self, value: i32)

src/problem_1206_design_skiplist/vanilla_low_memory.rs:94

↓ 2 callersMethodsearch_helper

(&self, value: i32)

src/problem_1206_design_skiplist/vanilla.rs:94

↓ 2 callersMethodsearch_helper

(&self, value: i32)

src/problem_1206_design_skiplist/vanilla_rand.rs:93

↓ 2 callersMethodseed

(&mut self, value: &impl Hash)

src/problem_1206_design_skiplist/vanilla_low_memory.rs:68

↓ 2 callersMethodseed

(&mut self, value: &impl Hash)

src/problem_1206_design_skiplist/vanilla.rs:68

↓ 2 callersMethodset

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

src/problem_1039_minimum_score_triangulation_of_polygon/dynamic_programming.rs:24

↓ 2 callersMethodslide

(&mut self, arr: &[i32], target: u32, num: u32)

src/problem_1477_find_two_non_overlapping_sub_arrays_each_with_target_sum/sliding_window.rs:15

↓ 2 callersMethodstart

(&mut self)

src/problem_2086_minimum_number_of_food_buckets_to_feed_the_hamsters/state_machine_2.rs:14

↓ 2 callersMethodtop

(&self)

src/problem_0155_min_stack/one_stack.rs:22

↓ 2 callersMethodupdate

(&mut self, rows: u16, columns: u16, steps: u16, node: (u16, u16))

src/problem_2258_escape_the_spreading_fire/bfs.rs:15

↓ 2 callersMethodupdate_score

(&mut self, score: u64)

src/problem_2049_count_nodes_with_the_highest_score/recursive.rs:14

↓ 2 callersFunctionwrite_difficulty

(writer: &mut ElementWriter<W>, level: u8)

tools/progress-tracker/src/report.rs:51

↓ 2 callersFunctionwrite_problem_link

(writer: &mut ElementWriter<W>, problem: &Problem)

tools/progress-tracker/src/report.rs:32

↓ 2 callersMethodwrite_right

(&mut self, mut value: (u32, u32, u32))

src/problem_1649_create_sorted_array_through_instructions/merge_sort.rs:42

↓ 2 callersMethodwrite_u64

(value: u64, mut target: String)

src/problem_0483_smallest_good_base/iterative.rs:6

↓ 1 callersMethodadd

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

src/problem_1865_finding_pairs_with_a_certain_sum/hash_map.rs:34

↓ 1 callersMethodadd

(&mut self, point: Vec<i32>)

src/problem_2013_detect_squares/hash_map.rs:15

↓ 1 callersMethodadd

(&mut self, number: i32)

src/problem_2671_frequency_tracker/hash_map.rs:22

↓ 1 callersMethodadd

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

src/problem_2276_count_integers_in_intervals/btree_map.rs:20

↓ 1 callersMethodadd

(&mut self, num: i32)

src/problem_1352_product_of_the_last_k_numbers/cumulative_product.rs:15

↓ 1 callersMethodadd

(&mut self, name: String, score: i32)

src/problem_2102_sequentially_ordinal_rank_tracker/binary_heap.rs:20

↓ 1 callersMethodadd

(&mut self, num: i32)

src/problem_1206_design_skiplist/vanilla.rs:128

↓ 1 callersMethodadd

(&mut self, key: i32)

src/problem_0705_design_hashset/store_by_buckets.rs:20

↓ 1 callersMethodadd_all

(&mut self, inc: i32)

src/problem_1622_fancy_sequence/lazy.rs:43

↓ 1 callersMethodadd_at_index

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

src/problem_0707_design_linked_list/doubly_linked_list.rs:109

↓ 1 callersMethodadd_back

(&mut self, num: i32)

src/problem_2336_smallest_number_in_infinite_set/binary_heap.rs:37

↓ 1 callersMethodadd_element

(&mut self, num: i32)

src/problem_1825_finding_mk_average/btree_map.rs:115

↓ 1 callersMethodadd_num

(&mut self, val: i32)

src/problem_0352_data_stream_as_disjoint_intervals/union_find.rs:32

↓ 1 callersMethodadd_num

(&mut self, num: i32)

src/problem_0295_find_median_from_data_stream/two_heaps.rs:20

↓ 1 callersMethodadd_path_to_result

(&mut self)

src/problem_1948_delete_duplicate_folders_in_system/interning.rs:40

↓ 1 callersMethodadd_range

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

src/problem_0715_range_module/btree_map.rs:18

↓ 1 callersMethodadd_raw

(&mut self, content: &str)

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

↓ 1 callersMethodadd_word

(&mut self, word: String)

src/problem_0211_design_add_and_search_words_data_structure/trie.rs:14

↓ 1 callersMethodadvance

(&mut self, current_time: u32)

src/problem_1797_design_authentication_manager/binary_heap.rs:87

↓ 1 callersMethodallocate

(&mut self)

src/problem_0749_contain_virus/bfs_2.rs:23

↓ 1 callersMethodallocate

(&mut self)

src/problem_0749_contain_virus/bfs_3.rs:23

↓ 1 callersMethodallocate

(&mut self)

src/problem_0749_contain_virus/bfs.rs:23

↓ 1 callersMethodand_a

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:44

↓ 1 callersMethodand_a_m

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:61

↓ 1 callersMethodand_a_m_p

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:77

↓ 1 callersMethodand_a_p

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:96

↓ 1 callersMethodand_a_p_o

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:112

↓ 1 callersMethodand_a_p_o_s

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:128

↓ 1 callersMethodand_f

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:147

↓ 1 callersMethodand_f_r

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:163

↓ 1 callersMethodand_f_r_a

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:179

↓ 1 callersMethodand_f_r_a_s

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:195

↓ 1 callersMethodand_f_r_a_s_l

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:211

↓ 1 callersMethodand_g

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:230

↓ 1 callersMethodand_g_t

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:246

↓ 1 callersMethodand_l

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:265

↓ 1 callersMethodand_l_t

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:281

↓ 1 callersMethodand_q

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:300

↓ 1 callersMethodand_q_u

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:316

↓ 1 callersMethodand_q_u_o

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:332

↓ 1 callersMethodand_q_u_o_t

(&mut self)

src/problem_1410_html_entity_parser/state_machine_2.rs:348

↓ 1 callersMethodappend

(&mut self, val: i32)

src/problem_1622_fancy_sequence/lazy.rs:29

↓ 1 callersMethodbirth

(&mut self, parent_name: String, child_name: String)

src/problem_1600_throne_inheritance/dfs.rs:32

↓ 1 callersMethodbits

(&self, mut f: impl FnMut(u32))

src/problem_1733_minimum_number_of_people_to_teach/bit_set.rs:28

↓ 1 callersMethodbuffer_mut

(&mut self)

src/problem_0854_k_similar_strings/bfs.rs:30

↓ 1 callersMethodbuild_dict

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

src/problem_0676_implement_magic_dictionary/trie.rs:54

↓ 1 callersMethodchange

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

src/problem_2349_design_a_number_container_system/hash_map_and_btree_set.rs:19

↓ 1 callersMethodchange_rating

(&mut self, food: String, new_rating: i32)

src/problem_2353_design_a_food_rating_system/binary_heap.rs:205

↓ 1 callersMethodcheck

(&mut self, s: &[u8], length: usize, i: usize, hash: u64)

src/problem_1044_longest_duplicate_substring/binary_search_and_rolling_hash.rs:38

↓ 1 callersFunctioncheck_balance

(node: Option<&RefCell<TreeNode>>)

src/problem_1382_balance_a_binary_search_tree/mod.rs:19

↓ 1 callersMethodcheck_in

(&mut self, id: i32, station_name: String, t: i32)

src/problem_1396_design_underground_system/standard.rs:33

↓ 1 callersMethodcheck_out

(&mut self, id: i32, station_name: String, t: i32)

src/problem_1396_design_underground_system/standard.rs:40

↓ 1 callersMethodclear

(&mut self)

src/problem_0030_substring_with_concatenation_of_all_words/interleaving_sliding_window_sets.rs:44

↓ 1 callersMethodclose

(self)

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

↓ 1 callersFunctionclosure_type_deduction_helper

(f: T)

xtask/src/coverage/mod.rs:223

↓ 1 callersMethodcmp

(&self, other: &Self)

src/problem_0743_network_delay_time/dijkstra.rs:28

↓ 1 callersMethoddeath

(&mut self, name: String)

src/problem_1600_throne_inheritance/dfs.rs:48

↓ 1 callersMethoddec

(&mut self, value: &'a [u8])

src/problem_3365_rearrange_k_substrings_to_form_target_string/hybrid_map.rs:20

↓ 1 callersMethoddec

(&mut self, key: String)

src/problem_0432_all_oone_data_structure/doubly_linked_list.rs:141

↓ 1 callersFunctiondecode_name

(mut name: u64, buffer: String)

src/problem_2353_design_a_food_rating_system/binary_heap.rs:20

↓ 1 callersMethoddeleteNode

c++/include/leet-code/problem-0237-delete-node-in-a-linked-list/modify-this.h:13

↓ 1 callersMethoddelete_at_index

(&mut self, index: i32)

src/problem_0707_design_linked_list/doubly_linked_list.rs:131

↓ 1 callersMethoddelete_one

(&mut self, number: i32)

src/problem_2671_frequency_tracker/hash_map.rs:43

↓ 1 callersMethoddeposit

(&mut self, banknotes_count: Vec<i32>)

src/problem_2241_design_an_atm_machine/greedy_2.rs:13

↓ 1 callersMethoddepth

(&self)

src/problem_0699_falling_squares/segment_tree.rs:32

↓ 1 callersMethoddeserialize

(&self, data: String)

src/problem_0297_serialize_and_deserialize_binary_tree/preorder_traversal.rs:51

↓ 1 callersMethoddeserialize

(&self, data: String)

src/problem_0449_serialize_and_deserialize_bst/preorder_traversal.rs:57

↓ 1 callersFunctiondraw

(repository: &Repository, problems: &Problems, output: &Path)

tools/progress-tracker/src/progress_chart.rs:136

↓ 1 callersFunctiondraw_chart

(data: &[(DateTime<Utc>, usize)], total: usize, output: &Path)

tools/progress-tracker/src/progress_chart.rs:69

↓ 1 callersMethoddrop

(&mut self, shop: i32, movie: i32)

src/problem_1912_design_movie_rental_system/btree_set.rs:65

← previous next →301–400 of 10,327, ranked by callers