Functions — github.com/EFanZh/LeetCode

CodeHub MCPcopy Create free account

hub / github.com/EFanZh/LeetCode / functions

Functions10,327 in github.com/EFanZh/LeetCode

⨍ Functions 10,327◇ Types & classes 5,558

↓ 1 callersMethodempty

src/problem_0232_implement_queue_using_stacks/double_ended_stack.rs:40

↓ 1 callersMethodempty_hamster

src/problem_2086_minimum_number_of_food_buckets_to_feed_the_hamsters/state_machine_2.rs:41

↓ 1 callersMethodencode

(&mut self, long_url: String)

src/problem_0535_encode_and_decode_tinyurl/hash_maps.rs:38

↓ 1 callersMethodeq

(&self, other: &Self)

src/problem_2386_find_the_k_sum_of_an_array/binary_heap.rs:14

↓ 1 callersMethodeq

(&self, other: &Self)

src/problem_2931_maximum_spending_after_buying_items/greedy_binary_heap.rs:15

↓ 1 callersMethodeq

(&self, other: &Self)

src/problem_0023_merge_k_sorted_lists/heap.rs:13

↓ 1 callersMethodeq

(&self, other: &Self)

src/problem_1631_path_with_minimum_effort/dijkstra.rs:14

↓ 1 callersMethodeq

(&self, other: &Self)

src/problem_0488_zuma_game/bfs.rs:142

↓ 1 callersMethodequals_to_slice

(&self, slice: &[Vec<T>])

src/test_utilities.rs:26

↓ 1 callersMethodf

(&self, x: i32, y: i32)

src/problem_1237_find_positive_integer_solution_for_a_given_equation/mod.rs:6

↓ 1 callersMethodfindRightInterval

c++/include/leet-code/problem-0436-find-right-interval/sort-and-scan.h:16

↓ 1 callersFunctionfind_cmake

xtask/src/tools/windows.rs:21

↓ 1 callersFunctionfind_ninja

xtask/src/tools/windows.rs:36

↓ 1 callersFunctionfind_rust_sysroot

xtask/src/tools/mod.rs:29

↓ 1 callersFunctionfind_rust_version_meta

xtask/src/tools/mod.rs:13

↓ 1 callersMethodfix

(&mut self, idx: i32)

src/problem_2166_design_bitset/dense_storage.rs:18

↓ 1 callersFunctionfix_svg_size

(svg: &str, zoom: u32)

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

↓ 1 callersMethodflip

src/problem_2166_design_bitset/dense_storage.rs:30

↓ 1 callersMethodfollow

(&mut self, follower_id: i32, followee_id: i32)

src/problem_0355_design_twitter/binary_heap.rs:72

↓ 1 callersMethodfree

(&mut self, handle: usize)

src/problem_0460_lfu_cache/map_to_nested_linked_lists.rs:92

↓ 1 callersMethodfree

(&mut self, mut value: Vec<usize>)

src/problem_1044_longest_duplicate_substring/binary_search_and_rolling_hash.rs:25

↓ 1 callersMethodgenerate

(&mut self, token_id: String, current_time: i32)

src/problem_1797_design_authentication_manager/binary_heap.rs:50

↓ 1 callersFunctiongenerate_report

(repository: &Path, target: &Path)

tools/progress-tracker/src/main.rs:26

↓ 1 callersMethodget

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

src/problem_0546_remove_boxes/memoized_dynamic_programming.rs:22

↓ 1 callersMethodget

(&mut self, key: i32)

src/problem_0146_lru_cache/map_to_doubly_linked_list_3.rs:49

↓ 1 callersFunctionget_all_problems

tools/progress-tracker/src/main.rs:16

↓ 1 callersMethodget_combination

(&self, n: usize, k: usize)

src/problem_1569_number_of_ways_to_reorder_array_to_get_same_bst/recursive.rs:14

↓ 1 callersFunctionget_hits

(tree: &Tree, hits_cache: &mut HashMap<String, bool>)

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

↓ 1 callersMethodget_odd

(&mut self, value: u32)

src/problem_1387_sort_integers_by_the_power_value/quick_select_and_memoized_dynamic_programming.rs:11

↓ 1 callersFunctionget_progress

(hits: usize, total: usize)

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

↓ 1 callersMethodget_value

(&self, index: u8)

src/problem_0770_basic_calculator_iv/recursive.rs:29

↓ 1 callersFunctionguess

src/problem_0374_guess_number_higher_or_lower/mod.rs:28

↓ 1 callersMethodhand_length

src/problem_0488_zuma_game/bfs.rs:51

↓ 1 callersMethodhas_common_bit

(&self, other: &Self)

src/problem_1733_minimum_number_of_people_to_teach/bit_set.rs:24

↓ 1 callersMethodhas_next

src/problem_0341_flatten_nested_list_iterator/stack.rs:47

↓ 1 callersMethodhas_right

src/problem_1537_get_the_maximum_score/tail_recursive.rs:46

↓ 1 callersMethodhash

(&self, state: &mut H)

src/problem_0652_find_duplicate_subtrees/cached_hash_values.rs:27

↓ 1 callersFunctionheap_sift_up

( 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:88

↓ 1 callersFunctionheap_update

(heap: &mut [u16], stats: &mut [(u32, u64, u16)], stat_index: u16, rating: u32)

src/problem_2353_design_a_food_rating_system/binary_heap.rs:132

↓ 1 callersMethodhelper

(&self, prefix: &str, suffix: &str)

src/problem_0745_prefix_and_suffix_search/two_tries.rs:48

↓ 1 callersMethodhelper

(&self, prefix: &str, suffix: &str)

src/problem_0745_prefix_and_suffix_search/trie_with_enumerated_suffixes.rs:58

↓ 1 callersMethodinc

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

src/problem_3365_rearrange_k_substrings_to_form_target_string/hybrid_map.rs:16

↓ 1 callersMethodinc

(&mut self, key: String)

src/problem_0432_all_oone_data_structure/doubly_linked_list.rs:64

↓ 1 callersMethodincrement

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

src/problem_1381_design_a_stack_with_increment_operation/lazy.rs:38

↓ 1 callersFunctioninternal_guess

src/problem_0374_guess_number_higher_or_lower/mod.rs:16

↓ 1 callersMethodintersection

(nums: Vec<Vec<i32>>)

src/problem_2248_intersection_of_multiple_arrays/iterative.rs:6

↓ 1 callersMethodintersection

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

src/problem_0349_intersection_of_two_arrays/two_sets.rs:8

↓ 1 callersMethodisBadVersion

(&self, version: i32)

src/problem_0278_first_bad_version/binary_search.rs:37

↓ 1 callersMethodis_complete

src/problem_3306_count_of_substrings_containing_every_vowel_and_k_consonants_ii/sliding_window.rs:26

↓ 1 callersMethodis_complete

src/problem_3305_count_of_substrings_containing_every_vowel_and_k_consonants_i/sliding_window.rs:26

↓ 1 callersMethodis_empty

src/problem_0691_stickers_to_spell_word/memoized_dynamic_programming.rs:23

↓ 1 callersMethodis_full

src/problem_0622_design_circular_queue/start_and_length.rs:71

↓ 1 callersMethodis_full

src/problem_0622_design_circular_queue/head_and_tail.rs:65

↓ 1 callersFunctioniter_tree_in_order

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

src/test_utilities.rs:166

↓ 1 callersFunctioniter_tree_post_order

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

src/test_utilities.rs:186

↓ 1 callersFunctioniter_tree_pre_order

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

src/test_utilities.rs:146

↓ 1 callersMethodkSmallestPairs

c++/include/leet-code/problem-0373-find-k-pairs-with-smallest-sums/bfs.h:19

↓ 1 callersMethodkthSmallest

c++/include/leet-code/problem-0378-kth-smallest-element-in-a-sorted-matrix/bfs-2.h:20

↓ 1 callersMethodleave

(&mut self, p: i32)

src/problem_0855_exam_room/binary_heap.rs:196

↓ 1 callersMethodleft

src/problem_0699_falling_squares/segment_tree.rs:16

↓ 1 callersMethodlexicalOrder

c++/include/leet-code/problem-0386-lexicographical-numbers/iterative-dfs.h:14

↓ 1 callersFunctionlist_to_vector

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

↓ 1 callersFunctionmake_list

c++/tests/leet-code/test-utilities.h:14

↓ 1 callersFunctionmake_problem_hits_cache

(problems: &Problems)

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

↓ 1 callersFunctionmake_solution_map

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

↓ 1 callersMethodmaxNumber

c++/include/leet-code/problem-0321-create-maximum-number/greedy.h:75

↓ 1 callersMethodmul_vec

(self, rhs: Vec6<WrappingNum>)

src/problem_0552_student_attendance_record_ii/matrix_multiplication.rs:85

↓ 1 callersMethodmult_all

(&mut self, m: i32)

src/problem_1622_fancy_sequence/lazy.rs:53

↓ 1 callersMethodnext

src/problem_0341_flatten_nested_list_iterator/stack_2.rs:39

↓ 1 callersMethodnexts

src/problem_0488_zuma_game/bfs.rs:61

↓ 1 callersMethodopen_1

src/problem_0986_interval_list_intersections/iterative.rs:15

↓ 1 callersMethodopen_2

src/problem_0986_interval_list_intersections/iterative.rs:19

↓ 1 callersMethodparse

src/problem_2245_maximum_trailing_zeros_in_a_cornered_path/prefix_sums.rs:6

↓ 1 callersMethodpartial_cmp

(&self, other: &Self)

src/problem_1488_avoid_flood_in_the_city/binary_heap.rs:30

↓ 1 callersMethodpartial_cmp

(&self, other: &Self)

src/problem_1514_path_with_maximum_probability/dijkstra.rs:22

↓ 1 callersMethodpartial_cmp

(&self, other: &Self)

src/problem_0882_reachable_nodes_in_subdivided_graph/dijkstra.rs:22

↓ 1 callersMethodpop

src/problem_0232_implement_queue_using_stacks/double_ended_stack.rs:24

↓ 1 callersMethodpost_tweet

(&mut self, user_id: i32, tweet_id: i32)

src/problem_0355_design_twitter/binary_heap.rs:25

↓ 1 callersMethodpush_middle

(&mut self, val: i32)

src/problem_1670_design_front_middle_back_queue/two_deques.rs:26

↓ 1 callersMethodput

(&mut self, key: i32, value: i32)

src/problem_0460_lfu_cache/map_to_nested_linked_lists.rs:258

↓ 1 callersMethodput

(&mut self, key: i32, value: i32)

src/problem_0706_design_hashmap/store_by_buckets.rs:20

↓ 1 callersMethodput

(&mut self, key: i32, value: i32)

src/problem_0146_lru_cache/map_to_doubly_linked_list.rs:64

↓ 1 callersMethodquery

(&mut self, start: usize, end: usize)

src/problem_0699_falling_squares/segment_tree.rs:98

↓ 1 callersMethodreconstructQueue

c++/include/leet-code/problem-0406-queue-reconstruction-by-height/insertion.h:16

↓ 1 callersMethodrecord_tweet

(&mut self, tweet_name: String, time: i32)

src/problem_1348_tweet_counts_per_frequency/iterative.rs:15

↓ 1 callersMethodremove

(&mut self, value: &Q)

src/problem_0030_substring_with_concatenation_of_all_words/sliding_window_sets.rs:31

↓ 1 callersMethodremove

(&mut self, value: &Q)

src/problem_0030_substring_with_concatenation_of_all_words/interleaving_sliding_window_sets.rs:31

↓ 1 callersMethodremove

(counts: &mut HashMap<i32, u32>, key: i32)

src/problem_0954_array_of_doubled_pairs/iterative.rs:41

↓ 1 callersMethodremove

(&mut self, key: i32)

src/problem_0705_design_hashset/store_by_buckets.rs:53

↓ 1 callersMethodremoveKdigits

c++/include/leet-code/problem-0402-remove-k-digits/greedy.h:15

↓ 1 callersMethodremove_block

(&mut self, block_index: usize)

src/problem_0460_lfu_cache/map_to_nested_linked_lists.rs:141

↓ 1 callersMethodremove_range

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

src/problem_0715_range_module/btree_map.rs:63

↓ 1 callersMethodrenew

(&mut self, token_id: String, current_time: i32)

src/problem_1797_design_authentication_manager/binary_heap.rs:70

↓ 1 callersMethodrent

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

src/problem_1912_design_movie_rental_system/btree_set.rs:56

↓ 1 callersMethodretain_free

tools/progress-tracker/src/problems.rs:37

↓ 1 callersMethodreverse

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

src/problem_2074_reverse_nodes_in_even_length_groups/iterative.rs:10

↓ 1 callersMethodreverse

src/problem_2443_sum_of_number_and_its_reverse/brute_force.rs:6

↓ 1 callersMethodreverse_bits

src/problem_0190_reverse_bits/cheating.rs:6

↓ 1 callersMethodright

src/problem_0699_falling_squares/segment_tree.rs:20

↓ 1 callersMethodrun

xtask/src/coverage/mod.rs:231

← previous next →401–500 of 10,327, ranked by callers