renamed to order properly

viren-sureja · Jul 2, 2021 · 2c0a8e8 · 2c0a8e8
1 parent b84de4b
commit 2c0a8e8
Show file tree

Hide file tree

Showing 89 changed files with 0 additions and 0 deletions.
diff --git a/01_array/1_reverse_array.cpp → 01_array/01_reverse_array.cpp b/01_array/1_reverse_array.cpp → 01_array/01_reverse_array.cpp
diff --git a/01_array/2_max_min_array.cpp → 01_array/02_max_min_array.cpp b/01_array/2_max_min_array.cpp → 01_array/02_max_min_array.cpp
diff --git a/01_array/3_kth_max_min.cpp → 01_array/03_kth_max_min.cpp b/01_array/3_kth_max_min.cpp → 01_array/03_kth_max_min.cpp
diff --git a/01_array/4_sort_arr_0_1_2.cpp → 01_array/04_sort_arr_0_1_2.cpp b/01_array/4_sort_arr_0_1_2.cpp → 01_array/04_sort_arr_0_1_2.cpp
diff --git a/...y/5_negative_ele_to_one_side_of_array.cpp → .../05_negative_ele_to_one_side_of_array.cpp b/...y/5_negative_ele_to_one_side_of_array.cpp → .../05_negative_ele_to_one_side_of_array.cpp
diff --git a/01_array/6_union_and_intersection.cpp → 01_array/06_union_and_intersection.cpp b/01_array/6_union_and_intersection.cpp → 01_array/06_union_and_intersection.cpp
diff --git a/01_array/7_cyclically_rotate_by_1.cpp → 01_array/07_cyclically_rotate_by_1.cpp b/01_array/7_cyclically_rotate_by_1.cpp → 01_array/07_cyclically_rotate_by_1.cpp
diff --git a/01_array/8_largest_sum_conti_arr.cpp → 01_array/08_largest_sum_conti_arr.cpp b/01_array/8_largest_sum_conti_arr.cpp → 01_array/08_largest_sum_conti_arr.cpp
diff --git a/01_array/9_minimize_the_height.cpp → 01_array/09_minimize_the_height.cpp b/01_array/9_minimize_the_height.cpp → 01_array/09_minimize_the_height.cpp
diff --git a/03_string/1-reverse-string.cpp → 03_string/01-reverse-string.cpp b/03_string/1-reverse-string.cpp → 03_string/01-reverse-string.cpp
diff --git a/03_string/2-is-palindrom.cpp → 03_string/02-is-palindrom.cpp b/03_string/2-is-palindrom.cpp → 03_string/02-is-palindrom.cpp
diff --git a/03_string/3_duplicates_char_in_string.cpp → 03_string/03_duplicates_char_in_string.cpp b/03_string/3_duplicates_char_in_string.cpp → 03_string/03_duplicates_char_in_string.cpp
diff --git a/03_string/4_why_string_are_immutable.cpp → 03_string/04_why_string_are_immutable.cpp b/03_string/4_why_string_are_immutable.cpp → 03_string/04_why_string_are_immutable.cpp
diff --git a/03_string/5_check_rotation_of_other.cpp → 03_string/05_check_rotation_of_other.cpp b/03_string/5_check_rotation_of_other.cpp → 03_string/05_check_rotation_of_other.cpp
diff --git a/03_string/6_string_shuffle_of_other.cpp → 03_string/06_string_shuffle_of_other.cpp b/03_string/6_string_shuffle_of_other.cpp → 03_string/06_string_shuffle_of_other.cpp
diff --git a/03_string/7_count_and_say.cpp → 03_string/07_count_and_say.cpp b/03_string/7_count_and_say.cpp → 03_string/07_count_and_say.cpp
diff --git a/...tring/8_longest_palindromic_substring.cpp → ...ring/08_longest_palindromic_substring.cpp b/...tring/8_longest_palindromic_substring.cpp → ...ring/08_longest_palindromic_substring.cpp
diff --git a/...tring/9_longest_recurring_subsequence.cpp → ...ring/09_longest_recurring_subsequence.cpp b/...tring/9_longest_recurring_subsequence.cpp → ...ring/09_longest_recurring_subsequence.cpp
diff --git a/05_linked_list/1_reverse_linklist.cpp → 05_linked_list/01_reverse_linklist.cpp b/05_linked_list/1_reverse_linklist.cpp → 05_linked_list/01_reverse_linklist.cpp
diff --git a/...inked_list/2_reverse_linklist_given_n.cpp → ...nked_list/02_reverse_linklist_given_n.cpp b/...inked_list/2_reverse_linklist_given_n.cpp → ...nked_list/02_reverse_linklist_given_n.cpp
diff --git a/05_linked_list/3_detect_loop.cpp → 05_linked_list/03_detect_loop.cpp b/05_linked_list/3_detect_loop.cpp → 05_linked_list/03_detect_loop.cpp
diff --git a/05_linked_list/4_delete_loop.cpp → 05_linked_list/04_delete_loop.cpp b/05_linked_list/4_delete_loop.cpp → 05_linked_list/04_delete_loop.cpp
diff --git a/05_linked_list/5_first_node_in_loop.cpp → 05_linked_list/05_first_node_in_loop.cpp b/05_linked_list/5_first_node_in_loop.cpp → 05_linked_list/05_first_node_in_loop.cpp
diff --git a/..._remove_duplicates_in_sorted_linklist.cpp → ..._remove_duplicates_in_sorted_linklist.cpp b/..._remove_duplicates_in_sorted_linklist.cpp → ..._remove_duplicates_in_sorted_linklist.cpp
diff --git a/...ove_duplicates_from_unsorted_linklist.cpp → ...ove_duplicates_from_unsorted_linklist.cpp b/...ove_duplicates_from_unsorted_linklist.cpp → ...ove_duplicates_from_unsorted_linklist.cpp
diff --git a/05_linked_list/8_move_last_ele_to_front.cpp → 05_linked_list/08_move_last_ele_to_front.cpp b/05_linked_list/8_move_last_ele_to_front.cpp → 05_linked_list/08_move_last_ele_to_front.cpp
diff --git a/05_linked_list/9_add_1_to_no_in_linklist.cpp → ...inked_list/09_add_1_to_no_in_linklist.cpp b/05_linked_list/9_add_1_to_no_in_linklist.cpp → ...inked_list/09_add_1_to_no_in_linklist.cpp
diff --git a/06_binary_trees/1_level_order_traversal.cpp → 06_binary_trees/01_level_order_traversal.cpp b/06_binary_trees/1_level_order_traversal.cpp → 06_binary_trees/01_level_order_traversal.cpp
diff --git a/...trees/2_reverse_level_order_traversal.cpp → ...rees/02_reverse_level_order_traversal.cpp b/...trees/2_reverse_level_order_traversal.cpp → ...rees/02_reverse_level_order_traversal.cpp
diff --git a/06_binary_trees/3_height_of_tree.cpp → 06_binary_trees/03_height_of_tree.cpp b/06_binary_trees/3_height_of_tree.cpp → 06_binary_trees/03_height_of_tree.cpp
diff --git a/06_binary_trees/4_diameter_of_tree.cpp → 06_binary_trees/04_diameter_of_tree.cpp b/06_binary_trees/4_diameter_of_tree.cpp → 06_binary_trees/04_diameter_of_tree.cpp
diff --git a/06_binary_trees/5_mirror_of_tree.cpp → 06_binary_trees/05_mirror_of_tree.cpp b/06_binary_trees/5_mirror_of_tree.cpp → 06_binary_trees/05_mirror_of_tree.cpp
diff --git a/..._inorder_traversal_recursion_itertion.cpp → ..._inorder_traversal_recursion_itertion.cpp b/..._inorder_traversal_recursion_itertion.cpp → ..._inorder_traversal_recursion_itertion.cpp
diff --git a/...preorder_traversal_recursion_itertion.cpp → ...preorder_traversal_recursion_itertion.cpp b/...preorder_traversal_recursion_itertion.cpp → ...preorder_traversal_recursion_itertion.cpp
diff --git a/...ostorder_traversal_recursion_itertion.cpp → ...ostorder_traversal_recursion_itertion.cpp b/...ostorder_traversal_recursion_itertion.cpp → ...ostorder_traversal_recursion_itertion.cpp
diff --git a/06_binary_trees/9_left_view_of_tree.cpp → 06_binary_trees/09_left_view_of_tree.cpp b/06_binary_trees/9_left_view_of_tree.cpp → 06_binary_trees/09_left_view_of_tree.cpp
diff --git a/...ry_search_trees/1_find_a_value_in_BST.cpp → ...y_search_trees/01_find_a_value_in_BST.cpp b/...ry_search_trees/1_find_a_value_in_BST.cpp → ...y_search_trees/01_find_a_value_in_BST.cpp
diff --git a/...earch_trees/2_deletion_of_node_in_BST.cpp → ...arch_trees/02_deletion_of_node_in_BST.cpp b/...earch_trees/2_deletion_of_node_in_BST.cpp → ...arch_trees/02_deletion_of_node_in_BST.cpp
diff --git a/...y_search_trees/3_min_max_value_in_BST.cpp → ..._search_trees/03_min_max_value_in_BST.cpp b/...y_search_trees/3_min_max_value_in_BST.cpp → ..._search_trees/03_min_max_value_in_BST.cpp
diff --git a/..._inorder_successor_predecessor_in_BST.cpp → ..._inorder_successor_predecessor_in_BST.cpp b/..._inorder_successor_predecessor_in_BST.cpp → ..._inorder_successor_predecessor_in_BST.cpp
diff --git a/...h_trees/5_check_if_tree_is_BST_or_not.cpp → ..._trees/05_check_if_tree_is_BST_or_not.cpp b/...h_trees/5_check_if_tree_is_BST_or_not.cpp → ..._trees/05_check_if_tree_is_BST_or_not.cpp
diff --git a/...s/6_populate_inorder_successor_of_BST.cpp → .../06_populate_inorder_successor_of_BST.cpp b/...s/6_populate_inorder_successor_of_BST.cpp → .../06_populate_inorder_successor_of_BST.cpp
diff --git a/...ch_trees/7_find_LCA_of_2_nodes_in_BST.cpp → ...h_trees/07_find_LCA_of_2_nodes_in_BST.cpp b/...ch_trees/7_find_LCA_of_2_nodes_in_BST.cpp → ...h_trees/07_find_LCA_of_2_nodes_in_BST.cpp
diff --git a/...construct_BST_from_preorder_traversal.cpp → ...construct_BST_from_preorder_traversal.cpp b/...construct_BST_from_preorder_traversal.cpp → ...construct_BST_from_preorder_traversal.cpp
diff --git a/..._trees/9_convert_binary_tree_into_BST.cpp → ...trees/09_convert_binary_tree_into_BST.cpp b/..._trees/9_convert_binary_tree_into_BST.cpp → ...trees/09_convert_binary_tree_into_BST.cpp
diff --git a/08_greedy/1_activity_selection_problem.cpp → 08_greedy/01_activity_selection_problem.cpp b/08_greedy/1_activity_selection_problem.cpp → 08_greedy/01_activity_selection_problem.cpp
diff --git a/08_greedy/2_job_sequencing_problem.cpp → 08_greedy/02_job_sequencing_problem.cpp b/08_greedy/2_job_sequencing_problem.cpp → 08_greedy/02_job_sequencing_problem.cpp
diff --git a/08_greedy/3_huffman_coding.cpp → 08_greedy/03_huffman_coding.cpp b/08_greedy/3_huffman_coding.cpp → 08_greedy/03_huffman_coding.cpp
diff --git a/08_greedy/4_water_connection_problem.cpp → 08_greedy/04_water_connection_problem.cpp b/08_greedy/4_water_connection_problem.cpp → 08_greedy/04_water_connection_problem.cpp
diff --git a/08_greedy/5_fractional_knapsack_problem.cpp → 08_greedy/05_fractional_knapsack_problem.cpp b/08_greedy/5_fractional_knapsack_problem.cpp → 08_greedy/05_fractional_knapsack_problem.cpp
diff --git a/08_greedy/6_find_minimum_no_of_coins.cpp → 08_greedy/06_find_minimum_no_of_coins.cpp b/08_greedy/6_find_minimum_no_of_coins.cpp → 08_greedy/06_find_minimum_no_of_coins.cpp
diff --git a/...ns_for_which_stoppage_can_be_provided.cpp → ...ns_for_which_stoppage_can_be_provided.cpp b/...ns_for_which_stoppage_can_be_provided.cpp → ...ns_for_which_stoppage_can_be_provided.cpp
diff --git a/08_greedy/8_minimum_platform_problem.cpp → 08_greedy/08_minimum_platform_problem.cpp b/08_greedy/8_minimum_platform_problem.cpp → 08_greedy/08_minimum_platform_problem.cpp
diff --git a/...mum_stock_if_can_be_bought_on_ith_day.cpp → ...mum_stock_if_can_be_bought_on_ith_day.cpp b/...mum_stock_if_can_be_bought_on_ith_day.cpp → ...mum_stock_if_can_be_bought_on_ith_day.cpp
diff --git a/...queues/1_implement_stack_from_scratch.cpp → ...ueues/01_implement_stack_from_scratch.cpp b/...queues/1_implement_stack_from_scratch.cpp → ...ueues/01_implement_stack_from_scratch.cpp
diff --git a/...queues/2_implement_queue_from_scratch.cpp → ...ueues/02_implement_queue_from_scratch.cpp b/...queues/2_implement_queue_from_scratch.cpp → ...ueues/02_implement_queue_from_scratch.cpp
diff --git a/...d_queues/3_implement_2_stack_in_array.cpp → ..._queues/03_implement_2_stack_in_array.cpp b/...d_queues/3_implement_2_stack_in_array.cpp → ..._queues/03_implement_2_stack_in_array.cpp
diff --git a/...and_queues/4_find_middle_ele_in_stack.cpp → ...nd_queues/04_find_middle_ele_in_stack.cpp b/...and_queues/4_find_middle_ele_in_stack.cpp → ...nd_queues/04_find_middle_ele_in_stack.cpp
diff --git a/...ues/5_implement_N_stacks_in_one_array.cpp → ...es/05_implement_N_stacks_in_one_array.cpp b/...ues/5_implement_N_stacks_in_one_array.cpp → ...es/05_implement_N_stacks_in_one_array.cpp
diff --git a/...ssion_has_balanced_paranthesis_or_not.cpp → ...ssion_has_balanced_paranthesis_or_not.cpp b/...ssion_has_balanced_paranthesis_or_not.cpp → ...ssion_has_balanced_paranthesis_or_not.cpp
diff --git a/...d_queues/7_reverse_string_using_stack.cpp → ..._queues/07_reverse_string_using_stack.cpp b/...d_queues/7_reverse_string_using_stack.cpp → ..._queues/07_reverse_string_using_stack.cpp
diff --git a/...ck_and_queues/8_minEle_in_O1_TC_O1_SC.cpp → ...k_and_queues/08_minEle_in_O1_TC_O1_SC.cpp b/...ck_and_queues/8_minEle_in_O1_TC_O1_SC.cpp → ...k_and_queues/08_minEle_in_O1_TC_O1_SC.cpp
diff --git a/...ck_and_queues/9_find_next_greater_ele.cpp → ...k_and_queues/09_find_next_greater_ele.cpp b/...ck_and_queues/9_find_next_greater_ele.cpp → ...k_and_queues/09_find_next_greater_ele.cpp
diff --git a/11_heap/2_sort_array_using_heap_HEAPSORT.cpp → ...eap/02_sort_array_using_heap_HEAPSORT.cpp b/11_heap/2_sort_array_using_heap_HEAPSORT.cpp → ...eap/02_sort_array_using_heap_HEAPSORT.cpp
diff --git a/...p/3_maximum_of_all_subarray_of_size_K.cpp → .../03_maximum_of_all_subarray_of_size_K.cpp b/...p/3_maximum_of_all_subarray_of_size_K.cpp → .../03_maximum_of_all_subarray_of_size_K.cpp
diff --git a/11_heap/4_k_largest_ele_in_array.cpp → 11_heap/04_k_largest_ele_in_array.cpp b/11_heap/4_k_largest_ele_in_array.cpp → 11_heap/04_k_largest_ele_in_array.cpp
diff --git a/...est_and_kth_largest_in_unsorted_array.cpp → ...est_and_kth_largest_in_unsorted_array.cpp b/...est_and_kth_largest_in_unsorted_array.cpp → ...est_and_kth_largest_in_unsorted_array.cpp
diff --git a/11_heap/6_merge_k_sorted_array.cpp → 11_heap/06_merge_k_sorted_array.cpp b/11_heap/6_merge_k_sorted_array.cpp → 11_heap/06_merge_k_sorted_array.cpp
diff --git a/11_heap/7_merge_two_binary_maxheaps.cpp → 11_heap/07_merge_two_binary_maxheaps.cpp b/11_heap/7_merge_two_binary_maxheaps.cpp → 11_heap/07_merge_two_binary_maxheaps.cpp
diff --git a/..._kth_largest_sum_continuous_subarrays.cpp → ..._kth_largest_sum_continuous_subarrays.cpp b/..._kth_largest_sum_continuous_subarrays.cpp → ..._kth_largest_sum_continuous_subarrays.cpp
diff --git a/11_heap/9_reorganize_strings.cpp → 11_heap/09_reorganize_strings.cpp b/11_heap/9_reorganize_strings.cpp → 11_heap/09_reorganize_strings.cpp
diff --git a/14_DP/1_0-1_knapsack.cpp → 14_DP/01_0-1_knapsack.cpp b/14_DP/1_0-1_knapsack.cpp → 14_DP/01_0-1_knapsack.cpp
diff --git a/14_DP/2_equal_subset-sum.cpp → 14_DP/02_equal_subset-sum.cpp b/14_DP/2_equal_subset-sum.cpp → 14_DP/02_equal_subset-sum.cpp
diff --git a/14_DP/3_coin_change.cpp → 14_DP/03_coin_change.cpp b/14_DP/3_coin_change.cpp → 14_DP/03_coin_change.cpp
diff --git a/14_DP/4_LC_subsequences.cpp → 14_DP/04_LC_subsequences.cpp b/14_DP/4_LC_subsequences.cpp → 14_DP/04_LC_subsequences.cpp
diff --git a/14_DP/5_LC_substring.cpp → 14_DP/05_LC_substring.cpp b/14_DP/5_LC_substring.cpp → 14_DP/05_LC_substring.cpp
diff --git a/14_DP/6_Longest_Palindromic_Subsequence.cpp → 14_DP/06_Longest_Palindromic_Subsequence.cpp b/14_DP/6_Longest_Palindromic_Subsequence.cpp → 14_DP/06_Longest_Palindromic_Subsequence.cpp
diff --git a/...n_in_a_string_to_make_it_a_palindrome.cpp → ...n_in_a_string_to_make_it_a_palindrome.cpp b/...n_in_a_string_to_make_it_a_palindrome.cpp → ...n_in_a_string_to_make_it_a_palindrome.cpp
diff --git a/14_DP/8_longest_repeated_subsequence.cpp → 14_DP/08_longest_repeated_subsequence.cpp b/14_DP/8_longest_repeated_subsequence.cpp → 14_DP/08_longest_repeated_subsequence.cpp
diff --git a/14_DP/9_binomial_cofficient.cpp → 14_DP/09_binomial_cofficient.cpp b/14_DP/9_binomial_cofficient.cpp → 14_DP/09_binomial_cofficient.cpp
diff --git a/...-manipulation/1_count_set_bits_in_num.cpp → ...manipulation/01_count_set_bits_in_num.cpp b/...-manipulation/1_count_set_bits_in_num.cpp → ...manipulation/01_count_set_bits_in_num.cpp
diff --git a/...manipulation/2_non_repeating_elements.cpp → ...anipulation/02_non_repeating_elements.cpp b/...manipulation/2_non_repeating_elements.cpp → ...anipulation/02_non_repeating_elements.cpp
diff --git a/15_bit-manipulation/3_bits_flipped.cpp → 15_bit-manipulation/03_bits_flipped.cpp b/15_bit-manipulation/3_bits_flipped.cpp → 15_bit-manipulation/03_bits_flipped.cpp
diff --git a/...pulation/4_total_set_bits_from_1_to_n.cpp → ...ulation/04_total_set_bits_from_1_to_n.cpp b/...pulation/4_total_set_bits_from_1_to_n.cpp → ...ulation/04_total_set_bits_from_1_to_n.cpp
diff --git a/15_bit-manipulation/5_no_is_power_of_2.cpp → 15_bit-manipulation/05_no_is_power_of_2.cpp b/15_bit-manipulation/5_no_is_power_of_2.cpp → 15_bit-manipulation/05_no_is_power_of_2.cpp
diff --git a/...it-manipulation/6_find_pos_of_set_bit.cpp → ...t-manipulation/06_find_pos_of_set_bit.cpp b/...it-manipulation/6_find_pos_of_set_bit.cpp → ...t-manipulation/06_find_pos_of_set_bit.cpp
diff --git a/...-manipulation/7_copy_set_bit_in_range.cpp → ...manipulation/07_copy_set_bit_in_range.cpp b/...-manipulation/7_copy_set_bit_in_range.cpp → ...manipulation/07_copy_set_bit_in_range.cpp
diff --git a/...it-manipulation/8_without_div_mul_mod.cpp → ...t-manipulation/08_without_div_mul_mod.cpp b/...it-manipulation/8_without_div_mul_mod.cpp → ...t-manipulation/08_without_div_mul_mod.cpp
diff --git a/...9_square_of_no_without_mul_pow_divide.cpp → ...9_square_of_no_without_mul_pow_divide.cpp b/...9_square_of_no_without_mul_pow_divide.cpp → ...9_square_of_no_without_mul_pow_divide.cpp