MCPcopy Create free account

hub / github.com/Hubstation/challenges / functions

Functions536 in github.com/Hubstation/challenges

⨍ Functions 536◇ Types & classes 176
↓ 189 callersMethodsize
golang/find_median_from_data_stream/find_median_from_data_stream.cpp:47
↓ 22 callersFunctionDFS
(candidates []int, start int, target int, solution []int, results [][]int)
golang/combination_sum/combination_sum.go:12
↓ 18 callersFunctionmax
golang/find_median_from_data_stream/find_median_from_data_stream.cpp:55
↓ 14 callersFunctionhelper
(root *TreeNode, sum int, solution []int)
golang/path_sum_II/path_sum_II.go:13
↓ 11 callersMethodempty
golang/find_median_from_data_stream/find_median_from_data_stream.cpp:44
↓ 9 callersMethodpush
golang/min_stack/min_stack.cpp:11
↓ 9 callersMethodtop
golang/find_median_from_data_stream/find_median_from_data_stream.cpp:50
↓ 8 callersMethodinsert
Inserts a word into the trie.
golang/implement_trie/implement_trie.cpp:19
↓ 7 callersMethodinsert
(val int)
golang/insertion_sort_list/insertion_sort_list_test.go:7
↓ 7 callersFunctionmin
golang/find_median_from_data_stream/find_median_from_data_stream.cpp:60
↓ 6 callersMethodprint
golang/lru_cache/lru_cache.cpp:55
↓ 6 callersFunctionrob
(nums []int)
golang/house_robber_II/house_robber_II.go:3
↓ 5 callersMethodaddNum
Adds a number into the data structure.
golang/find_median_from_data_stream/find_median_from_data_stream.cpp:70
↓ 5 callersFunctionhash
(row, col, length int)
golang/number_of_islands/number_of_islands.go:59
↓ 5 callersMethodpush
golang/find_median_from_data_stream/find_median_from_data_stream.cpp:27
↓ 5 callersMethodtop
golang/min_stack/min_stack.cpp:24
↓ 4 callersMethodDFS
(i, j int)
golang/surrounded_regions/surrounded_regions.go:48
↓ 4 callersMethodempty
Return whether the queue is empty.
golang/implement_queue_using_stacks/implement_queue_using_stacks.cpp:36
↓ 4 callersFunctionmax
(i, j int)
golang/house_robber_II/house_robber_II.go:28
↓ 4 callersFunctionmin
(i, j int)
golang/edit_distance/edit_distance.go:40
↓ 4 callersFunctionnext
next goes to the next digit of l.
golang/challenge2/add-two-numbers.go:47
↓ 4 callersMethodpop
golang/min_stack/min_stack.cpp:17
↓ 4 callersMethodpop
golang/find_median_from_data_stream/find_median_from_data_stream.cpp:37
↓ 4 callersFunctionreverse
(nums []int, i, j int)
golang/rotate_array/rotate_array.go:11
↓ 3 callersMethodWorld
(ctx context.Context, in *Null, opts ...grpc.CallOption)
grpc/harsh/challenge1/protos/go/hello/hello.pb.go:221
↓ 3 callersFunctionadd
(a, b, c byte)
golang/add_binary/add_binary.go:28
↓ 3 callersFunctionfindKthNum
(nums1 []int, nums2 []int, k int)
golang/median_of_two_sorted_arrays/median_of_two_sorted_arrays.go:13
↓ 3 callersFunctiongenerateNodeList
(list []int)
golang/add_two_numbers/add_two_numbers_test.go:32
↓ 3 callersMethodget
golang/lru_cache/lru_cache.cpp:76
↓ 3 callersFunctionisDigit
(b byte)
golang/valid_number/valid_number.go:59
↓ 3 callersFunctionmax
(i, j int)
golang/rectangle_area/rectangle_area.go:21
↓ 3 callersFunctionmax
(i, j int)
golang/maximum_product_subarray/maximum_product_subarray.go:21
↓ 3 callersFunctionmin
(i, j int)
golang/dungeon_game/dungeon_game.go:38
↓ 3 callersMethodset
golang/lru_cache/lru_cache.cpp:85
↓ 3 callersMethodtop
Get the top element.
golang/implement_stack_using_queues/implement_stack_using_queues.cpp:22
↓ 2 callersFunctionBytesToInts
(bytes []byte)
golang/multiply_strings/multiply_strings.go:24
↓ 2 callersFunctionabs
(i int)
golang/three_sum_closest/three_sum_closest.go:40
↓ 2 callersFunctionbinarySearch
(nums []int, target, left, right int)
golang/search_in_rotated_sorted_array_II/search_in_rotated_sorted_array_II.go:52
↓ 2 callersFunctionbinarySearch
(nums []int, left, right, target int)
golang/search_in_rotated_sorted_array/search_in_rotated_sorted_array.go:46
↓ 2 callersFunctiondistance
golang/word_ladder/word_ladder.cpp:43
↓ 2 callersFunctiondivisor
(bits int)
golang/palindrome_number/palindrome_number.go:28
↓ 2 callersFunctionfile_hello_proto_rawDescGZIP
()
grpc/harsh/challenge1/protos/go/hello/hello.pb.go:136
↓ 2 callersFunctionfindPalindrome
(subRune []rune, i, j int)
golang/longest_palindromic_substring/longest_palindromic_substring.go:25
↓ 2 callersFunctionflatten
(root *TreeNode)
golang/flatten_binary_tree_to_linked_list/flatten_binary_tree_to_linked_list.go:9
↓ 2 callersFunctionhelper
(nums []int, i, j int)
golang/house_robber_II/house_robber_II.go:18
↓ 2 callersFunctionisAlpha
(b byte)
golang/valid_palindrome/valid_palindrome.go:44
↓ 2 callersFunctionmax
(i, j int)
golang/trapping_rain_water/trapping_rain_water.go:19
↓ 2 callersFunctionmin
(i, j int)
golang/ugly_number_II/ugly_number_II.go:25
↓ 2 callersFunctionmin
(i, j int)
golang/rectangle_area/rectangle_area.go:14
↓ 2 callersFunctionmin
(i, j int)
golang/maximum_product_subarray/maximum_product_subarray.go:28
↓ 2 callersFunctionmin
(i, j int)
golang/maximal_square/maximal_square.go:31
↓ 2 callersFunctionoperate
(i, j int, op byte)
golang/basic_calculator_II/basic_calculator_II.go:45
↓ 2 callersFunctionpriority
(op byte)
golang/basic_calculator_II/basic_calculator_II.go:35
↓ 2 callersMethodpush
Push element x to the back of queue.
golang/implement_queue_using_stacks/implement_queue_using_stacks.cpp:9
↓ 2 callersFunctionreverse
(head *ListNode)
golang/palindrome_lined_list/palindrome_lined_list.go:23
↓ 2 callersFunctionreverseNums
(nums []int)
golang/next_permutation/next_permutation.go:28
↓ 2 callersMethodsearchNode
golang/lowest_common_ancestor_of_a_binary_tree/lowest_common_ancestor_of_a_binary_tree.cpp:25
↓ 2 callersFunctionstep
(walk, head *ListNode, first bool, val int)
golang/add_two_numbers/add_two_numbers.go:36
↓ 2 callersFunctiontoLower
(b byte)
golang/valid_palindrome/valid_palindrome.go:37
↓ 2 callersMethodupdate
golang/lru_cache/lru_cache.cpp:43
↓ 1 callersFunctionDFS
(candidates []int, start int, target int, solution []int, results [][]int)
golang/combination_sum_II/combination_sum_II.go:12
↓ 1 callersFunctionDFS
(level int, start int, k int, n int, path []int)
golang/combinations_sum_III/combinations_sum_III.go:7
↓ 1 callersFunctionIntsToBytes
(ints []int)
golang/multiply_strings/multiply_strings.go:32
↓ 1 callersFunctionadd
( n1 , n2 * ListNode , I int )
golang/challenge2/add-two-numbers.go:54
↓ 1 callersMethodadd
golang/count_of_smaller_numbers_after_self/count_of_smaller_numbers_after_self.cpp:16
↓ 1 callersFunctionaddBinary
(a string, b string)
golang/add_binary/add_binary.go:3
↓ 1 callersFunctionaddTwoNumbers
(l1 *ListNode, l2 *ListNode)
golang/add_two_numbers/add_two_numbers.go:8
↓ 1 callersFunctionbinarySearch
(array []int, i, j, target int)
golang/search_a_2D_matrix/search_a_2D_matrix.go:20
↓ 1 callersFunctioncalculate
(num1, num2 int, op string)
golang/evaluate_reverse_polish_notation/evaluate_reverse_polish_notation.go:24
↓ 1 callersFunctioncombinationSum
(candidates []int, target int)
golang/combination_sum/combination_sum.go:7
↓ 1 callersFunctionconvert
(s string, numRows int)
golang/zigzag_conversion/zigzag_conversion.go:8
↓ 1 callersFunctioncountAndSay
(n int)
golang/count_and_say/count_and_say.go:3
↓ 1 callersFunctioncountAndSayInts
(n int)
golang/count_and_say/count_and_say.go:18
↓ 1 callersFunctionequal
(left, right *ListNode)
golang/add_two_numbers/add_two_numbers_test.go:48
↓ 1 callersFunctionexist
(board [][]byte, word string)
golang/word_search/word_search.go:3
↓ 1 callersFunctionfile_hello_proto_init
()
grpc/harsh/challenge1/protos/go/hello/hello.pb.go:159
↓ 1 callersFunctionfindLower
(nums []int, left, right, target int)
golang/search_for_a_range/search_for_a_range.go:33
↓ 1 callersFunctionfindMedianSortedArrays
(nums1 []int, nums2 []int)
golang/median_of_two_sorted_arrays/median_of_two_sorted_arrays.go:3
↓ 1 callersFunctionfindUpper
(nums []int, left, right, target int)
golang/search_for_a_range/search_for_a_range.go:53
↓ 1 callersFunctiongenerateCombinations
(slices [][]string)
golang/letter_combinations_of_a_phone_number/letter_combinations_of_a_phone_number.go:25
↓ 1 callersFunctiongenerateParenthesisI
(left, right, sum int)
golang/generate_parentheses/generate_parentheses.go:15
↓ 1 callersFunctiongenerateTreesI
(left, right int)
golang/unique_binary_search_trees_II/unique_binary_search_trees_II.go:16
↓ 1 callersFunctiongetPermutation
(n int, k int)
golang/permutation_sequence/permutation_sequence.go:3
↓ 1 callersFunctionhasCycle
(start int, graph map[int][]int, path []bool, visited []bool)
golang/course_schedule/course_schedule.go:54
↓ 1 callersFunctionhelper
(root *TreeNode, pre **TreeNode)
golang/flatten_binary_tree_to_linked_list/flatten_binary_tree_to_linked_list.go:15
↓ 1 callersFunctionhelper
(input string, cache map[string][]int)
golang/different_ways_to_add_parentheses/different_ways_to_add_parentheses.go:11
↓ 1 callersFunctionhelper
(nums []int, left, right int)
golang/find_minimum_in_rotated_sorted_array_II/find_minimum_in_rotated_sorted_array_II.go:7
↓ 1 callersFunctionhelper
(inorder []int, inL, inR int, postorder []int, postL, postR int, m map[int]int)
golang/construct_binary_tree_from_inorder_and_postorder_traversal/construct_binary_tree_from_inorder_and_postorder_traversal.go:17
↓ 1 callersFunctionhelper
(nums []int, i, j int)
golang/convert_sorted_array_to_binary_search_tree/convert_sorted_array_to_binary_search_tree.go:13
↓ 1 callersFunctionhelper
(head **ListNode, i, j int)
golang/convert_sorted_list_to_binary_search_tree/convert_sorted_list_to_binary_search_tree.go:24
↓ 1 callersFunctionhelper
(nums []int, i, j int)
golang/find_minimum_in_rotated_sorted_array/find_minimum_in_rotated_sorted_array.go:7
↓ 1 callersFunctionhelper
(preorder []int, preL, preR int, inorder []int, inL, inR int, m map[int]int)
golang/construct_binary_tree_from_preorder_and_inorder_traversal/construct_binary_tree_from_preorder_and_inorder_traversal.go:17
↓ 1 callersFunctionhelper
(root *TreeNode)
golang/kth_smallest_element_in_a_BST/kth_smallest_element_in_a_BST.go:23
↓ 1 callersFunctionhelper
(root *TreeNode)
golang/balanced_bianry_tree/balanced_bianry_tree.go:14
↓ 1 callersMethodhelper
(root *TreeNode, current int)
golang/sum_root_to_leaf_numbers/sum_root_to_leaf_numbers.go:19
↓ 1 callersMethodhelper
()
golang/binary_tree_paths/binary_tree_paths.go:27
↓ 1 callersMethodhelper
(root *TreeNode)
golang/binary_tree_maximum_path_sum/binary_tree_maximum_path_sum.go:20
↓ 1 callersFunctioninsertionSortList
(head *ListNode)
golang/insertion_sort_list/insertion_sort_list.go:8
↓ 1 callersFunctionintsPlus
(num1, num2 []int)
golang/multiply_strings/multiply_strings.go:64
↓ 1 callersFunctionisNumber
(s string)
golang/valid_number/valid_number.go:3
next →1–100 of 536, ranked by callers