GitHub - mubin86/leetcode-solutions: problem-solving, leetcode submissions

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 563 Commits
javascript		javascript
01_knapsack_recur_memoization.cpp		01_knapsack_recur_memoization.cpp
01_knapsack_recursion.cpp		01_knapsack_recursion.cpp
3rd_general_number.cpp		3rd_general_number.cpp
3sum.cpp		3sum.cpp
3sum_closest.cpp		3sum_closest.cpp
4_sum_2.cpp		4_sum_2.cpp
Kth_largest_element.cpp		Kth_largest_element.cpp
Kth_smallest_prime_fraction.cpp		Kth_smallest_prime_fraction.cpp
LCA_binary_tree.cpp		LCA_binary_tree.cpp
LCA_bst.cpp		LCA_bst.cpp
LIS.cpp		LIS.cpp
N_ary_tree_level_order.cpp		N_ary_tree_level_order.cpp
Roman to Int.cpp		Roman to Int.cpp
add_binary.cpp		add_binary.cpp
add_one_row_to_tree.cpp		add_one_row_to_tree.cpp
add_one_row_to_tree_another_sol.cpp		add_one_row_to_tree_another_sol.cpp
add_strings.cpp		add_strings.cpp
add_two_number_linked_list.cpp		add_two_number_linked_list.cpp
add_two_numbers_2.cpp		add_two_numbers_2.cpp
advantage_shuffle.cpp		advantage_shuffle.cpp
all_anagram_string.cpp		all_anagram_string.cpp
all_paths_from_source_to_target_backtracking.cpp		all_paths_from_source_to_target_backtracking.cpp
all_possible_full_binary_trees.cpp		all_possible_full_binary_trees.cpp
arithmetic_subarrays.cpp		arithmetic_subarrays.cpp
array_partition.cpp		array_partition.cpp
arrays_equal_reverse_sub_arrays.cpp		arrays_equal_reverse_sub_arrays.cpp
asign_cookies.cpp		asign_cookies.cpp
average_levels_binary_tree.cpp		average_levels_binary_tree.cpp
average_waiting_time.cpp		average_waiting_time.cpp
avrg_salary_exclude_min_max.cpp		avrg_salary_exclude_min_max.cpp
backspace_string_com.cpp		backspace_string_com.cpp
balance_bst.cpp		balance_bst.cpp
balanced_binary_tree.cpp		balanced_binary_tree.cpp
balanced_strings.cpp		balanced_strings.cpp
beautiful_arrangement.cpp		beautiful_arrangement.cpp
best_time_buy_sell_stock.cpp		best_time_buy_sell_stock.cpp
best_time_to_buy_sell_stock.cpp		best_time_to_buy_sell_stock.cpp
best_time_to_buy_sell_strock_transaction_fee.cpp		best_time_to_buy_sell_strock_transaction_fee.cpp
binary_number_alternating_bits.cpp		binary_number_alternating_bits.cpp
binary_search.cpp		binary_search.cpp
binary_tree_level_order_2.cpp		binary_tree_level_order_2.cpp
binary_tree_level_order_traversal.cpp		binary_tree_level_order_traversal.cpp
binary_tree_paths.cpp		binary_tree_paths.cpp
binary_tree_post_order.cpp		binary_tree_post_order.cpp
binary_tree_preorder.cpp		binary_tree_preorder.cpp
binary_tree_pruning.cpp		binary_tree_pruning.cpp
binary_tree_right_side_view.cpp		binary_tree_right_side_view.cpp
binary_tree_zigzag_level_order.cpp		binary_tree_zigzag_level_order.cpp
bottom_left_tree_value.cpp		bottom_left_tree_value.cpp
bst_to_greater_sum_tree.cpp		bst_to_greater_sum_tree.cpp
buddy_strings.cpp		buddy_strings.cpp
build_array_from_permutation.cpp		build_array_from_permutation.cpp
calculate_money.cpp		calculate_money.cpp
can_place_flowers.cpp		can_place_flowers.cpp
capacity_to_ship_packages_within_d_days.cpp		capacity_to_ship_packages_within_d_days.cpp
catalan_number_unique_bst.cpp		catalan_number_unique_bst.cpp
check_array_equivalent.cpp		check_array_equivalent.cpp
check_array_is_sorted_rotated.cpp		check_array_is_sorted_rotated.cpp
check_characters_have_equal_occurence.cpp		check_characters_have_equal_occurence.cpp
check_every_row_and_column_contain_all_numbers.cpp		check_every_row_and_column_contain_all_numbers.cpp
check_if_nu,bers_are_ascending_in_sentence.cpp		check_if_nu,bers_are_ascending_in_sentence.cpp
check_if_string_can_break_another_string.cpp		check_if_string_can_break_another_string.cpp
check_n_and_its_double_exist.cpp		check_n_and_its_double_exist.cpp
check_num_is_sum_of_pow_three.cpp		check_num_is_sum_of_pow_three.cpp
check_sentence_pangram.cpp		check_sentence_pangram.cpp
check_straight_line.cpp		check_straight_line.cpp
climbing_stair_dp.cpp		climbing_stair_dp.cpp
clone_graph.cpp		clone_graph.cpp
closest_number_to_zero.cpp		closest_number_to_zero.cpp
combination_sum3.cpp		combination_sum3.cpp
combination_sum_2.cpp		combination_sum_2.cpp
combination_sum_backtracking.cpp		combination_sum_backtracking.cpp
combinations.cpp		combinations.cpp
consecutive_characters.cpp		consecutive_characters.cpp
consistent_strings.cpp		consistent_strings.cpp
container_most_water.cpp		container_most_water.cpp
contains_duplicate.cpp		contains_duplicate.cpp
contains_duplicate_hashmap.cpp		contains_duplicate_hashmap.cpp
convert_1d_array_into_2d_array.cpp		convert_1d_array_into_2d_array.cpp
convert_sorted_array_into_height_balanced_bst.cpp		convert_sorted_array_into_height_balanced_bst.cpp
corresponding_node_clone_tree.cpp		corresponding_node_clone_tree.cpp
count_and_say.cpp		count_and_say.cpp
count_binary_substring.cpp		count_binary_substring.cpp
count_common_words_with_one_occurrence.cpp		count_common_words_with_one_occurrence.cpp
count_elements_with_strictly_smaller_and_greater_elements.cpp		count_elements_with_strictly_smaller_and_greater_elements.cpp
count_good_nodes.cpp		count_good_nodes.cpp
count_good_substring.cpp		count_good_substring.cpp
count_ineteger_with_even_digit_sum.cpp		count_ineteger_with_even_digit_sum.cpp
count_nodes_equal_to_avrg_of_subtree.cpp		count_nodes_equal_to_avrg_of_subtree.cpp
count_number_of_bad_pairs.cpp		count_number_of_bad_pairs.cpp
count_number_of_good_subarray.cpp		count_number_of_good_subarray.cpp
count_number_of_pairs_abs_diff.cpp		count_number_of_pairs_abs_diff.cpp
count_of_subsets_in_sum.cpp		count_of_subsets_in_sum.cpp
count_square_sum_triples.cpp		count_square_sum_triples.cpp
count_sub_island_dfs.cpp		count_sub_island_dfs.cpp
counting_bits.cpp		counting_bits.cpp
course_schedule.cpp		course_schedule.cpp
cousins_binary_tree.cpp		cousins_binary_tree.cpp
crawler_log_folder.cpp		crawler_log_folder.cpp

About

problem-solving, leetcode submissions

Activity

2 stars

0 watching

0 forks

Report repository

Releases

No releases published

Packages

No packages published

mubin86/leetcode-solutions

Folders and files

Latest commit

History