Skip to content

Latest commit

 

History

History

leetcode

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
1.two_sum
1.two_sum
 
 
10.regular_expression_matching
10.regular_expression_matching
 
 
100.same_tree
100.same_tree
 
 
1008.construct_binary_search_tree_from_preorder_traversal
1008.construct_binary_search_tree_from_preorder_traversal
 
 
101.symmetric_tree
101.symmetric_tree
 
 
1019.next_greater_node_in_linked_list
1019.next_greater_node_in_linked_list
 
 
102.binary_tree_level_order_traversal
102.binary_tree_level_order_traversal
 
 
1021.remove_outermost_parentheses
1021.remove_outermost_parentheses
 
 
1025.divisor_game
1025.divisor_game
 
 
103.binary_tree_zigzag_level_order_traversal
103.binary_tree_zigzag_level_order_traversal
 
 
1036.rotting_oranges
1036.rotting_oranges
 
 
104.maximum_depth_of_binary_tree
104.maximum_depth_of_binary_tree
 
 
1048.longest_string_chain
1048.longest_string_chain
 
 
105.construct_binary_tree_from_preorder_and_inorder_traversal
105.construct_binary_tree_from_preorder_and_inorder_traversal
 
 
107.binary_tree_level_order_traversal_ii
107.binary_tree_level_order_traversal_ii
 
 
108.convert_sorted_array_to_binary_search_tree
108.convert_sorted_array_to_binary_search_tree
 
 
109.convert_sorted_list_to_binary_search_tree
109.convert_sorted_list_to_binary_search_tree
 
 
11.container_with_most_water
11.container_with_most_water
 
 
110.balanced_binary_tree
110.balanced_binary_tree
 
 
111.minimum_depth_of_binary_tree
111.minimum_depth_of_binary_tree
 
 
1110.delete_nodes_and_return_forest
1110.delete_nodes_and_return_forest
 
 
112.path_sum
112.path_sum
 
 
113.path_sum_ii
113.path_sum_ii
 
 
1130.minimum_cost_tree_from_leaf_values
1130.minimum_cost_tree_from_leaf_values
 
 
114.flatten_binary_tree_to_linked_list
114.flatten_binary_tree_to_linked_list
 
 
116.populating_next_right_pointers_in_each_node
116.populating_next_right_pointers_in_each_node
 
 
1162.as_far_from_land_as_possible
1162.as_far_from_land_as_possible
 
 
120.triangle
120.triangle
 
 
121.best_time_to_buy_and_sell_stock
121.best_time_to_buy_and_sell_stock
 
 
1235.maximum_profit_in_job_scheduling
1235.maximum_profit_in_job_scheduling
 
 
124.binary_tree_maximum_path_sum
124.binary_tree_maximum_path_sum
 
 
1249.minimum_remove_to_make_valid_parentheses
1249.minimum_remove_to_make_valid_parentheses
 
 
126.word_ladder_ii
126.word_ladder_ii
 
 
127.word_ladder
127.word_ladder
 
 
1290.convert_binary_number_in_a_linked_list_to_integer
1290.convert_binary_number_in_a_linked_list_to_integer
 
 
13.roman_to_integer
13.roman_to_integer
 
 
1300.critical_connections_in_a_network
1300.critical_connections_in_a_network
 
 
132.palindrome_partitioning_ii
132.palindrome_partitioning_ii
 
 
1326.minimum_number_of_taps_to_open_to_water_a_garden
1326.minimum_number_of_taps_to_open_to_water_a_garden
 
 
133.clone_graph
133.clone_graph
 
 
1353.maximum_number_of_events_that_can_be_attended
1353.maximum_number_of_events_that_can_be_attended
 
 
136.single_number
136.single_number
 
 
137.single_number_ii
137.single_number_ii
 
 
138.copy_list_with_random_pointer
138.copy_list_with_random_pointer
 
 
139.word_break
139.word_break
 
 
14.longest_common_prefix
14.longest_common_prefix
 
 
140.word_break_ii
140.word_break_ii
 
 
141.linked_list_cycle
141.linked_list_cycle
 
 
142.linked_list_cycle_ii
142.linked_list_cycle_ii
 
 
143.reorder_list
143.reorder_list
 
 
146.lru_cache
146.lru_cache
 
 
1470.shuffle_the_array
1470.shuffle_the_array
 
 
148.sort_list
148.sort_list
 
 
1480.running_sum_of_1d_array
1480.running_sum_of_1d_array
 
 
15.3sum
15.3sum
 
 
150.evaluate_reverse_polish_notation
150.evaluate_reverse_polish_notation
 
 
1504.count_submatrices_with_all_ones
1504.count_submatrices_with_all_ones
 
 
151.reverse_words_in_a_string
151.reverse_words_in_a_string
 
 
1512._number_of_good_pairs
1512._number_of_good_pairs
 
 
152.maximum_product_subarray
152.maximum_product_subarray
 
 
153.find_minimum_in_rotated_sorted_array
153.find_minimum_in_rotated_sorted_array
 
 
154.find_minimum_in_rotated_sorted_array_ii
154.find_minimum_in_rotated_sorted_array_ii
 
 
155.min_stack
155.min_stack
 
 
158.read_n_characters_given_read4_ii_-_call_multiple_times
158.read_n_characters_given_read4_ii_-_call_multiple_times
 
 
16.3_sum_closest
16.3_sum_closest
 
 
160.intersection_of_two_linked_lists
160.intersection_of_two_linked_lists
 
 
162.find_peak_element
162.find_peak_element
 
 
1651.shuffle_string
1651.shuffle_string
 
 
1652.bulb_switcher_iv
1652.bulb_switcher_iv
 
 
1653.number_of_good_leaf_nodes_pairs
1653.number_of_good_leaf_nodes_pairs
 
 
1658.minimum_swaps_to_arrange_a_binary_grid
1658.minimum_swaps_to_arrange_a_binary_grid
 
 
1659.get_the_maximum_score
1659.get_the_maximum_score
 
 
167.two_sum_ii_-_input_array_is_sorted
167.two_sum_ii_-_input_array_is_sorted
 
 
17.letter_combinations_of_a_phone_number
17.letter_combinations_of_a_phone_number
 
 
173.binary_search_tree_iterator
173.binary_search_tree_iterator
 
 
174.dungeon_game
174.dungeon_game
 
 
18.4sum
18.4sum
 
 
19.remove_nth_node_from_end_of_list
19.remove_nth_node_from_end_of_list
 
 
190.reverse_bits
190.reverse_bits
 
 
191.number_of_1_bits
191.number_of_1_bits
 
 
198.house_robber
198.house_robber
 
 
199.binary_tree_right_side_view
199.binary_tree_right_side_view
 
 
2.add_two_numbers
2.add_two_numbers
 
 
20.valid_parentheses
20.valid_parentheses
 
 
200.number_of_islands
200.number_of_islands
 
 
201.bitwise_and_of_numbers_range
201.bitwise_and_of_numbers_range
 
 
202.happy_number
202.happy_number
 
 
203.remove_linked_list_elements
203.remove_linked_list_elements
 
 
206.reverse_linked_list
206.reverse_linked_list
 
 
207.course_schedule
207.course_schedule
 
 
21.merge_two_sorted_lists
21.merge_two_sorted_lists
 
 
210.course_schedule_ii
210.course_schedule_ii
 
 
214.shortest_palindrome
214.shortest_palindrome
 
 
215_kth_largest_element_in_an_array
215_kth_largest_element_in_an_array
 
 
22.generate_parentheses
22.generate_parentheses
 
 
221.maximal_square
221.maximal_square
 
 
222.count_complete_tree_nodes
222.count_complete_tree_nodes
 
 
225.implement_stack_using_queues
225.implement_stack_using_queues
 
 
226.invert_binary_tree
226.invert_binary_tree
 
 
227.basic_calculator_ii
227.basic_calculator_ii
 
 

README.md

Talk is cheap. Show me the code.

close