MCPcopy Create free account

hub / github.com/begeekmyfriend/leetcode / functions

Functions962 in github.com/begeekmyfriend/leetcode

⨍ Functions 962◇ Types & classes 357
↓ 1 callersFunctionaddBinary
0067_add_binary/add_binary.c:5
↓ 1 callersFunctionaddTwoNumbers
0002_add_two_numbers/add_two_numbers.c:12
↓ 1 callersFunctionarea_calc
0085_maximal_rectangle/maximal_rectangle.c:11
↓ 1 callersFunctionavl_node_balance
0460_lfu_cache/lfu_cache.c:161
↓ 1 callersFunctionavl_node_closest_get
0460_lfu_cache/lfu_cache.c:229
↓ 1 callersFunctionavl_node_destory_recursive
0460_lfu_cache/lfu_cache.c:304
↓ 1 callersFunctionavl_node_erase
0460_lfu_cache/lfu_cache.c:254
↓ 1 callersFunctionavl_tree_destory
0460_lfu_cache/lfu_cache.c:316
↓ 1 callersFunctionavl_tree_init
0460_lfu_cache/lfu_cache.c:296
↓ 1 callersFunctionbfs
0107_binary_tree_level_order_traversal_ii/bst_bfs.c:12
↓ 1 callersFunctionbinary_search
0300_longest_increasing_subsequence/lis.c:10
↓ 1 callersFunctionbrokenCalc
0991_broken_calculator/calculator.c:5
↓ 1 callersFunctionbstIteratorCreate
0173_binary_search_tree_iterator/bst_iter.c:28
↓ 1 callersFunctionbstIteratorFree
Deallocates memory iteriously allocated for the iterator */
0173_binary_search_tree_iterator/bst_iter.c:50
↓ 1 callersFunctionbstIteratorHasNext
@return whether we have a next smallest number */
0173_binary_search_tree_iterator/bst_iter.c:38
↓ 1 callersFunctionbstIteratorNext
@return the next smallest number */
0173_binary_search_tree_iterator/bst_iter.c:44
↓ 1 callersFunctionbuildTree
0106_construct_binary_tree_from_inorder_and_postorder_traversal/binary_tree_build.c:95
↓ 1 callersFunctionbuildTree
0105_construct_binary_tree_from_preorder_and_inorder_traversal/binary_tree_build.c:95
↓ 1 callersFunctionbuild_max_heap
0215_kth_largest_element_in_an_array/kth_elem.c:42
↓ 1 callersFunctioncalculateMinimumHP
0174_dungeon_game/dungeon.c:4
↓ 1 callersFunctioncalculator
0227_basic_calculator_ii/calculator.c:4
↓ 1 callersFunctioncalculator
0224_basic_calculator/calculator.c:60
↓ 1 callersFunctioncanCompleteCircuit
0134_gas_station/gas_station.c:4
↓ 1 callersFunctioncanFinish
0207_course_schedule/course_schedule.c:35
↓ 1 callersFunctioncanJump
0055_jump_game/jump_game.c:10
↓ 1 callersFunctioncan_insert
0149_max_points_on_a_line/points_on_line.c:60
↓ 1 callersFunctioncandy
0135_candy/candy.c:5
↓ 1 callersFunctionchange
0518_coin_change_ii/coin_change.c:5
↓ 1 callersFunctioncheckInclusion
0567_permutation_in_string/permutation_in_string.c:7
↓ 1 callersFunctionclimbStairs
0070_climbing_stairs/climb_stairs.c:20
↓ 1 callersFunctioncoinChange
0322_coin_change/coin_change.c:5
↓ 1 callersFunctioncombinationSum
** Return an array of arrays of size *returnSize. ** The sizes of the arrays are returned as *returnColumnSizes array. ** Note: Both returned array
0040_combination_sum_ii/combination_sum.c:43
↓ 1 callersFunctioncombinationSum
** Return an array of arrays of size *returnSize. ** The sizes of the arrays are returned as *returnColumnSizes array. ** Note: Both returned array
0039_combination_sum/combination_sum.c:31
↓ 1 callersFunctioncombinationSum3
** Return an array of arrays of size *returnSize. ** The sizes of the arrays are returned as *returnColumnSizes array. ** Note: Both returned array
0216_combination_sum_iii/combination_sum.c:30
↓ 1 callersFunctioncombine
* Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array and
0077_combinations/combinations.c:29
↓ 1 callersFunctioncompareVersioin
0165_compare_version_numbers/version.c:4
↓ 1 callersFunctionconnect
0117_populating_next_right_pointers_in_each_node_ii/connect.c:89
↓ 1 callersFunctionconvert
0006_zigzag_conversion/zigzag_conversion.c:5
↓ 1 callersFunctionconvertToTitle
0168_excel_sheet_column_title/sheet_column.c:4
↓ 1 callersFunctioncopyRandomList
0138_copy_list_with_random_pointer/copy_list.c:10
↓ 1 callersFunctioncountAndSay
0038_count_and_say/count_and_say.c:37
↓ 1 callersFunctioncountPrimes
0204_count_primes/count_primes.c:6
↓ 1 callersFunctiondeleteDuplicates
0082_remove_duplicates_from_sorted_list_ii/rm_dup.c:10
↓ 1 callersFunctiondeleteDuplicates
0083_remove_duplicates_from_sorted_list/rm_dup.c:11
↓ 1 callersFunctiondeserialize
Decodes your encoded data to tree. */
0297_serialize_and_deserialize_binary_tree/tree_serdes.c:59
↓ 1 callersFunctiondetectCycle
0142_linked_list_cycle_ii/list_cycle.c:10
↓ 1 callersFunctiondfs
0070_climbing_stairs/climb_stairs.c:5
↓ 1 callersFunctiondfs
0173_binary_search_tree_iterator/bst_iter.c:17
↓ 1 callersFunctiondfs
0140_word_break_ii/word_break.c:66
↓ 1 callersFunctiondfs
0093_restore_ip_addresses/ip_addr.c:22
↓ 1 callersFunctiondfs
0210_course_schedule_ii/course_schedule.c:14
↓ 1 callersFunctiondfs
0095_unique_binary_search_trees_ii/unique_bst.c:55
↓ 1 callersFunctiondfs
0200_number_of_islands/islands.c:5
↓ 1 callersFunctiondfs
0133_clone_graph/clone_graph.c:71
↓ 1 callersFunctiondfs
0079_word_search/word_search.c:6
↓ 1 callersFunctiondfs
0224_basic_calculator/calculator.c:6
↓ 1 callersFunctiondfs
0023_merge_k_sorted_lists/merge_lists.c:91
↓ 1 callersFunctiondfs
0139_word_break/word_break.c:7
↓ 1 callersFunctiondfs
0207_course_schedule/course_schedule.c:14
↓ 1 callersFunctiondfs
0212_word_search_ii/word_search.c:49
↓ 1 callersFunctiondivide
0029_divide_two_integers/divide.c:5
↓ 1 callersFunctiondump
0106_construct_binary_tree_from_inorder_and_postorder_traversal/binary_tree_build.c:109
↓ 1 callersFunctiondump
0105_construct_binary_tree_from_preorder_and_inorder_traversal/binary_tree_build.c:109
↓ 1 callersFunctiondump
0095_unique_binary_search_trees_ii/unique_bst.c:115
↓ 1 callersFunctionequationsPossible
0990_satisfiability_of_equality_equations/equality_equations.c:43
↓ 1 callersFunctionevalRPN
0150_evaluate_reverse_polish_notation/eval_rpn.c:28
↓ 1 callersFunctionexist
0079_word_search/word_search.c:40
↓ 1 callersFunctionfind
0127_word_ladder/word_ladder.c:80
↓ 1 callersFunctionfind
0106_construct_binary_tree_from_inorder_and_postorder_traversal/binary_tree_build.c:60
↓ 1 callersFunctionfind
0105_construct_binary_tree_from_preorder_and_inorder_traversal/binary_tree_build.c:60
↓ 1 callersFunctionfind
0133_clone_graph/clone_graph.c:59
↓ 1 callersFunctionfind
0030_substring_with_concatenation_of_all_words/concatenation.c:78
↓ 1 callersFunctionfind
0166_fraction_to_recurring_decimal/fraction.c:56
↓ 1 callersFunctionfindAnagrams
* Note: The returned array must be malloced, assume caller calls free(). */
0438_find_all_anagrams_in_a_string/anagrams_in_string.c:8
↓ 1 callersFunctionfindKthLargest
0215_kth_largest_element_in_an_array/kth_elem.c:87
↓ 1 callersFunctionfindLadders
** Return an array of arrays of size *returnSize. ** The sizes of the arrays are returned as *returnColumnSizes array. ** Note: Both returned array
0126_word_ladder_ii/word_ladder.c:103
↓ 1 callersFunctionfindMin
0154_find_minimum_in_rotated_sorted_array_ii/minimum.c:4
↓ 1 callersFunctionfindMin
0153_find_minimum_in_rotated_sorted_array/minimum.c:5
↓ 1 callersFunctionfindOrder
* Return an array of size *returnSize. * Note: The returned array must be malloced, assume caller calls free(). */
0210_course_schedule_ii/course_schedule.c:41
↓ 1 callersFunctionfindPeakElement
0162_find_peak_element/peak.c:5
↓ 1 callersFunctionfindSubstring
** Return an array of size *returnSize. ** Note: The returned array must be malloced, assume caller calls free(). **/
0030_substring_with_concatenation_of_all_words/concatenation.c:111
↓ 1 callersFunctionfindWords
* Return an array of size *returnSize. * Note: The returned array must be malloced, assume caller calls free(). */
0212_word_search_ii/word_search.c:98
↓ 1 callersFunctionfirstMissingPositive
0041_first_missing_positive/missing_positive.c:11
↓ 1 callersFunctionflatten
0114_flatten_binary_tree_to_linked_list/flatten.c:33
↓ 1 callersFunctionfourSum
* Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array and
0018_four_sum/four_sum.c:49
↓ 1 callersFunctionfullJustify
* Return an array of size *returnSize. * Note: The returned array must be malloced, assume caller calls free(). */
0068_text_justification/justification.c:33
↓ 1 callersFunctiongcd
0149_max_points_on_a_line/points_on_line.c:69
↓ 1 callersFunctiongenerate
* Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array and
0118_pascal_triangle/pascal_triangle.c:10
↓ 1 callersFunctiongenerateMatrix
* Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array and
0059_spiral_matrix_ii/spiral_matrix.c:10
↓ 1 callersFunctiongenerateParenthesis
** Return an array of size *returnSize. ** Note: The returned array must be malloced, assume caller calls free(). **/
0022_generate_parathesis/parenthesis.c:28
↓ 1 callersFunctiongenerateTrees
** Return an array of size *returnSize. ** Note: The returned array must be malloced, assume caller calls free(). **/
0095_unique_binary_search_trees_ii/unique_bst.c:103
↓ 1 callersFunctionget
0023_merge_k_sorted_lists/merge_lists.c:56
↓ 1 callersFunctiongetIntersectionNode
0160_intersection_of_two_linked_list/intersection.c:10
↓ 1 callersFunctiongetPermutation
0060_permutation_sequence/permutation_sequence.c:6
↓ 1 callersFunctiongetRow
** Return an array of size *returnSize. ** Note: The returned array must be malloced, assume caller calls free(). **/
0119_pascal_triangle_ii/pascal_triangle.c:8
↓ 1 callersFunctiongrayCode
** Return an array of size *returnSize. ** Note: The returned array must be malloced, assume caller calls free(). **/
0089_gray_code/gray_code.c:8
↓ 1 callersFunctiongroupAnagrams
** Return an array of arrays of size *returnSize. ** The sizes of the arrays are returned as *returnColumnSizes array. ** Note: Both returned array
0049_group_anagrams/anagrams.c:32
↓ 1 callersFunctionhammingWeight
0191_number_of_one_bits/hamming_weight.c:5
↓ 1 callersFunctionhasCycle
0141_linked_list_cycle/list_cycle.c:10
↓ 1 callersFunctioninorderTraversal
** Return an array of size *returnSize. ** Note: The returned array must be malloced, assume caller calls free(). **/
0094_binary_tree_inorder_traversal/bst_inorder_traversal.c:26
← previousnext →201–300 of 962, ranked by callers