GitHub - zvant/LeetCodeSolutions: Accepted LeetCode Solutions.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 47 Commits
USACOSolutions		USACOSolutions
.gitignore		.gitignore
0001.two_sum_E.c		0001.two_sum_E.c
0002.add_two_numbers_M.c		0002.add_two_numbers_M.c
0003.longest_substring_without_repeating_characters_M.cpp		0003.longest_substring_without_repeating_characters_M.cpp
0004.median_of_two_sorted_arrays_H.cpp		0004.median_of_two_sorted_arrays_H.cpp
0005.longest_palindromic_substring_M.c		0005.longest_palindromic_substring_M.c
0006.zigzag_conversion_M.cpp		0006.zigzag_conversion_M.cpp
0007.reverse_integer_E.c		0007.reverse_integer_E.c
0008.string_to_integer_atoi_M.c		0008.string_to_integer_atoi_M.c
0009.palindrome_number_E.c		0009.palindrome_number_E.c
0010.regular_expression_matching_H.cpp		0010.regular_expression_matching_H.cpp
0011.container_with_most_wate_M.py		0011.container_with_most_wate_M.py
0012.integer_to_roman_M.py		0012.integer_to_roman_M.py
0013.roman_to_integer_E.py		0013.roman_to_integer_E.py
0014.longest_common_prefix_E.c		0014.longest_common_prefix_E.c
0017.3sum_M.cpp		0017.3sum_M.cpp
0017.letter_combinations_of_a_phone_number_M.py		0017.letter_combinations_of_a_phone_number_M.py
0019.remove_nth_node_from_end_of_list_M.c		0019.remove_nth_node_from_end_of_list_M.c
0020.valid_parentheses_E.cpp		0020.valid_parentheses_E.cpp
0021.merge_two_sorted_lists_E.c		0021.merge_two_sorted_lists_E.c
0022.generate_parentheses_M.py		0022.generate_parentheses_M.py
0023.merge_k_sorted_lists_H.cpp		0023.merge_k_sorted_lists_H.cpp
0024.swap_nodes_in_pairs_M.c		0024.swap_nodes_in_pairs_M.c
0025.reverse_nodes_in_k_group_H.c		0025.reverse_nodes_in_k_group_H.c
0026.remove_duplicates_from_sorted_array_E.c		0026.remove_duplicates_from_sorted_array_E.c
0027.remove_element_E.c		0027.remove_element_E.c
0028.implement_strstr_E.c		0028.implement_strstr_E.c
0029.divide_two_integers_M.c		0029.divide_two_integers_M.c
0030.substring_with_concatenation_of_all_words_H.py		0030.substring_with_concatenation_of_all_words_H.py
0031.next_permutation_M.cpp		0031.next_permutation_M.cpp
0033.search_in_rotated_sorted_array_M.cpp		0033.search_in_rotated_sorted_array_M.cpp
0034.find_first_and_last_position_of_element_in_sorted_array_M.cpp		0034.find_first_and_last_position_of_element_in_sorted_array_M.cpp
0035.search_insert_position_E.c		0035.search_insert_position_E.c
0036.valid_sudoku_M.cpp		0036.valid_sudoku_M.cpp
0037.sudoku_solver_H.cpp		0037.sudoku_solver_H.cpp
0038.count_and_say_E.py		0038.count_and_say_E.py
0039.combination_sum_M.py		0039.combination_sum_M.py
0040.combination_sum_ii_M.py		0040.combination_sum_ii_M.py
0042.trapping_rain_water_H.cpp		0042.trapping_rain_water_H.cpp
0043.multiply_strings_M.cpp		0043.multiply_strings_M.cpp
0044.wildcard_matching_H.cpp		0044.wildcard_matching_H.cpp
0046.permutations_M.py		0046.permutations_M.py
0047.permutations_ii_M.cpp		0047.permutations_ii_M.cpp
0048.rotate_image_M.cpp		0048.rotate_image_M.cpp
0049.group_anagrams_M.cpp		0049.group_anagrams_M.cpp
0050.powx_n_M.c		0050.powx_n_M.c
0051.n_queens_H.cpp		0051.n_queens_H.cpp
0052.n_queens_ii_H.cpp		0052.n_queens_ii_H.cpp
0053.maximum_subarray_E.c		0053.maximum_subarray_E.c
0054.spiral_matrix_M.cpp		0054.spiral_matrix_M.cpp
0055.jump_game_M.cpp		0055.jump_game_M.cpp
0056.merge_intervals_M.cpp		0056.merge_intervals_M.cpp
0057.insert_interval_H.cpp		0057.insert_interval_H.cpp
0058.length_of_last_word_E.c		0058.length_of_last_word_E.c
0059.spiral_matrix_ii_M.cpp		0059.spiral_matrix_ii_M.cpp
0060.permutation_sequence_M.py		0060.permutation_sequence_M.py
0061.rotate_list_M.c		0061.rotate_list_M.c
0062.unique_paths_M.cpp		0062.unique_paths_M.cpp
0063.unique_paths_ii_M.cpp		0063.unique_paths_ii_M.cpp
0064.minimum_path_sum_M.cpp		0064.minimum_path_sum_M.cpp
0065.valid_number_H.c		0065.valid_number_H.c
0066.plus_one_E.c		0066.plus_one_E.c
0067.add_binary_E.c		0067.add_binary_E.c
0068.text_justification_H.java		0068.text_justification_H.java
0069.sqrtx_E.c		0069.sqrtx_E.c
0070.climbing_stairs_E.cpp		0070.climbing_stairs_E.cpp
0071.simplify_path_M.java		0071.simplify_path_M.java
0072.edit_distance_H.cpp		0072.edit_distance_H.cpp
0073.set_matrix_zeroes_M.cpp		0073.set_matrix_zeroes_M.cpp
0074.search_a_2d_matrix_M.cpp		0074.search_a_2d_matrix_M.cpp
0075.sort_colors_M.c		0075.sort_colors_M.c
0077.combinations_M.py		0077.combinations_M.py
0078.subsets_M.cpp		0078.subsets_M.cpp
0079.word_search_M.cpp		0079.word_search_M.cpp
0080.remove_duplicates_from_sorted_array_ii_M.c		0080.remove_duplicates_from_sorted_array_ii_M.c
0081.search_in_rotated_sorted_array_ii_M.cpp		0081.search_in_rotated_sorted_array_ii_M.cpp
0082.remove_duplicates_from_sorted_list_ii_M.c		0082.remove_duplicates_from_sorted_list_ii_M.c
0083.remove_duplicates_from_sorted_list_E.c		0083.remove_duplicates_from_sorted_list_E.c
0084.largest_rectangle_in_histogram_H.cpp		0084.largest_rectangle_in_histogram_H.cpp
0085.maximal_rectangle_H.cpp		0085.maximal_rectangle_H.cpp
0086.partition_list_M.c		0086.partition_list_M.c
0088.merge_sorted_array_E.cpp		0088.merge_sorted_array_E.cpp
0090.subsets_ii_M.cpp		0090.subsets_ii_M.cpp
0091.decode_ways_M.cpp		0091.decode_ways_M.cpp
0092.reverse_linked_list_ii_M.c		0092.reverse_linked_list_ii_M.c
0093.restore_ip_addresses_M.cpp		0093.restore_ip_addresses_M.cpp
0094.binary_tree_inorder_traversal_M.cpp		0094.binary_tree_inorder_traversal_M.cpp
0095.unique_binary_search_trees_ii_M.cpp		0095.unique_binary_search_trees_ii_M.cpp
0096.unique_binary_search_trees_M.cpp		0096.unique_binary_search_trees_M.cpp
0098.validate_binary_search_tree_M.cpp		0098.validate_binary_search_tree_M.cpp
0099.recover_binary_search_tree_H.cpp		0099.recover_binary_search_tree_H.cpp
0100.same_tree_E.c		0100.same_tree_E.c
0101.symmetric_tree_E.cpp		0101.symmetric_tree_E.cpp
0102.binary_tree_level_order_traversal_M.cpp		0102.binary_tree_level_order_traversal_M.cpp
0103.binary_tree_zigzag_level_order_traversal_M.cpp		0103.binary_tree_zigzag_level_order_traversal_M.cpp
0104.maximum_depth_of_binary_tree_E.cpp		0104.maximum_depth_of_binary_tree_E.cpp
0105.construct_binary_tree_from_preorder_and_inorder_traversal_M.cpp		0105.construct_binary_tree_from_preorder_and_inorder_traversal_M.cpp
0106.construct_binary_tree_from_inorder_and_postorder_traversal_M.cpp		0106.construct_binary_tree_from_inorder_and_postorder_traversal_M.cpp
0107.binary_tree_level_order_traversal_ii_E.cpp		0107.binary_tree_level_order_traversal_ii_E.cpp

Repository files navigation

LeetCode Problem Set: https://leetcode.com/problemset/all/
zvant on LeetCode: https://leetcode.com/zvant/
activity: 2015/07 - 2024/04
Rank: 109360
progress:
Easy   179/787
Medium 251/1637
Hard    37/695

in the source files:
- link of the problem
- submission date
- runtime
- code