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 callersFunctionrun_command_and_get_output

(command: &mut Command)

xtask/src/utilities.rs:42

↓ 1 callersFunctionrun_command_and_redirect_output

(command: &mut Command, output: impl Into<Stdio>)

xtask/src/utilities.rs:66

↓ 1 callersFunctionrun_cpp_tests

(cmake_toolchain_file: Option<&Path>, llvm_version: Option<&str>, output: &Path)

xtask/src/coverage/mod.rs:94

↓ 1 callersFunctionrun_rust_tests

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

xtask/src/coverage/mod.rs:171

↓ 1 callersMethodsaturating_sub

(&self, other: &Self)

src/problem_0691_stickers_to_spell_word/memoized_dynamic_programming.rs:27

↓ 1 callersMethodsearch_helper

(&self, word: &[u8])

src/problem_0211_design_add_and_search_words_data_structure/trie.rs:24

↓ 1 callersMethodserialize

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

src/problem_0297_serialize_and_deserialize_binary_tree/preorder_traversal.rs:32

↓ 1 callersMethodserialize

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

src/problem_0449_serialize_and_deserialize_bst/preorder_traversal.rs:29

↓ 1 callersMethodset

(&mut self, index: usize)

src/problem_1615_maximal_network_rank/brute_force.rs:16

↓ 1 callersMethodset

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

src/problem_0546_remove_boxes/memoized_dynamic_programming.rs:26

↓ 1 callersMethodset

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

src/problem_0664_strange_printer/dynamic_programming.rs:26

↓ 1 callersMethodset

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

src/problem_0981_time_based_key_value_store/binary_search.rs:15

↓ 1 callersMethodsift_down

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

src/problem_1514_path_with_maximum_probability/dijkstra_2.rs:43

↓ 1 callersMethodsift_down_by_key

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

src/problem_1172_dinner_plate_stacks/heap.rs:58

↓ 1 callersMethodsift_up

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

src/problem_1514_path_with_maximum_probability/dijkstra_2.rs:22

↓ 1 callersMethodslide

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

src/problem_1425_constrained_subsequence_sum/sliding_window_maximum.rs:44

↓ 1 callersMethodslide

(&mut self, old: i32, new: i32)

src/problem_0239_sliding_window_maximum/deque_2.rs:44

↓ 1 callersMethodsort

(lhs: &mut (u16, u8), rhs: &mut (u16, u8))

src/problem_1405_longest_happy_string/greedy.rs:8

↓ 1 callersMethodstep

(&mut self, num: i32)

src/problem_2069_walking_robot_simulation_ii/modular_arithmetic.rs:23

↓ 1 callersFunctionto_all_caps_case

tools/check-cpp-code-format/src/main.rs:7

↓ 1 callersFunctionto_title_case

tools/check-cpp-code-format/src/main.rs:21

↓ 1 callersMethodtranspose

src/problem_0552_student_attendance_record_ii/matrix_multiplication.rs:68

↓ 1 callersMethodunfix

(&mut self, idx: i32)

src/problem_2166_design_bitset/dense_storage.rs:24

↓ 1 callersMethodunfollow

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

src/problem_0355_design_twitter/binary_heap.rs:85

↓ 1 callersMethodunreserve

(&mut self, seat_number: i32)

src/problem_1845_seat_reservation_manager/binary_heap.rs:21

↓ 1 callersFunctionunstable_sorted

(iter: impl IntoIterator<Item = T>)

src/test_utilities.rs:307

↓ 1 callersMethodupdate

(&mut self, timestamp: i32, price: i32)

src/problem_2034_stock_price_fluctuation/binary_heap_and_hash_map.rs:59

↓ 1 callersMethodupdate

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

src/problem_0307_range_sum_query_mutable/segment_tree.rs:30

↓ 1 callersMethodupdate

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

src/problem_0699_falling_squares/segment_tree.rs:52

↓ 1 callersMethodupdate_subrectangle

(&mut self, row1: i32, col1: i32, row2: i32, col2: i32, new_value: i32)

src/problem_1476_subrectangle_queries/stack_updates.rs:20

↓ 1 callersMethodupload

(&mut self, video: i32)

src/problem_2424_longest_uploaded_prefix/array.rs:14

↓ 1 callersMethodvalue

xtask/src/coverage/mod.rs:49

↓ 1 callersMethodvisit

(&mut self, url: String)

src/problem_1472_design_browser_history/stack.rs:18

↓ 1 callersFunctionwrite_html

(writer: &mut impl Write, problems: &[Problem], tree: &Tree, progress_chart: &str)

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

↓ 1 callersMethodwrite_left

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

src/problem_1649_create_sorted_array_through_instructions/merge_sort.rs:29

↓ 1 callersFunctionwrite_solution_link

(writer: &mut ElementWriter<W>, solution: &Solution)

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

c++/include/leet-code/data-structures/list-node.h:9

c++/include/leet-code/data-structures/tree-node-with-next-right-pointer.h:11

c++/tests/leet-code/problem-0373-find-k-pairs-with-smallest-sums/bfs-2.cpp:5

c++/tests/leet-code/problem-0373-find-k-pairs-with-smallest-sums/bfs.cpp:5

c++/tests/leet-code/problem-0378-kth-smallest-element-in-a-sorted-matrix/bfs-2.cpp:5

c++/tests/leet-code/problem-0378-kth-smallest-element-in-a-sorted-matrix/binary-search.cpp:5

c++/tests/leet-code/problem-0378-kth-smallest-element-in-a-sorted-matrix/binary-search-2.cpp:5

c++/tests/leet-code/problem-0378-kth-smallest-element-in-a-sorted-matrix/binary-search-3.cpp:5

c++/tests/leet-code/problem-0386-lexicographical-numbers/iterative-dfs.cpp:5

c++/tests/leet-code/problem-0237-delete-node-in-a-linked-list/modify-this.cpp:5

c++/tests/leet-code/problem-0402-remove-k-digits/greedy.cpp:5

c++/tests/leet-code/problem-0402-remove-k-digits/greedy-2.cpp:5

c++/tests/leet-code/problem-0406-queue-reconstruction-by-height/insertion.cpp:5

c++/tests/leet-code/problem-0406-queue-reconstruction-by-height/fenwick-tree.cpp:5

c++/tests/leet-code/problem-0406-queue-reconstruction-by-height/binary-search-tree.cpp:5

c++/tests/leet-code/problem-0116-populating-next-right-pointers-in-each-node/recursive.cpp:5

c++/tests/leet-code/problem-0116-populating-next-right-pointers-in-each-node/iterative.cpp:5

c++/tests/leet-code/problem-0117-populating-next-right-pointers-in-each-node-ii/iterative.cpp:5

c++/tests/leet-code/problem-0436-find-right-interval/sort-and-merge.cpp:5

c++/tests/leet-code/problem-0436-find-right-interval/sort-and-scan.cpp:5

c++/tests/leet-code/problem-0321-create-maximum-number/greedy.cpp:5

c++/tests/leet-code/problem-0321-create-maximum-number/dynamic-programming.cpp:5

Methodabs_difference

(nums: Vec<i32>, k: i32)

src/problem_3774_absolute_difference_between_maximum_and_minimum_k_elements/quick_select.rs:6

src/problem_0042_trapping_rain_water/maximum_on_both_sides.rs:6

Methodaccount_balance_after_purchase

(purchase_amount: i32)

src/problem_2806_account_balance_after_rounded_purchase/greedy.rs:6

Methodaccounts_merge

(accounts: Vec<Vec<String>>)

src/problem_0721_accounts_merge/iterative_dfs.rs:8

(&mut self, val: i32)

src/problem_0703_kth_largest_element_in_a_stream/binary_heap.rs:29

(mut lhs: u32, rhs: u32)

src/problem_3335_total_characters_in_string_after_transformations_i/dynamic_programming.rs:6

(self, rhs: Self)

src/problem_0679_24_game/backtracking.rs:14

(lhs: u32, rhs: u32)

src/problem_2466_count_ways_to_build_good_strings/hash_set.rs:6

(lhs: u32, rhs: u32)

src/problem_1987_number_of_unique_good_subsequences/dynamic_programming.rs:6

(lhs: u32, rhs: u32)

src/problem_1987_number_of_unique_good_subsequences/dynamic_programming_2.rs:6

(self, rhs: Self)

src/problem_0552_student_attendance_record_ii/dynamic_programming.rs:13

(self, rhs: Self)

src/problem_0552_student_attendance_record_ii/matrix_multiplication.rs:15

(tree: &mut [u16], mut index: usize, diff: u16)

src/problem_1409_queries_on_a_permutation_with_key/fenwick_tree.rs:6

(lhs: u32, rhs: u32)

src/problem_1262_greatest_sum_divisible_by_three/dynamic_programming.rs:6

(lhs: u32, rhs: u32)

src/problem_1223_dice_roll_simulation/dynamic_programming.rs:8

(lhs: u32, rhs: u32)

src/problem_0903_valid_permutations_for_di_sequence/dynamic_programming.rs:6

(target: &mut u32, value: u32)

src/problem_2266_count_number_of_texts/dynamic_programming.rs:6

(&mut self, num: i32)

src/problem_1206_design_skiplist/vanilla_low_memory.rs:130

(&mut self, num: i32)

src/problem_1206_design_skiplist/vanilla_rand.rs:127

(lhs: u32, rhs: u32)

src/problem_0935_knight_dialer/dynamic_programming.rs:6

((x1, y1): (i32, i32), (x2, y2): (i32, i32))

src/problem_0593_valid_square/mathematical.rs:18

(lhs: u32, rhs: u32)

src/problem_0940_distinct_subsequences_ii/dynamic_programming.rs:10

(lhs: u32, rhs: u32)

src/problem_1735_count_ways_to_make_array_with_product/combinations.rs:10

(x: u32, y: u32)

src/problem_2318_number_of_distinct_roll_sequences/dynamic_programming.rs:65

(x: u32, y: u32, z: u32)

src/problem_2318_number_of_distinct_roll_sequences/dynamic_programming.rs:71

(x: u32, y: u32, z: u32, w: u32)

src/problem_2318_number_of_distinct_roll_sequences/dynamic_programming.rs:75

(&mut self, inc: i32)

src/problem_1622_fancy_sequence/mod_inverse.rs:48

(&mut self, inc: i32)

src/problem_1622_fancy_sequence/mod_inverse_2.rs:49

Methodadd_and_get

(lhs: &mut u32, rhs: u32)

src/problem_1224_maximum_equal_frequency/iterative.rs:8

Methodadd_binary

(a: String, b: String)

src/problem_0067_add_binary/naive.rs:6

(&mut self, car_type: i32)

src/problem_1603_design_parking_system/naive.rs:14

Methodadd_digits

src/problem_0258_add_digits/formula.rs:6

(s: &mut [u8], k: u8)

src/problem_1625_lexicographically_smallest_string_after_applying_operations/group_theory.rs:33

(s: &mut [u8], mut i: usize, k: u8)

src/problem_1625_lexicographically_smallest_string_after_applying_operations/group_theory.rs:21

Methodadd_minimum

src/problem_2645_minimum_additions_to_make_valid_string/greedy.rs:6

(lhs: &mut u32, rhs: u32)

src/problem_1155_number_of_dice_rolls_with_target_sum/dynamic_programming.rs:10

Methodadd_negabinary

(arr1: Vec<i32>, arr2: Vec<i32>)

src/problem_1073_adding_two_negabinary_numbers/iterative.rs:6

(&mut self, val: i32)

src/problem_0352_data_stream_as_disjoint_intervals/ordered_map.rs:17

(counts: &mut HashMap<u32, u32>, num: u32)

src/problem_2841_maximum_sum_of_almost_unique_subarray/sliding_window.rs:9

(s: &mut [u8], k: u8)

src/problem_1625_lexicographically_smallest_string_after_applying_operations/group_theory.rs:37

Methodadd_one_row

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

src/problem_0623_add_one_row_to_tree/recursive.rs:41

Methodadd_operators

(num: String, target: i32)

src/problem_0282_expression_add_operators/backtracking_2.rs:61

← previous next →501–600 of 10,327, ranked by callers