MCPcopy Create free account

hub / github.com/begeekmyfriend/leetcode / functions

Functions962 in github.com/begeekmyfriend/leetcode

⨍ Functions 962◇ Types & classes 357
↓ 1 callersFunctioninsert
* Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array and
0057_insert_interval/insert_interval.c:15
↓ 1 callersFunctioninsertionSortList
0147_insertion_sort_list/insert_sort_list.c:9
↓ 1 callersFunctionintToRoman
0012_roman_numeral/roman_numeral.c:65
↓ 1 callersFunctionisBalanced
0110_balanced_binary_tree/balanced_bst.c:26
↓ 1 callersFunctionisHappy
0202_happy_number/happy_number.c:21
↓ 1 callersFunctionisInterleave
* Interleaving string s3 is whether a line from left top to right buttom. * or not. * * s2 ..... *s1 T F F F F F *. T F F F F F *. T T T T T
0097_interleaving_string/interleaving_string.c:18
↓ 1 callersFunctionisIsomorphic
0205_isomorphic_strings/isomorphic_strings.c:5
↓ 1 callersMethodisIsomorphic
0205_isomorphic_strings/isomorphic_strings.cpp:21
↓ 1 callersFunctionisMatch
0044_wildcard_matching/wildcard_matching.c:7
↓ 1 callersFunctionisMatch
0010_regular_expression_matching/regular_expression.c:6
↓ 1 callersFunctionisNumber
0065_valid_number/valid_number.c:6
↓ 1 callersFunctionisPalindrome
0009_palindrome_number/palindrome_number.c:24
↓ 1 callersFunctionisPalindrome
0125_valid_palindrome/valid_palindrome.c:11
↓ 1 callersFunctionisScramble
0087_scramble_string/scramble_string.c:48
↓ 1 callersFunctionisSymmetricTree
0101_symmetric_tree/symmetric_tree.c:28
↓ 1 callersFunctionisValid
0020_valid_parentheses/valid_parentheses.c:5
↓ 1 callersFunctionisValidBST
0098_validate_binary_search_tree/valid_bst.c:13
↓ 1 callersFunctionisValidSudoku
0036_valid_sudoku/valid_sudoku.c:19
↓ 1 callersFunctionjump
0045_jump_game_ii/jump_game.c:10
↓ 1 callersFunctionkthSmallest
0230_kth_smallest_element_in_a_bst/kth_bst.c:29
↓ 1 callersFunctionlFUCacheCreate
0460_lfu_cache/lfu_cache.c:338
↓ 1 callersFunctionlFUCacheFree
0460_lfu_cache/lfu_cache.c:406
↓ 1 callersFunctionlRUCacheCreate
0146_lru_cache/lru_cache.c:94
↓ 1 callersFunctionladderLength
0127_word_ladder/word_ladder.c:92
↓ 1 callersFunctionlargestNumber
0179_largest_number/largest_number.c:20
↓ 1 callersFunctionlargestRectangleArea
0084_largest_rectangle_in_histogram/rect_in_histogram.c:4
↓ 1 callersFunctionlengthOfLIS
0300_longest_increasing_subsequence/lis.c:23
↓ 1 callersFunctionlengthOfLastWord
0058_length_of_last_word/word_length.c:5
↓ 1 callersFunctionlengthOfLongestSubstring
0003_longest_substring_without_repeat/longest_substring_without_repeat.c:6
↓ 1 callersFunctionletterCombinations
** Return an array of size *returnSize. ** Note: The returned array must be malloced, assume caller calls free(). **/
0017_letter_combinations_of_a_phone_number/letter_combinations.c:9
↓ 1 callersMethodletterCombinations
0017_letter_combinations_of_a_phone_number/letter_combinations.cpp:9
↓ 1 callersFunctionlevelOrder
** Return an array of arrays of size *returnSize. ** The sizes of the arrays are returned as *returnColumnSizes array. ** Note: Both returned array
0102_binary_tree_level_order_traversal/bst_bfs.c:96
↓ 1 callersFunctionlevelOrderBottom
** Return an array of arrays of size *returnSize. ** The sizes of the arrays are returned as *returnColumnSizes array. ** Note: Both returned array
0107_binary_tree_level_order_traversal_ii/bst_bfs.c:33
↓ 1 callersFunctionlist_add
0102_binary_tree_level_order_traversal/bst_bfs.c:50
↓ 1 callersFunctionlist_add
0127_word_ladder/word_ladder.c:41
↓ 1 callersFunctionlist_add
0106_construct_binary_tree_from_inorder_and_postorder_traversal/binary_tree_build.c:50
↓ 1 callersFunctionlist_add
0149_max_points_on_a_line/points_on_line.c:50
↓ 1 callersFunctionlist_add
0105_construct_binary_tree_from_preorder_and_inorder_traversal/binary_tree_build.c:50
↓ 1 callersFunctionlist_add
0133_clone_graph/clone_graph.c:49
↓ 1 callersFunctionlist_add
0126_word_ladder_ii/word_ladder.c:52
↓ 1 callersFunctionlist_add
0030_substring_with_concatenation_of_all_words/concatenation.c:46
↓ 1 callersFunctionlist_add
0128_longest_consecutive_sequence/consec_seq.c:43
↓ 1 callersFunctionlist_add
0166_fraction_to_recurring_decimal/fraction.c:46
↓ 1 callersFunctionlist_add
0199_binary_tree_right_side_view/bst_right.c:50
↓ 1 callersFunctionlist_add
0130_surrounded_regions/surrounded_regions.c:41
↓ 1 callersFunctionlist_add
0103_binary_tree_zigzag_level_order_traversal/bst_zigzag.c:49
↓ 1 callersFunctionlist_add_tail
0140_word_break_ii/word_break.c:54
↓ 1 callersFunctionlist_add_tail
0127_word_ladder/word_ladder.c:46
↓ 1 callersFunctionlist_add_tail
0146_lru_cache/lru_cache.c:65
↓ 1 callersFunctionlist_del
0127_word_ladder/word_ladder.c:57
↓ 1 callersFunctionlist_del
0126_word_ladder_ii/word_ladder.c:68
↓ 1 callersFunctionlist_del
0128_longest_consecutive_sequence/consec_seq.c:59
↓ 1 callersFunctionlist_empty
0127_word_ladder/word_ladder.c:28
↓ 1 callersFunctionlist_empty
0126_word_ladder_ii/word_ladder.c:39
↓ 1 callersFunctionlist_empty
0460_lfu_cache/lfu_cache.c:65
↓ 1 callersFunctionlongestCommonPrefix
0014_longest_common_prefix/common_prefix.c:6
↓ 1 callersFunctionlongestCommonSubsequence
1143_longest_common_subsequence/lcs.c:11
↓ 1 callersFunctionlongestConsecutive
0128_longest_consecutive_sequence/consec_seq.c:77
↓ 1 callersFunctionlongestPalindrom
0005_longest_palindromic_substring/longest_palindromic_substring.c:58
↓ 1 callersFunctionlongestPalindromeSubseq
0516_longest_palindromic_subsequence/lps.c:11
↓ 1 callersFunctionlongestValidParentheses
0032_longest_valid_parentheses/valid_parentheses.c:10
↓ 1 callersFunctionmajorityElement
0229_majority_element_ii/majority.c:4
↓ 1 callersFunctionmajorityElement
0169_majority_element/majority.c:4
↓ 1 callersFunctionmanacher
0005_longest_palindromic_substring/longest_palindromic_substring.c:10
↓ 1 callersFunctionmax
0221_maximal_square/maximal_square.c:10
↓ 1 callersFunctionmaxArea
0011_container_with_most_water/container.c:4
↓ 1 callersFunctionmaxEnvelopes
0354_russian_doll_envelopes/russian_doll.c:27
↓ 1 callersFunctionmaxPathSum
0124_binary_tree_maximum_path_sum/bst_max_path.c:37
↓ 1 callersFunctionmaxPoints
0149_max_points_on_a_line/points_on_line.c:79
↓ 1 callersFunctionmaxProduct
0152_maximum_product_subarray/subarray.c:16
↓ 1 callersFunctionmaxProfit
0188_best_time_to_buy_and_sell_stock_iv/stock.c:10
↓ 1 callersFunctionmaxProfit
0123_best_time_to_buy_and_sell_stock_iii/stock.c:12
↓ 1 callersFunctionmaxProfit
0121_best_time_to_buy_and_sell_stock/stock.c:4
↓ 1 callersFunctionmaxProfit
0122_best_time_to_buy_and_sell_stock_ii/stock.c:6
↓ 1 callersFunctionmaxSlidingWindow
* Return an array of size *returnSize. * Note: The returned array must be malloced, assume caller calls free(). */
0239_sliding_window_maximum/slide_window.c:8
↓ 1 callersFunctionmaxSubArray
0053_maximum_subarray/max_subarray.c:37
↓ 1 callersFunctionmaximalRectangle
0085_maximal_rectangle/maximal_rectangle.c:46
↓ 1 callersFunctionmaximalSquare
0221_maximal_square/maximal_square.c:15
↓ 1 callersFunctionmaximumGap
0164_maximum_gap/max_gap.c:15
↓ 1 callersFunctionmerge
0912_sort_an_array/sort.c:59
↓ 1 callersFunctionmerge
* Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array and
0056_merge_intervals/merge_intervals.c:16
↓ 1 callersFunctionmerge
0088_merge_sorted_array/merge_array.c:5
↓ 1 callersFunctionmergeKLists
0023_merge_k_sorted_lists/merge_lists.c:104
↓ 1 callersFunctionmergeTwoLists
0021_merge_two_sorted_lists/merge_lists.c:9
↓ 1 callersFunctionmergeTwoLists
0023_merge_k_sorted_lists/merge_lists.c:70
↓ 1 callersFunctionmerge_sort
0912_sort_an_array/sort.c:86
↓ 1 callersFunctionmin
0209_minimum_size_subarray_sum/mini_size.c:5
↓ 1 callersFunctionmin
0064_minumum_path_sum/minimum_path_sum.c:5
↓ 1 callersFunctionmin
0005_longest_palindromic_substring/longest_palindromic_substring.c:5
↓ 1 callersFunctionminCut
0132_palindrome_patitioning_ii/palindrome_partition.c:7
↓ 1 callersFunctionminDistance
0072_edit_distance/edit_distance.c:31
↓ 1 callersFunctionminInsertions
1312_minimum_insertion_steps_to_make_a_string_palindrome/insertion.c:11
↓ 1 callersFunctionminPathSum
0064_minumum_path_sum/minimum_path_sum.c:10
↓ 1 callersFunctionminStackCreate
initialize your data structure here. */
0155_min_stack/stack.c:11
↓ 1 callersFunctionminStackFree
0155_min_stack/stack.c:52
↓ 1 callersFunctionminSubArrayLen
0209_minimum_size_subarray_sum/mini_size.c:10
↓ 1 callersFunctionminWindow
sliding window pattern * while (r < size) { * // check target condition * while (target_condition) { * // calculate minimum lengt
0076_minimum_window_substring/window_substring.c:16
↓ 1 callersFunctionminimumTotal
0120_triangle/triangle.c:24
↓ 1 callersFunctionmultiply
0043_multiply_strings/multiply_strings.c:6
↓ 1 callersFunctionmyAtoi
0008_atoi/atoi.c:7
← previousnext →301–400 of 962, ranked by callers