From 2c0a8e807d5389984ab6bd8a567095b8436256ed Mon Sep 17 00:00:00 2001
From: viren sureja <virensureja3@gmail.com>
Date: Fri, 2 Jul 2021 16:23:59 +0530
Subject: [PATCH] renamed to order properly

---
 01_array/{1_reverse_array.cpp => 01_reverse_array.cpp}            | 0
 01_array/{2_max_min_array.cpp => 02_max_min_array.cpp}            | 0
 01_array/{3_kth_max_min.cpp => 03_kth_max_min.cpp}                | 0
 01_array/{4_sort_arr_0_1_2.cpp => 04_sort_arr_0_1_2.cpp}          | 0
 ...side_of_array.cpp => 05_negative_ele_to_one_side_of_array.cpp} | 0
 ...6_union_and_intersection.cpp => 06_union_and_intersection.cpp} | 0
 ...7_cyclically_rotate_by_1.cpp => 07_cyclically_rotate_by_1.cpp} | 0
 .../{8_largest_sum_conti_arr.cpp => 08_largest_sum_conti_arr.cpp} | 0
 .../{9_minimize_the_height.cpp => 09_minimize_the_height.cpp}     | 0
 03_string/{1-reverse-string.cpp => 01-reverse-string.cpp}         | 0
 03_string/{2-is-palindrom.cpp => 02-is-palindrom.cpp}             | 0
 ...icates_char_in_string.cpp => 03_duplicates_char_in_string.cpp} | 0
 ...y_string_are_immutable.cpp => 04_why_string_are_immutable.cpp} | 0
 ...check_rotation_of_other.cpp => 05_check_rotation_of_other.cpp} | 0
 ...string_shuffle_of_other.cpp => 06_string_shuffle_of_other.cpp} | 0
 03_string/{7_count_and_say.cpp => 07_count_and_say.cpp}           | 0
 ...ndromic_substring.cpp => 08_longest_palindromic_substring.cpp} | 0
 ...rring_subsequence.cpp => 09_longest_recurring_subsequence.cpp} | 0
 .../{1_reverse_linklist.cpp => 01_reverse_linklist.cpp}           | 0
 ...verse_linklist_given_n.cpp => 02_reverse_linklist_given_n.cpp} | 0
 05_linked_list/{3_detect_loop.cpp => 03_detect_loop.cpp}          | 0
 05_linked_list/{4_delete_loop.cpp => 04_delete_loop.cpp}          | 0
 .../{5_first_node_in_loop.cpp => 05_first_node_in_loop.cpp}       | 0
 ...d_linklist.cpp => 06_remove_duplicates_in_sorted_linklist.cpp} | 0
 ...nklist.cpp => 07_remove_duplicates_from_unsorted_linklist.cpp} | 0
 ...8_move_last_ele_to_front.cpp => 08_move_last_ele_to_front.cpp} | 0
 ...add_1_to_no_in_linklist.cpp => 09_add_1_to_no_in_linklist.cpp} | 0
 .../{1_level_order_traversal.cpp => 01_level_order_traversal.cpp} | 0
 ...l_order_traversal.cpp => 02_reverse_level_order_traversal.cpp} | 0
 06_binary_trees/{3_height_of_tree.cpp => 03_height_of_tree.cpp}   | 0
 .../{4_diameter_of_tree.cpp => 04_diameter_of_tree.cpp}           | 0
 06_binary_trees/{5_mirror_of_tree.cpp => 05_mirror_of_tree.cpp}   | 0
 ...n_itertion.cpp => 06_inorder_traversal_recursion_itertion.cpp} | 0
 ..._itertion.cpp => 07_preorder_traversal_recursion_itertion.cpp} | 0
 ...itertion.cpp => 08_postorder_traversal_recursion_itertion.cpp} | 0
 .../{9_left_view_of_tree.cpp => 09_left_view_of_tree.cpp}         | 0
 .../{1_find_a_value_in_BST.cpp => 01_find_a_value_in_BST.cpp}     | 0
 ...deletion_of_node_in_BST.cpp => 02_deletion_of_node_in_BST.cpp} | 0
 .../{3_min_max_value_in_BST.cpp => 03_min_max_value_in_BST.cpp}   | 0
 ...n_BST.cpp => 04_find_inorder_successor_predecessor_in_BST.cpp} | 0
 ..._tree_is_BST_or_not.cpp => 05_check_if_tree_is_BST_or_not.cpp} | 0
 ...cessor_of_BST.cpp => 06_populate_inorder_successor_of_BST.cpp} | 0
 ...CA_of_2_nodes_in_BST.cpp => 07_find_LCA_of_2_nodes_in_BST.cpp} | 0
 ...traversal.cpp => 08_construct_BST_from_preorder_traversal.cpp} | 0
 ...nary_tree_into_BST.cpp => 09_convert_binary_tree_into_BST.cpp} | 0
 ...ty_selection_problem.cpp => 01_activity_selection_problem.cpp} | 0
 ...2_job_sequencing_problem.cpp => 02_job_sequencing_problem.cpp} | 0
 08_greedy/{3_huffman_coding.cpp => 03_huffman_coding.cpp}         | 0
 ...ter_connection_problem.cpp => 04_water_connection_problem.cpp} | 0
 ...al_knapsack_problem.cpp => 05_fractional_knapsack_problem.cpp} | 0
 ...nd_minimum_no_of_coins.cpp => 06_find_minimum_no_of_coins.cpp} | 0
 ...p => 07_maximum_trains_for_which_stoppage_can_be_provided.cpp} | 0
 ...nimum_platform_problem.cpp => 08_minimum_platform_problem.cpp} | 0
 ...y.cpp => 09_buy_maximum_stock_if_can_be_bought_on_ith_day.cpp} | 0
 ...stack_from_scratch.cpp => 01_implement_stack_from_scratch.cpp} | 0
 ...queue_from_scratch.cpp => 02_implement_queue_from_scratch.cpp} | 0
 ...ent_2_stack_in_array.cpp => 03_implement_2_stack_in_array.cpp} | 0
 ...nd_middle_ele_in_stack.cpp => 04_find_middle_ele_in_stack.cpp} | 0
 ...ks_in_one_array.cpp => 05_implement_N_stacks_in_one_array.cpp} | 0
 ...pp => 06_check_expression_has_balanced_paranthesis_or_not.cpp} | 0
 ...e_string_using_stack.cpp => 07_reverse_string_using_stack.cpp} | 0
 .../{8_minEle_in_O1_TC_O1_SC.cpp => 08_minEle_in_O1_TC_O1_SC.cpp} | 0
 .../{9_find_next_greater_ele.cpp => 09_find_next_greater_ele.cpp} | 0
 ...ng_heap_HEAPSORT.cpp => 02_sort_array_using_heap_HEAPSORT.cpp} | 0
 ...ray_of_size_K.cpp => 03_maximum_of_all_subarray_of_size_K.cpp} | 0
 ...4_k_largest_ele_in_array.cpp => 04_k_largest_ele_in_array.cpp} | 0
 ....cpp => 05_kth_smallest_and_kth_largest_in_unsorted_array.cpp} | 0
 .../{6_merge_k_sorted_array.cpp => 06_merge_k_sorted_array.cpp}   | 0
 ...e_two_binary_maxheaps.cpp => 07_merge_two_binary_maxheaps.cpp} | 0
 ..._subarrays.cpp => 08_kth_largest_sum_continuous_subarrays.cpp} | 0
 11_heap/{9_reorganize_strings.cpp => 09_reorganize_strings.cpp}   | 0
 14_DP/{1_0-1_knapsack.cpp => 01_0-1_knapsack.cpp}                 | 0
 14_DP/{2_equal_subset-sum.cpp => 02_equal_subset-sum.cpp}         | 0
 14_DP/{3_coin_change.cpp => 03_coin_change.cpp}                   | 0
 14_DP/{4_LC_subsequences.cpp => 04_LC_subsequences.cpp}           | 0
 14_DP/{5_LC_substring.cpp => 05_LC_substring.cpp}                 | 0
 ...mic_Subsequence.cpp => 06_Longest_Palindromic_Subsequence.cpp} | 0
 ...um_number_of_deletion_in_a_string_to_make_it_a_palindrome.cpp} | 0
 ...peated_subsequence.cpp => 08_longest_repeated_subsequence.cpp} | 0
 14_DP/{9_binomial_cofficient.cpp => 09_binomial_cofficient.cpp}   | 0
 .../{1_count_set_bits_in_num.cpp => 01_count_set_bits_in_num.cpp} | 0
 ...2_non_repeating_elements.cpp => 02_non_repeating_elements.cpp} | 0
 15_bit-manipulation/{3_bits_flipped.cpp => 03_bits_flipped.cpp}   | 0
 ...set_bits_from_1_to_n.cpp => 04_total_set_bits_from_1_to_n.cpp} | 0
 .../{5_no_is_power_of_2.cpp => 05_no_is_power_of_2.cpp}           | 0
 .../{6_find_pos_of_set_bit.cpp => 06_find_pos_of_set_bit.cpp}     | 0
 .../{7_copy_set_bit_in_range.cpp => 07_copy_set_bit_in_range.cpp} | 0
 .../{8_without_div_mul_mod.cpp => 08_without_div_mul_mod.cpp}     | 0
 ..._pow_divide.cpp => 09_square_of_no_without_mul_pow_divide.cpp} | 0
 89 files changed, 0 insertions(+), 0 deletions(-)
 rename 01_array/{1_reverse_array.cpp => 01_reverse_array.cpp} (100%)
 rename 01_array/{2_max_min_array.cpp => 02_max_min_array.cpp} (100%)
 rename 01_array/{3_kth_max_min.cpp => 03_kth_max_min.cpp} (100%)
 rename 01_array/{4_sort_arr_0_1_2.cpp => 04_sort_arr_0_1_2.cpp} (100%)
 rename 01_array/{5_negative_ele_to_one_side_of_array.cpp => 05_negative_ele_to_one_side_of_array.cpp} (100%)
 rename 01_array/{6_union_and_intersection.cpp => 06_union_and_intersection.cpp} (100%)
 rename 01_array/{7_cyclically_rotate_by_1.cpp => 07_cyclically_rotate_by_1.cpp} (100%)
 rename 01_array/{8_largest_sum_conti_arr.cpp => 08_largest_sum_conti_arr.cpp} (100%)
 rename 01_array/{9_minimize_the_height.cpp => 09_minimize_the_height.cpp} (100%)
 rename 03_string/{1-reverse-string.cpp => 01-reverse-string.cpp} (100%)
 rename 03_string/{2-is-palindrom.cpp => 02-is-palindrom.cpp} (100%)
 rename 03_string/{3_duplicates_char_in_string.cpp => 03_duplicates_char_in_string.cpp} (100%)
 rename 03_string/{4_why_string_are_immutable.cpp => 04_why_string_are_immutable.cpp} (100%)
 rename 03_string/{5_check_rotation_of_other.cpp => 05_check_rotation_of_other.cpp} (100%)
 rename 03_string/{6_string_shuffle_of_other.cpp => 06_string_shuffle_of_other.cpp} (100%)
 rename 03_string/{7_count_and_say.cpp => 07_count_and_say.cpp} (100%)
 rename 03_string/{8_longest_palindromic_substring.cpp => 08_longest_palindromic_substring.cpp} (100%)
 rename 03_string/{9_longest_recurring_subsequence.cpp => 09_longest_recurring_subsequence.cpp} (100%)
 rename 05_linked_list/{1_reverse_linklist.cpp => 01_reverse_linklist.cpp} (100%)
 rename 05_linked_list/{2_reverse_linklist_given_n.cpp => 02_reverse_linklist_given_n.cpp} (100%)
 rename 05_linked_list/{3_detect_loop.cpp => 03_detect_loop.cpp} (100%)
 rename 05_linked_list/{4_delete_loop.cpp => 04_delete_loop.cpp} (100%)
 rename 05_linked_list/{5_first_node_in_loop.cpp => 05_first_node_in_loop.cpp} (100%)
 rename 05_linked_list/{6_remove_duplicates_in_sorted_linklist.cpp => 06_remove_duplicates_in_sorted_linklist.cpp} (100%)
 rename 05_linked_list/{7_remove_duplicates_from_unsorted_linklist.cpp => 07_remove_duplicates_from_unsorted_linklist.cpp} (100%)
 rename 05_linked_list/{8_move_last_ele_to_front.cpp => 08_move_last_ele_to_front.cpp} (100%)
 rename 05_linked_list/{9_add_1_to_no_in_linklist.cpp => 09_add_1_to_no_in_linklist.cpp} (100%)
 rename 06_binary_trees/{1_level_order_traversal.cpp => 01_level_order_traversal.cpp} (100%)
 rename 06_binary_trees/{2_reverse_level_order_traversal.cpp => 02_reverse_level_order_traversal.cpp} (100%)
 rename 06_binary_trees/{3_height_of_tree.cpp => 03_height_of_tree.cpp} (100%)
 rename 06_binary_trees/{4_diameter_of_tree.cpp => 04_diameter_of_tree.cpp} (100%)
 rename 06_binary_trees/{5_mirror_of_tree.cpp => 05_mirror_of_tree.cpp} (100%)
 rename 06_binary_trees/{6_inorder_traversal_recursion_itertion.cpp => 06_inorder_traversal_recursion_itertion.cpp} (100%)
 rename 06_binary_trees/{7_preorder_traversal_recursion_itertion.cpp => 07_preorder_traversal_recursion_itertion.cpp} (100%)
 rename 06_binary_trees/{8_postorder_traversal_recursion_itertion.cpp => 08_postorder_traversal_recursion_itertion.cpp} (100%)
 rename 06_binary_trees/{9_left_view_of_tree.cpp => 09_left_view_of_tree.cpp} (100%)
 rename 07_binary_search_trees/{1_find_a_value_in_BST.cpp => 01_find_a_value_in_BST.cpp} (100%)
 rename 07_binary_search_trees/{2_deletion_of_node_in_BST.cpp => 02_deletion_of_node_in_BST.cpp} (100%)
 rename 07_binary_search_trees/{3_min_max_value_in_BST.cpp => 03_min_max_value_in_BST.cpp} (100%)
 rename 07_binary_search_trees/{4_find_inorder_successor_predecessor_in_BST.cpp => 04_find_inorder_successor_predecessor_in_BST.cpp} (100%)
 rename 07_binary_search_trees/{5_check_if_tree_is_BST_or_not.cpp => 05_check_if_tree_is_BST_or_not.cpp} (100%)
 rename 07_binary_search_trees/{6_populate_inorder_successor_of_BST.cpp => 06_populate_inorder_successor_of_BST.cpp} (100%)
 rename 07_binary_search_trees/{7_find_LCA_of_2_nodes_in_BST.cpp => 07_find_LCA_of_2_nodes_in_BST.cpp} (100%)
 rename 07_binary_search_trees/{8_construct_BST_from_preorder_traversal.cpp => 08_construct_BST_from_preorder_traversal.cpp} (100%)
 rename 07_binary_search_trees/{9_convert_binary_tree_into_BST.cpp => 09_convert_binary_tree_into_BST.cpp} (100%)
 rename 08_greedy/{1_activity_selection_problem.cpp => 01_activity_selection_problem.cpp} (100%)
 rename 08_greedy/{2_job_sequencing_problem.cpp => 02_job_sequencing_problem.cpp} (100%)
 rename 08_greedy/{3_huffman_coding.cpp => 03_huffman_coding.cpp} (100%)
 rename 08_greedy/{4_water_connection_problem.cpp => 04_water_connection_problem.cpp} (100%)
 rename 08_greedy/{5_fractional_knapsack_problem.cpp => 05_fractional_knapsack_problem.cpp} (100%)
 rename 08_greedy/{6_find_minimum_no_of_coins.cpp => 06_find_minimum_no_of_coins.cpp} (100%)
 rename 08_greedy/{7_maximum_trains_for_which_stoppage_can_be_provided.cpp => 07_maximum_trains_for_which_stoppage_can_be_provided.cpp} (100%)
 rename 08_greedy/{8_minimum_platform_problem.cpp => 08_minimum_platform_problem.cpp} (100%)
 rename 08_greedy/{9_buy_maximum_stock_if_can_be_bought_on_ith_day.cpp => 09_buy_maximum_stock_if_can_be_bought_on_ith_day.cpp} (100%)
 rename 10_stack_and_queues/{1_implement_stack_from_scratch.cpp => 01_implement_stack_from_scratch.cpp} (100%)
 rename 10_stack_and_queues/{2_implement_queue_from_scratch.cpp => 02_implement_queue_from_scratch.cpp} (100%)
 rename 10_stack_and_queues/{3_implement_2_stack_in_array.cpp => 03_implement_2_stack_in_array.cpp} (100%)
 rename 10_stack_and_queues/{4_find_middle_ele_in_stack.cpp => 04_find_middle_ele_in_stack.cpp} (100%)
 rename 10_stack_and_queues/{5_implement_N_stacks_in_one_array.cpp => 05_implement_N_stacks_in_one_array.cpp} (100%)
 rename 10_stack_and_queues/{6_check_expression_has_balanced_paranthesis_or_not.cpp => 06_check_expression_has_balanced_paranthesis_or_not.cpp} (100%)
 rename 10_stack_and_queues/{7_reverse_string_using_stack.cpp => 07_reverse_string_using_stack.cpp} (100%)
 rename 10_stack_and_queues/{8_minEle_in_O1_TC_O1_SC.cpp => 08_minEle_in_O1_TC_O1_SC.cpp} (100%)
 rename 10_stack_and_queues/{9_find_next_greater_ele.cpp => 09_find_next_greater_ele.cpp} (100%)
 rename 11_heap/{2_sort_array_using_heap_HEAPSORT.cpp => 02_sort_array_using_heap_HEAPSORT.cpp} (100%)
 rename 11_heap/{3_maximum_of_all_subarray_of_size_K.cpp => 03_maximum_of_all_subarray_of_size_K.cpp} (100%)
 rename 11_heap/{4_k_largest_ele_in_array.cpp => 04_k_largest_ele_in_array.cpp} (100%)
 rename 11_heap/{5_kth_smallest_and_kth_largest_in_unsorted_array.cpp => 05_kth_smallest_and_kth_largest_in_unsorted_array.cpp} (100%)
 rename 11_heap/{6_merge_k_sorted_array.cpp => 06_merge_k_sorted_array.cpp} (100%)
 rename 11_heap/{7_merge_two_binary_maxheaps.cpp => 07_merge_two_binary_maxheaps.cpp} (100%)
 rename 11_heap/{8_kth_largest_sum_continuous_subarrays.cpp => 08_kth_largest_sum_continuous_subarrays.cpp} (100%)
 rename 11_heap/{9_reorganize_strings.cpp => 09_reorganize_strings.cpp} (100%)
 rename 14_DP/{1_0-1_knapsack.cpp => 01_0-1_knapsack.cpp} (100%)
 rename 14_DP/{2_equal_subset-sum.cpp => 02_equal_subset-sum.cpp} (100%)
 rename 14_DP/{3_coin_change.cpp => 03_coin_change.cpp} (100%)
 rename 14_DP/{4_LC_subsequences.cpp => 04_LC_subsequences.cpp} (100%)
 rename 14_DP/{5_LC_substring.cpp => 05_LC_substring.cpp} (100%)
 rename 14_DP/{6_Longest_Palindromic_Subsequence.cpp => 06_Longest_Palindromic_Subsequence.cpp} (100%)
 rename 14_DP/{7_Minimum_number_of_deletion_in_a_string_to_make_it_a_palindrome.cpp => 07_Minimum_number_of_deletion_in_a_string_to_make_it_a_palindrome.cpp} (100%)
 rename 14_DP/{8_longest_repeated_subsequence.cpp => 08_longest_repeated_subsequence.cpp} (100%)
 rename 14_DP/{9_binomial_cofficient.cpp => 09_binomial_cofficient.cpp} (100%)
 rename 15_bit-manipulation/{1_count_set_bits_in_num.cpp => 01_count_set_bits_in_num.cpp} (100%)
 rename 15_bit-manipulation/{2_non_repeating_elements.cpp => 02_non_repeating_elements.cpp} (100%)
 rename 15_bit-manipulation/{3_bits_flipped.cpp => 03_bits_flipped.cpp} (100%)
 rename 15_bit-manipulation/{4_total_set_bits_from_1_to_n.cpp => 04_total_set_bits_from_1_to_n.cpp} (100%)
 rename 15_bit-manipulation/{5_no_is_power_of_2.cpp => 05_no_is_power_of_2.cpp} (100%)
 rename 15_bit-manipulation/{6_find_pos_of_set_bit.cpp => 06_find_pos_of_set_bit.cpp} (100%)
 rename 15_bit-manipulation/{7_copy_set_bit_in_range.cpp => 07_copy_set_bit_in_range.cpp} (100%)
 rename 15_bit-manipulation/{8_without_div_mul_mod.cpp => 08_without_div_mul_mod.cpp} (100%)
 rename 15_bit-manipulation/{9_square_of_no_without_mul_pow_divide.cpp => 09_square_of_no_without_mul_pow_divide.cpp} (100%)

diff --git a/01_array/1_reverse_array.cpp b/01_array/01_reverse_array.cpp
similarity index 100%
rename from 01_array/1_reverse_array.cpp
rename to 01_array/01_reverse_array.cpp
diff --git a/01_array/2_max_min_array.cpp b/01_array/02_max_min_array.cpp
similarity index 100%
rename from 01_array/2_max_min_array.cpp
rename to 01_array/02_max_min_array.cpp
diff --git a/01_array/3_kth_max_min.cpp b/01_array/03_kth_max_min.cpp
similarity index 100%
rename from 01_array/3_kth_max_min.cpp
rename to 01_array/03_kth_max_min.cpp
diff --git a/01_array/4_sort_arr_0_1_2.cpp b/01_array/04_sort_arr_0_1_2.cpp
similarity index 100%
rename from 01_array/4_sort_arr_0_1_2.cpp
rename to 01_array/04_sort_arr_0_1_2.cpp
diff --git a/01_array/5_negative_ele_to_one_side_of_array.cpp b/01_array/05_negative_ele_to_one_side_of_array.cpp
similarity index 100%
rename from 01_array/5_negative_ele_to_one_side_of_array.cpp
rename to 01_array/05_negative_ele_to_one_side_of_array.cpp
diff --git a/01_array/6_union_and_intersection.cpp b/01_array/06_union_and_intersection.cpp
similarity index 100%
rename from 01_array/6_union_and_intersection.cpp
rename to 01_array/06_union_and_intersection.cpp
diff --git a/01_array/7_cyclically_rotate_by_1.cpp b/01_array/07_cyclically_rotate_by_1.cpp
similarity index 100%
rename from 01_array/7_cyclically_rotate_by_1.cpp
rename to 01_array/07_cyclically_rotate_by_1.cpp
diff --git a/01_array/8_largest_sum_conti_arr.cpp b/01_array/08_largest_sum_conti_arr.cpp
similarity index 100%
rename from 01_array/8_largest_sum_conti_arr.cpp
rename to 01_array/08_largest_sum_conti_arr.cpp
diff --git a/01_array/9_minimize_the_height.cpp b/01_array/09_minimize_the_height.cpp
similarity index 100%
rename from 01_array/9_minimize_the_height.cpp
rename to 01_array/09_minimize_the_height.cpp
diff --git a/03_string/1-reverse-string.cpp b/03_string/01-reverse-string.cpp
similarity index 100%
rename from 03_string/1-reverse-string.cpp
rename to 03_string/01-reverse-string.cpp
diff --git a/03_string/2-is-palindrom.cpp b/03_string/02-is-palindrom.cpp
similarity index 100%
rename from 03_string/2-is-palindrom.cpp
rename to 03_string/02-is-palindrom.cpp
diff --git a/03_string/3_duplicates_char_in_string.cpp b/03_string/03_duplicates_char_in_string.cpp
similarity index 100%
rename from 03_string/3_duplicates_char_in_string.cpp
rename to 03_string/03_duplicates_char_in_string.cpp
diff --git a/03_string/4_why_string_are_immutable.cpp b/03_string/04_why_string_are_immutable.cpp
similarity index 100%
rename from 03_string/4_why_string_are_immutable.cpp
rename to 03_string/04_why_string_are_immutable.cpp
diff --git a/03_string/5_check_rotation_of_other.cpp b/03_string/05_check_rotation_of_other.cpp
similarity index 100%
rename from 03_string/5_check_rotation_of_other.cpp
rename to 03_string/05_check_rotation_of_other.cpp
diff --git a/03_string/6_string_shuffle_of_other.cpp b/03_string/06_string_shuffle_of_other.cpp
similarity index 100%
rename from 03_string/6_string_shuffle_of_other.cpp
rename to 03_string/06_string_shuffle_of_other.cpp
diff --git a/03_string/7_count_and_say.cpp b/03_string/07_count_and_say.cpp
similarity index 100%
rename from 03_string/7_count_and_say.cpp
rename to 03_string/07_count_and_say.cpp
diff --git a/03_string/8_longest_palindromic_substring.cpp b/03_string/08_longest_palindromic_substring.cpp
similarity index 100%
rename from 03_string/8_longest_palindromic_substring.cpp
rename to 03_string/08_longest_palindromic_substring.cpp
diff --git a/03_string/9_longest_recurring_subsequence.cpp b/03_string/09_longest_recurring_subsequence.cpp
similarity index 100%
rename from 03_string/9_longest_recurring_subsequence.cpp
rename to 03_string/09_longest_recurring_subsequence.cpp
diff --git a/05_linked_list/1_reverse_linklist.cpp b/05_linked_list/01_reverse_linklist.cpp
similarity index 100%
rename from 05_linked_list/1_reverse_linklist.cpp
rename to 05_linked_list/01_reverse_linklist.cpp
diff --git a/05_linked_list/2_reverse_linklist_given_n.cpp b/05_linked_list/02_reverse_linklist_given_n.cpp
similarity index 100%
rename from 05_linked_list/2_reverse_linklist_given_n.cpp
rename to 05_linked_list/02_reverse_linklist_given_n.cpp
diff --git a/05_linked_list/3_detect_loop.cpp b/05_linked_list/03_detect_loop.cpp
similarity index 100%
rename from 05_linked_list/3_detect_loop.cpp
rename to 05_linked_list/03_detect_loop.cpp
diff --git a/05_linked_list/4_delete_loop.cpp b/05_linked_list/04_delete_loop.cpp
similarity index 100%
rename from 05_linked_list/4_delete_loop.cpp
rename to 05_linked_list/04_delete_loop.cpp
diff --git a/05_linked_list/5_first_node_in_loop.cpp b/05_linked_list/05_first_node_in_loop.cpp
similarity index 100%
rename from 05_linked_list/5_first_node_in_loop.cpp
rename to 05_linked_list/05_first_node_in_loop.cpp
diff --git a/05_linked_list/6_remove_duplicates_in_sorted_linklist.cpp b/05_linked_list/06_remove_duplicates_in_sorted_linklist.cpp
similarity index 100%
rename from 05_linked_list/6_remove_duplicates_in_sorted_linklist.cpp
rename to 05_linked_list/06_remove_duplicates_in_sorted_linklist.cpp
diff --git a/05_linked_list/7_remove_duplicates_from_unsorted_linklist.cpp b/05_linked_list/07_remove_duplicates_from_unsorted_linklist.cpp
similarity index 100%
rename from 05_linked_list/7_remove_duplicates_from_unsorted_linklist.cpp
rename to 05_linked_list/07_remove_duplicates_from_unsorted_linklist.cpp
diff --git a/05_linked_list/8_move_last_ele_to_front.cpp b/05_linked_list/08_move_last_ele_to_front.cpp
similarity index 100%
rename from 05_linked_list/8_move_last_ele_to_front.cpp
rename to 05_linked_list/08_move_last_ele_to_front.cpp
diff --git a/05_linked_list/9_add_1_to_no_in_linklist.cpp b/05_linked_list/09_add_1_to_no_in_linklist.cpp
similarity index 100%
rename from 05_linked_list/9_add_1_to_no_in_linklist.cpp
rename to 05_linked_list/09_add_1_to_no_in_linklist.cpp
diff --git a/06_binary_trees/1_level_order_traversal.cpp b/06_binary_trees/01_level_order_traversal.cpp
similarity index 100%
rename from 06_binary_trees/1_level_order_traversal.cpp
rename to 06_binary_trees/01_level_order_traversal.cpp
diff --git a/06_binary_trees/2_reverse_level_order_traversal.cpp b/06_binary_trees/02_reverse_level_order_traversal.cpp
similarity index 100%
rename from 06_binary_trees/2_reverse_level_order_traversal.cpp
rename to 06_binary_trees/02_reverse_level_order_traversal.cpp
diff --git a/06_binary_trees/3_height_of_tree.cpp b/06_binary_trees/03_height_of_tree.cpp
similarity index 100%
rename from 06_binary_trees/3_height_of_tree.cpp
rename to 06_binary_trees/03_height_of_tree.cpp
diff --git a/06_binary_trees/4_diameter_of_tree.cpp b/06_binary_trees/04_diameter_of_tree.cpp
similarity index 100%
rename from 06_binary_trees/4_diameter_of_tree.cpp
rename to 06_binary_trees/04_diameter_of_tree.cpp
diff --git a/06_binary_trees/5_mirror_of_tree.cpp b/06_binary_trees/05_mirror_of_tree.cpp
similarity index 100%
rename from 06_binary_trees/5_mirror_of_tree.cpp
rename to 06_binary_trees/05_mirror_of_tree.cpp
diff --git a/06_binary_trees/6_inorder_traversal_recursion_itertion.cpp b/06_binary_trees/06_inorder_traversal_recursion_itertion.cpp
similarity index 100%
rename from 06_binary_trees/6_inorder_traversal_recursion_itertion.cpp
rename to 06_binary_trees/06_inorder_traversal_recursion_itertion.cpp
diff --git a/06_binary_trees/7_preorder_traversal_recursion_itertion.cpp b/06_binary_trees/07_preorder_traversal_recursion_itertion.cpp
similarity index 100%
rename from 06_binary_trees/7_preorder_traversal_recursion_itertion.cpp
rename to 06_binary_trees/07_preorder_traversal_recursion_itertion.cpp
diff --git a/06_binary_trees/8_postorder_traversal_recursion_itertion.cpp b/06_binary_trees/08_postorder_traversal_recursion_itertion.cpp
similarity index 100%
rename from 06_binary_trees/8_postorder_traversal_recursion_itertion.cpp
rename to 06_binary_trees/08_postorder_traversal_recursion_itertion.cpp
diff --git a/06_binary_trees/9_left_view_of_tree.cpp b/06_binary_trees/09_left_view_of_tree.cpp
similarity index 100%
rename from 06_binary_trees/9_left_view_of_tree.cpp
rename to 06_binary_trees/09_left_view_of_tree.cpp
diff --git a/07_binary_search_trees/1_find_a_value_in_BST.cpp b/07_binary_search_trees/01_find_a_value_in_BST.cpp
similarity index 100%
rename from 07_binary_search_trees/1_find_a_value_in_BST.cpp
rename to 07_binary_search_trees/01_find_a_value_in_BST.cpp
diff --git a/07_binary_search_trees/2_deletion_of_node_in_BST.cpp b/07_binary_search_trees/02_deletion_of_node_in_BST.cpp
similarity index 100%
rename from 07_binary_search_trees/2_deletion_of_node_in_BST.cpp
rename to 07_binary_search_trees/02_deletion_of_node_in_BST.cpp
diff --git a/07_binary_search_trees/3_min_max_value_in_BST.cpp b/07_binary_search_trees/03_min_max_value_in_BST.cpp
similarity index 100%
rename from 07_binary_search_trees/3_min_max_value_in_BST.cpp
rename to 07_binary_search_trees/03_min_max_value_in_BST.cpp
diff --git a/07_binary_search_trees/4_find_inorder_successor_predecessor_in_BST.cpp b/07_binary_search_trees/04_find_inorder_successor_predecessor_in_BST.cpp
similarity index 100%
rename from 07_binary_search_trees/4_find_inorder_successor_predecessor_in_BST.cpp
rename to 07_binary_search_trees/04_find_inorder_successor_predecessor_in_BST.cpp
diff --git a/07_binary_search_trees/5_check_if_tree_is_BST_or_not.cpp b/07_binary_search_trees/05_check_if_tree_is_BST_or_not.cpp
similarity index 100%
rename from 07_binary_search_trees/5_check_if_tree_is_BST_or_not.cpp
rename to 07_binary_search_trees/05_check_if_tree_is_BST_or_not.cpp
diff --git a/07_binary_search_trees/6_populate_inorder_successor_of_BST.cpp b/07_binary_search_trees/06_populate_inorder_successor_of_BST.cpp
similarity index 100%
rename from 07_binary_search_trees/6_populate_inorder_successor_of_BST.cpp
rename to 07_binary_search_trees/06_populate_inorder_successor_of_BST.cpp
diff --git a/07_binary_search_trees/7_find_LCA_of_2_nodes_in_BST.cpp b/07_binary_search_trees/07_find_LCA_of_2_nodes_in_BST.cpp
similarity index 100%
rename from 07_binary_search_trees/7_find_LCA_of_2_nodes_in_BST.cpp
rename to 07_binary_search_trees/07_find_LCA_of_2_nodes_in_BST.cpp
diff --git a/07_binary_search_trees/8_construct_BST_from_preorder_traversal.cpp b/07_binary_search_trees/08_construct_BST_from_preorder_traversal.cpp
similarity index 100%
rename from 07_binary_search_trees/8_construct_BST_from_preorder_traversal.cpp
rename to 07_binary_search_trees/08_construct_BST_from_preorder_traversal.cpp
diff --git a/07_binary_search_trees/9_convert_binary_tree_into_BST.cpp b/07_binary_search_trees/09_convert_binary_tree_into_BST.cpp
similarity index 100%
rename from 07_binary_search_trees/9_convert_binary_tree_into_BST.cpp
rename to 07_binary_search_trees/09_convert_binary_tree_into_BST.cpp
diff --git a/08_greedy/1_activity_selection_problem.cpp b/08_greedy/01_activity_selection_problem.cpp
similarity index 100%
rename from 08_greedy/1_activity_selection_problem.cpp
rename to 08_greedy/01_activity_selection_problem.cpp
diff --git a/08_greedy/2_job_sequencing_problem.cpp b/08_greedy/02_job_sequencing_problem.cpp
similarity index 100%
rename from 08_greedy/2_job_sequencing_problem.cpp
rename to 08_greedy/02_job_sequencing_problem.cpp
diff --git a/08_greedy/3_huffman_coding.cpp b/08_greedy/03_huffman_coding.cpp
similarity index 100%
rename from 08_greedy/3_huffman_coding.cpp
rename to 08_greedy/03_huffman_coding.cpp
diff --git a/08_greedy/4_water_connection_problem.cpp b/08_greedy/04_water_connection_problem.cpp
similarity index 100%
rename from 08_greedy/4_water_connection_problem.cpp
rename to 08_greedy/04_water_connection_problem.cpp
diff --git a/08_greedy/5_fractional_knapsack_problem.cpp b/08_greedy/05_fractional_knapsack_problem.cpp
similarity index 100%
rename from 08_greedy/5_fractional_knapsack_problem.cpp
rename to 08_greedy/05_fractional_knapsack_problem.cpp
diff --git a/08_greedy/6_find_minimum_no_of_coins.cpp b/08_greedy/06_find_minimum_no_of_coins.cpp
similarity index 100%
rename from 08_greedy/6_find_minimum_no_of_coins.cpp
rename to 08_greedy/06_find_minimum_no_of_coins.cpp
diff --git a/08_greedy/7_maximum_trains_for_which_stoppage_can_be_provided.cpp b/08_greedy/07_maximum_trains_for_which_stoppage_can_be_provided.cpp
similarity index 100%
rename from 08_greedy/7_maximum_trains_for_which_stoppage_can_be_provided.cpp
rename to 08_greedy/07_maximum_trains_for_which_stoppage_can_be_provided.cpp
diff --git a/08_greedy/8_minimum_platform_problem.cpp b/08_greedy/08_minimum_platform_problem.cpp
similarity index 100%
rename from 08_greedy/8_minimum_platform_problem.cpp
rename to 08_greedy/08_minimum_platform_problem.cpp
diff --git a/08_greedy/9_buy_maximum_stock_if_can_be_bought_on_ith_day.cpp b/08_greedy/09_buy_maximum_stock_if_can_be_bought_on_ith_day.cpp
similarity index 100%
rename from 08_greedy/9_buy_maximum_stock_if_can_be_bought_on_ith_day.cpp
rename to 08_greedy/09_buy_maximum_stock_if_can_be_bought_on_ith_day.cpp
diff --git a/10_stack_and_queues/1_implement_stack_from_scratch.cpp b/10_stack_and_queues/01_implement_stack_from_scratch.cpp
similarity index 100%
rename from 10_stack_and_queues/1_implement_stack_from_scratch.cpp
rename to 10_stack_and_queues/01_implement_stack_from_scratch.cpp
diff --git a/10_stack_and_queues/2_implement_queue_from_scratch.cpp b/10_stack_and_queues/02_implement_queue_from_scratch.cpp
similarity index 100%
rename from 10_stack_and_queues/2_implement_queue_from_scratch.cpp
rename to 10_stack_and_queues/02_implement_queue_from_scratch.cpp
diff --git a/10_stack_and_queues/3_implement_2_stack_in_array.cpp b/10_stack_and_queues/03_implement_2_stack_in_array.cpp
similarity index 100%
rename from 10_stack_and_queues/3_implement_2_stack_in_array.cpp
rename to 10_stack_and_queues/03_implement_2_stack_in_array.cpp
diff --git a/10_stack_and_queues/4_find_middle_ele_in_stack.cpp b/10_stack_and_queues/04_find_middle_ele_in_stack.cpp
similarity index 100%
rename from 10_stack_and_queues/4_find_middle_ele_in_stack.cpp
rename to 10_stack_and_queues/04_find_middle_ele_in_stack.cpp
diff --git a/10_stack_and_queues/5_implement_N_stacks_in_one_array.cpp b/10_stack_and_queues/05_implement_N_stacks_in_one_array.cpp
similarity index 100%
rename from 10_stack_and_queues/5_implement_N_stacks_in_one_array.cpp
rename to 10_stack_and_queues/05_implement_N_stacks_in_one_array.cpp
diff --git a/10_stack_and_queues/6_check_expression_has_balanced_paranthesis_or_not.cpp b/10_stack_and_queues/06_check_expression_has_balanced_paranthesis_or_not.cpp
similarity index 100%
rename from 10_stack_and_queues/6_check_expression_has_balanced_paranthesis_or_not.cpp
rename to 10_stack_and_queues/06_check_expression_has_balanced_paranthesis_or_not.cpp
diff --git a/10_stack_and_queues/7_reverse_string_using_stack.cpp b/10_stack_and_queues/07_reverse_string_using_stack.cpp
similarity index 100%
rename from 10_stack_and_queues/7_reverse_string_using_stack.cpp
rename to 10_stack_and_queues/07_reverse_string_using_stack.cpp
diff --git a/10_stack_and_queues/8_minEle_in_O1_TC_O1_SC.cpp b/10_stack_and_queues/08_minEle_in_O1_TC_O1_SC.cpp
similarity index 100%
rename from 10_stack_and_queues/8_minEle_in_O1_TC_O1_SC.cpp
rename to 10_stack_and_queues/08_minEle_in_O1_TC_O1_SC.cpp
diff --git a/10_stack_and_queues/9_find_next_greater_ele.cpp b/10_stack_and_queues/09_find_next_greater_ele.cpp
similarity index 100%
rename from 10_stack_and_queues/9_find_next_greater_ele.cpp
rename to 10_stack_and_queues/09_find_next_greater_ele.cpp
diff --git a/11_heap/2_sort_array_using_heap_HEAPSORT.cpp b/11_heap/02_sort_array_using_heap_HEAPSORT.cpp
similarity index 100%
rename from 11_heap/2_sort_array_using_heap_HEAPSORT.cpp
rename to 11_heap/02_sort_array_using_heap_HEAPSORT.cpp
diff --git a/11_heap/3_maximum_of_all_subarray_of_size_K.cpp b/11_heap/03_maximum_of_all_subarray_of_size_K.cpp
similarity index 100%
rename from 11_heap/3_maximum_of_all_subarray_of_size_K.cpp
rename to 11_heap/03_maximum_of_all_subarray_of_size_K.cpp
diff --git a/11_heap/4_k_largest_ele_in_array.cpp b/11_heap/04_k_largest_ele_in_array.cpp
similarity index 100%
rename from 11_heap/4_k_largest_ele_in_array.cpp
rename to 11_heap/04_k_largest_ele_in_array.cpp
diff --git a/11_heap/5_kth_smallest_and_kth_largest_in_unsorted_array.cpp b/11_heap/05_kth_smallest_and_kth_largest_in_unsorted_array.cpp
similarity index 100%
rename from 11_heap/5_kth_smallest_and_kth_largest_in_unsorted_array.cpp
rename to 11_heap/05_kth_smallest_and_kth_largest_in_unsorted_array.cpp
diff --git a/11_heap/6_merge_k_sorted_array.cpp b/11_heap/06_merge_k_sorted_array.cpp
similarity index 100%
rename from 11_heap/6_merge_k_sorted_array.cpp
rename to 11_heap/06_merge_k_sorted_array.cpp
diff --git a/11_heap/7_merge_two_binary_maxheaps.cpp b/11_heap/07_merge_two_binary_maxheaps.cpp
similarity index 100%
rename from 11_heap/7_merge_two_binary_maxheaps.cpp
rename to 11_heap/07_merge_two_binary_maxheaps.cpp
diff --git a/11_heap/8_kth_largest_sum_continuous_subarrays.cpp b/11_heap/08_kth_largest_sum_continuous_subarrays.cpp
similarity index 100%
rename from 11_heap/8_kth_largest_sum_continuous_subarrays.cpp
rename to 11_heap/08_kth_largest_sum_continuous_subarrays.cpp
diff --git a/11_heap/9_reorganize_strings.cpp b/11_heap/09_reorganize_strings.cpp
similarity index 100%
rename from 11_heap/9_reorganize_strings.cpp
rename to 11_heap/09_reorganize_strings.cpp
diff --git a/14_DP/1_0-1_knapsack.cpp b/14_DP/01_0-1_knapsack.cpp
similarity index 100%
rename from 14_DP/1_0-1_knapsack.cpp
rename to 14_DP/01_0-1_knapsack.cpp
diff --git a/14_DP/2_equal_subset-sum.cpp b/14_DP/02_equal_subset-sum.cpp
similarity index 100%
rename from 14_DP/2_equal_subset-sum.cpp
rename to 14_DP/02_equal_subset-sum.cpp
diff --git a/14_DP/3_coin_change.cpp b/14_DP/03_coin_change.cpp
similarity index 100%
rename from 14_DP/3_coin_change.cpp
rename to 14_DP/03_coin_change.cpp
diff --git a/14_DP/4_LC_subsequences.cpp b/14_DP/04_LC_subsequences.cpp
similarity index 100%
rename from 14_DP/4_LC_subsequences.cpp
rename to 14_DP/04_LC_subsequences.cpp
diff --git a/14_DP/5_LC_substring.cpp b/14_DP/05_LC_substring.cpp
similarity index 100%
rename from 14_DP/5_LC_substring.cpp
rename to 14_DP/05_LC_substring.cpp
diff --git a/14_DP/6_Longest_Palindromic_Subsequence.cpp b/14_DP/06_Longest_Palindromic_Subsequence.cpp
similarity index 100%
rename from 14_DP/6_Longest_Palindromic_Subsequence.cpp
rename to 14_DP/06_Longest_Palindromic_Subsequence.cpp
diff --git a/14_DP/7_Minimum_number_of_deletion_in_a_string_to_make_it_a_palindrome.cpp b/14_DP/07_Minimum_number_of_deletion_in_a_string_to_make_it_a_palindrome.cpp
similarity index 100%
rename from 14_DP/7_Minimum_number_of_deletion_in_a_string_to_make_it_a_palindrome.cpp
rename to 14_DP/07_Minimum_number_of_deletion_in_a_string_to_make_it_a_palindrome.cpp
diff --git a/14_DP/8_longest_repeated_subsequence.cpp b/14_DP/08_longest_repeated_subsequence.cpp
similarity index 100%
rename from 14_DP/8_longest_repeated_subsequence.cpp
rename to 14_DP/08_longest_repeated_subsequence.cpp
diff --git a/14_DP/9_binomial_cofficient.cpp b/14_DP/09_binomial_cofficient.cpp
similarity index 100%
rename from 14_DP/9_binomial_cofficient.cpp
rename to 14_DP/09_binomial_cofficient.cpp
diff --git a/15_bit-manipulation/1_count_set_bits_in_num.cpp b/15_bit-manipulation/01_count_set_bits_in_num.cpp
similarity index 100%
rename from 15_bit-manipulation/1_count_set_bits_in_num.cpp
rename to 15_bit-manipulation/01_count_set_bits_in_num.cpp
diff --git a/15_bit-manipulation/2_non_repeating_elements.cpp b/15_bit-manipulation/02_non_repeating_elements.cpp
similarity index 100%
rename from 15_bit-manipulation/2_non_repeating_elements.cpp
rename to 15_bit-manipulation/02_non_repeating_elements.cpp
diff --git a/15_bit-manipulation/3_bits_flipped.cpp b/15_bit-manipulation/03_bits_flipped.cpp
similarity index 100%
rename from 15_bit-manipulation/3_bits_flipped.cpp
rename to 15_bit-manipulation/03_bits_flipped.cpp
diff --git a/15_bit-manipulation/4_total_set_bits_from_1_to_n.cpp b/15_bit-manipulation/04_total_set_bits_from_1_to_n.cpp
similarity index 100%
rename from 15_bit-manipulation/4_total_set_bits_from_1_to_n.cpp
rename to 15_bit-manipulation/04_total_set_bits_from_1_to_n.cpp
diff --git a/15_bit-manipulation/5_no_is_power_of_2.cpp b/15_bit-manipulation/05_no_is_power_of_2.cpp
similarity index 100%
rename from 15_bit-manipulation/5_no_is_power_of_2.cpp
rename to 15_bit-manipulation/05_no_is_power_of_2.cpp
diff --git a/15_bit-manipulation/6_find_pos_of_set_bit.cpp b/15_bit-manipulation/06_find_pos_of_set_bit.cpp
similarity index 100%
rename from 15_bit-manipulation/6_find_pos_of_set_bit.cpp
rename to 15_bit-manipulation/06_find_pos_of_set_bit.cpp
diff --git a/15_bit-manipulation/7_copy_set_bit_in_range.cpp b/15_bit-manipulation/07_copy_set_bit_in_range.cpp
similarity index 100%
rename from 15_bit-manipulation/7_copy_set_bit_in_range.cpp
rename to 15_bit-manipulation/07_copy_set_bit_in_range.cpp
diff --git a/15_bit-manipulation/8_without_div_mul_mod.cpp b/15_bit-manipulation/08_without_div_mul_mod.cpp
similarity index 100%
rename from 15_bit-manipulation/8_without_div_mul_mod.cpp
rename to 15_bit-manipulation/08_without_div_mul_mod.cpp
diff --git a/15_bit-manipulation/9_square_of_no_without_mul_pow_divide.cpp b/15_bit-manipulation/09_square_of_no_without_mul_pow_divide.cpp
similarity index 100%
rename from 15_bit-manipulation/9_square_of_no_without_mul_pow_divide.cpp
rename to 15_bit-manipulation/09_square_of_no_without_mul_pow_divide.cpp