MCPcopy Create free account

hub / github.com/begeekmyfriend/leetcode / functions

Functions962 in github.com/begeekmyfriend/leetcode

⨍ Functions 962◇ Types & classes 357
↓ 1 callersFunctionmySqrt
0069_sqrt/sqrt.c:6
↓ 1 callersFunctionmy_pow
0050_pow/pow.c:14
↓ 1 callersFunctionnextPermutation
0031_next_permutation/next_permutation.c:22
↓ 1 callersFunctionnode_add
0106_construct_binary_tree_from_inorder_and_postorder_traversal/binary_tree_build.c:72
↓ 1 callersFunctionnode_add
0105_construct_binary_tree_from_preorder_and_inorder_traversal/binary_tree_build.c:86
↓ 1 callersFunctionnode_free
0117_populating_next_right_pointers_in_each_node_ii/connect.c:83
↓ 1 callersFunctionnode_free
0102_binary_tree_level_order_traversal/bst_bfs.c:85
↓ 1 callersFunctionnode_free
0199_binary_tree_right_side_view/bst_right.c:86
↓ 1 callersFunctionnode_free
0103_binary_tree_zigzag_level_order_traversal/bst_zigzag.c:84
↓ 1 callersFunctionnumDecodings
0091_decode_ways/decode_ways.c:6
↓ 1 callersFunctionnumDistinct
0115_distinct_subsequences/distinct_subseq.c:5
↓ 1 callersFunctionnumIslands
0200_number_of_islands/islands.c:26
↓ 1 callersFunctionnumTrees
0096_unique_binary_search_trees/unique_bst.c:8
↓ 1 callersFunctionpartition
0086_partition_list/partition_list.c:9
↓ 1 callersFunctionpartition
0114_flatten_binary_tree_to_linked_list/flatten.c:11
↓ 1 callersFunctionpartition
0053_maximum_subarray/max_subarray.c:5
↓ 1 callersFunctionpartition
** Return an array of arrays of size *returnSize. ** The sizes of the arrays are returned as *returnColumnSizes array. ** Note: Both returned array
0131_palindrome_patitioning/palindrome_partition.c:55
↓ 1 callersFunctionpathSum
* Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array and
0113_path_sum_ii/path_sum.c:34
↓ 1 callersFunctionpermute
* Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array and
0047_permutations_ii/permutations.c:47
↓ 1 callersFunctionpermute
* Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array and
0046_permutations/permutations.c:65
↓ 1 callersFunctionplusOne
** Return an array of size *returnSize. ** Note: The returned array must be malloced, assume caller calls free(). **/
0066_plus_one/plus_one.c:9
↓ 1 callersFunctionpostorderTraversal
** Return an array of size *returnSize. ** Note: The returned array must be malloced, assume caller calls free(). **/
0145_binary_tree_postorder_traversal/bst_postorder.c:19
↓ 1 callersFunctionpreorderTraversal
** Return an array of size *returnSize. ** Note: The returned array must be malloced, assume caller calls free(). **/
0144_binary_tree_preorder_traversal/bst_preorder.c:14
↓ 1 callersFunctionpush
0051_n_queens/n_queens.c:18
↓ 1 callersFunctionpush
0052_n_queens_ii/n_queens.c:19
↓ 1 callersFunctionput
0023_merge_k_sorted_lists/merge_lists.c:64
↓ 1 callersFunctionquick_select
0215_kth_largest_element_in_an_array/kth_elem.c:50
↓ 1 callersFunctionquick_sort
0912_sort_an_array/sort.c:21
↓ 1 callersFunctionrangeBitwiseAnd
0201_bitwise_and_of_numbers_range/and.c:4
↓ 1 callersFunctionrecoverTree
0099_recover_binary_search_tree/recover_bst.c:38
↓ 1 callersFunctionrecursive
0202_happy_number/happy_number.c:6
↓ 1 callersFunctionrecursive
0206_reverse_linked_list/reverse_list.c:10
↓ 1 callersFunctionremoveDuplicates
0080_remove_duplicates_from_sorted_array_ii/rm_dups.c:4
↓ 1 callersFunctionremoveDuplicates
0026_remove_duplicates_from_sorted_array/rm_dup.c:5
↓ 1 callersFunctionremoveElement
0203_remove_linked_list_element/rm_elem.c:9
↓ 1 callersFunctionremoveElement
0027_remove_element/rm_elem.c:5
↓ 1 callersFunctionremoveNthFromEnd
0019_remove_nth_node_from_end_of_list/remove_end.c:9
↓ 1 callersFunctionreorderList
0143_reorder_list/reorder_list.c:9
↓ 1 callersFunctionrestoreIpAddresses
** Return an array of size *returnSize. ** Note: The returned array must be malloced, assume caller calls free(). **/
0093_restore_ip_addresses/ip_addr.c:60
↓ 1 callersFunctionrev_cpy
0214_shortest_palindrome/shortest_palindrome.c:6
↓ 1 callersFunctionreverseBetween
0092_reverse_linked_list_ii/reverse_list.c:9
↓ 1 callersFunctionreverseBits
0190_reverse_bits/reverse_bits.c:5
↓ 1 callersFunctionreverseKGroup
0025_reverse_nodes_in_k_group/reverse_nodes.c:9
↓ 1 callersFunctionreverseList
0206_reverse_linked_list/reverse_list.c:21
↓ 1 callersFunctionreverseWords
0151_reverse_words_in_a_string/reverse.c:16
↓ 1 callersFunctionrightSideView
** The returned array must be malloced, assume caller calls free(). **/
0199_binary_tree_right_side_view/bst_right.c:95
↓ 1 callersFunctionrob
0213_house_robber_ii/robber.c:26
↓ 1 callersFunctionrob
0198_house_robber/robber.c:10
↓ 1 callersFunctionromanToInt
0013_roman_to_integer/roman_to_integer.c:26
↓ 1 callersFunctionrotate
0048_rotate_image/rotate.c:4
↓ 1 callersFunctionrotate
0189_rotate_array/rotate_array.c:15
↓ 1 callersFunctionrotateRight
0061_rotate_list/rotate_list.c:10
↓ 1 callersFunctionscramble
The recursive way is quite simple. * 1) break the string to two parts: * s1[0..j] s1[j+1..n] * s2[0..j] s2[j+1..n] *
0087_scramble_string/scramble_string.c:15
↓ 1 callersFunctionsearch
0081_search_in_rotated_sorted_array_ii/search_rotated_array.c:6
↓ 1 callersFunctionsearch
0033_search_in_rotated_sorted_array/rotated_array.c:5
↓ 1 callersFunctionsearchInsert
0035_search_insert_position/insert_position.c:4
↓ 1 callersFunctionsearchMatrix
0074_search_a_2d_matrix/matrix_search.c:24
↓ 1 callersFunctionsearchRange
** Return an array of size *returnSize. ** Note: The returned array must be malloced, assume caller calls free(). **/
0034_search_for_a_range/range_search.c:48
↓ 1 callersFunctionserialize
Encodes a tree to a single string. */
0297_serialize_and_deserialize_binary_tree/tree_serdes.c:50
↓ 1 callersFunctionshortestPalindrome
0214_shortest_palindrome/shortest_palindrome.c:14
↓ 1 callersFunctionshow
0912_sort_an_array/sort.c:5
↓ 1 callersFunctionsimplifyPath
0071_simplify_path/simplify_path.c:5
↓ 1 callersFunctionsingleNumber
0137_single_number_ii/single_number.c:5
↓ 1 callersFunctionsingleNumber
0136_single_number/single_number.c:4
↓ 1 callersFunctionsolveNQueens
* Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array and
0051_n_queens/n_queens.c:78
↓ 1 callersFunctionsolveSudoku
0037_sudoku_solver/sudoku_solver.c:47
↓ 1 callersFunctionsortArray
0912_sort_an_array/sort.c:102
↓ 1 callersFunctionsortColors
0075_sort_colors/sort_colors.c:13
↓ 1 callersFunctionsortList
0148_sort_list/sort_list.c:39
↓ 1 callersFunctionsortedArrayToBST
0108_convert_sorted_array_to_binary_search_tree/bst_convert.c:24
↓ 1 callersFunctionspiralOrder
** Note: The returned array must be malloced, assume caller calls free(). **/
0054_spiral_matrix/spiral_matrix.c:8
↓ 1 callersFunctionstrStr
0028_implement_strstr/strstr.c:6
↓ 1 callersFunctionsumNumbers
0129_sum_root_to_leaf_numbers/sum_tree.c:30
↓ 1 callersFunctionswap
0023_merge_k_sorted_lists/merge_lists.c:17
↓ 1 callersFunctionswapPairs
0024_swap_nodes_in_pairs/swap_nodes.c:9
↓ 1 callersFunctionthreeSum
** Return an array of arrays of size *returnSize. ** Note: The returned array must be malloced, assume caller calls free(). **/
0015_three_sum/three_sum.c:34
↓ 1 callersFunctionthreeSumClosest
0016_three_sum_closest/three_sum_closest.c:11
↓ 1 callersFunctiontitleToNumber
0171_excel_sheet_column_number/sheet_column.c:4
↓ 1 callersFunctiontop
0051_n_queens/n_queens.c:30
↓ 1 callersFunctiontop
0052_n_queens_ii/n_queens.c:31
↓ 1 callersFunctiontotalNQueens
0052_n_queens_ii/n_queens.c:57
↓ 1 callersFunctiontrap
0042_trapping_rain_water/trap_water.c:5
↓ 1 callersFunctiontraverse
0094_binary_tree_inorder_traversal/bst_inorder_traversal.c:10
↓ 1 callersFunctiontraverse
0230_kth_smallest_element_in_a_bst/kth_bst.c:11
↓ 1 callersFunctiontraverse
0148_sort_list/sort_list.c:9
↓ 1 callersFunctiontraverse
0101_symmetric_tree/symmetric_tree.c:11
↓ 1 callersFunctiontrieFree
0208_implement_trie/trie.c:66
↓ 1 callersFunctiontrieStartsWith
Returns if there is any word in the trie that starts with the given prefix. */
0208_implement_trie/trie.c:49
↓ 1 callersFunctiontrie_insert
0212_word_search_ii/word_search.c:21
↓ 1 callersFunctiontrie_remove
0212_word_search_ii/word_search.c:35
↓ 1 callersFunctiontwo_sum
0015_three_sum/three_sum.c:10
↓ 1 callersFunctiontwosum
0001_two_sum/two_sum.c:15
↓ 1 callersFunctionufs_connected
0990_satisfiability_of_equality_equations/equality_equations.c:38
↓ 1 callersFunctionufs_init
0990_satisfiability_of_equality_equations/equality_equations.c:11
↓ 1 callersFunctionufs_union
0990_satisfiability_of_equality_equations/equality_equations.c:28
↓ 1 callersFunctionuniquePaths
0062_unique_path/unique_path.c:4
↓ 1 callersFunctionuniquePathsWithObstacles
0063_unique_paths_ii/unique_path.c:4
↓ 1 callersFunctionvalid
0093_restore_ip_addresses/ip_addr.c:6
↓ 1 callersFunctionwordBreak
* Return an array of size *returnSize. * Note: The returned array must be malloced, assume caller calls free(). */
0140_word_break_ii/word_break.c:109
↓ 1 callersFunctionwordBreak
0139_word_break/word_break.c:31
← previousnext →401–500 of 962, ranked by callers