MCPcopy Create free account

hub / github.com/austingebauer/go-leetcode / functions

Functions430 in github.com/austingebauer/go-leetcode

⨍ Functions 430◇ Types & classes 142
↓ 1 callersFunctionremoveNthFromEnd
(head *ListNode, n int)
remove_nth_node_from_end_of_list_19/solution.go:5
↓ 1 callersFunctionreorderList
(head *ListNode)
reorder_list_143/solution.go:5
↓ 1 callersFunctionreorderLogFiles
(logs []string)
reorder_data_in_log_files_937/solution.go:8
↓ 1 callersFunctionreverse
(x int)
reverse_integer_7/solution.go:5
↓ 1 callersFunctionreverse
(a []string)
reverse_words_in_a_string_151/solution.go:68
↓ 1 callersFunctionreverseBits
(num uint32)
reverse_bits_190/solution.go:3
↓ 1 callersFunctionreverseList
Returns a pointer to a list that is the reverse of the passed head. This function prepends the first n values in the passed list into a new list and r
reverse_linked_list_206/solution.go:8
↓ 1 callersFunctionreverseStr
(s string, k int)
reverse_string_ii_541/solution.go:5
↓ 1 callersFunctionreverseString
(s []byte)
reverse_string_344/solution.go:3
↓ 1 callersFunctionreverseWords
Note: solution using a single string with which tokens are prepended into.
reverse_words_in_a_string_151/solution.go:6
↓ 1 callersFunctionreverseWordsArrayReversal
Note: First, correct, and optimal runtime solution using an array for tokens and reversing the array.
reverse_words_in_a_string_151/solution.go:37
↓ 1 callersFunctionrob
(nums []int)
house_robber_ii_213/solution.go:5
↓ 1 callersFunctionrob
Solved alone for second time. Better solution.
house_robber_198/solution.go:6
↓ 1 callersFunctionrob0
(nums []int)
house_robber_198/solution.go:24
↓ 1 callersFunctionromanToInt
(s string)
roman_to_integer_13/solution.go:3
↓ 1 callersFunctionrotate
(matrix [][]int)
rotate_image_48/solution.go:3
↓ 1 callersFunctionrotateString
(A string, B string)
rotate_string_796/solution.go:3
↓ 1 callersFunctionsearch
(nums []int, target int)
search_in_rotated_sorted_array_33/solution.go:3
↓ 1 callersFunctionsetZeroes
(matrix [][]int)
set_matrix_zeros_73/solution.go:5
↓ 1 callersFunctionsingleNumber
NOTE: bitwise XOR arithmetic operator used to find single digit n XOR 0 = n n XOR n = 0 So, for [2,2,1]: a = 0 ^ 2 = 2 a = 2 ^ 2 = 0 a = 0 ^ 1 = 1 =
single_number_136/solution.go:16
↓ 1 callersFunctionsingleNumber2
(nums []int)
single_number_136/solution.go:24
↓ 1 callersFunctionsortString
(s string)
group_anagrams_49/solution.go:65
↓ 1 callersFunctionspiralOrder
(matrix [][]int)
spiral_matrix_54/solution.go:3
↓ 1 callersFunctionsumZero
Time: O(n) Space: O(n) (output space)
find_n_unique_integers_sum_up_to_zero_1304/solution.go:5
↓ 1 callersFunctionsumZeroNoAppend
(n int)
find_n_unique_integers_sum_up_to_zero_1304/solution.go:21
↓ 1 callersFunctionthreeSum
(nums []int)
three_sum_15/solution.go:5
↓ 1 callersFunctiontitleToNumber
(s string)
excel_sheet_column_number_171/solution.go:5
↓ 1 callersFunctiontopKFrequent
Time: O(n) Space: O(n)
top_k_frequent_elements_347/solution.go:33
↓ 1 callersFunctiontrap
(height []int)
trapping_rain_water_42/solution.go:5
↓ 1 callersFunctiontrap2
trap2 worked, but ran out of memory on leetcode. This was my first pass at the problem. I didn't think clearly enough about the memory, which could've
trapping_rain_water_42/solution.go:38
↓ 1 callersFunctiontwoSum
twoSum does not assume that nums is sorted.
two_sum_1/solution.go:4
↓ 1 callersFunctionvalidParens
(s string)
generate_parentheses_22/solution.go:25
↓ 1 callersFunctionvalidTicTacToe
(board []string)
valid_tic_tac_toe_state_794/solution.go:7
↓ 1 callersFunctionvalidTree
(n int, edges [][]int)
graph_valid_tree_261/solution.go:3
↓ 1 callersFunctionwatchedVideosByFriends
Note: study again.
get_watched_videos_by_your_friends_1311/solution.go:6
↓ 1 callersFunctionwordBreak
Note: study again. DP.
word_break_139/solution.go:4
↓ 1 callersFunctionwordBreak0
Recursive solution, which exceeds the time limit.
word_break_139/solution.go:36
↓ 1 callersFunctionwordBreakHelper
(s string, wordDictSet map[string]bool, start int)
word_break_139/solution.go:46
↓ 1 callersFunctionxorQueries
(arr []int, queries [][]int)
xor_queries_of_a_subarray_1310/solution.go:3
FunctionConstructor
(names []string, columns []int)
design_sql_2408/solution.go:18
MethodExp
(name string)
design_sql_2408/solution.go:73
MethodIns
(name string, row []string)
design_sql_2408/solution.go:34
MethodLen
()
find_median_from_data_stream_295/solution.go:28
MethodLen
()
top_k_frequent_elements_347/solution.go:12
MethodLess
(i, j int)
find_median_from_data_stream_295/solution.go:10
MethodLess
(i, j int)
find_median_from_data_stream_295/solution.go:31
MethodLess
(i, j int)
top_k_frequent_elements_347/solution.go:15
MethodPop
()
find_median_from_data_stream_295/solution.go:40
MethodPush
(x interface{})
find_median_from_data_stream_295/solution.go:37
MethodRmv
(name string, rowId int)
design_sql_2408/solution.go:45
MethodSel
(name string, rowId int, columnId int)
design_sql_2408/solution.go:55
MethodSwap
(i, j int)
find_median_from_data_stream_295/solution.go:13
MethodSwap
(i, j int)
find_median_from_data_stream_295/solution.go:34
MethodSwap
(i, j int)
top_k_frequent_elements_347/solution.go:18
FunctionTestEncodeAndDecode
(t *testing.T)
encode_and_decode_strings_271/solution_test.go:8
FunctionTestIterator
(t *testing.T)
flatten_nested_list_iterator_341/solution_test.go:9
FunctionTestKV
(t *testing.T)
time_based_key_value_store_981/solution_test.go:9
FunctionTestLRUCache_1
(t *testing.T)
lru_cache_146/solution_test.go:8
FunctionTestLRUCache_2
(t *testing.T)
lru_cache_146/solution_test.go:23
FunctionTestLRUCache_3
* ["LRUCache","put","get","put","get","get"] [[1],[2,1],[2],[3,2],[2],[3]] */
lru_cache_146/solution_test.go:33
FunctionTestLRUCache_4
* ["LRUCache","put","put","get","put","put","get"] [[2],[2,1],[2,2],[2],[1,1],[4,1],[2]] */
lru_cache_146/solution_test.go:47
FunctionTestLRUCache_5
* ["LRUCache","put","put","put","put","get","get"] [[2],[2,1],[1,1],[2,3],[4,1],[1],[2]] Output: [null,null,null,null,null,1,-1] Expected: [null,nul
lru_cache_146/solution_test.go:60
FunctionTestLRUCache_6
* ["LRUCache","put","put","get","put","put","get"] [[2],[2,1],[2,2],[2],[1,1],[4,1],[2]] Output: [null,null,null,null,null,1,-1] Expected: [null,nul
lru_cache_146/solution_test.go:78
FunctionTestLRUCache_7
* ["LRUCache","get","put","get","put","put","get","get"] [[2],[2],[2,6],[1],[1,5],[1,2],[1],[2]] */
lru_cache_146/solution_test.go:92
FunctionTestLRUCache_8
* ["LRUCache","put","put","put","put","get","get","get","get","put","get","get","get","get","get"] [[3],[1,1],[2,2],[3,3],[4,4],[4],[3],[2],[1],[5,5],
lru_cache_146/solution_test.go:109
FunctionTestMedianFinder_0
(t *testing.T)
find_median_from_data_stream_295/solution_test.go:8
FunctionTestMedianFinder_1
(t *testing.T)
find_median_from_data_stream_295/solution_test.go:18
FunctionTestMinStack_1
(t *testing.T)
min_stack_155/solution_test.go:8
FunctionTestMovingAverageFromDataStream
(t *testing.T)
moving_average_from_data_stream_346/solution_test.go:8
FunctionTestTicTacToeBackwardDiagonalWin
(t *testing.T)
design_tic_tac_toe_348/solution_test.go:70
FunctionTestTicTacToeForwardDiagonalWin
(t *testing.T)
design_tic_tac_toe_348/solution_test.go:61
FunctionTestTicTacToeNoWins
(t *testing.T)
design_tic_tac_toe_348/solution_test.go:48
FunctionTestTicTacToeOWinsCol
(t *testing.T)
design_tic_tac_toe_348/solution_test.go:38
FunctionTestTicTacToeOWinsRow
(t *testing.T)
design_tic_tac_toe_348/solution_test.go:28
FunctionTestTicTacToeXWinsCol
(t *testing.T)
design_tic_tac_toe_348/solution_test.go:19
FunctionTestTicTacToeXWinsRow
(t *testing.T)
design_tic_tac_toe_348/solution_test.go:8
FunctionTestTrie
(t *testing.T)
implement_trie_208/solution_test.go:8
FunctionTestValidTree
(t *testing.T)
graph_valid_tree_261/solution_test.go:8
FunctionTest_addTwoNumbers
(t *testing.T)
add_two_numbers_2/solution_test.go:9
FunctionTest_alienOrder
(t *testing.T)
alien_dictionary_269/solution_test.go:8
FunctionTest_buildTree
(t *testing.T)
construct_binary_tree_from_preorder_and_inorder_traversal_105/solution_test.go:9
FunctionTest_canAttendMeetings
(t *testing.T)
meeting_rooms_252/solution_test.go:8
FunctionTest_canFinish
(t *testing.T)
course_schedule_207/solution_test.go:8
FunctionTest_canPartitionKSubsets
(t *testing.T)
partition_to_k_equal_sum_subsets_698/solution_test.go:8
FunctionTest_characterReplacement
(t *testing.T)
longest_repeating_character_replacement_424/solution_test.go:8
FunctionTest_climbStairs
(t *testing.T)
climbing_stairs_70/solution_test.go:8
FunctionTest_coinChange
(t *testing.T)
coin_change_322/solution_test.go:8
FunctionTest_combinationSum4
(t *testing.T)
combination_sum_iv_377/solution_test.go:8
FunctionTest_containsDuplicate
(t *testing.T)
contains_duplicate_217/solution_test.go:8
FunctionTest_countAndSay
(t *testing.T)
count_and_say_38/solution_test.go:8
FunctionTest_countBits
(t *testing.T)
counting_bits_338/solution_test.go:8
FunctionTest_countSubstrings
(t *testing.T)
palindromic_substrings_647/solution_test.go:8
FunctionTest_criticalConnections
(t *testing.T)
critical_connections_in_a_network_1192/solution_test.go:8
FunctionTest_deleteNode
(t *testing.T)
delete_node_in_a_linked_list_237/solution_test.go:9
FunctionTest_dietPlanPerformance
(t *testing.T)
diet_plan_performance_1176/solution_test.go:8
FunctionTest_distributeCandies
(t *testing.T)
distribute_candies_575/solution_test.go:8
FunctionTest_eraseOverlapIntervals
(t *testing.T)
non_overlapping_intervals_435/solution_test.go:8
FunctionTest_exist
(t *testing.T)
word_search_79/solution_test.go:8
FunctionTest_fib
(t *testing.T)
fibonacci_number_509/solution_test.go:8
FunctionTest_findDifference
(t *testing.T)
find_the_difference_of_two_arrays_2215/solution_test.go:9
← previousnext →201–300 of 430, ranked by callers