MCPcopy Create free account

hub / github.com/begeekmyfriend/leetcode / functions

Functions962 in github.com/begeekmyfriend/leetcode

⨍ Functions 962◇ Types & classes 357
↓ 20 callersFunctionmax
0198_house_robber/robber.c:5
↓ 18 callersFunctiondfs
0078_subsets/subsets.c:6
↓ 14 callersFunctionfractionToDecimal
0166_fraction_to_recurring_decimal/fraction.c:68
↓ 11 callersFunctionlFUCacheGet
0460_lfu_cache/lfu_cache.c:351
↓ 10 callersFunctionheight
0460_lfu_cache/lfu_cache.c:106
↓ 10 callersFunctionreverse
0189_rotate_array/rotate_array.c:4
↓ 8 callersFunctionlist_add_tail
0130_surrounded_regions/surrounded_regions.c:46
↓ 8 callersFunctionnode_new
0130_surrounded_regions/surrounded_regions.c:63
↓ 7 callersFunctiondfs
0022_generate_parathesis/parenthesis.c:5
↓ 7 callersFunctiondfs
0051_n_queens/n_queens.c:56
↓ 7 callersFunctionlFUCachePut
0460_lfu_cache/lfu_cache.c:368
↓ 7 callersFunctionmax
1143_longest_common_subsequence/lcs.c:6
↓ 6 callersFunctionfindMedianSortedArrays
0004_median_of_two_sorted_array/median_of_two_sorted_array.c:4
↓ 6 callersMethodget
0460_lfu_cache/lfu_cache.cc:21
↓ 6 callersFunctionmax
0213_house_robber_ii/robber.c:5
↓ 6 callersFunctionnum2char
0012_roman_numeral/roman_numeral.c:5
↓ 6 callersFunctionvalid
0036_valid_sudoku/valid_sudoku.c:7
↓ 5 callersFunctionavl_update_height
0460_lfu_cache/lfu_cache.c:111
↓ 5 callersFunctionlRUCacheGet
0146_lru_cache/lru_cache.c:117
↓ 5 callersFunctionlist_del
0460_lfu_cache/lfu_cache.c:99
↓ 5 callersFunctionmax
0300_longest_increasing_subsequence/lis.c:5
↓ 5 callersFunctionmin
0072_edit_distance/edit_distance.c:26
↓ 5 callersFunctionreverse
0007_reverse_integer/reverse_integer.c:6
↓ 4 callersFunctionavl_node_replace
0460_lfu_cache/lfu_cache.c:118
↓ 4 callersFunctionavl_node_rotate
0460_lfu_cache/lfu_cache.c:137
↓ 4 callersFunctionbfs
0130_surrounded_regions/surrounded_regions.c:75
↓ 4 callersFunctiondepth
0110_balanced_binary_tree/balanced_bst.c:11
↓ 4 callersFunctiondes
0297_serialize_and_deserialize_binary_tree/tree_serdes.c:29
↓ 4 callersFunctiondfs
0129_sum_root_to_leaf_numbers/sum_tree.c:11
↓ 4 callersFunctiondfs
0109_convert_sorted_list_to_binary_search_tree/bst_convert.c:16
↓ 4 callersFunctiondfs
0106_construct_binary_tree_from_inorder_and_postorder_traversal/binary_tree_build.c:81
↓ 4 callersFunctiondfs
0105_construct_binary_tree_from_preorder_and_inorder_traversal/binary_tree_build.c:72
↓ 4 callersFunctiondfs
0099_recover_binary_search_tree/recover_bst.c:12
↓ 4 callersFunctiondfs
0124_binary_tree_maximum_path_sum/bst_max_path.c:16
↓ 4 callersFunctiondfs
0120_triangle/triangle.c:7
↓ 4 callersFunctiondfs
0037_sudoku_solver/sudoku_solver.c:12
↓ 4 callersFunctiondfs
0113_path_sum_ii/path_sum.c:12
↓ 4 callersFunctionfreq_incr
0460_lfu_cache/lfu_cache.c:321
↓ 4 callersFunctionlRUCachePut
0146_lru_cache/lru_cache.c:131
↓ 4 callersFunctionlist_add_tail
0117_populating_next_right_pointers_in_each_node_ii/connect.c:53
↓ 4 callersFunctionmax
0045_jump_game_ii/jump_game.c:5
↓ 4 callersFunctionmax
0516_longest_palindromic_subsequence/lps.c:6
↓ 4 callersFunctionmax
0032_longest_valid_parentheses/valid_parentheses.c:5
↓ 4 callersFunctionminStackGetMin
0155_min_stack/stack.c:47
↓ 4 callersFunctionminStackPush
0155_min_stack/stack.c:19
↓ 4 callersFunctionpartition
0108_convert_sorted_array_to_binary_search_tree/bst_convert.c:11
↓ 4 callersMethodput
0460_lfu_cache/lfu_cache.cc:30
↓ 4 callersFunctionroman_to_integer
0013_roman_to_integer/roman_to_integer.c:4
↓ 4 callersFunctionser
0297_serialize_and_deserialize_binary_tree/tree_serdes.c:16
↓ 4 callersFunctionswap
0075_sort_colors/sort_colors.c:6
↓ 4 callersFunctionswap
0215_kth_largest_element_in_an_array/kth_elem.c:14
↓ 4 callersFunctionufs_find
0990_satisfiability_of_equality_equations/equality_equations.c:19
↓ 4 callersFunctionwordDictionarySearch
Returns if the word is in the wordDictionary. */
0211_add_and_search_word/word_dict.c:35
↓ 3 callersFunctionINIT_LIST_HEAD
0126_word_ladder_ii/word_ladder.c:34
↓ 3 callersFunction__list_del
0146_lru_cache/lru_cache.c:70
↓ 3 callersFunctionconflict
0051_n_queens/n_queens.c:6
↓ 3 callersFunctionconflict
0052_n_queens_ii/n_queens.c:7
↓ 3 callersFunctionconnect
0116_populating_next_right_pointers_in_each_node/connect.c:12
↓ 3 callersFunctiondfs
0216_combination_sum_iii/combination_sum.c:6
↓ 3 callersFunctiondfs
0047_permutations_ii/permutations.c:11
↓ 3 callersFunctiondfs
0040_combination_sum_ii/combination_sum.c:13
↓ 3 callersFunctiondfs
0039_combination_sum/combination_sum.c:6
↓ 3 callersFunctiondfs
0046_permutations/permutations.c:14
↓ 3 callersFunctiondfs
0090_subsets_ii/subsets.c:12
↓ 3 callersFunctiondfs
0077_combinations/combinations.c:7
↓ 3 callersFunctiondfs
0131_palindrome_patitioning/palindrome_partition.c:23
↓ 3 callersFunctiondfs
0052_n_queens_ii/n_queens.c:42
↓ 3 callersFunctionfast_pow
0050_pow/pow.c:6
↓ 3 callersFunctionfind
0128_longest_consecutive_sequence/consec_seq.c:65
↓ 3 callersFunctiongt
0164_maximum_gap/max_gap.c:5
↓ 3 callersFunctionhasPathSum
0112_path_sum/path_sum.c:12
↓ 3 callersFunctioninvertTree
0226_invert_binary_tree/invert_binary_tree.c:11
↓ 3 callersFunctionisSameTree
0100_same_tree/same_tree.c:11
↓ 3 callersFunctionk_sum
0018_four_sum/four_sum.c:11
↓ 3 callersFunctionlist_add
0146_lru_cache/lru_cache.c:60
↓ 3 callersFunctionlist_add
0460_lfu_cache/lfu_cache.c:80
↓ 3 callersFunctionlist_add_tail
0102_binary_tree_level_order_traversal/bst_bfs.c:55
↓ 3 callersFunctionlist_add_tail
0126_word_ladder_ii/word_ladder.c:57
↓ 3 callersFunctionlist_add_tail
0199_binary_tree_right_side_view/bst_right.c:55
↓ 3 callersFunctionlist_add_tail
0103_binary_tree_zigzag_level_order_traversal/bst_zigzag.c:54
↓ 3 callersFunctionlist_del
0146_lru_cache/lru_cache.c:76
↓ 3 callersFunctionlowestCommonAncestor
0236_lowest_common_ancestor_of_a_binary_tree/bst_lca.c:12
↓ 3 callersFunctionlowestCommonAncestor
0235_lowest_common_ancestor_of_a_binary_search_tree/bst_lca.c:11
↓ 3 callersFunctionmax
0152_maximum_product_subarray/subarray.c:11
↓ 3 callersFunctionmax
0055_jump_game/jump_game.c:5
↓ 3 callersFunctionmaxDepth
0104_maximum_depth_of_binary_tree/bst_depth.c:10
↓ 3 callersFunctionmaximum
0124_binary_tree_maximum_path_sum/bst_max_path.c:11
↓ 3 callersFunctionmin
0152_maximum_product_subarray/subarray.c:6
↓ 3 callersFunctionmin
1312_minimum_insertion_steps_to_make_a_string_palindrome/insertion.c:6
↓ 3 callersFunctionminDepth
0111_minimum_depth_of_binary_tree/bst_depth.c:10
↓ 3 callersFunctionminStackPop
0155_min_stack/stack.c:27
↓ 3 callersFunctionnew_word_add
0140_word_break_ii/word_break.c:59
↓ 3 callersFunctionnode_new
0117_populating_next_right_pointers_in_each_node_ii/connect.c:70
↓ 3 callersFunctionnode_new
0102_binary_tree_level_order_traversal/bst_bfs.c:72
↓ 3 callersFunctionnode_new
0199_binary_tree_right_side_view/bst_right.c:72
↓ 3 callersFunctionnode_new
0103_binary_tree_zigzag_level_order_traversal/bst_zigzag.c:71
↓ 3 callersFunctionshow
0002_add_two_numbers/add_two_numbers.c:78
↓ 3 callersFunctionsolute
0051_n_queens/n_queens.c:41
↓ 3 callersFunctionsolve
0130_surrounded_regions/surrounded_regions.c:120
↓ 3 callersFunctionsortedListToBST
0109_convert_sorted_list_to_binary_search_tree/bst_convert.c:31
next →1–100 of 962, ranked by callers