GitHub - voidsatisfaction/leet_code_solutions: my own solutions of leetcode problems

Branches Tags

About

my own solutions of leetcode problems

Activity

0 stars

1 watching

0 forks

Report repository

Releases

No releases published

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

About

Uh oh!

Releases

Packages

Uh oh!

Contributors

Uh oh!

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 149 Commits
.gitignore		.gitignore
00_kmp.py		00_kmp.py
1008_medium_[binary_search_tree]_construct_binary_search_tree_from_preorder_traversal.py		1008_medium_[binary_search_tree]_construct_binary_search_tree_from_preorder_traversal.py
1010_medium_[set_and_math]_pairs_of_songs_with_total_durations_divisible_by_60.py		1010_medium_[set_and_math]_pairs_of_songs_with_total_durations_divisible_by_60.py
102_medium_[binary_tree_and_bfs]_binary_tree_level_order_traversal.py		102_medium_[binary_tree_and_bfs]_binary_tree_level_order_traversal.py
103_medium_[binary_tree]_binary_tree_zigzag_level_order_traversal.py		103_medium_[binary_tree]_binary_tree_zigzag_level_order_traversal.py
1041_medium_[sense]_robot_bounded_in_circle.py		1041_medium_[sense]_robot_bounded_in_circle.py
1048_medium_[dfs_dp]_longest_string_chain.py		1048_medium_[dfs_dp]_longest_string_chain.py
105_medium_[binary_tree]_construct_binary_tree_from_preorder_and_inorder_traversal.py		105_medium_[binary_tree]_construct_binary_tree_from_preorder_and_inorder_traversal.py
106_medium_[binary_tree]_construct_tree_from_inorder_postorder_traversal.py		106_medium_[binary_tree]_construct_tree_from_inorder_postorder_traversal.py
1088_hard_[dfs]_confusing_number2.py		1088_hard_[dfs]_confusing_number2.py
1110_medium_[binary_tree]_delete_nodes_and_return_forest.py		1110_medium_[binary_tree]_delete_nodes_and_return_forest.py
1114_easy_[concurrency]_print_in_order.py		1114_easy_[concurrency]_print_in_order.py
1115_medium_[threading]_print_foobar_alternatively.py		1115_medium_[threading]_print_foobar_alternatively.py
1146_medium_[hash_or_separate_chaining_binary_search]_snapshot_array.py		1146_medium_[hash_or_separate_chaining_binary_search]_snapshot_array.py
1152_medium_[brute_force]_analyze_user_website_visit_pattern.py		1152_medium_[brute_force]_analyze_user_website_visit_pattern.py
1177_medium_[prefix_sum]_can_make_palindrome_from_substring.py		1177_medium_[prefix_sum]_can_make_palindrome_from_substring.py
11_medium_[disjoint_set]_container_with_most_water.py		11_medium_[disjoint_set]_container_with_most_water.py
1202_medium_[disjoint_set]_smallest_string_with_swaps.py		1202_medium_[disjoint_set]_smallest_string_with_swaps.py
1259_hard_[dp]_handshakes_that_don_cross.py		1259_hard_[dp]_handshakes_that_don_cross.py
126_hard_[bfs]_word_ladder2.py		126_hard_[bfs]_word_ladder2.py
127_hard_[bfs]_word_ladder.py		127_hard_[bfs]_word_ladder.py
128_hard_[sense]_longest_consecutive_sequence.py		128_hard_[sense]_longest_consecutive_sequence.py
131_medium_[backtrack]_palindrome_partitioning.py		131_medium_[backtrack]_palindrome_partitioning.py
134_medium_[greedy]_gas_station.py		134_medium_[greedy]_gas_station.py
136_easy_[xor_or_quick_sort_partition]_single_number.py		136_easy_[xor_or_quick_sort_partition]_single_number.py
138_medium_[linked_list]_copy_list_with_random_pointer.py		138_medium_[linked_list]_copy_list_with_random_pointer.py
139_medium_[dfs]_word_break.py		139_medium_[dfs]_word_break.py
140_hard_[dp_and_dfs]_word_break2.py		140_hard_[dp_and_dfs]_word_break2.py
1423_medium_[dp]_maximum_points_you_can_obtain_from_cards.py		1423_medium_[dp]_maximum_points_you_can_obtain_from_cards.py
142_medium_[linked_list_or_two_pointers]_linked_list_cycle2.py		142_medium_[linked_list_or_two_pointers]_linked_list_cycle2.py
146_medium_[hash_based_linked_list]_LRU_Cache.py		146_medium_[hash_based_linked_list]_LRU_Cache.py
148_medium_[sort]_sort_list.py		148_medium_[sort]_sort_list.py
1525_medium_[hash]_number_of_good_ways_to_split_a_string.py		1525_medium_[hash]_number_of_good_ways_to_split_a_string.py
152_medium_[sense]_maximum_product_subarray.py		152_medium_[sense]_maximum_product_subarray.py
15_medium_[two_pointer]_3sum.py		15_medium_[two_pointer]_3sum.py
1706_medium_[sense]_where_will_the_ball_fall.py		1706_medium_[sense]_where_will_the_ball_fall.py
174_hard_[dp_or_binary_search]_dungeon_game.py		174_hard_[dp_or_binary_search]_dungeon_game.py
17_medium_[dfs]_letter_combination_of_phone_number.py		17_medium_[dfs]_letter_combination_of_phone_number.py
1834_medium_[priority_queue]_single-threaded_cpu.py		1834_medium_[priority_queue]_single-threaded_cpu.py
189_medium_[sense]_rotate_array.py		189_medium_[sense]_rotate_array.py
198_medium_[dp]_house_robber.py		198_medium_[dp]_house_robber.py
19_medium_[linked_list]_remove_nth_node_from_end_of_list.py		19_medium_[linked_list]_remove_nth_node_from_end_of_list.py
200_medium_[dfs_or_bfs]_number_of_islands.py		200_medium_[dfs_or_bfs]_number_of_islands.py
207_medium_[topology_sort]_course_schedule.py		207_medium_[topology_sort]_course_schedule.py
208_medium_[trie]_implement_trie.py		208_medium_[trie]_implement_trie.py
209_medium_[two_pointers]_minimum_size_subarray_sum.py		209_medium_[two_pointers]_minimum_size_subarray_sum.py
210_medium_[topological_sort]_course_schedule2.py		210_medium_[topological_sort]_course_schedule2.py
212_hard_[trie_and_backtrack]_word_search2.py		212_hard_[trie_and_backtrack]_word_search2.py
213_medium_[dp]_house_robber2.py		213_medium_[dp]_house_robber2.py
215_medium_[quick_select_or_sort_or_bst_with_child_node_number]_kth_largest_element_in_an_array.py		215_medium_[quick_select_or_sort_or_bst_with_child_node_number]_kth_largest_element_in_an_array.py
221_medium_[dp]_maximal_square.py		221_medium_[dp]_maximal_square.py
22_medium_[dfs_or_bfs]_generate_parenthesis.py		22_medium_[dfs_or_bfs]_generate_parenthesis.py
236_medium_[binary_tree]_lowest_common_ancestor.py		236_medium_[binary_tree]_lowest_common_ancestor.py
239_hard_[deque_or_heap]_sliding_window_minimum.kt		239_hard_[deque_or_heap]_sliding_window_minimum.kt
239_hard_[deque_or_max_heap_and_hash]_sliding_window_maximum.py		239_hard_[deque_or_max_heap_and_hash]_sliding_window_maximum.py
23_hard_[heap]_merge_k_sorted_lists.py		23_hard_[heap]_merge_k_sorted_lists.py
23_hard_[heap_or_divide_and_conquer]_merge_k_sorted_lists.py		23_hard_[heap_or_divide_and_conquer]_merge_k_sorted_lists.py
240_medium_[binary_search]_search_a_2D_matrix.py		240_medium_[binary_search]_search_a_2D_matrix.py
244_medium_[two_pointers]_shortest_word_distance2.py		244_medium_[two_pointers]_shortest_word_distance2.py
245_medium_[indexing]_shortest_word_distance3.py		245_medium_[indexing]_shortest_word_distance3.py
253_medium_[priority_queue_or_sense]_meeting_rooms2.py		253_medium_[priority_queue_or_sense]_meeting_rooms2.py
265_hard_[dp]_paint_house2.py		265_hard_[dp]_paint_house2.py
271_medium_[sense]_encode_and_decode_strings.py		271_medium_[sense]_encode_and_decode_strings.py
271_medium_[string]_encode_and_decode_strings.py		271_medium_[string]_encode_and_decode_strings.py
277_medium_[graph_and_sense]_find_the_celebrity.py		277_medium_[graph_and_sense]_find_the_celebrity.py
279_medium_[dp]_perfect_squares.py		279_medium_[dp]_perfect_squares.py
287_medium_[binary_search]_find_the_duplicate_number.py		287_medium_[binary_search]_find_the_duplicate_number.py
291_hard_[backtrack]_word_pattern2.py		291_hard_[backtrack]_word_pattern2.py
295_hard_[heap]_find_median_from_data_stream.kt		295_hard_[heap]_find_median_from_data_stream.kt
295_hard_[two_heap]_find_median_from_data_stream.py		295_hard_[two_heap]_find_median_from_data_stream.py
299_medium_[hash]_bulls_and_cows.py		299_medium_[hash]_bulls_and_cows.py
29_medium_[math]_divide_two_integers.py		29_medium_[math]_divide_two_integers.py
2_medium_[linked_list]_add_two_numbers.py		2_medium_[linked_list]_add_two_numbers.py
300_medium_[binary_search]_longest_increasing_subsequence.py		300_medium_[binary_search]_longest_increasing_subsequence.py
305_hard_[disjoint_set]_number_of_islands2.py		305_hard_[disjoint_set]_number_of_islands2.py
309_medium_[dp]_best_time_to_buy_and_sell_stock_with_cooldown.py		309_medium_[dp]_best_time_to_buy_and_sell_stock_with_cooldown.py
325_medium_[cache_and_indexing]_maximum_size_subarray_sum_equals_k.py		325_medium_[cache_and_indexing]_maximum_size_subarray_sum_equals_k.py
329_medium_[dp]_longest_increasing_path_in_a_matrix.kt		329_medium_[dp]_longest_increasing_path_in_a_matrix.kt
332_medium_[back_track_and_greedy]_reconstruct_itinerary.py		332_medium_[back_track_and_greedy]_reconstruct_itinerary.py
34_medium_[binarysearch]_find_first_and_last_position_of_element_in_sorted_array.py		34_medium_[binarysearch]_find_first_and_last_position_of_element_in_sorted_array.py
355_medium_[implementation]_design_tweeter.py		355_medium_[implementation]_design_tweeter.py
358_hard_[priority_queue_and_hash_map]_rearrange_string_k_distance_apart.py		358_hard_[priority_queue_and_hash_map]_rearrange_string_k_distance_apart.py
36_medium_[sense]_valid_sudoku.py		36_medium_[sense]_valid_sudoku.py
380_medium_[sense]_insert_delete_getRandom_o(1).py		380_medium_[sense]_insert_delete_getRandom_o(1).py
388_medium_[stack]_longest_absolute_file_path.py		388_medium_[stack]_longest_absolute_file_path.py
394_medium_[stack]_decode_string.py		394_medium_[stack]_decode_string.py
39_medium_[dp]_combination_sum.py		39_medium_[dp]_combination_sum.py
3_medium_[set_and_two_pointer]_longest_substring_without_repeating_characters.py		3_medium_[set_and_two_pointer]_longest_substring_without_repeating_characters.py
41_hard_[array_indexing]_first_missing_positive.py		41_hard_[array_indexing]_first_missing_positive.py
42_hard_[stack]_trapping_rain_water.py		42_hard_[stack]_trapping_rain_water.py
432_hard_[data_structure]_all_o_one_data_structure.py		432_hard_[data_structure]_all_o_one_data_structure.py
438_medium_[sliding_window]_find_all_anagrams_in_a_string.py		438_medium_[sliding_window]_find_all_anagrams_in_a_string.py
44_hard_[dp]_wildcard_matching.py		44_hard_[dp]_wildcard_matching.py
45_medium_[greedy]_jump_game2.py		45_medium_[greedy]_jump_game2.py
460_hard_[hash_based_linked_list]_LFU_Cache.py		460_hard_[hash_based_linked_list]_LFU_Cache.py
46_medium_[back_track_or_recursive]_permutations.py		46_medium_[back_track_or_recursive]_permutations.py
480_hard_[heap_and_lazy]_sliding_window_median.kt		480_hard_[heap_and_lazy]_sliding_window_median.kt
48_medium_[sense]_rotate_image.py		48_medium_[sense]_rotate_image.py
490_medium_[dfs_cache]_the_maze.kt		490_medium_[dfs_cache]_the_maze.kt

Folders and files

Latest commit

History

About

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages