Functions — github.com/RealHacker/leetcode-solutions

MethodaddNum

:type val: int :rtype: void

352_data_stream_disjoint_intervals/352.py:15

MethodaddNum

Adds a num into the data structure. :type num: int :rtype: void

295_find_median_from_data_stream/median.py:11

MethodaddOperators

:type num: str :type target: int :rtype: List[str]

282_expression_add_operators/expression_add_operators_TLE.py:2

MethodaddOperators

:type num: str :type target: int :rtype: List[str]

282_expression_add_operators/expression_add_operators.py:2

MethodaddTwoNumbers

:type l1: ListNode :type l2: ListNode :rtype: ListNode

002_add_two_numbers/add_two_numbers.py:2

MethodaddWord

(self, word)

211_add_and_search_word/add_and_search_ds.py:11

Methodajacent

(self, pos1, pos2)

079_word_search/word_search_TLE.py:18

Methodajacent

(self, pos1, pos2)

079_word_search/word_search.py:17

MethodalienOrder

:type words: List[str] :rtype: str

269_alien_dictionary/dictionary.py:2

MethodallWordsFound

(d)

030_substring_with_cancatenation_all_words/substring_concat_all_words_TLE.py:17

Methodanagrams

(self, strs)

049_group_anagrams/anagrams.py:5

Methodbacktrack

()

010_regular_expression_matching/regular_expression_matching.py:38

MethodbinaryTreePaths

:type root: TreeNode :rtype: List[str]

257_binary_tree_paths/binary_tree_paths.py:9

MethodbuildTree

:type preorder: List[int] :type inorder: List[int] :rtype: TreeNode

105_construct_bt_from_preorder_inorder/contruct_binary_tree_from_preorder_inorder.py:9

MethodbuildTree

:type inorder: List[int] :type postorder: List[int] :rtype: TreeNode

106_construct_bt_from_postorder_inorder/construct_binary_tree_from_inorder_postorder.py:9

MethodbulbSwitch

:type n: int :rtype: int

319_bulb_switcher/bulb_switcher.py:3

Methodcalculate

:type s: str :rtype: int

227_basic_calculator_ii/basic_calculator_ii_take2.py:2

Methodcalculate

(self, s)

227_basic_calculator_ii/basic_calculator_ii.py:11

Methodcalculate

:type s: str :rtype: int

224_basic_calculator/cal.py:15

MethodcalculateMinimumHP

:type dungeon: List[List[int]] :rtype: int

174_dungeon_game/dungeon_game.py:2

MethodcanAttendMeetings

:type intervals: List[Interval] :rtype: bool

252_meeting_rooms/meeting_rooms.py:9

MethodcanCompleteCircuit

:type gas: List[int] :type cost: List[int] :rtype: int

134_gas_station/gas_station.py:2

MethodcanFinish

(self, numCourses, prerequisites)

207_course_schedule/course_schedule.py:5

MethodcanPermutePalindrome

:type s: str :rtype: bool

266_palindrome_permutation/permutation.py:3

MethodcanReach

(i)

055_jump_game/jump_game_TLE.py:6

MethodcanWin

:type s: str :rtype: bool

294_flip_game_ii/flip.py:2

MethodcanWinNim

:type n: int :rtype: bool

292_nim_game/vim.py:3

MethodcanWinNim

:type n: int :rtype: bool

292_nim_game/nim_naive.py:3

Methodcandy

:type ratings: List[int] :rtype: int

135_candies/candy.py:2

Methodcandy

:type ratings: List[int] :rtype: int

135_candies/candy_graph.py:3

Methodcheck_distance_t

(i)

220_contains_duplicate_iii/contains_duplicate_iii.py:10

MethodclimbStairs

(self, n)

070_climbing_stairs/climb_stairs.py:4

MethodcloneGraph

(self, node)

133_clone_graph/clone_graph.py:10

MethodclosestKValues

:type root: TreeNode :type target: float :type k: int :rtype: List[int]

272_closest_binary_search_tree_values/closest.py:9

MethodclosestValue

:type root: TreeNode :type target: float :rtype: int

270_closest_binary_search_tree_value/closest.py:9

MethodcoinChange

:type coins: List[int] :type amount: int :rtype: int

322_coin_change/coin_change_TLE.py:3

MethodcoinChange

:type coins: List[int] :type amount: int :rtype: int

322_coin_change/coin_change_TLE2.py:4

MethodcombinationSum

:type candidates: List[int] :type target: int :rtype: List[List[int]]

039_combination_sum/combination_sum.py:2

MethodcombinationSum2

:type candidates: List[int] :type target: int :rtype: List[List[int]]

040_combination_sum_ii/combination_sum_ii.py:3

MethodcombinationSum3

:type k: int :type n: int :rtype: List[List[int]]

216_combination_sum_iii/combination_sum_iii.py:2

Methodcombine

:type n: int :type k: int :rtype: List[List[int]]

077_combinations/combinations.py:2

MethodcomputeArea

(self, A, B, C, D, E, F, G, H)

223_rectangle_area/rectangle_area.py:11

Methodconnect

:type root: TreeLinkNode :rtype: nothing

116_populating_next_right_pointers_in_each_node/populating_next_right_pointers.py:10

Methodconnect

:type root: TreeLinkNode :rtype: nothing

117_populating_next_right_pointers_in_each_node_ii/populating_next_right_ii.py:10

MethodcontainsDuplicate

(self, nums)

217_contains_duplicate/contains_duplicate.py:4

MethodcontainsNearbyAlmostDuplicate

:type nums: List[int] :type k: int :type t: int :rtype: bool

220_contains_duplicate_iii/contains_duplicate_iii_TLE.py:2

MethodcontainsNearbyAlmostDuplicate

:type nums: List[int] :type k: int :type t: int :rtype: bool

220_contains_duplicate_iii/contains_duplicate_iii.py:2

MethodcontainsNearbyDuplicate

(self, nums, k)

219_contains_duplicate_ii/contains_duplicate_ii.py:6

Methodconvert

(p)

051_n_queens/n_queens.py:22

Methodconvert

(self, s, numRows)

006_zigzag_conversion/zigzag.py:6

MethodconvertToTitle

:type n: int :rtype: str

168_excel_sheet/excel_sheet_column_title_take2.py:2

MethodcopyRandomList

:type head: RandomListNode :rtype: RandomListNode

138_copy_list_with_random_pointer/copy_node_list_random.py:9

MethodcountAndSay

(self, n)

038_count_and_say/count_and_say.py:4

MethodcountBits

:type num: int :rtype: List[int]

338_counting_bits/338_counting_bits.py:2

MethodcountComponents

:type n: int :type edges: List[List[int]] :rtype: int

323_number_of_connected_components/components.py:4

MethodcountDigitOne

:type n: int :rtype: int

233_number_of_digit_one/number_of_digit_one.py:2

MethodcountNodes

:type root: TreeNode :rtype: int

222_count_complete_tree_nodes/count_complete_tree_nodes_take2.py:9

MethodcountNodes

(self, root)

222_count_complete_tree_nodes/count_complete_tree_nodes.py:11

MethodcountPrimes

:type n: int :rtype: int

204_count_primes/count_primes.py:2

MethodcountRangeSum

:type nums: List[int] :type lower: int :type upper: int :rtype: int

327_count_of_range_sum/count_of_range_sum.py:2

MethodcountSmaller

:type nums: List[int] :rtype: List[int]

315_count_of_smaller_numbers/count_of_smaller_numbers.py:2

MethodcountSmaller

:type nums: List[int] :rtype: List[int]

315_count_of_smaller_numbers/count_of_smaller_numbers_TLE.py:2

MethodcountUnivalSubtrees

:type root: TreeNode :rtype: int

250_count_univalue_subtrees/univalue_subtrees.py:9

Methoddecode

Decodes a single string to a list of strings. :type s: str :rtype: List[str]

271_encode_and_decode_strings/encode_and_decode.py:14

MethoddeleteDuplicates

:type head: ListNode :rtype: ListNode

083_remove_duplicates_from_sorted_list_ii/remove-duplicates-from-sorted-list.py:8

MethoddeleteDuplicates

:type head: ListNode :rtype: ListNode

082_remove_duplicates_from_sorted_list/remove_duplicates_from_sorted_list.py:8

MethoddeleteNode

(self, node)

237_delete_node_in_linked_list/delete_node_in_linked_list.py:16

MethoddepthSum

:type nestedList: List[NestedInteger] :rtype: int

339_nested_list_weighted_sum/weight_sum.py:27

Methoddeserialize

Decodes your encoded data to tree. :type data: str :rtype: TreeNode

297_serialize_and_deserialize_binary_tree/serialize_and_desialize_binary_tree_MLE.py:26

Methoddeserialize

Decodes your encoded data to tree. :type data: str :rtype: TreeNode

297_serialize_and_deserialize_binary_tree/serialize_and_desialize_binary_tree.py:31

MethoddetectCycle

:type head: ListNode :rtype: ListNode

142_linked_list_cycle_ii/linked_list_cycle_ii.py:3

Methoddiff

(word1, word2)

127_word_ladder/word_ladder.py:10

Methoddiff

(word1, word2)

127_word_ladder/word_ladder_TLE.py:9

Methoddiff

(word1, word2)

126_word_ladder_ii/word_ladder_ii_TLE.py:10

MethoddiffWaysToCompute

(self, input)

241_different_ways_to_add_parenthesis/different_ways_to_add_parenthesis.py:7

MethoddiffWaysToCompute

:type input: str :rtype: List[int]

241_different_ways_to_add_parenthesis/different_ways_to_add_parenthesis_take2.py:2

Methoddp

(x, y)

329_longest_increasing_path/longest_increasing_path.py:15

Methodempty

(self)

225_impl_stack_using_queues/stack_using_queues.py:30

Methodempty

:rtype: bool

225_impl_stack_using_queues/stack_using_queues_take2.py:40

Methodempty

(self)

232_make_queue_using_stacks/queue_using_stacks.py:41

Methodencode

Encodes a list of strings to a single string. :type strs: List[str] :rtype: str

271_encode_and_decode_strings/encode_and_decode.py:3

MethodevalRPN

:type tokens: List[str] :rtype: int

150_evaluate_reverse_polish/evaluate_reverse_polish_notation.py:2

Methodexist

:type board: List[List[str]] :type word: str :rtype: bool

079_word_search/word_search_TLE.py:6

Methodexist

:type board: List[List[str]] :type word: str :rtype: bool

079_word_search/word_search.py:5

MethodfindCelebrity

(self, n)

277_find_the_celebrity/celebrity.py:8

MethodfindDuplicate

:type nums: List[int] :rtype: int

287_finding_duplicate_number/find_the_duplicate_number.py:315

MethodfindItinerary

:type tickets: List[List[str]] :rtype: List[str]

332_reconstruct_itinerary/332_reconstruct_itinerary.py:2

MethodfindKthLargest

(self, nums, k)

215_kth_element_in_array/kth_largest.py:9

MethodfindKthLargest

:type nums: List[int] :type k: int :rtype: int

215_kth_element_in_array/no_cheat.py:2

MethodfindLadders

:type beginWord: str :type endWord: str :type wordList: Set[str] :rtype: int

126_word_ladder_ii/word_ladder_ii_TLE.py:3

MethodfindMedian

Returns the median of current data stream :rtype: float

295_find_median_from_data_stream/median.py:36

MethodfindMedianSortedArrays

:type nums1: List[int] :type nums2: List[int] :rtype: float

004_median_of_2_sorted_arrays/median_sorted_arrays.py:14

MethodfindMedianSortedArrays

:type nums1: List[int] :type nums2: List[int] :rtype: float

004_median_of_2_sorted_arrays/median_of_2_sorted_arrays_TLE.py:4

MethodfindMedianSortedArrays

(self, nums1, nums2)

004_median_of_2_sorted_arrays/median_of_2_sorted_arrays.py:2

MethodfindMin

:type nums: List[int] :rtype: int

153_find_minimum_rotated_sorted_array/minimum_in_rotated_sorted.py:2

MethodfindMin

:type nums: List[int] :rtype: int

154_find_minimum_in_rotated_array_ii/find.py:2

MethodfindMinHeightTrees

:type n: int :type edges: List[List[int]] :rtype: List[int]

310_minimum_height_trees/mininum_height_trees.py:2

MethodfindMissingRanges

:type nums: List[int] :type lower: int :type upper: int :rtype: List[str]

163_find_missing_ranges/find_missing_ranges.py:2

MethodfindOrder

:type numCourses: int :type prerequisites: List[List[int]] :rtype: List[int]

210_course_schedule_ii/course_schedule_ii.py:2

MethodfindPeakElement

(self, nums)

162_peak_element/find_peak_element.py:4

Functions604 in github.com/RealHacker/leetcode-solutions