diff --git a/.github/workflows/process_leetcode.yml b/.github/workflows/process_leetcode.yml new file mode 100644 index 0000000..8eb4763 --- /dev/null +++ b/.github/workflows/process_leetcode.yml @@ -0,0 +1,36 @@ +name: Process LeetCode Problems + +on: + workflow_run: + workflows: ["Sync Leetcode"] + types: + - completed + +jobs: + process: + runs-on: ubuntu-latest + if: ${{ github.event.workflow_run.conclusion == 'success' }} + + steps: + - uses: actions/checkout@v3 + with: + fetch-depth: 0 + + - name: Set up Go + uses: actions/setup-go@v4 + with: + go-version: '1.21' + + - name: Create problems directory + run: mkdir -p problems + + - name: Process problems + run: go run scripts/process_problems.go + + - name: Commit changes + run: | + git config --local user.email "action@github.com" + git config --local user.name "GitHub Action" + git add problems/ + git commit -m "Move processed problems to problems directory" || echo "No changes to commit" + git push \ No newline at end of file diff --git a/problems_backup/array_partition_i/solution.java b/0-array-partition-i/solution.java similarity index 100% rename from problems_backup/array_partition_i/solution.java rename to 0-array-partition-i/solution.java diff --git a/problems_backup/element_appearing_more_than_25%_in_sorted_array/solution.java b/0-element-appearing-more-than-25%-in-sorted-array/solution.java similarity index 100% rename from problems_backup/element_appearing_more_than_25%_in_sorted_array/solution.java rename to 0-element-appearing-more-than-25%-in-sorted-array/solution.java diff --git a/problems_backup/implement_strstr()/solution.java b/0-implement-strstr()/solution.java similarity index 100% rename from problems_backup/implement_strstr()/solution.java rename to 0-implement-strstr()/solution.java diff --git a/problems_backup/make_two_arrays_equal_by_reversing_sub-arrays/solution.java b/0-make-two-arrays-equal-by-reversing-sub-arrays/solution.java similarity index 100% rename from problems_backup/make_two_arrays_equal_by_reversing_sub-arrays/solution.java rename to 0-make-two-arrays-equal-by-reversing-sub-arrays/solution.java diff --git a/problems_backup/two_sum/solution.java b/1-two-sum/solution.java similarity index 100% rename from problems_backup/two_sum/solution.java rename to 1-two-sum/solution.java diff --git a/problems_backup/same_tree/solution.go b/100-same-tree/solution.go similarity index 100% rename from problems_backup/same_tree/solution.go rename to 100-same-tree/solution.go diff --git a/problems_backup/same_tree/solution.java b/100-same-tree/solution.java similarity index 100% rename from problems_backup/same_tree/solution.java rename to 100-same-tree/solution.java diff --git a/problems_backup/n-repeated_element_in_size_2n_array/solution.java b/1001-n-repeated-element-in-size-2n-array/solution.java similarity index 100% rename from problems_backup/n-repeated_element_in_size_2n_array/solution.java rename to 1001-n-repeated-element-in-size-2n-array/solution.java diff --git a/problems_backup/univalued_binary_tree/solution.java b/1005-univalued-binary-tree/solution.java similarity index 100% rename from problems_backup/univalued_binary_tree/solution.java rename to 1005-univalued-binary-tree/solution.java diff --git a/problems_backup/symmetric_tree/solution.java b/101-symmetric-tree/solution.java similarity index 100% rename from problems_backup/symmetric_tree/solution.java rename to 101-symmetric-tree/solution.java diff --git a/problems_backup/fibonacci_number/solution.go b/1013-fibonacci-number/solution.go similarity index 100% rename from problems_backup/fibonacci_number/solution.go rename to 1013-fibonacci-number/solution.go diff --git a/problems_backup/fibonacci_number/solution.java b/1013-fibonacci-number/solution.java similarity index 100% rename from problems_backup/fibonacci_number/solution.java rename to 1013-fibonacci-number/solution.java diff --git a/problems_backup/k_closest_points_to_origin/solution.go b/1014-k-closest-points-to-origin/solution.go similarity index 100% rename from problems_backup/k_closest_points_to_origin/solution.go rename to 1014-k-closest-points-to-origin/solution.go diff --git a/problems_backup/largest_perimeter_triangle/solution.go b/1018-largest-perimeter-triangle/solution.go similarity index 100% rename from problems_backup/largest_perimeter_triangle/solution.go rename to 1018-largest-perimeter-triangle/solution.go diff --git a/problems_backup/squares_of_a_sorted_array/solution.go b/1019-squares-of-a-sorted-array/solution.go similarity index 100% rename from problems_backup/squares_of_a_sorted_array/solution.go rename to 1019-squares-of-a-sorted-array/solution.go diff --git a/problems_backup/squares_of_a_sorted_array/solution.java b/1019-squares-of-a-sorted-array/solution.java similarity index 100% rename from problems_backup/squares_of_a_sorted_array/solution.java rename to 1019-squares-of-a-sorted-array/solution.java diff --git a/problems_backup/binary_tree_level_order_traversal/solution.go b/102-binary-tree-level-order-traversal/solution.go similarity index 100% rename from problems_backup/binary_tree_level_order_traversal/solution.go rename to 102-binary-tree-level-order-traversal/solution.go diff --git a/problems_backup/sum_of_even_numbers_after_queries/solution.go b/1027-sum-of-even-numbers-after-queries/solution.go similarity index 100% rename from problems_backup/sum_of_even_numbers_after_queries/solution.go rename to 1027-sum-of-even-numbers-after-queries/solution.go diff --git a/problems_backup/vertical_order_traversal_of_a_binary_tree/solution.go b/1029-vertical-order-traversal-of-a-binary-tree/solution.go similarity index 100% rename from problems_backup/vertical_order_traversal_of_a_binary_tree/solution.go rename to 1029-vertical-order-traversal-of-a-binary-tree/solution.go diff --git a/problems_backup/binary_tree_zigzag_level_order_traversal/solution.go b/103-binary-tree-zigzag-level-order-traversal/solution.go similarity index 100% rename from problems_backup/binary_tree_zigzag_level_order_traversal/solution.go rename to 103-binary-tree-zigzag-level-order-traversal/solution.go diff --git a/problems_backup/smallest_string_starting_from_leaf/solution.go b/1030-smallest-string-starting-from-leaf/solution.go similarity index 100% rename from problems_backup/smallest_string_starting_from_leaf/solution.go rename to 1030-smallest-string-starting-from-leaf/solution.go diff --git a/problems_backup/add_to_array-form_of_integer/solution.go b/1031-add-to-array-form-of-integer/solution.go similarity index 100% rename from problems_backup/add_to_array-form_of_integer/solution.go rename to 1031-add-to-array-form-of-integer/solution.go diff --git a/problems_backup/cousins_in_binary_tree/solution.go b/1035-cousins-in-binary-tree/solution.go similarity index 100% rename from problems_backup/cousins_in_binary_tree/solution.go rename to 1035-cousins-in-binary-tree/solution.go diff --git a/problems_backup/rotting_oranges/solution.go b/1036-rotting-oranges/solution.go similarity index 100% rename from problems_backup/rotting_oranges/solution.go rename to 1036-rotting-oranges/solution.go diff --git a/problems_backup/number_of_squareful_arrays/solution.go b/1038-number-of-squareful-arrays/solution.go similarity index 100% rename from problems_backup/number_of_squareful_arrays/solution.go rename to 1038-number-of-squareful-arrays/solution.go diff --git a/problems_backup/find_the_town_judge/solution.go b/1039-find-the-town-judge/solution.go similarity index 100% rename from problems_backup/find_the_town_judge/solution.go rename to 1039-find-the-town-judge/solution.go diff --git a/problems_backup/maximum_depth_of_binary_tree/solution.go b/104-maximum-depth-of-binary-tree/solution.go similarity index 100% rename from problems_backup/maximum_depth_of_binary_tree/solution.go rename to 104-maximum-depth-of-binary-tree/solution.go diff --git a/problems_backup/maximum_depth_of_binary_tree/solution.java b/104-maximum-depth-of-binary-tree/solution.java similarity index 100% rename from problems_backup/maximum_depth_of_binary_tree/solution.java rename to 104-maximum-depth-of-binary-tree/solution.java diff --git a/problems_backup/available_captures_for_rook/solution.go b/1041-available-captures-for-rook/solution.go similarity index 100% rename from problems_backup/available_captures_for_rook/solution.go rename to 1041-available-captures-for-rook/solution.go diff --git a/problems_backup/find_common_characters/solution.java b/1044-find-common-characters/solution.java similarity index 100% rename from problems_backup/find_common_characters/solution.java rename to 1044-find-common-characters/solution.java diff --git a/problems_backup/max_consecutive_ones_iii/solution.go b/1046-max-consecutive-ones-iii/solution.go similarity index 100% rename from problems_backup/max_consecutive_ones_iii/solution.go rename to 1046-max-consecutive-ones-iii/solution.go diff --git a/problems_backup/maximize_sum_of_array_after_k_negations/solution.java b/1047-maximize-sum-of-array-after-k-negations/solution.java similarity index 100% rename from problems_backup/maximize_sum_of_array_after_k_negations/solution.java rename to 1047-maximize-sum-of-array-after-k-negations/solution.java diff --git a/problems_backup/complement_of_base_10_integer/solution.go b/1054-complement-of-base-10-integer/solution.go similarity index 100% rename from problems_backup/complement_of_base_10_integer/solution.go rename to 1054-complement-of-base-10-integer/solution.go diff --git a/problems_backup/number_of_valid_subarrays/solution.go b/1061-number-of-valid-subarrays/solution.go similarity index 100% rename from problems_backup/number_of_valid_subarrays/solution.go rename to 1061-number-of-valid-subarrays/solution.go diff --git a/problems_backup/binary_string_with_substrings_representing_1_to_n/solution.go b/1065-binary-string-with-substrings-representing-1-to-n/solution.go similarity index 100% rename from problems_backup/binary_string_with_substrings_representing_1_to_n/solution.go rename to 1065-binary-string-with-substrings-representing-1-to-n/solution.go diff --git a/problems_backup/fixed_point/solution.go b/1066-fixed-point/solution.go similarity index 100% rename from problems_backup/fixed_point/solution.go rename to 1066-fixed-point/solution.go diff --git a/problems_backup/confusing_number/solution.go b/1069-confusing-number/solution.go similarity index 100% rename from problems_backup/confusing_number/solution.go rename to 1069-confusing-number/solution.go diff --git a/problems_backup/binary_tree_level_order_traversal_ii/solution.go b/107-binary-tree-level-order-traversal-ii/solution.go similarity index 100% rename from problems_backup/binary_tree_level_order_traversal_ii/solution.go rename to 107-binary-tree-level-order-traversal-ii/solution.go diff --git a/problems_backup/binary_prefix_divisible_by_5/solution.go b/1071-binary-prefix-divisible-by-5/solution.go similarity index 100% rename from problems_backup/binary_prefix_divisible_by_5/solution.go rename to 1071-binary-prefix-divisible-by-5/solution.go diff --git a/problems_backup/next_greater_node_in_linked_list/solution.go b/1072-next-greater-node-in-linked-list/solution.go similarity index 100% rename from problems_backup/next_greater_node_in_linked_list/solution.go rename to 1072-next-greater-node-in-linked-list/solution.go diff --git a/problems_backup/number_of_enclaves/solution.go b/1073-number-of-enclaves/solution.go similarity index 100% rename from problems_backup/number_of_enclaves/solution.go rename to 1073-number-of-enclaves/solution.go diff --git a/problems_backup/high_five/solution.go b/1074-high-five/solution.go similarity index 100% rename from problems_backup/high_five/solution.go rename to 1074-high-five/solution.go diff --git a/problems_backup/index_pairs_of_a_string/solution.go b/1075-index-pairs-of-a-string/solution.go similarity index 100% rename from problems_backup/index_pairs_of_a_string/solution.go rename to 1075-index-pairs-of-a-string/solution.go diff --git a/problems_backup/brace_expansion/solution.go b/1076-brace-expansion/solution.go similarity index 100% rename from problems_backup/brace_expansion/solution.go rename to 1076-brace-expansion/solution.go diff --git a/problems_backup/remove_outermost_parentheses/solution.go b/1078-remove-outermost-parentheses/solution.go similarity index 100% rename from problems_backup/remove_outermost_parentheses/solution.go rename to 1078-remove-outermost-parentheses/solution.go diff --git a/problems_backup/remove_outermost_parentheses/solution.java b/1078-remove-outermost-parentheses/solution.java similarity index 100% rename from problems_backup/remove_outermost_parentheses/solution.java rename to 1078-remove-outermost-parentheses/solution.java diff --git a/problems_backup/sum_of_root_to_leaf_binary_numbers/solution.go b/1079-sum-of-root-to-leaf-binary-numbers/solution.go similarity index 100% rename from problems_backup/sum_of_root_to_leaf_binary_numbers/solution.go rename to 1079-sum-of-root-to-leaf-binary-numbers/solution.go diff --git a/problems_backup/convert_sorted_array_to_binary_search_tree/solution.go b/108-convert-sorted-array-to-binary-search-tree/solution.go similarity index 100% rename from problems_backup/convert_sorted_array_to_binary_search_tree/solution.go rename to 108-convert-sorted-array-to-binary-search-tree/solution.go diff --git a/problems_backup/camelcase_matching/solution.go b/1080-camelcase-matching/solution.go similarity index 100% rename from problems_backup/camelcase_matching/solution.go rename to 1080-camelcase-matching/solution.go diff --git a/problems_backup/sum_of_digits_in_the_minimum_number/solution.go b/1082-sum-of-digits-in-the-minimum-number/solution.go similarity index 100% rename from problems_backup/sum_of_digits_in_the_minimum_number/solution.go rename to 1082-sum-of-digits-in-the-minimum-number/solution.go diff --git a/problems_backup/find_k-length_substrings_with_no_repeated_characters/solution.go b/1084-find-k-length-substrings-with-no-repeated-characters/solution.go similarity index 100% rename from problems_backup/find_k-length_substrings_with_no_repeated_characters/solution.go rename to 1084-find-k-length-substrings-with-no-repeated-characters/solution.go diff --git a/problems_backup/the_earliest_moment_when_everyone_become_friends/solution.go b/1085-the-earliest-moment-when-everyone-become-friends/solution.go similarity index 100% rename from problems_backup/the_earliest_moment_when_everyone_become_friends/solution.go rename to 1085-the-earliest-moment-when-everyone-become-friends/solution.go diff --git a/problems_backup/divisor_game/solution.go b/1086-divisor-game/solution.go similarity index 100% rename from problems_backup/divisor_game/solution.go rename to 1086-divisor-game/solution.go diff --git a/problems_backup/divisor_game/solution.java b/1086-divisor-game/solution.java similarity index 100% rename from problems_backup/divisor_game/solution.java rename to 1086-divisor-game/solution.java diff --git a/problems_backup/number_of_days_in_a_month/solution.go b/1088-number-of-days-in-a-month/solution.go similarity index 100% rename from problems_backup/number_of_days_in_a_month/solution.go rename to 1088-number-of-days-in-a-month/solution.go diff --git a/problems_backup/convert_sorted_list_to_binary_search_tree/solution.go b/109-convert-sorted-list-to-binary-search-tree/solution.go similarity index 100% rename from problems_backup/convert_sorted_list_to_binary_search_tree/solution.go rename to 109-convert-sorted-list-to-binary-search-tree/solution.go diff --git a/problems_backup/armstrong_number/solution.go b/1090-armstrong-number/solution.go similarity index 100% rename from problems_backup/armstrong_number/solution.go rename to 1090-armstrong-number/solution.go diff --git a/problems_backup/maximum_average_subtree/solution.go b/1091-maximum-average-subtree/solution.go similarity index 100% rename from problems_backup/maximum_average_subtree/solution.go rename to 1091-maximum-average-subtree/solution.go diff --git a/problems_backup/maximum_difference_between_node_and_ancestor/solution.go b/1092-maximum-difference-between-node-and-ancestor/solution.go similarity index 100% rename from problems_backup/maximum_difference_between_node_and_ancestor/solution.go rename to 1092-maximum-difference-between-node-and-ancestor/solution.go diff --git a/problems_backup/recover_a_tree_from_preorder_traversal/solution.go b/1093-recover-a-tree-from-preorder-traversal/solution.go similarity index 100% rename from problems_backup/recover_a_tree_from_preorder_traversal/solution.go rename to 1093-recover-a-tree-from-preorder-traversal/solution.go diff --git a/problems_backup/matrix_cells_in_distance_order/solution.go b/1094-matrix-cells-in-distance-order/solution.go similarity index 100% rename from problems_backup/matrix_cells_in_distance_order/solution.go rename to 1094-matrix-cells-in-distance-order/solution.go diff --git a/problems_backup/two_city_scheduling/solution.go b/1095-two-city-scheduling/solution.go similarity index 100% rename from problems_backup/two_city_scheduling/solution.go rename to 1095-two-city-scheduling/solution.go diff --git a/problems_backup/largest_unique_number/solution.go b/1098-largest-unique-number/solution.go similarity index 100% rename from problems_backup/largest_unique_number/solution.go rename to 1098-largest-unique-number/solution.go diff --git a/problems_backup/path_with_maximum_minimum_value/solution.go b/1099-path-with-maximum-minimum-value/solution.go similarity index 100% rename from problems_backup/path_with_maximum_minimum_value/solution.go rename to 1099-path-with-maximum-minimum-value/solution.go diff --git a/problems_backup/container_with_most_water/solution.go b/11-container-with-most-water/solution.go similarity index 100% rename from problems_backup/container_with_most_water/solution.go rename to 11-container-with-most-water/solution.go diff --git a/problems_backup/balanced_binary_tree/solution.go b/110-balanced-binary-tree/solution.go similarity index 100% rename from problems_backup/balanced_binary_tree/solution.go rename to 110-balanced-binary-tree/solution.go diff --git a/problems_backup/connecting_cities_with_minimum_cost/solution.go b/1100-connecting-cities-with-minimum-cost/solution.go similarity index 100% rename from problems_backup/connecting_cities_with_minimum_cost/solution.go rename to 1100-connecting-cities-with-minimum-cost/solution.go diff --git a/problems_backup/parallel_courses/solution.go b/1101-parallel-courses/solution.go similarity index 100% rename from problems_backup/parallel_courses/solution.go rename to 1101-parallel-courses/solution.go diff --git a/problems_backup/check_if_a_number_is_majority_element_in_a_sorted_array/solution.go b/1102-check-if-a-number-is-majority-element-in-a-sorted-array/solution.go similarity index 100% rename from problems_backup/check_if_a_number_is_majority_element_in_a_sorted_array/solution.go rename to 1102-check-if-a-number-is-majority-element-in-a-sorted-array/solution.go diff --git a/problems_backup/uncrossed_lines/solution.go b/1105-uncrossed-lines/solution.go similarity index 100% rename from problems_backup/uncrossed_lines/solution.go rename to 1105-uncrossed-lines/solution.go diff --git a/problems_backup/minimum_depth_of_binary_tree/solution.go b/111-minimum-depth-of-binary-tree/solution.go similarity index 100% rename from problems_backup/minimum_depth_of_binary_tree/solution.go rename to 111-minimum-depth-of-binary-tree/solution.go diff --git a/problems_backup/find_words_that_can_be_formed_by_characters/solution.java b/1112-find-words-that-can-be-formed-by-characters/solution.java similarity index 100% rename from problems_backup/find_words_that_can_be_formed_by_characters/solution.java rename to 1112-find-words-that-can-be-formed-by-characters/solution.java diff --git a/problems_backup/binary_search_tree_to_greater_sum_tree/solution.go b/1114-binary-search-tree-to-greater-sum-tree/solution.go similarity index 100% rename from problems_backup/binary_search_tree_to_greater_sum_tree/solution.go rename to 1114-binary-search-tree-to-greater-sum-tree/solution.go diff --git a/problems_backup/binary_search_tree_to_greater_sum_tree/solution.java b/1114-binary-search-tree-to-greater-sum-tree/solution.java similarity index 100% rename from problems_backup/binary_search_tree_to_greater_sum_tree/solution.java rename to 1114-binary-search-tree-to-greater-sum-tree/solution.java diff --git a/problems_backup/valid_boomerang/solution.go b/1115-valid-boomerang/solution.go similarity index 100% rename from problems_backup/valid_boomerang/solution.go rename to 1115-valid-boomerang/solution.go diff --git a/problems_backup/maximum_level_sum_of_a_binary_tree/solution.go b/1116-maximum-level-sum-of-a-binary-tree/solution.go similarity index 100% rename from problems_backup/maximum_level_sum_of_a_binary_tree/solution.go rename to 1116-maximum-level-sum-of-a-binary-tree/solution.go diff --git a/problems_backup/as_far_from_land_as_possible/solution.go b/1117-as-far-from-land-as-possible/solution.go similarity index 100% rename from problems_backup/as_far_from_land_as_possible/solution.go rename to 1117-as-far-from-land-as-possible/solution.go diff --git a/problems_backup/divide_array_into_increasing_sequences/solution.go b/1118-divide-array-into-increasing-sequences/solution.go similarity index 100% rename from problems_backup/divide_array_into_increasing_sequences/solution.go rename to 1118-divide-array-into-increasing-sequences/solution.go diff --git a/problems_backup/remove_vowels_from_a_string/solution.go b/1119-remove-vowels-from-a-string/solution.go similarity index 100% rename from problems_backup/remove_vowels_from_a_string/solution.go rename to 1119-remove-vowels-from-a-string/solution.go diff --git a/problems_backup/robot_bounded_in_circle/solution.go b/1119-robot-bounded-in-circle/solution.go similarity index 100% rename from problems_backup/robot_bounded_in_circle/solution.go rename to 1119-robot-bounded-in-circle/solution.go diff --git a/problems_backup/path_sum/solution.go b/112-path-sum/solution.go similarity index 100% rename from problems_backup/path_sum/solution.go rename to 112-path-sum/solution.go diff --git a/problems_backup/single-row_keyboard/solution.go b/1123-single-row-keyboard/solution.go similarity index 100% rename from problems_backup/single-row_keyboard/solution.go rename to 1123-single-row-keyboard/solution.go diff --git a/problems_backup/minimum_cost_to_connect_sticks/solution.go b/1126-minimum-cost-to-connect-sticks/solution.go similarity index 100% rename from problems_backup/minimum_cost_to_connect_sticks/solution.go rename to 1126-minimum-cost-to-connect-sticks/solution.go diff --git a/problems_backup/last_stone_weight/solution.go b/1127-last-stone-weight/solution.go similarity index 100% rename from problems_backup/last_stone_weight/solution.go rename to 1127-last-stone-weight/solution.go diff --git a/problems_backup/remove_all_adjacent_duplicates_in_string/solution.java b/1128-remove-all-adjacent-duplicates-in-string/solution.java similarity index 100% rename from problems_backup/remove_all_adjacent_duplicates_in_string/solution.java rename to 1128-remove-all-adjacent-duplicates-in-string/solution.java diff --git a/problems_backup/path_sum_ii/solution.go b/113-path-sum-ii/solution.go similarity index 100% rename from problems_backup/path_sum_ii/solution.go rename to 113-path-sum-ii/solution.go diff --git a/problems_backup/count_substrings_with_only_one_distinct_letter/solution.go b/1131-count-substrings-with-only-one-distinct-letter/solution.go similarity index 100% rename from problems_backup/count_substrings_with_only_one_distinct_letter/solution.go rename to 1131-count-substrings-with-only-one-distinct-letter/solution.go diff --git a/problems_backup/height_checker/solution.java b/1137-height-checker/solution.java similarity index 100% rename from problems_backup/height_checker/solution.java rename to 1137-height-checker/solution.java diff --git a/problems_backup/grumpy_bookstore_owner/solution.go b/1138-grumpy-bookstore-owner/solution.go similarity index 100% rename from problems_backup/grumpy_bookstore_owner/solution.go rename to 1138-grumpy-bookstore-owner/solution.go diff --git a/problems_backup/flatten_binary_tree_to_linked_list/solution.go b/114-flatten-binary-tree-to-linked-list/solution.go similarity index 100% rename from problems_backup/flatten_binary_tree_to_linked_list/solution.go rename to 114-flatten-binary-tree-to-linked-list/solution.go diff --git a/problems_backup/distant_barcodes/solution.go b/1140-distant-barcodes/solution.go similarity index 100% rename from problems_backup/distant_barcodes/solution.go rename to 1140-distant-barcodes/solution.go diff --git a/problems_backup/how_many_apples_can_you_put_into_the_basket/solution.go b/1141-how-many-apples-can-you-put-into-the-basket/solution.go similarity index 100% rename from problems_backup/how_many_apples_can_you_put_into_the_basket/solution.go rename to 1141-how-many-apples-can-you-put-into-the-basket/solution.go diff --git a/problems_backup/find_smallest_common_element_in_all_rows/solution.go b/1143-find-smallest-common-element-in-all-rows/solution.go similarity index 100% rename from problems_backup/find_smallest_common_element_in_all_rows/solution.go rename to 1143-find-smallest-common-element-in-all-rows/solution.go diff --git a/problems_backup/greatest_common_divisor_of_strings/solution.go b/1146-greatest-common-divisor-of-strings/solution.go similarity index 100% rename from problems_backup/greatest_common_divisor_of_strings/solution.go rename to 1146-greatest-common-divisor-of-strings/solution.go diff --git a/problems_backup/intersection_of_three_sorted_arrays/solution.go b/1149-intersection-of-three-sorted-arrays/solution.go similarity index 100% rename from problems_backup/intersection_of_three_sorted_arrays/solution.go rename to 1149-intersection-of-three-sorted-arrays/solution.go diff --git a/problems_backup/two_sum_bsts/solution.go b/1150-two-sum-bsts/solution.go similarity index 100% rename from problems_backup/two_sum_bsts/solution.go rename to 1150-two-sum-bsts/solution.go diff --git a/problems_backup/occurrences_after_bigram/solution.java b/1156-occurrences-after-bigram/solution.java similarity index 100% rename from problems_backup/occurrences_after_bigram/solution.java rename to 1156-occurrences-after-bigram/solution.java diff --git a/problems_backup/smallest_subsequence_of_distinct_characters/solution.go b/1159-smallest-subsequence-of-distinct-characters/solution.go similarity index 100% rename from problems_backup/smallest_subsequence_of_distinct_characters/solution.go rename to 1159-smallest-subsequence-of-distinct-characters/solution.go diff --git a/problems_backup/populating_next_right_pointers_in_each_node/solution.go b/116-populating-next-right-pointers-in-each-node/solution.go similarity index 100% rename from problems_backup/populating_next_right_pointers_in_each_node/solution.go rename to 116-populating-next-right-pointers-in-each-node/solution.go diff --git a/problems_backup/letter_tile_possibilities/solution.go b/1160-letter-tile-possibilities/solution.go similarity index 100% rename from problems_backup/letter_tile_possibilities/solution.go rename to 1160-letter-tile-possibilities/solution.go diff --git a/problems_backup/missing_number_in_arithmetic_progression/solution.go b/1164-missing-number-in-arithmetic-progression/solution.go similarity index 100% rename from problems_backup/missing_number_in_arithmetic_progression/solution.go rename to 1164-missing-number-in-arithmetic-progression/solution.go diff --git a/problems_backup/duplicate_zeros/solution.go b/1168-duplicate-zeros/solution.go similarity index 100% rename from problems_backup/duplicate_zeros/solution.go rename to 1168-duplicate-zeros/solution.go diff --git a/problems_backup/populating_next_right_pointers_in_each_node_ii/solution.go b/117-populating-next-right-pointers-in-each-node-ii/solution.go similarity index 100% rename from problems_backup/populating_next_right_pointers_in_each_node_ii/solution.go rename to 117-populating-next-right-pointers-in-each-node-ii/solution.go diff --git a/problems_backup/array_transformation/solution.go b/1175-array-transformation/solution.go similarity index 100% rename from problems_backup/array_transformation/solution.go rename to 1175-array-transformation/solution.go diff --git a/problems_backup/design_a_leaderboard/solution.go b/1176-design-a-leaderboard/solution.go similarity index 100% rename from problems_backup/design_a_leaderboard/solution.go rename to 1176-design-a-leaderboard/solution.go diff --git a/problems_backup/pascal's_triangle/solution.go b/118-pascal's-triangle/solution.go similarity index 100% rename from problems_backup/pascal's_triangle/solution.go rename to 118-pascal's-triangle/solution.go diff --git a/problems_backup/pascal's_triangle_ii/solution.go b/119-pascal's-triangle-ii/solution.go similarity index 100% rename from problems_backup/pascal's_triangle_ii/solution.go rename to 119-pascal's-triangle-ii/solution.go diff --git a/problems_backup/smallest_common_region/solution.go b/1190-smallest-common-region/solution.go similarity index 100% rename from problems_backup/smallest_common_region/solution.go rename to 1190-smallest-common-region/solution.go diff --git a/problems_backup/distribute_candies_to_people/solution.java b/1195-distribute-candies-to-people/solution.java similarity index 100% rename from problems_backup/distribute_candies_to_people/solution.java rename to 1195-distribute-candies-to-people/solution.java diff --git a/problems_backup/integer_to_roman/solution.go b/12-integer-to-roman/solution.go similarity index 100% rename from problems_backup/integer_to_roman/solution.go rename to 12-integer-to-roman/solution.go diff --git a/problems_backup/triangle/solution.go b/120-triangle/solution.go similarity index 100% rename from problems_backup/triangle/solution.go rename to 120-triangle/solution.go diff --git a/problems_backup/remove_interval/solution.go b/1200-remove-interval/solution.go similarity index 100% rename from problems_backup/remove_interval/solution.go rename to 1200-remove-interval/solution.go diff --git a/problems_backup/delete_tree_nodes/solution.go b/1201-delete-tree-nodes/solution.go similarity index 100% rename from problems_backup/delete_tree_nodes/solution.go rename to 1201-delete-tree-nodes/solution.go diff --git a/problems_backup/defanging_an_ip_address/solution.java b/1205-defanging-an-ip-address/solution.java similarity index 100% rename from problems_backup/defanging_an_ip_address/solution.java rename to 1205-defanging-an-ip-address/solution.java diff --git a/problems_backup/corporate_flight_bookings/solution.go b/1206-corporate-flight-bookings/solution.go similarity index 100% rename from problems_backup/corporate_flight_bookings/solution.go rename to 1206-corporate-flight-bookings/solution.go diff --git a/problems_backup/maximum_nesting_depth_of_two_valid_parentheses_strings/solution.go b/1208-maximum-nesting-depth-of-two-valid-parentheses-strings/solution.go similarity index 100% rename from problems_backup/maximum_nesting_depth_of_two_valid_parentheses_strings/solution.go rename to 1208-maximum-nesting-depth-of-two-valid-parentheses-strings/solution.go diff --git a/problems_backup/best_time_to_buy_and_sell_stock/solution.go b/121-best-time-to-buy-and-sell-stock/solution.go similarity index 100% rename from problems_backup/best_time_to_buy_and_sell_stock/solution.go rename to 121-best-time-to-buy-and-sell-stock/solution.go diff --git a/problems_backup/mean_of_array_after_removing_some_elements/solution.go b/1210-mean-of-array-after-removing-some-elements/solution.go similarity index 100% rename from problems_backup/mean_of_array_after_removing_some_elements/solution.go rename to 1210-mean-of-array-after-removing-some-elements/solution.go diff --git a/problems_backup/sequential_digits/solution.go b/1212-sequential-digits/solution.go similarity index 100% rename from problems_backup/sequential_digits/solution.go rename to 1212-sequential-digits/solution.go diff --git a/problems_backup/relative_sort_array/solution.go b/1217-relative-sort-array/solution.go similarity index 100% rename from problems_backup/relative_sort_array/solution.go rename to 1217-relative-sort-array/solution.go diff --git a/problems_backup/relative_sort_array/solution.java b/1217-relative-sort-array/solution.java similarity index 100% rename from problems_backup/relative_sort_array/solution.java rename to 1217-relative-sort-array/solution.java diff --git a/problems_backup/lowest_common_ancestor_of_deepest_leaves/solution.go b/1218-lowest-common-ancestor-of-deepest-leaves/solution.go similarity index 100% rename from problems_backup/lowest_common_ancestor_of_deepest_leaves/solution.go rename to 1218-lowest-common-ancestor-of-deepest-leaves/solution.go diff --git a/problems_backup/path_with_maximum_gold/solution.go b/1219-path-with-maximum-gold/solution.go similarity index 100% rename from problems_backup/path_with_maximum_gold/solution.go rename to 1219-path-with-maximum-gold/solution.go diff --git a/problems_backup/remove_covered_intervals/solution.go b/1222-remove-covered-intervals/solution.go similarity index 100% rename from problems_backup/remove_covered_intervals/solution.go rename to 1222-remove-covered-intervals/solution.go diff --git a/problems_backup/number_of_equivalent_domino_pairs/solution.go b/1227-number-of-equivalent-domino-pairs/solution.go similarity index 100% rename from problems_backup/number_of_equivalent_domino_pairs/solution.go rename to 1227-number-of-equivalent-domino-pairs/solution.go diff --git a/problems_backup/best_time_to_buy_and_sell_stock_iii/solution.go b/123-best-time-to-buy-and-sell-stock-iii/solution.go similarity index 100% rename from problems_backup/best_time_to_buy_and_sell_stock_iii/solution.go rename to 123-best-time-to-buy-and-sell-stock-iii/solution.go diff --git a/problems_backup/replace_elements_with_greatest_element_on_right_side/solution.go b/1231-replace-elements-with-greatest-element-on-right-side/solution.go similarity index 100% rename from problems_backup/replace_elements_with_greatest_element_on_right_side/solution.go rename to 1231-replace-elements-with-greatest-element-on-right-side/solution.go diff --git a/problems_backup/replace_elements_with_greatest_element_on_right_side/solution.java b/1231-replace-elements-with-greatest-element-on-right-side/solution.java similarity index 100% rename from problems_backup/replace_elements_with_greatest_element_on_right_side/solution.java rename to 1231-replace-elements-with-greatest-element-on-right-side/solution.java diff --git a/problems_backup/n-th_tribonacci_number/solution.java b/1236-n-th-tribonacci-number/solution.java similarity index 100% rename from problems_backup/n-th_tribonacci_number/solution.java rename to 1236-n-th-tribonacci-number/solution.java diff --git a/problems_backup/alphabet_board_path/solution.go b/1238-alphabet-board-path/solution.go similarity index 100% rename from problems_backup/alphabet_board_path/solution.go rename to 1238-alphabet-board-path/solution.go diff --git a/problems_backup/binary_tree_maximum_path_sum/solution.go b/124-binary-tree-maximum-path-sum/solution.go similarity index 100% rename from problems_backup/binary_tree_maximum_path_sum/solution.go rename to 124-binary-tree-maximum-path-sum/solution.go diff --git a/problems_backup/decompress_run-length_encoded_list/solution.java b/1241-decompress-run-length-encoded-list/solution.java similarity index 100% rename from problems_backup/decompress_run-length_encoded_list/solution.java rename to 1241-decompress-run-length-encoded-list/solution.java diff --git a/problems_backup/sum_of_nodes_with_even-valued_grandparent/solution.java b/1243-sum-of-nodes-with-even-valued-grandparent/solution.java similarity index 100% rename from problems_backup/sum_of_nodes_with_even-valued_grandparent/solution.java rename to 1243-sum-of-nodes-with-even-valued-grandparent/solution.java diff --git a/problems_backup/distinct_echo_substrings/solution.go b/1244-distinct-echo-substrings/solution.go similarity index 100% rename from problems_backup/distinct_echo_substrings/solution.go rename to 1244-distinct-echo-substrings/solution.go diff --git a/problems_backup/binary_tree_coloring_game/solution.go b/1248-binary-tree-coloring-game/solution.go similarity index 100% rename from problems_backup/binary_tree_coloring_game/solution.go rename to 1248-binary-tree-coloring-game/solution.go diff --git a/problems_backup/snapshot_array/solution.go b/1249-snapshot-array/solution.go similarity index 100% rename from problems_backup/snapshot_array/solution.go rename to 1249-snapshot-array/solution.go diff --git a/problems_backup/valid_palindrome/solution.java b/125-valid-palindrome/solution.java similarity index 100% rename from problems_backup/valid_palindrome/solution.java rename to 125-valid-palindrome/solution.java diff --git a/problems_backup/sort_the_matrix_diagonally/solution.go b/1253-sort-the-matrix-diagonally/solution.go similarity index 100% rename from problems_backup/sort_the_matrix_diagonally/solution.go rename to 1253-sort-the-matrix-diagonally/solution.go diff --git a/problems_backup/deepest_leaves_sum/solution.go b/1254-deepest-leaves-sum/solution.go similarity index 100% rename from problems_backup/deepest_leaves_sum/solution.go rename to 1254-deepest-leaves-sum/solution.go diff --git a/problems_backup/rank_transform_of_an_array/solution.go b/1256-rank-transform-of-an-array/solution.go similarity index 100% rename from problems_backup/rank_transform_of_an_array/solution.go rename to 1256-rank-transform-of-an-array/solution.go diff --git a/problems_backup/day_of_the_year/solution.go b/1260-day-of-the-year/solution.go similarity index 100% rename from problems_backup/day_of_the_year/solution.go rename to 1260-day-of-the-year/solution.go diff --git a/problems_backup/maximum_number_of_words_you_can_type/solution.go b/1264-maximum-number-of-words-you-can-type/solution.go similarity index 100% rename from problems_backup/maximum_number_of_words_you_can_type/solution.go rename to 1264-maximum-number-of-words-you-can-type/solution.go diff --git a/problems_backup/compare_strings_by_frequency_of_the_smallest_character/solution.go b/1273-compare-strings-by-frequency-of-the-smallest-character/solution.go similarity index 100% rename from problems_backup/compare_strings_by_frequency_of_the_smallest_character/solution.go rename to 1273-compare-strings-by-frequency-of-the-smallest-character/solution.go diff --git a/problems_backup/closest_divisors/solution.java b/1276-closest-divisors/solution.java similarity index 100% rename from problems_backup/closest_divisors/solution.java rename to 1276-closest-divisors/solution.java diff --git a/problems_backup/longest_consecutive_sequence/solution.go b/128-longest-consecutive-sequence/solution.go similarity index 100% rename from problems_backup/longest_consecutive_sequence/solution.go rename to 128-longest-consecutive-sequence/solution.go diff --git a/problems_backup/diet_plan_performance/solution.go b/1280-diet-plan-performance/solution.go similarity index 100% rename from problems_backup/diet_plan_performance/solution.go rename to 1280-diet-plan-performance/solution.go diff --git a/problems_backup/reformat_date/solution.go b/1283-reformat-date/solution.go similarity index 100% rename from problems_backup/reformat_date/solution.go rename to 1283-reformat-date/solution.go diff --git a/problems_backup/sum_root_to_leaf_numbers/solution.go b/129-sum-root-to-leaf-numbers/solution.go similarity index 100% rename from problems_backup/sum_root_to_leaf_numbers/solution.go rename to 129-sum-root-to-leaf-numbers/solution.go diff --git a/problems_backup/three_consecutive_odds/solution.java b/1293-three-consecutive-odds/solution.java similarity index 100% rename from problems_backup/three_consecutive_odds/solution.java rename to 1293-three-consecutive-odds/solution.java diff --git a/problems_backup/minimum_garden_perimeter_to_collect_enough_apples/solution.go b/1295-minimum-garden-perimeter-to-collect-enough-apples/solution.go similarity index 100% rename from problems_backup/minimum_garden_perimeter_to_collect_enough_apples/solution.go rename to 1295-minimum-garden-perimeter-to-collect-enough-apples/solution.go diff --git a/problems_backup/maximum_number_of_balloons/solution.go b/1297-maximum-number-of-balloons/solution.go similarity index 100% rename from problems_backup/maximum_number_of_balloons/solution.go rename to 1297-maximum-number-of-balloons/solution.go diff --git a/problems_backup/reverse_substrings_between_each_pair_of_parentheses/solution.go b/1298-reverse-substrings-between-each-pair-of-parentheses/solution.go similarity index 100% rename from problems_backup/reverse_substrings_between_each_pair_of_parentheses/solution.go rename to 1298-reverse-substrings-between-each-pair-of-parentheses/solution.go diff --git a/problems_backup/roman_to_integer/solution.go b/13-roman-to-integer/solution.go similarity index 100% rename from problems_backup/roman_to_integer/solution.go rename to 13-roman-to-integer/solution.go diff --git a/problems_backup/roman_to_integer/solution.java b/13-roman-to-integer/solution.java similarity index 100% rename from problems_backup/roman_to_integer/solution.java rename to 13-roman-to-integer/solution.java diff --git a/problems_backup/surrounded_regions/solution.go b/130-surrounded-regions/solution.go similarity index 100% rename from problems_backup/surrounded_regions/solution.go rename to 130-surrounded-regions/solution.go diff --git a/problems_backup/minimum_moves_to_reach_target_score/solution.go b/1303-minimum-moves-to-reach-target-score/solution.go similarity index 100% rename from problems_backup/minimum_moves_to_reach_target_score/solution.go rename to 1303-minimum-moves-to-reach-target-score/solution.go diff --git a/problems_backup/number_of_visible_people_in_a_queue/solution.go b/1305-number-of-visible-people-in-a-queue/solution.go similarity index 100% rename from problems_backup/number_of_visible_people_in_a_queue/solution.go rename to 1305-number-of-visible-people-in-a-queue/solution.go diff --git a/problems_backup/minimum_absolute_difference/solution.java b/1306-minimum-absolute-difference/solution.java similarity index 100% rename from problems_backup/minimum_absolute_difference/solution.java rename to 1306-minimum-absolute-difference/solution.java diff --git a/problems_backup/watering_plants/solution.go b/1310-watering-plants/solution.go similarity index 100% rename from problems_backup/watering_plants/solution.go rename to 1310-watering-plants/solution.go diff --git a/problems_backup/unique_number_of_occurrences/solution.java b/1319-unique-number-of-occurrences/solution.java similarity index 100% rename from problems_backup/unique_number_of_occurrences/solution.java rename to 1319-unique-number-of-occurrences/solution.java diff --git a/problems_backup/remove_all_adjacent_duplicates_in_string_ii/solution.go b/1320-remove-all-adjacent-duplicates-in-string-ii/solution.go similarity index 100% rename from problems_backup/remove_all_adjacent_duplicates_in_string_ii/solution.go rename to 1320-remove-all-adjacent-duplicates-in-string-ii/solution.go diff --git a/problems_backup/where_will_the_ball_fall/solution.go b/1324-where-will-the-ball-fall/solution.go similarity index 100% rename from problems_backup/where_will_the_ball_fall/solution.go rename to 1324-where-will-the-ball-fall/solution.go diff --git a/problems_backup/minimum_cost_to_move_chips_to_the_same_position/solution.go b/1329-minimum-cost-to-move-chips-to-the-same-position/solution.go similarity index 100% rename from problems_backup/minimum_cost_to_move_chips_to_the_same_position/solution.go rename to 1329-minimum-cost-to-move-chips-to-the-same-position/solution.go diff --git a/problems_backup/clone_graph/solution.go b/133-clone-graph/solution.go similarity index 100% rename from problems_backup/clone_graph/solution.go rename to 133-clone-graph/solution.go diff --git a/problems_backup/gas_station/solution.go b/134-gas-station/solution.go similarity index 100% rename from problems_backup/gas_station/solution.go rename to 134-gas-station/solution.go diff --git a/problems_backup/split_a_string_in_balanced_strings/solution.java b/1341-split-a-string-in-balanced-strings/solution.java similarity index 100% rename from problems_backup/split_a_string_in_balanced_strings/solution.java rename to 1341-split-a-string-in-balanced-strings/solution.java diff --git a/problems_backup/queens_that_can_attack_the_king/solution.go b/1342-queens-that-can-attack-the-king/solution.go similarity index 100% rename from problems_backup/queens_that_can_attack_the_king/solution.go rename to 1342-queens-that-can-attack-the-king/solution.go diff --git a/problems_backup/perform_string_shifts/solution.go b/1345-perform-string-shifts/solution.go similarity index 100% rename from problems_backup/perform_string_shifts/solution.go rename to 1345-perform-string-shifts/solution.go diff --git a/problems_backup/check_if_it_is_a_straight_line/solution.go b/1349-check-if-it-is-a-straight-line/solution.go similarity index 100% rename from problems_backup/check_if_it_is_a_straight_line/solution.go rename to 1349-check-if-it-is-a-straight-line/solution.go diff --git a/problems_backup/product_of_the_last_k_numbers/solution.go b/1352-product-of-the-last-k-numbers/solution.go similarity index 100% rename from problems_backup/product_of_the_last_k_numbers/solution.go rename to 1352-product-of-the-last-k-numbers/solution.go diff --git a/problems_backup/find_resultant_array_after_removing_anagrams/solution.go b/1353-find-resultant-array-after-removing-anagrams/solution.go similarity index 100% rename from problems_backup/find_resultant_array_after_removing_anagrams/solution.go rename to 1353-find-resultant-array-after-removing-anagrams/solution.go diff --git a/problems_backup/find_players_with_zero_or_one_losses/solution.go b/1354-find-players-with-zero-or-one-losses/solution.go similarity index 100% rename from problems_backup/find_players_with_zero_or_one_losses/solution.go rename to 1354-find-players-with-zero-or-one-losses/solution.go diff --git a/problems_backup/single_number/solution.go b/136-single-number/solution.go similarity index 100% rename from problems_backup/single_number/solution.go rename to 136-single-number/solution.go diff --git a/problems_backup/single_number/solution.java b/136-single-number/solution.java similarity index 100% rename from problems_backup/single_number/solution.java rename to 136-single-number/solution.java diff --git a/problems_backup/airplane_seat_assignment_probability/solution.go b/1362-airplane-seat-assignment-probability/solution.go similarity index 100% rename from problems_backup/airplane_seat_assignment_probability/solution.go rename to 1362-airplane-seat-assignment-probability/solution.go diff --git a/problems_backup/greatest_english_letter_in_upper_and_lower_case/solution.go b/1363-greatest-english-letter-in-upper-and-lower-case/solution.go similarity index 100% rename from problems_backup/greatest_english_letter_in_upper_and_lower_case/solution.go rename to 1363-greatest-english-letter-in-upper-and-lower-case/solution.go diff --git a/problems_backup/first_unique_number/solution.go b/1366-first-unique-number/solution.go similarity index 100% rename from problems_backup/first_unique_number/solution.go rename to 1366-first-unique-number/solution.go diff --git a/problems_backup/single_number_ii/solution.go b/137-single-number-ii/solution.go similarity index 100% rename from problems_backup/single_number_ii/solution.go rename to 137-single-number-ii/solution.go diff --git a/problems_backup/minimum_remove_to_make_valid_parentheses/solution.go b/1371-minimum-remove-to-make-valid-parentheses/solution.go similarity index 100% rename from problems_backup/minimum_remove_to_make_valid_parentheses/solution.go rename to 1371-minimum-remove-to-make-valid-parentheses/solution.go diff --git a/problems_backup/leftmost_column_with_at_least_a_one/solution.go b/1374-leftmost-column-with-at-least-a-one/solution.go similarity index 100% rename from problems_backup/leftmost_column_with_at_least_a_one/solution.go rename to 1374-leftmost-column-with-at-least-a-one/solution.go diff --git a/problems_backup/bulb_switcher_iii/solution.go b/1375-bulb-switcher-iii/solution.go similarity index 100% rename from problems_backup/bulb_switcher_iii/solution.go rename to 1375-bulb-switcher-iii/solution.go diff --git a/problems_backup/find_palindrome_with_fixed_length/solution.go b/1375-find-palindrome-with-fixed-length/solution.go similarity index 100% rename from problems_backup/find_palindrome_with_fixed_length/solution.go rename to 1375-find-palindrome-with-fixed-length/solution.go diff --git a/problems_backup/cells_with_odd_values_in_a_matrix/solution.go b/1378-cells-with-odd-values-in-a-matrix/solution.go similarity index 100% rename from problems_backup/cells_with_odd_values_in_a_matrix/solution.go rename to 1378-cells-with-odd-values-in-a-matrix/solution.go diff --git a/problems_backup/reconstruct_a_2-row_binary_matrix/solution.go b/1379-reconstruct-a-2-row-binary-matrix/solution.go similarity index 100% rename from problems_backup/reconstruct_a_2-row_binary_matrix/solution.go rename to 1379-reconstruct-a-2-row-binary-matrix/solution.go diff --git a/problems_backup/number_of_closed_islands/solution.go b/1380-number-of-closed-islands/solution.go similarity index 100% rename from problems_backup/number_of_closed_islands/solution.go rename to 1380-number-of-closed-islands/solution.go diff --git a/problems_backup/maximum_score_words_formed_by_letters/solution.go b/1381-maximum-score-words-formed-by-letters/solution.go similarity index 100% rename from problems_backup/maximum_score_words_formed_by_letters/solution.go rename to 1381-maximum-score-words-formed-by-letters/solution.go diff --git a/problems_backup/calculate_amount_paid_in_taxes/solution.go b/1382-calculate-amount-paid-in-taxes/solution.go similarity index 100% rename from problems_backup/calculate_amount_paid_in_taxes/solution.go rename to 1382-calculate-amount-paid-in-taxes/solution.go diff --git a/problems_backup/number_of_ways_to_build_house_of_cards/solution.go b/1385-number-of-ways-to-build-house-of-cards/solution.go similarity index 100% rename from problems_backup/number_of_ways_to_build_house_of_cards/solution.go rename to 1385-number-of-ways-to-build-house-of-cards/solution.go diff --git a/problems_backup/shift_2d_grid/solution.go b/1386-shift-2d-grid/solution.go similarity index 100% rename from problems_backup/shift_2d_grid/solution.go rename to 1386-shift-2d-grid/solution.go diff --git a/problems_backup/counting_elements/solution.go b/1391-counting-elements/solution.go similarity index 100% rename from problems_backup/counting_elements/solution.go rename to 1391-counting-elements/solution.go diff --git a/problems_backup/find_the_difference_of_two_arrays/solution.go b/1392-find-the-difference-of-two-arrays/solution.go similarity index 100% rename from problems_backup/find_the_difference_of_two_arrays/solution.go rename to 1392-find-the-difference-of-two-arrays/solution.go diff --git a/problems_backup/minimum_time_visiting_all_points/solution.java b/1395-minimum-time-visiting-all-points/solution.java similarity index 100% rename from problems_backup/minimum_time_visiting_all_points/solution.java rename to 1395-minimum-time-visiting-all-points/solution.java diff --git a/problems_backup/count_servers_that_communicate/solution.go b/1396-count-servers-that-communicate/solution.go similarity index 100% rename from problems_backup/count_servers_that_communicate/solution.go rename to 1396-count-servers-that-communicate/solution.go diff --git a/problems_backup/search_suggestions_system/solution.go b/1397-search-suggestions-system/solution.go similarity index 100% rename from problems_backup/search_suggestions_system/solution.go rename to 1397-search-suggestions-system/solution.go diff --git a/problems_backup/longest_common_prefix/solution.java b/14-longest-common-prefix/solution.java similarity index 100% rename from problems_backup/longest_common_prefix/solution.java rename to 14-longest-common-prefix/solution.java diff --git a/problems_backup/word_break_ii/solution.go b/140-word-break-ii/solution.go similarity index 100% rename from problems_backup/word_break_ii/solution.go rename to 140-word-break-ii/solution.go diff --git a/problems_backup/find_winner_on_a_tic_tac_toe_game/solution.go b/1400-find-winner-on-a-tic-tac-toe-game/solution.go similarity index 100% rename from problems_backup/find_winner_on_a_tic_tac_toe_game/solution.go rename to 1400-find-winner-on-a-tic-tac-toe-game/solution.go diff --git a/problems_backup/number_of_burgers_with_no_waste_of_ingredients/solution.go b/1401-number-of-burgers-with-no-waste-of-ingredients/solution.go similarity index 100% rename from problems_backup/number_of_burgers_with_no_waste_of_ingredients/solution.go rename to 1401-number-of-burgers-with-no-waste-of-ingredients/solution.go diff --git a/problems_backup/print_immutable_linked_list_in_reverse/solution.go b/1404-print-immutable-linked-list-in-reverse/solution.go similarity index 100% rename from problems_backup/print_immutable_linked_list_in_reverse/solution.go rename to 1404-print-immutable-linked-list-in-reverse/solution.go diff --git a/problems_backup/subtract_the_product_and_sum_of_digits_of_an_integer/solution.go b/1406-subtract-the-product-and-sum-of-digits-of-an-integer/solution.go similarity index 100% rename from problems_backup/subtract_the_product_and_sum_of_digits_of_an_integer/solution.go rename to 1406-subtract-the-product-and-sum-of-digits-of-an-integer/solution.go diff --git a/problems_backup/subtract_the_product_and_sum_of_digits_of_an_integer/solution.java b/1406-subtract-the-product-and-sum-of-digits-of-an-integer/solution.java similarity index 100% rename from problems_backup/subtract_the_product_and_sum_of_digits_of_an_integer/solution.java rename to 1406-subtract-the-product-and-sum-of-digits-of-an-integer/solution.java diff --git a/problems_backup/group_the_people_given_the_group_size_they_belong_to/solution.java b/1407-group-the-people-given-the-group-size-they-belong-to/solution.java similarity index 100% rename from problems_backup/group_the_people_given_the_group_size_they_belong_to/solution.java rename to 1407-group-the-people-given-the-group-size-they-belong-to/solution.java diff --git a/problems_backup/linked_list_cycle/solution.go b/141-linked-list-cycle/solution.go similarity index 100% rename from problems_backup/linked_list_cycle/solution.go rename to 141-linked-list-cycle/solution.go diff --git a/problems_backup/convert_binary_number_in_a_linked_list_to_integer/solution.go b/1411-convert-binary-number-in-a-linked-list-to-integer/solution.go similarity index 100% rename from problems_backup/convert_binary_number_in_a_linked_list_to_integer/solution.go rename to 1411-convert-binary-number-in-a-linked-list-to-integer/solution.go diff --git a/problems_backup/check_if_an_array_is_consecutive/solution.go b/1416-check-if-an-array-is-consecutive/solution.go similarity index 100% rename from problems_backup/check_if_an_array_is_consecutive/solution.go rename to 1416-check-if-an-array-is-consecutive/solution.go diff --git a/problems_backup/linked_list_cycle_ii/solution.go b/142-linked-list-cycle-ii/solution.go similarity index 100% rename from problems_backup/linked_list_cycle_ii/solution.go rename to 142-linked-list-cycle-ii/solution.go diff --git a/problems_backup/find_numbers_with_even_number_of_digits/solution.java b/1421-find-numbers-with-even-number-of-digits/solution.java similarity index 100% rename from problems_backup/find_numbers_with_even_number_of_digits/solution.java rename to 1421-find-numbers-with-even-number-of-digits/solution.java diff --git a/problems_backup/divide_array_in_sets_of_k_consecutive_numbers/solution.go b/1422-divide-array-in-sets-of-k-consecutive-numbers/solution.go similarity index 100% rename from problems_backup/divide_array_in_sets_of_k_consecutive_numbers/solution.go rename to 1422-divide-array-in-sets-of-k-consecutive-numbers/solution.go diff --git a/problems_backup/find_n_unique_integers_sum_up_to_zero/solution.java b/1426-find-n-unique-integers-sum-up-to-zero/solution.java similarity index 100% rename from problems_backup/find_n_unique_integers_sum_up_to_zero/solution.java rename to 1426-find-n-unique-integers-sum-up-to-zero/solution.java diff --git a/problems_backup/all_elements_in_two_binary_search_trees/solution.go b/1427-all-elements-in-two-binary-search-trees/solution.go similarity index 100% rename from problems_backup/all_elements_in_two_binary_search_trees/solution.go rename to 1427-all-elements-in-two-binary-search-trees/solution.go diff --git a/problems_backup/reorder_list/solution.go b/143-reorder-list/solution.go similarity index 100% rename from problems_backup/reorder_list/solution.go rename to 143-reorder-list/solution.go diff --git a/problems_backup/find_the_k-beauty_of_a_number/solution.go b/1430-find-the-k-beauty-of-a-number/solution.go similarity index 100% rename from problems_backup/find_the_k-beauty_of_a_number/solution.go rename to 1430-find-the-k-beauty-of-a-number/solution.go diff --git a/problems_backup/decrypt_string_from_alphabet_to_integer_mapping/solution.java b/1434-decrypt-string-from-alphabet-to-integer-mapping/solution.java similarity index 100% rename from problems_backup/decrypt_string_from_alphabet_to_integer_mapping/solution.java rename to 1434-decrypt-string-from-alphabet-to-integer-mapping/solution.java diff --git a/problems_backup/binary_tree_preorder_traversal/solution.go b/144-binary-tree-preorder-traversal/solution.go similarity index 100% rename from problems_backup/binary_tree_preorder_traversal/solution.go rename to 144-binary-tree-preorder-traversal/solution.go diff --git a/problems_backup/convert_integer_to_the_sum_of_two_no-zero_integers/solution.go b/1440-convert-integer-to-the-sum-of-two-no-zero-integers/solution.go similarity index 100% rename from problems_backup/convert_integer_to_the_sum_of_two_no-zero_integers/solution.go rename to 1440-convert-integer-to-the-sum-of-two-no-zero-integers/solution.go diff --git a/problems_backup/minimum_flips_to_make_a_or_b_equal_to_c/solution.go b/1441-minimum-flips-to-make-a-or-b-equal-to-c/solution.go similarity index 100% rename from problems_backup/minimum_flips_to_make_a_or_b_equal_to_c/solution.go rename to 1441-minimum-flips-to-make-a-or-b-equal-to-c/solution.go diff --git a/problems_backup/number_of_operations_to_make_network_connected/solution.go b/1442-number-of-operations-to-make-network-connected/solution.go similarity index 100% rename from problems_backup/number_of_operations_to_make_network_connected/solution.go rename to 1442-number-of-operations-to-make-network-connected/solution.go diff --git a/problems_backup/number_of_steps_to_reduce_a_number_to_zero/solution.go b/1444-number-of-steps-to-reduce-a-number-to-zero/solution.go similarity index 100% rename from problems_backup/number_of_steps_to_reduce_a_number_to_zero/solution.go rename to 1444-number-of-steps-to-reduce-a-number-to-zero/solution.go diff --git a/problems_backup/number_of_steps_to_reduce_a_number_to_zero/solution.java b/1444-number-of-steps-to-reduce-a-number-to-zero/solution.java similarity index 100% rename from problems_backup/number_of_steps_to_reduce_a_number_to_zero/solution.java rename to 1444-number-of-steps-to-reduce-a-number-to-zero/solution.java diff --git a/problems_backup/number_of_sub-arrays_of_size_k_and_average_greater_than_or_equal_to_threshold/solution.go b/1445-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/solution.go similarity index 100% rename from problems_backup/number_of_sub-arrays_of_size_k_and_average_greater_than_or_equal_to_threshold/solution.go rename to 1445-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/solution.go diff --git a/problems_backup/angle_between_hands_of_a_clock/solution.go b/1446-angle-between-hands-of-a-clock/solution.go similarity index 100% rename from problems_backup/angle_between_hands_of_a_clock/solution.go rename to 1446-angle-between-hands-of-a-clock/solution.go diff --git a/problems_backup/maximum_69_number/solution.go b/1448-maximum-69-number/solution.go similarity index 100% rename from problems_backup/maximum_69_number/solution.go rename to 1448-maximum-69-number/solution.go diff --git a/problems_backup/maximum_69_number/solution.java b/1448-maximum-69-number/solution.java similarity index 100% rename from problems_backup/maximum_69_number/solution.java rename to 1448-maximum-69-number/solution.java diff --git a/problems_backup/print_words_vertically/solution.go b/1449-print-words-vertically/solution.go similarity index 100% rename from problems_backup/print_words_vertically/solution.go rename to 1449-print-words-vertically/solution.go diff --git a/problems_backup/binary_tree_postorder_traversal/solution.go b/145-binary-tree-postorder-traversal/solution.go similarity index 100% rename from problems_backup/binary_tree_postorder_traversal/solution.go rename to 145-binary-tree-postorder-traversal/solution.go diff --git a/problems_backup/delete_leaves_with_a_given_value/solution.go b/1450-delete-leaves-with-a-given-value/solution.go similarity index 100% rename from problems_backup/delete_leaves_with_a_given_value/solution.go rename to 1450-delete-leaves-with-a-given-value/solution.go diff --git a/problems_backup/remove_palindromic_subsequences/solution.go b/1454-remove-palindromic-subsequences/solution.go similarity index 100% rename from problems_backup/remove_palindromic_subsequences/solution.go rename to 1454-remove-palindromic-subsequences/solution.go diff --git a/problems_backup/sort_integers_by_the_number_of_1_bits/solution.go b/1458-sort-integers-by-the-number-of-1-bits/solution.go similarity index 100% rename from problems_backup/sort_integers_by_the_number_of_1_bits/solution.go rename to 1458-sort-integers-by-the-number-of-1-bits/solution.go diff --git a/problems_backup/the_k_weakest_rows_in_a_matrix/solution.go b/1463-the-k-weakest-rows-in-a-matrix/solution.go similarity index 100% rename from problems_backup/the_k_weakest_rows_in_a_matrix/solution.go rename to 1463-the-k-weakest-rows-in-a-matrix/solution.go diff --git a/problems_backup/reduce_array_size_to_the_half/solution.go b/1464-reduce-array-size-to-the-half/solution.go similarity index 100% rename from problems_backup/reduce_array_size_to_the_half/solution.go rename to 1464-reduce-array-size-to-the-half/solution.go diff --git a/problems_backup/check_if_n_and_its_double_exist/solution.java b/1468-check-if-n-and-its-double-exist/solution.java similarity index 100% rename from problems_backup/check_if_n_and_its_double_exist/solution.java rename to 1468-check-if-n-and-its-double-exist/solution.java diff --git a/problems_backup/minimum_number_of_steps_to_make_two_strings_anagram/solution.java b/1469-minimum-number-of-steps-to-make-two-strings-anagram/solution.java similarity index 100% rename from problems_backup/minimum_number_of_steps_to_make_two_strings_anagram/solution.java rename to 1469-minimum-number-of-steps-to-make-two-strings-anagram/solution.java diff --git a/problems_backup/insertion_sort_list/solution.go b/147-insertion-sort-list/solution.go similarity index 100% rename from problems_backup/insertion_sort_list/solution.go rename to 147-insertion-sort-list/solution.go diff --git a/problems_backup/maximum_students_taking_exam/solution.go b/1471-maximum-students-taking-exam/solution.go similarity index 100% rename from problems_backup/maximum_students_taking_exam/solution.go rename to 1471-maximum-students-taking-exam/solution.go diff --git a/problems_backup/increasing_decreasing_string/solution.java b/1472-increasing-decreasing-string/solution.java similarity index 100% rename from problems_backup/increasing_decreasing_string/solution.java rename to 1472-increasing-decreasing-string/solution.java diff --git a/problems_backup/count_negative_numbers_in_a_sorted_matrix/solution.go b/1476-count-negative-numbers-in-a-sorted-matrix/solution.go similarity index 100% rename from problems_backup/count_negative_numbers_in_a_sorted_matrix/solution.go rename to 1476-count-negative-numbers-in-a-sorted-matrix/solution.go diff --git a/problems_backup/count_negative_numbers_in_a_sorted_matrix/solution.java b/1476-count-negative-numbers-in-a-sorted-matrix/solution.java similarity index 100% rename from problems_backup/count_negative_numbers_in_a_sorted_matrix/solution.java rename to 1476-count-negative-numbers-in-a-sorted-matrix/solution.java diff --git a/problems_backup/sort_list/solution.go b/148-sort-list/solution.go similarity index 100% rename from problems_backup/sort_list/solution.go rename to 148-sort-list/solution.go diff --git a/problems_backup/how_many_numbers_are_smaller_than_the_current_number/solution.java b/1482-how-many-numbers-are-smaller-than-the-current-number/solution.java similarity index 100% rename from problems_backup/how_many_numbers_are_smaller_than_the_current_number/solution.java rename to 1482-how-many-numbers-are-smaller-than-the-current-number/solution.java diff --git a/problems_backup/linked_list_in_binary_tree/solution.go b/1484-linked-list-in-binary-tree/solution.go similarity index 100% rename from problems_backup/linked_list_in_binary_tree/solution.go rename to 1484-linked-list-in-binary-tree/solution.go diff --git a/problems_backup/find_the_distance_value_between_two_arrays/solution.go b/1486-find-the-distance-value-between-two-arrays/solution.go similarity index 100% rename from problems_backup/find_the_distance_value_between_two_arrays/solution.go rename to 1486-find-the-distance-value-between-two-arrays/solution.go diff --git a/problems_backup/max_points_on_a_line/solution.go b/149-max-points-on-a-line/solution.go similarity index 100% rename from problems_backup/max_points_on_a_line/solution.go rename to 149-max-points-on-a-line/solution.go diff --git a/problems_backup/generate_a_string_with_characters_that_have_odd_counts/solution.go b/1490-generate-a-string-with-characters-that-have-odd-counts/solution.go similarity index 100% rename from problems_backup/generate_a_string_with_characters_that_have_odd_counts/solution.go rename to 1490-generate-a-string-with-characters-that-have-odd-counts/solution.go diff --git a/problems_backup/frog_position_after_t_seconds/solution.go b/1493-frog-position-after-t-seconds/solution.go similarity index 100% rename from problems_backup/frog_position_after_t_seconds/solution.go rename to 1493-frog-position-after-t-seconds/solution.go diff --git a/problems_backup/lucky_numbers_in_a_matrix/solution.java b/1496-lucky-numbers-in-a-matrix/solution.java similarity index 100% rename from problems_backup/lucky_numbers_in_a_matrix/solution.java rename to 1496-lucky-numbers-in-a-matrix/solution.java diff --git a/problems_backup/design_a_stack_with_increment_operation/solution.go b/1497-design-a-stack-with-increment-operation/solution.go similarity index 100% rename from problems_backup/design_a_stack_with_increment_operation/solution.go rename to 1497-design-a-stack-with-increment-operation/solution.go diff --git a/problems_backup/find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree/solution.java b/1498-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/solution.java similarity index 100% rename from problems_backup/find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree/solution.java rename to 1498-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/solution.java diff --git a/problems_backup/evaluate_reverse_polish_notation/solution.go b/150-evaluate-reverse-polish-notation/solution.go similarity index 100% rename from problems_backup/evaluate_reverse_polish_notation/solution.go rename to 150-evaluate-reverse-polish-notation/solution.go diff --git a/problems_backup/count_largest_group/solution.java b/1500-count-largest-group/solution.java similarity index 100% rename from problems_backup/count_largest_group/solution.java rename to 1500-count-largest-group/solution.java diff --git a/problems_backup/circle_and_rectangle_overlapping/solution.go b/1501-circle-and-rectangle-overlapping/solution.go similarity index 100% rename from problems_backup/circle_and_rectangle_overlapping/solution.go rename to 1501-circle-and-rectangle-overlapping/solution.go diff --git a/problems_backup/reducing_dishes/solution.go b/1503-reducing-dishes/solution.go similarity index 100% rename from problems_backup/reducing_dishes/solution.go rename to 1503-reducing-dishes/solution.go diff --git a/problems_backup/create_target_array_in_the_given_order/solution.java b/1505-create-target-array-in-the-given-order/solution.java similarity index 100% rename from problems_backup/create_target_array_in_the_given_order/solution.java rename to 1505-create-target-array-in-the-given-order/solution.java diff --git a/problems_backup/longest_happy_prefix/solution.go b/1508-longest-happy-prefix/solution.go similarity index 100% rename from problems_backup/longest_happy_prefix/solution.go rename to 1508-longest-happy-prefix/solution.go diff --git a/problems_backup/reverse_words_in_a_string/solution.go b/151-reverse-words-in-a-string/solution.go similarity index 100% rename from problems_backup/reverse_words_in_a_string/solution.go rename to 151-reverse-words-in-a-string/solution.go diff --git a/problems_backup/find_lucky_integer_in_an_array/solution.java b/1510-find-lucky-integer-in-an-array/solution.java similarity index 100% rename from problems_backup/find_lucky_integer_in_an_array/solution.java rename to 1510-find-lucky-integer-in-an-array/solution.java diff --git a/problems_backup/count_number_of_teams/solution.java b/1511-count-number-of-teams/solution.java similarity index 100% rename from problems_backup/count_number_of_teams/solution.java rename to 1511-count-number-of-teams/solution.java diff --git a/problems_backup/design_underground_system/solution.go b/1512-design-underground-system/solution.go similarity index 100% rename from problems_backup/design_underground_system/solution.go rename to 1512-design-underground-system/solution.go diff --git a/problems_backup/minimum_value_to_get_positive_step_by_step_sum/solution.go b/1514-minimum-value-to-get-positive-step-by-step-sum/solution.go similarity index 100% rename from problems_backup/minimum_value_to_get_positive_step_by_step_sum/solution.go rename to 1514-minimum-value-to-get-positive-step-by-step-sum/solution.go diff --git a/problems_backup/find_the_minimum_number_of_fibonacci_numbers_whose_sum_is_k/solution.go b/1515-find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/solution.go similarity index 100% rename from problems_backup/find_the_minimum_number_of_fibonacci_numbers_whose_sum_is_k/solution.go rename to 1515-find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/solution.go diff --git a/problems_backup/minimum_subsequence_in_non-increasing_order/solution.go b/1519-minimum-subsequence-in-non-increasing-order/solution.go similarity index 100% rename from problems_backup/minimum_subsequence_in_non-increasing_order/solution.go rename to 1519-minimum-subsequence-in-non-increasing-order/solution.go diff --git a/problems_backup/number_of_steps_to_reduce_a_number_in_binary_representation_to_one/solution.go b/1520-number-of-steps-to-reduce-a-number-in-binary-representation-to-one/solution.go similarity index 100% rename from problems_backup/number_of_steps_to_reduce_a_number_in_binary_representation_to_one/solution.go rename to 1520-number-of-steps-to-reduce-a-number-in-binary-representation-to-one/solution.go diff --git a/problems_backup/string_matching_in_an_array/solution.java b/1524-string-matching-in-an-array/solution.java similarity index 100% rename from problems_backup/string_matching_in_an_array/solution.java rename to 1524-string-matching-in-an-array/solution.java diff --git a/problems_backup/kids_with_the_greatest_number_of_candies/solution.java b/1528-kids-with-the-greatest-number-of-candies/solution.java similarity index 100% rename from problems_backup/kids_with_the_greatest_number_of_candies/solution.java rename to 1528-kids-with-the-greatest-number-of-candies/solution.java diff --git a/problems_backup/find_minimum_in_rotated_sorted_array/solution.go b/153-find-minimum-in-rotated-sorted-array/solution.go similarity index 100% rename from problems_backup/find_minimum_in_rotated_sorted_array/solution.go rename to 153-find-minimum-in-rotated-sorted-array/solution.go diff --git a/problems_backup/check_if_a_string_can_break_another_string/solution.go b/1530-check-if-a-string-can-break-another-string/solution.go similarity index 100% rename from problems_backup/check_if_a_string_can_break_another_string/solution.go rename to 1530-check-if-a-string-can-break-another-string/solution.go diff --git a/problems_backup/reformat_the_string/solution.java b/1532-reformat-the-string/solution.java similarity index 100% rename from problems_backup/reformat_the_string/solution.java rename to 1532-reformat-the-string/solution.java diff --git a/problems_backup/minimum_number_of_frogs_croaking/solution.go b/1534-minimum-number-of-frogs-croaking/solution.go similarity index 100% rename from problems_backup/minimum_number_of_frogs_croaking/solution.go rename to 1534-minimum-number-of-frogs-croaking/solution.go diff --git a/problems_backup/maximum_score_after_splitting_a_string/solution.go b/1537-maximum-score-after-splitting-a-string/solution.go similarity index 100% rename from problems_backup/maximum_score_after_splitting_a_string/solution.go rename to 1537-maximum-score-after-splitting-a-string/solution.go diff --git a/problems_backup/diagonal_traverse_ii/solution.go b/1539-diagonal-traverse-ii/solution.go similarity index 100% rename from problems_backup/diagonal_traverse_ii/solution.go rename to 1539-diagonal-traverse-ii/solution.go diff --git a/problems_backup/find_minimum_in_rotated_sorted_array_ii/solution.go b/154-find-minimum-in-rotated-sorted-array-ii/solution.go similarity index 100% rename from problems_backup/find_minimum_in_rotated_sorted_array_ii/solution.go rename to 154-find-minimum-in-rotated-sorted-array-ii/solution.go diff --git a/problems_backup/consecutive_characters/solution.java b/1542-consecutive-characters/solution.java similarity index 100% rename from problems_backup/consecutive_characters/solution.java rename to 1542-consecutive-characters/solution.java diff --git a/problems_backup/count_good_nodes_in_binary_tree/solution.go b/1544-count-good-nodes-in-binary-tree/solution.go similarity index 100% rename from problems_backup/count_good_nodes_in_binary_tree/solution.go rename to 1544-count-good-nodes-in-binary-tree/solution.go diff --git a/problems_backup/destination_city/solution.go b/1547-destination-city/solution.go similarity index 100% rename from problems_backup/destination_city/solution.go rename to 1547-destination-city/solution.go diff --git a/problems_backup/destination_city/solution.java b/1547-destination-city/solution.java similarity index 100% rename from problems_backup/destination_city/solution.java rename to 1547-destination-city/solution.java diff --git a/problems_backup/min_stack/solution.java b/155-min-stack/solution.java similarity index 100% rename from problems_backup/min_stack/solution.java rename to 155-min-stack/solution.java diff --git a/problems_backup/build_an_array_with_stack_operations/solution.java b/1552-build-an-array-with-stack-operations/solution.java similarity index 100% rename from problems_backup/build_an_array_with_stack_operations/solution.java rename to 1552-build-an-array-with-stack-operations/solution.java diff --git a/problems_backup/check_if_a_string_contains_all_binary_codes_of_size_k/solution.go b/1557-check-if-a-string-contains-all-binary-codes-of-size-k/solution.go similarity index 100% rename from problems_backup/check_if_a_string_contains_all_binary_codes_of_size_k/solution.go rename to 1557-check-if-a-string-contains-all-binary-codes-of-size-k/solution.go diff --git a/problems_backup/number_of_students_doing_homework_at_a_given_time/solution.java b/1560-number-of-students-doing-homework-at-a-given-time/solution.java similarity index 100% rename from problems_backup/number_of_students_doing_homework_at_a_given_time/solution.java rename to 1560-number-of-students-doing-homework-at-a-given-time/solution.java diff --git a/problems_backup/rearrange_words_in_a_sentence/solution.go b/1561-rearrange-words-in-a-sentence/solution.go similarity index 100% rename from problems_backup/rearrange_words_in_a_sentence/solution.go rename to 1561-rearrange-words-in-a-sentence/solution.go diff --git a/problems_backup/check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence/solution.go b/1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/solution.go similarity index 100% rename from problems_backup/check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence/solution.go rename to 1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/solution.go diff --git a/problems_backup/maximum_number_of_vowels_in_a_substring_of_given_length/solution.go b/1567-maximum-number-of-vowels-in-a-substring-of-given-length/solution.go similarity index 100% rename from problems_backup/maximum_number_of_vowels_in_a_substring_of_given_length/solution.go rename to 1567-maximum-number-of-vowels-in-a-substring-of-given-length/solution.go diff --git a/problems_backup/pseudo-palindromic_paths_in_a_binary_tree/solution.go b/1568-pseudo-palindromic-paths-in-a-binary-tree/solution.go similarity index 100% rename from problems_backup/pseudo-palindromic_paths_in_a_binary_tree/solution.go rename to 1568-pseudo-palindromic-paths-in-a-binary-tree/solution.go diff --git a/problems_backup/final_prices_with_a_special_discount_in_a_shop/solution.go b/1570-final-prices-with-a-special-discount-in-a-shop/solution.go similarity index 100% rename from problems_backup/final_prices_with_a_special_discount_in_a_shop/solution.go rename to 1570-final-prices-with-a-special-discount-in-a-shop/solution.go diff --git a/problems_backup/subrectangle_queries/solution.go b/1572-subrectangle-queries/solution.go similarity index 100% rename from problems_backup/subrectangle_queries/solution.go rename to 1572-subrectangle-queries/solution.go diff --git a/problems_backup/maximum_product_of_two_elements_in_an_array/solution.java b/1574-maximum-product-of-two-elements-in-an-array/solution.java similarity index 100% rename from problems_backup/maximum_product_of_two_elements_in_an_array/solution.java rename to 1574-maximum-product-of-two-elements-in-an-array/solution.java diff --git a/problems_backup/maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts/solution.go b/1575-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/solution.go similarity index 100% rename from problems_backup/maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts/solution.go rename to 1575-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/solution.go diff --git a/problems_backup/shuffle_the_array/solution.java b/1580-shuffle-the-array/solution.java similarity index 100% rename from problems_backup/shuffle_the_array/solution.java rename to 1580-shuffle-the-array/solution.java diff --git a/problems_backup/design_browser_history/solution.go b/1582-design-browser-history/solution.go similarity index 100% rename from problems_backup/design_browser_history/solution.go rename to 1582-design-browser-history/solution.go diff --git a/problems_backup/average_salary_excluding_the_minimum_and_maximum_salary/solution.java b/1584-average-salary-excluding-the-minimum-and-maximum-salary/solution.java similarity index 100% rename from problems_backup/average_salary_excluding_the_minimum_and_maximum_salary/solution.java rename to 1584-average-salary-excluding-the-minimum-and-maximum-salary/solution.java diff --git a/problems_backup/the_kth_factor_of_n/solution.go b/1585-the-kth-factor-of-n/solution.go similarity index 100% rename from problems_backup/the_kth_factor_of_n/solution.go rename to 1585-the-kth-factor-of-n/solution.go diff --git a/problems_backup/intersection_of_two_linked_lists/solution.go b/160-intersection-of-two-linked-lists/solution.go similarity index 100% rename from problems_backup/intersection_of_two_linked_lists/solution.go rename to 160-intersection-of-two-linked-lists/solution.go diff --git a/problems_backup/running_sum_of_1d_array/solution.go b/1603-running-sum-of-1d-array/solution.go similarity index 100% rename from problems_backup/running_sum_of_1d_array/solution.go rename to 1603-running-sum-of-1d-array/solution.go diff --git a/problems_backup/running_sum_of_1d_array/solution.java b/1603-running-sum-of-1d-array/solution.java similarity index 100% rename from problems_backup/running_sum_of_1d_array/solution.java rename to 1603-running-sum-of-1d-array/solution.java diff --git a/problems_backup/find_all_the_lonely_nodes/solution.go b/1609-find-all-the-lonely-nodes/solution.go similarity index 100% rename from problems_backup/find_all_the_lonely_nodes/solution.go rename to 1609-find-all-the-lonely-nodes/solution.go diff --git a/problems_backup/xor_operation_in_an_array/solution.java b/1610-xor-operation-in-an-array/solution.java similarity index 100% rename from problems_backup/xor_operation_in_an_array/solution.java rename to 1610-xor-operation-in-an-array/solution.java diff --git a/problems_backup/stone_game_iv/solution.go b/1617-stone-game-iv/solution.go similarity index 100% rename from problems_backup/stone_game_iv/solution.go rename to 1617-stone-game-iv/solution.go diff --git a/problems_backup/delete_n_nodes_after_m_nodes_of_a_linked_list/solution.go b/1618-delete-n-nodes-after-m-nodes-of-a-linked-list/solution.go similarity index 100% rename from problems_backup/delete_n_nodes_after_m_nodes_of_a_linked_list/solution.go rename to 1618-delete-n-nodes-after-m-nodes-of-a-linked-list/solution.go diff --git a/problems_backup/path_crossing/solution.go b/1619-path-crossing/solution.go similarity index 100% rename from problems_backup/path_crossing/solution.go rename to 1619-path-crossing/solution.go diff --git a/problems_backup/find_peak_element/solution.go b/162-find-peak-element/solution.go similarity index 100% rename from problems_backup/find_peak_element/solution.go rename to 162-find-peak-element/solution.go diff --git a/problems_backup/can_make_arithmetic_progression_from_sequence/solution.go b/1626-can-make-arithmetic-progression-from-sequence/solution.go similarity index 100% rename from problems_backup/can_make_arithmetic_progression_from_sequence/solution.go rename to 1626-can-make-arithmetic-progression-from-sequence/solution.go diff --git a/problems_backup/last_moment_before_all_ants_fall_out_of_a_plank/solution.go b/1627-last-moment-before-all-ants-fall-out-of-a-plank/solution.go similarity index 100% rename from problems_backup/last_moment_before_all_ants_fall_out_of_a_plank/solution.go rename to 1627-last-moment-before-all-ants-fall-out-of-a-plank/solution.go diff --git a/problems_backup/missing_ranges/solution.go b/163-missing-ranges/solution.go similarity index 100% rename from problems_backup/missing_ranges/solution.go rename to 163-missing-ranges/solution.go diff --git a/problems_backup/count_odd_numbers_in_an_interval_range/solution.go b/1630-count-odd-numbers-in-an-interval-range/solution.go similarity index 100% rename from problems_backup/count_odd_numbers_in_an_interval_range/solution.go rename to 1630-count-odd-numbers-in-an-interval-range/solution.go diff --git a/problems_backup/minimum_number_of_increments_on_subarrays_to_form_a_target_array/solution.go b/1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array/solution.go similarity index 100% rename from problems_backup/minimum_number_of_increments_on_subarrays_to_form_a_target_array/solution.go rename to 1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array/solution.go diff --git a/problems_backup/clone_n-ary_tree/solution.go b/1634-clone-n-ary-tree/solution.go similarity index 100% rename from problems_backup/clone_n-ary_tree/solution.go rename to 1634-clone-n-ary-tree/solution.go diff --git a/problems_backup/number_of_good_pairs/solution.java b/1635-number-of-good-pairs/solution.java similarity index 100% rename from problems_backup/number_of_good_pairs/solution.java rename to 1635-number-of-good-pairs/solution.java diff --git a/problems_backup/maximum_gap/solution.go b/164-maximum-gap/solution.go similarity index 100% rename from problems_backup/maximum_gap/solution.go rename to 164-maximum-gap/solution.go diff --git a/problems_backup/water_bottles/solution.java b/1642-water-bottles/solution.java similarity index 100% rename from problems_backup/water_bottles/solution.java rename to 1642-water-bottles/solution.java diff --git a/problems_backup/kth_missing_positive_number/solution.java b/1646-kth-missing-positive-number/solution.java similarity index 100% rename from problems_backup/kth_missing_positive_number/solution.java rename to 1646-kth-missing-positive-number/solution.java diff --git a/problems_backup/minimum_insertions_to_balance_a_parentheses_string/solution.go b/1648-minimum-insertions-to-balance-a-parentheses-string/solution.go similarity index 100% rename from problems_backup/minimum_insertions_to_balance_a_parentheses_string/solution.go rename to 1648-minimum-insertions-to-balance-a-parentheses-string/solution.go diff --git a/problems_backup/compare_version_numbers/solution.go b/165-compare-version-numbers/solution.go similarity index 100% rename from problems_backup/compare_version_numbers/solution.go rename to 165-compare-version-numbers/solution.go diff --git a/problems_backup/shuffle_string/solution.java b/1651-shuffle-string/solution.java similarity index 100% rename from problems_backup/shuffle_string/solution.java rename to 1651-shuffle-string/solution.java diff --git a/problems_backup/minimum_suffix_flips/solution.go b/1652-minimum-suffix-flips/solution.go similarity index 100% rename from problems_backup/minimum_suffix_flips/solution.go rename to 1652-minimum-suffix-flips/solution.go diff --git a/problems_backup/number_of_good_leaf_nodes_pairs/solution.go b/1653-number-of-good-leaf-nodes-pairs/solution.go similarity index 100% rename from problems_backup/number_of_good_leaf_nodes_pairs/solution.go rename to 1653-number-of-good-leaf-nodes-pairs/solution.go diff --git a/problems_backup/count_good_triplets/solution.java b/1656-count-good-triplets/solution.java similarity index 100% rename from problems_backup/count_good_triplets/solution.java rename to 1656-count-good-triplets/solution.java diff --git a/problems_backup/find_the_winner_of_an_array_game/solution.go b/1657-find-the-winner-of-an-array-game/solution.go similarity index 100% rename from problems_backup/find_the_winner_of_an_array_game/solution.go rename to 1657-find-the-winner-of-an-array-game/solution.go diff --git a/problems_backup/thousand_separator/solution.go b/1660-thousand-separator/solution.go similarity index 100% rename from problems_backup/thousand_separator/solution.go rename to 1660-thousand-separator/solution.go diff --git a/problems_backup/minimum_number_of_vertices_to_reach_all_nodes/solution.go b/1661-minimum-number-of-vertices-to-reach-all-nodes/solution.go similarity index 100% rename from problems_backup/minimum_number_of_vertices_to_reach_all_nodes/solution.go rename to 1661-minimum-number-of-vertices-to-reach-all-nodes/solution.go diff --git a/problems_backup/detect_cycles_in_2d_grid/solution.go b/1663-detect-cycles-in-2d-grid/solution.go similarity index 100% rename from problems_backup/detect_cycles_in_2d_grid/solution.go rename to 1663-detect-cycles-in-2d-grid/solution.go diff --git a/problems_backup/make_the_string_great/solution.java b/1666-make-the-string-great/solution.java similarity index 100% rename from problems_backup/make_the_string_great/solution.java rename to 1666-make-the-string-great/solution.java diff --git a/problems_backup/two_sum_ii_-_input_array_is_sorted/solution.go b/167-two-sum-ii---input-array-is-sorted/solution.go similarity index 100% rename from problems_backup/two_sum_ii_-_input_array_is_sorted/solution.go rename to 167-two-sum-ii---input-array-is-sorted/solution.go diff --git a/problems_backup/two_sum_ii_-_input_array_is_sorted/solution.java b/167-two-sum-ii---input-array-is-sorted/solution.java similarity index 100% rename from problems_backup/two_sum_ii_-_input_array_is_sorted/solution.java rename to 167-two-sum-ii---input-array-is-sorted/solution.java diff --git a/problems_backup/minimum_operations_to_make_array_equal/solution.go b/1674-minimum-operations-to-make-array-equal/solution.go similarity index 100% rename from problems_backup/minimum_operations_to_make_array_equal/solution.go rename to 1674-minimum-operations-to-make-array-equal/solution.go diff --git a/problems_backup/matrix_diagonal_sum/solution.go b/1677-matrix-diagonal-sum/solution.go similarity index 100% rename from problems_backup/matrix_diagonal_sum/solution.go rename to 1677-matrix-diagonal-sum/solution.go diff --git a/problems_backup/matrix_diagonal_sum/solution.java b/1677-matrix-diagonal-sum/solution.java similarity index 100% rename from problems_backup/matrix_diagonal_sum/solution.java rename to 1677-matrix-diagonal-sum/solution.java diff --git a/problems_backup/excel_sheet_column_title/solution.go b/168-excel-sheet-column-title/solution.go similarity index 100% rename from problems_backup/excel_sheet_column_title/solution.go rename to 168-excel-sheet-column-title/solution.go diff --git a/problems_backup/maximum_number_of_coins_you_can_get/solution.java b/1683-maximum-number-of-coins-you-can-get/solution.java similarity index 100% rename from problems_backup/maximum_number_of_coins_you_can_get/solution.java rename to 1683-maximum-number-of-coins-you-can-get/solution.java diff --git a/problems_backup/detect_pattern_of_length_m_repeated_k_or_more_times/solution.go b/1689-detect-pattern-of-length-m-repeated-k-or-more-times/solution.go similarity index 100% rename from problems_backup/detect_pattern_of_length_m_repeated_k_or_more_times/solution.go rename to 1689-detect-pattern-of-length-m-repeated-k-or-more-times/solution.go diff --git a/problems_backup/majority_element/solution.go b/169-majority-element/solution.go similarity index 100% rename from problems_backup/majority_element/solution.go rename to 169-majority-element/solution.go diff --git a/problems_backup/majority_element/solution.java b/169-majority-element/solution.java similarity index 100% rename from problems_backup/majority_element/solution.java rename to 169-majority-element/solution.java diff --git a/problems_backup/sum_of_all_odd_length_subarrays/solution.java b/1693-sum-of-all-odd-length-subarrays/solution.java similarity index 100% rename from problems_backup/sum_of_all_odd_length_subarrays/solution.java rename to 1693-sum-of-all-odd-length-subarrays/solution.java diff --git a/problems_backup/strings_differ_by_one_character/solution.go b/1697-strings-differ-by-one-character/solution.go similarity index 100% rename from problems_backup/strings_differ_by_one_character/solution.go rename to 1697-strings-differ-by-one-character/solution.go diff --git a/problems_backup/letter_combinations_of_a_phone_number/solution.go b/17-letter-combinations-of-a-phone-number/solution.go similarity index 100% rename from problems_backup/letter_combinations_of_a_phone_number/solution.go rename to 17-letter-combinations-of-a-phone-number/solution.go diff --git a/problems_backup/two_sum_iii_-_data_structure_design/solution.go b/170-two-sum-iii---data-structure-design/solution.go similarity index 100% rename from problems_backup/two_sum_iii_-_data_structure_design/solution.go rename to 170-two-sum-iii---data-structure-design/solution.go diff --git a/problems_backup/put_boxes_into_the_warehouse_i/solution.go b/1703-put-boxes-into-the-warehouse-i/solution.go similarity index 100% rename from problems_backup/put_boxes_into_the_warehouse_i/solution.go rename to 1703-put-boxes-into-the-warehouse-i/solution.go diff --git a/problems_backup/special_positions_in_a_binary_matrix/solution.go b/1704-special-positions-in-a-binary-matrix/solution.go similarity index 100% rename from problems_backup/special_positions_in_a_binary_matrix/solution.go rename to 1704-special-positions-in-a-binary-matrix/solution.go diff --git a/problems_backup/min_cost_to_connect_all_points/solution.go b/1706-min-cost-to-connect-all-points/solution.go similarity index 100% rename from problems_backup/min_cost_to_connect_all_points/solution.go rename to 1706-min-cost-to-connect-all-points/solution.go diff --git a/problems_backup/design_parking_system/solution.go b/1708-design-parking-system/solution.go similarity index 100% rename from problems_backup/design_parking_system/solution.go rename to 1708-design-parking-system/solution.go diff --git a/problems_backup/excel_sheet_column_number/solution.go b/171-excel-sheet-column-number/solution.go similarity index 100% rename from problems_backup/excel_sheet_column_number/solution.go rename to 171-excel-sheet-column-number/solution.go diff --git a/problems_backup/find_valid_matrix_given_row_and_column_sums/solution.go b/1711-find-valid-matrix-given-row-and-column-sums/solution.go similarity index 100% rename from problems_backup/find_valid_matrix_given_row_and_column_sums/solution.go rename to 1711-find-valid-matrix-given-row-and-column-sums/solution.go diff --git a/problems_backup/dot_product_of_two_sparse_vectors/solution.go b/1713-dot-product-of-two-sparse-vectors/solution.go similarity index 100% rename from problems_backup/dot_product_of_two_sparse_vectors/solution.go rename to 1713-dot-product-of-two-sparse-vectors/solution.go diff --git a/problems_backup/rearrange_spaces_between_words/solution.go b/1714-rearrange-spaces-between-words/solution.go similarity index 100% rename from problems_backup/rearrange_spaces_between_words/solution.go rename to 1714-rearrange-spaces-between-words/solution.go diff --git a/problems_backup/factorial_trailing_zeroes/solution.go b/172-factorial-trailing-zeroes/solution.go similarity index 100% rename from problems_backup/factorial_trailing_zeroes/solution.go rename to 172-factorial-trailing-zeroes/solution.go diff --git a/problems_backup/crawler_log_folder/solution.go b/1720-crawler-log-folder/solution.go similarity index 100% rename from problems_backup/crawler_log_folder/solution.go rename to 1720-crawler-log-folder/solution.go diff --git a/problems_backup/binary_search_tree_iterator/solution.go b/173-binary-search-tree-iterator/solution.go similarity index 100% rename from problems_backup/binary_search_tree_iterator/solution.go rename to 173-binary-search-tree-iterator/solution.go diff --git a/problems_backup/special_array_with_x_elements_greater_than_or_equal_x/solution.java b/1730-special-array-with-x-elements-greater-than-or-equal-x/solution.java similarity index 100% rename from problems_backup/special_array_with_x_elements_greater_than_or_equal_x/solution.java rename to 1730-special-array-with-x-elements-greater-than-or-equal-x/solution.java diff --git a/problems_backup/even_odd_tree/solution.go b/1731-even-odd-tree/solution.go similarity index 100% rename from problems_backup/even_odd_tree/solution.go rename to 1731-even-odd-tree/solution.go diff --git a/problems_backup/maximum_nesting_depth_of_the_parentheses/solution.java b/1737-maximum-nesting-depth-of-the-parentheses/solution.java similarity index 100% rename from problems_backup/maximum_nesting_depth_of_the_parentheses/solution.java rename to 1737-maximum-nesting-depth-of-the-parentheses/solution.java diff --git a/problems_backup/sort_array_by_increasing_frequency/solution.go b/1741-sort-array-by-increasing-frequency/solution.go similarity index 100% rename from problems_backup/sort_array_by_increasing_frequency/solution.go rename to 1741-sort-array-by-increasing-frequency/solution.go diff --git a/problems_backup/widest_vertical_area_between_two_points_containing_no_points/solution.go b/1742-widest-vertical-area-between-two-points-containing-no-points/solution.go similarity index 100% rename from problems_backup/widest_vertical_area_between_two_points_containing_no_points/solution.go rename to 1742-widest-vertical-area-between-two-points-containing-no-points/solution.go diff --git a/problems_backup/find_nearest_right_node_in_binary_tree/solution.go b/1745-find-nearest-right-node-in-binary-tree/solution.go similarity index 100% rename from problems_backup/find_nearest_right_node_in_binary_tree/solution.go rename to 1745-find-nearest-right-node-in-binary-tree/solution.go diff --git a/problems_backup/largest_substring_between_two_equal_characters/solution.java b/1746-largest-substring-between-two-equal-characters/solution.java similarity index 100% rename from problems_backup/largest_substring_between_two_equal_characters/solution.java rename to 1746-largest-substring-between-two-equal-characters/solution.java diff --git a/problems_backup/slowest_key/solution.go b/1751-slowest-key/solution.go similarity index 100% rename from problems_backup/slowest_key/solution.go rename to 1751-slowest-key/solution.go diff --git a/problems_backup/path_with_minimum_effort/solution.go b/1753-path-with-minimum-effort/solution.go similarity index 100% rename from problems_backup/path_with_minimum_effort/solution.go rename to 1753-path-with-minimum-effort/solution.go diff --git a/problems_backup/defuse_the_bomb/solution.java b/1755-defuse-the-bomb/solution.java similarity index 100% rename from problems_backup/defuse_the_bomb/solution.java rename to 1755-defuse-the-bomb/solution.java diff --git a/problems_backup/count_sorted_vowel_strings/solution.java b/1761-count-sorted-vowel-strings/solution.java similarity index 100% rename from problems_backup/count_sorted_vowel_strings/solution.java rename to 1761-count-sorted-vowel-strings/solution.java diff --git a/problems_backup/maximum_repeating_substring/solution.java b/1764-maximum-repeating-substring/solution.java similarity index 100% rename from problems_backup/maximum_repeating_substring/solution.java rename to 1764-maximum-repeating-substring/solution.java diff --git a/problems_backup/merge_in_between_linked_lists/solution.go b/1765-merge-in-between-linked-lists/solution.go similarity index 100% rename from problems_backup/merge_in_between_linked_lists/solution.go rename to 1765-merge-in-between-linked-lists/solution.go diff --git a/problems_backup/design_front_middle_back_queue/solution.go b/1767-design-front-middle-back-queue/solution.go similarity index 100% rename from problems_backup/design_front_middle_back_queue/solution.go rename to 1767-design-front-middle-back-queue/solution.go diff --git a/problems_backup/get_maximum_in_generated_array/solution.go b/1769-get-maximum-in-generated-array/solution.go similarity index 100% rename from problems_backup/get_maximum_in_generated_array/solution.go rename to 1769-get-maximum-in-generated-array/solution.go diff --git a/problems_backup/minimum_deletions_to_make_character_frequencies_unique/solution.go b/1770-minimum-deletions-to-make-character-frequencies-unique/solution.go similarity index 100% rename from problems_backup/minimum_deletions_to_make_character_frequencies_unique/solution.go rename to 1770-minimum-deletions-to-make-character-frequencies-unique/solution.go diff --git a/problems_backup/design_an_ordered_stream/solution.go b/1775-design-an-ordered-stream/solution.go similarity index 100% rename from problems_backup/design_an_ordered_stream/solution.go rename to 1775-design-an-ordered-stream/solution.go diff --git a/problems_backup/check_if_two_string_arrays_are_equivalent/solution.java b/1781-check-if-two-string-arrays-are-equivalent/solution.java similarity index 100% rename from problems_backup/check_if_two_string_arrays_are_equivalent/solution.java rename to 1781-check-if-two-string-arrays-are-equivalent/solution.java diff --git a/problems_backup/smallest_string_with_a_given_numeric_value/solution.go b/1782-smallest-string-with-a-given-numeric-value/solution.go similarity index 100% rename from problems_backup/smallest_string_with_a_given_numeric_value/solution.go rename to 1782-smallest-string-with-a-given-numeric-value/solution.go diff --git a/problems_backup/count_the_number_of_consistent_strings/solution.java b/1786-count-the-number-of-consistent-strings/solution.java similarity index 100% rename from problems_backup/count_the_number_of_consistent_strings/solution.java rename to 1786-count-the-number-of-consistent-strings/solution.java diff --git a/problems_backup/lowest_common_ancestor_of_a_binary_tree_iii/solution.go b/1790-lowest-common-ancestor-of-a-binary-tree-iii/solution.go similarity index 100% rename from problems_backup/lowest_common_ancestor_of_a_binary_tree_iii/solution.go rename to 1790-lowest-common-ancestor-of-a-binary-tree-iii/solution.go diff --git a/problems_backup/richest_customer_wealth/solution.go b/1791-richest-customer-wealth/solution.go similarity index 100% rename from problems_backup/richest_customer_wealth/solution.go rename to 1791-richest-customer-wealth/solution.go diff --git a/problems_backup/richest_customer_wealth/solution.java b/1791-richest-customer-wealth/solution.java similarity index 100% rename from problems_backup/richest_customer_wealth/solution.java rename to 1791-richest-customer-wealth/solution.java diff --git a/problems_backup/goal_parser_interpretation/solution.java b/1797-goal-parser-interpretation/solution.java similarity index 100% rename from problems_backup/goal_parser_interpretation/solution.java rename to 1797-goal-parser-interpretation/solution.java diff --git a/problems_backup/max_number_of_k-sum_pairs/solution.go b/1798-max-number-of-k-sum-pairs/solution.go similarity index 100% rename from problems_backup/max_number_of_k-sum_pairs/solution.go rename to 1798-max-number-of-k-sum-pairs/solution.go diff --git a/problems_backup/number_of_students_unable_to_eat_lunch/solution.go b/1802-number-of-students-unable-to-eat-lunch/solution.go similarity index 100% rename from problems_backup/number_of_students_unable_to_eat_lunch/solution.go rename to 1802-number-of-students-unable-to-eat-lunch/solution.go diff --git a/problems_backup/average_waiting_time/solution.go b/1803-average-waiting-time/solution.go similarity index 100% rename from problems_backup/average_waiting_time/solution.go rename to 1803-average-waiting-time/solution.go diff --git a/problems_backup/implement_trie_ii_(prefix_tree)/solution.go b/1804-implement-trie-ii-(prefix-tree)/solution.go similarity index 100% rename from problems_backup/implement_trie_ii_(prefix_tree)/solution.go rename to 1804-implement-trie-ii-(prefix-tree)/solution.go diff --git a/problems_backup/count_of_matches_in_tournament/solution.java b/1806-count-of-matches-in-tournament/solution.java similarity index 100% rename from problems_backup/count_of_matches_in_tournament/solution.java rename to 1806-count-of-matches-in-tournament/solution.java diff --git a/problems_backup/partitioning_into_minimum_number_of_deci-binary_numbers/solution.go b/1807-partitioning-into-minimum-number-of-deci-binary-numbers/solution.go similarity index 100% rename from problems_backup/partitioning_into_minimum_number_of_deci-binary_numbers/solution.go rename to 1807-partitioning-into-minimum-number-of-deci-binary-numbers/solution.go diff --git a/problems_backup/reformat_phone_number/solution.java b/1812-reformat-phone-number/solution.java similarity index 100% rename from problems_backup/reformat_phone_number/solution.java rename to 1812-reformat-phone-number/solution.java diff --git a/problems_backup/calculate_money_in_leetcode_bank/solution.java b/1817-calculate-money-in-leetcode-bank/solution.java similarity index 100% rename from problems_backup/calculate_money_in_leetcode_bank/solution.java rename to 1817-calculate-money-in-leetcode-bank/solution.java diff --git a/problems_backup/determine_if_string_halves_are_alike/solution.go b/1823-determine-if-string-halves-are-alike/solution.go similarity index 100% rename from problems_backup/determine_if_string_halves_are_alike/solution.go rename to 1823-determine-if-string-halves-are-alike/solution.go diff --git a/problems_backup/determine_if_string_halves_are_alike/solution.java b/1823-determine-if-string-halves-are-alike/solution.java similarity index 100% rename from problems_backup/determine_if_string_halves_are_alike/solution.java rename to 1823-determine-if-string-halves-are-alike/solution.java diff --git a/problems_backup/maximum_units_on_a_truck/solution.go b/1829-maximum-units-on-a-truck/solution.go similarity index 100% rename from problems_backup/maximum_units_on_a_truck/solution.go rename to 1829-maximum-units-on-a-truck/solution.go diff --git a/problems_backup/customers_who_never_order/solution.sql b/183-customers-who-never-order/solution.sql similarity index 100% rename from problems_backup/customers_who_never_order/solution.sql rename to 183-customers-who-never-order/solution.sql diff --git a/problems_backup/find_the_highest_altitude/solution.go b/1833-find-the-highest-altitude/solution.go similarity index 100% rename from problems_backup/find_the_highest_altitude/solution.go rename to 1833-find-the-highest-altitude/solution.go diff --git a/problems_backup/decode_xored_array/solution.java b/1839-decode-xored-array/solution.java similarity index 100% rename from problems_backup/decode_xored_array/solution.java rename to 1839-decode-xored-array/solution.java diff --git a/problems_backup/number_of_rectangles_that_can_form_the_largest_square/solution.go b/1843-number-of-rectangles-that-can-form-the-largest-square/solution.go similarity index 100% rename from problems_backup/number_of_rectangles_that_can_form_the_largest_square/solution.go rename to 1843-number-of-rectangles-that-can-form-the-largest-square/solution.go diff --git a/problems_backup/maximum_number_of_balls_in_a_box/solution.go b/1844-maximum-number-of-balls-in-a-box/solution.go similarity index 100% rename from problems_backup/maximum_number_of_balls_in_a_box/solution.go rename to 1844-maximum-number-of-balls-in-a-box/solution.go diff --git a/problems_backup/largest_submatrix_with_rearrangements/solution.go b/1845-largest-submatrix-with-rearrangements/solution.go similarity index 100% rename from problems_backup/largest_submatrix_with_rearrangements/solution.go rename to 1845-largest-submatrix-with-rearrangements/solution.go diff --git a/problems_backup/largest_subarray_length_k/solution.go b/1847-largest-subarray-length-k/solution.go similarity index 100% rename from problems_backup/largest_subarray_length_k/solution.go rename to 1847-largest-subarray-length-k/solution.go diff --git a/problems_backup/sum_of_unique_elements/solution.go b/1848-sum-of-unique-elements/solution.go similarity index 100% rename from problems_backup/sum_of_unique_elements/solution.go rename to 1848-sum-of-unique-elements/solution.go diff --git a/problems_backup/minimum_length_of_string_after_deleting_similar_ends/solution.go b/1850-minimum-length-of-string-after-deleting-similar-ends/solution.go similarity index 100% rename from problems_backup/minimum_length_of_string_after_deleting_similar_ends/solution.go rename to 1850-minimum-length-of-string-after-deleting-similar-ends/solution.go diff --git a/problems_backup/latest_time_by_replacing_hidden_digits/solution.go b/1858-latest-time-by-replacing-hidden-digits/solution.go similarity index 100% rename from problems_backup/latest_time_by_replacing_hidden_digits/solution.go rename to 1858-latest-time-by-replacing-hidden-digits/solution.go diff --git a/problems_backup/building_boxes/solution.go b/1861-building-boxes/solution.go similarity index 100% rename from problems_backup/building_boxes/solution.go rename to 1861-building-boxes/solution.go diff --git a/problems_backup/restore_the_array_from_adjacent_pairs/solution.go b/1866-restore-the-array-from-adjacent-pairs/solution.go similarity index 100% rename from problems_backup/restore_the_array_from_adjacent_pairs/solution.go rename to 1866-restore-the-array-from-adjacent-pairs/solution.go diff --git a/problems_backup/repeated_dna_sequences/solution.go b/187-repeated-dna-sequences/solution.go similarity index 100% rename from problems_backup/repeated_dna_sequences/solution.go rename to 187-repeated-dna-sequences/solution.go diff --git a/problems_backup/check_if_array_is_sorted_and_rotated/solution.go b/1878-check-if-array-is-sorted-and-rotated/solution.go similarity index 100% rename from problems_backup/check_if_array_is_sorted_and_rotated/solution.go rename to 1878-check-if-array-is-sorted-and-rotated/solution.go diff --git a/problems_backup/largest_merge_of_two_strings/solution.go b/1880-largest-merge-of-two-strings/solution.go similarity index 100% rename from problems_backup/largest_merge_of_two_strings/solution.go rename to 1880-largest-merge-of-two-strings/solution.go diff --git a/problems_backup/find_distance_in_a_binary_tree/solution.go b/1883-find-distance-in-a-binary-tree/solution.go similarity index 100% rename from problems_backup/find_distance_in_a_binary_tree/solution.go rename to 1883-find-distance-in-a-binary-tree/solution.go diff --git a/problems_backup/minimum_changes_to_make_alternating_binary_string/solution.go b/1884-minimum-changes-to-make-alternating-binary-string/solution.go similarity index 100% rename from problems_backup/minimum_changes_to_make_alternating_binary_string/solution.go rename to 1884-minimum-changes-to-make-alternating-binary-string/solution.go diff --git a/problems_backup/find_nearest_point_that_has_the_same_x_or_y_coordinate/solution.go b/1888-find-nearest-point-that-has-the-same-x-or-y-coordinate/solution.go similarity index 100% rename from problems_backup/find_nearest_point_that_has_the_same_x_or_y_coordinate/solution.go rename to 1888-find-nearest-point-that-has-the-same-x-or-y-coordinate/solution.go diff --git a/problems_backup/rotate_array/solution.go b/189-rotate-array/solution.go similarity index 100% rename from problems_backup/rotate_array/solution.go rename to 189-rotate-array/solution.go diff --git a/problems_backup/rotate_array/solution.java b/189-rotate-array/solution.java similarity index 100% rename from problems_backup/rotate_array/solution.java rename to 189-rotate-array/solution.java diff --git a/problems_backup/merge_strings_alternately/solution.go b/1894-merge-strings-alternately/solution.go similarity index 100% rename from problems_backup/merge_strings_alternately/solution.go rename to 1894-merge-strings-alternately/solution.go diff --git a/problems_backup/minimum_number_of_operations_to_move_all_balls_to_each_box/solution.go b/1895-minimum-number-of-operations-to-move-all-balls-to-each-box/solution.go similarity index 100% rename from problems_backup/minimum_number_of_operations_to_move_all_balls_to_each_box/solution.go rename to 1895-minimum-number-of-operations-to-move-all-balls-to-each-box/solution.go diff --git a/problems_backup/count_items_matching_a_rule/solution.go b/1899-count-items-matching-a-rule/solution.go similarity index 100% rename from problems_backup/count_items_matching_a_rule/solution.go rename to 1899-count-items-matching-a-rule/solution.go diff --git a/problems_backup/remove_nth_node_from_end_of_list/solution.go b/19-remove-nth-node-from-end-of-list/solution.go similarity index 100% rename from problems_backup/remove_nth_node_from_end_of_list/solution.go rename to 19-remove-nth-node-from-end-of-list/solution.go diff --git a/problems_backup/reverse_bits/solution.java b/190-reverse-bits/solution.java similarity index 100% rename from problems_backup/reverse_bits/solution.java rename to 190-reverse-bits/solution.java diff --git a/problems_backup/second_largest_digit_in_a_string/solution.go b/1904-second-largest-digit-in-a-string/solution.go similarity index 100% rename from problems_backup/second_largest_digit_in_a_string/solution.go rename to 1904-second-largest-digit-in-a-string/solution.go diff --git a/problems_backup/maximize_score_after_n_operations/solution.go b/1906-maximize-score-after-n-operations/solution.go similarity index 100% rename from problems_backup/maximize_score_after_n_operations/solution.go rename to 1906-maximize-score-after-n-operations/solution.go diff --git a/problems_backup/recyclable_and_low_fat_products/solution.sql b/1908-recyclable-and-low-fat-products/solution.sql similarity index 100% rename from problems_backup/recyclable_and_low_fat_products/solution.sql rename to 1908-recyclable-and-low-fat-products/solution.sql diff --git a/problems_backup/buildings_with_an_ocean_view/solution.go b/1909-buildings-with-an-ocean-view/solution.go similarity index 100% rename from problems_backup/buildings_with_an_ocean_view/solution.go rename to 1909-buildings-with-an-ocean-view/solution.go diff --git a/problems_backup/number_of_1_bits/solution.go b/191-number-of-1-bits/solution.go similarity index 100% rename from problems_backup/number_of_1_bits/solution.go rename to 191-number-of-1-bits/solution.go diff --git a/problems_backup/number_of_1_bits/solution.java b/191-number-of-1-bits/solution.java similarity index 100% rename from problems_backup/number_of_1_bits/solution.java rename to 191-number-of-1-bits/solution.java diff --git a/problems_backup/check_if_binary_string_has_at_most_one_segment_of_ones/solution.go b/1910-check-if-binary-string-has-at-most-one-segment-of-ones/solution.go similarity index 100% rename from problems_backup/check_if_binary_string_has_at_most_one_segment_of_ones/solution.go rename to 1910-check-if-binary-string-has-at-most-one-segment-of-ones/solution.go diff --git a/problems_backup/find_center_of_star_graph/solution.go b/1916-find-center-of-star-graph/solution.go similarity index 100% rename from problems_backup/find_center_of_star_graph/solution.go rename to 1916-find-center-of-star-graph/solution.go diff --git a/problems_backup/determine_color_of_a_chessboard_square/solution.go b/1920-determine-color-of-a-chessboard-square/solution.go similarity index 100% rename from problems_backup/determine_color_of_a_chessboard_square/solution.go rename to 1920-determine-color-of-a-chessboard-square/solution.go diff --git a/problems_backup/maximum_ascending_subarray_sum/solution.go b/1927-maximum-ascending-subarray-sum/solution.go similarity index 100% rename from problems_backup/maximum_ascending_subarray_sum/solution.go rename to 1927-maximum-ascending-subarray-sum/solution.go diff --git a/problems_backup/concatenation_of_array/solution.go b/1929-concatenation-of-array/solution.go similarity index 100% rename from problems_backup/concatenation_of_array/solution.go rename to 1929-concatenation-of-array/solution.go diff --git a/problems_backup/number_of_different_integers_in_a_string/solution.go b/1933-number-of-different-integers-in-a-string/solution.go similarity index 100% rename from problems_backup/number_of_different_integers_in_a_string/solution.go rename to 1933-number-of-different-integers-in-a-string/solution.go diff --git a/problems_backup/evaluate_the_bracket_pairs_of_a_string/solution.go b/1934-evaluate-the-bracket-pairs-of-a-string/solution.go similarity index 100% rename from problems_backup/evaluate_the_bracket_pairs_of_a_string/solution.go rename to 1934-evaluate-the-bracket-pairs-of-a-string/solution.go diff --git a/problems_backup/minimum_number_of_operations_to_reinitialize_a_permutation/solution.go b/1935-minimum-number-of-operations-to-reinitialize-a-permutation/solution.go similarity index 100% rename from problems_backup/minimum_number_of_operations_to_reinitialize_a_permutation/solution.go rename to 1935-minimum-number-of-operations-to-reinitialize-a-permutation/solution.go diff --git a/problems_backup/minimum_operations_to_make_the_array_increasing/solution.go b/1938-minimum-operations-to-make-the-array-increasing/solution.go similarity index 100% rename from problems_backup/minimum_operations_to_make_the_array_increasing/solution.go rename to 1938-minimum-operations-to-make-the-array-increasing/solution.go diff --git a/problems_backup/queries_on_number_of_points_inside_a_circle/solution.go b/1939-queries-on-number-of-points-inside-a-circle/solution.go similarity index 100% rename from problems_backup/queries_on_number_of_points_inside_a_circle/solution.go rename to 1939-queries-on-number-of-points-inside-a-circle/solution.go diff --git a/problems_backup/truncate_sentence/solution.go b/1944-truncate-sentence/solution.go similarity index 100% rename from problems_backup/truncate_sentence/solution.go rename to 1944-truncate-sentence/solution.go diff --git a/problems_backup/finding_the_users_active_minutes/solution.go b/1945-finding-the-users-active-minutes/solution.go similarity index 100% rename from problems_backup/finding_the_users_active_minutes/solution.go rename to 1945-finding-the-users-active-minutes/solution.go diff --git a/problems_backup/sign_of_the_product_of_an_array/solution.go b/1950-sign-of-the-product-of-an-array/solution.go similarity index 100% rename from problems_backup/sign_of_the_product_of_an_array/solution.go rename to 1950-sign-of-the-product-of-an-array/solution.go diff --git a/problems_backup/find_the_winner_of_the_circular_game/solution.go b/1951-find-the-winner-of-the-circular-game/solution.go similarity index 100% rename from problems_backup/find_the_winner_of_the_circular_game/solution.go rename to 1951-find-the-winner-of-the-circular-game/solution.go diff --git a/problems_backup/replace_all_digits_with_characters/solution.go b/1954-replace-all-digits-with-characters/solution.go similarity index 100% rename from problems_backup/replace_all_digits_with_characters/solution.go rename to 1954-replace-all-digits-with-characters/solution.go diff --git a/problems_backup/seat_reservation_manager/solution.go b/1955-seat-reservation-manager/solution.go similarity index 100% rename from problems_backup/seat_reservation_manager/solution.go rename to 1955-seat-reservation-manager/solution.go diff --git a/problems_backup/check_if_the_sentence_is_pangram/solution.go b/1960-check-if-the-sentence-is-pangram/solution.go similarity index 100% rename from problems_backup/check_if_the_sentence_is_pangram/solution.go rename to 1960-check-if-the-sentence-is-pangram/solution.go diff --git a/problems_backup/maximum_ice_cream_bars/solution.go b/1961-maximum-ice-cream-bars/solution.go similarity index 100% rename from problems_backup/maximum_ice_cream_bars/solution.go rename to 1961-maximum-ice-cream-bars/solution.go diff --git a/problems_backup/sum_of_digits_in_base_k/solution.go b/1965-sum-of-digits-in-base-k/solution.go similarity index 100% rename from problems_backup/sum_of_digits_in_base_k/solution.go rename to 1965-sum-of-digits-in-base-k/solution.go diff --git a/problems_backup/sorting_the_sentence/solution.go b/1970-sorting-the-sentence/solution.go similarity index 100% rename from problems_backup/sorting_the_sentence/solution.go rename to 1970-sorting-the-sentence/solution.go diff --git a/problems_backup/rotating_the_box/solution.go b/1972-rotating-the-box/solution.go similarity index 100% rename from problems_backup/rotating_the_box/solution.go rename to 1972-rotating-the-box/solution.go diff --git a/problems_backup/minimum_distance_to_the_target_element/solution.go b/1975-minimum-distance-to-the-target-element/solution.go similarity index 100% rename from problems_backup/minimum_distance_to_the_target_element/solution.go rename to 1975-minimum-distance-to-the-target-element/solution.go diff --git a/problems_backup/house_robber/solution.go b/198-house-robber/solution.go similarity index 100% rename from problems_backup/house_robber/solution.go rename to 198-house-robber/solution.go diff --git a/problems_backup/remove_duplicates_from_an_unsorted_linked_list/solution.go b/1982-remove-duplicates-from-an-unsorted-linked-list/solution.go similarity index 100% rename from problems_backup/remove_duplicates_from_an_unsorted_linked_list/solution.go rename to 1982-remove-duplicates-from-an-unsorted-linked-list/solution.go diff --git a/problems_backup/maximum_population_year/solution.go b/1983-maximum-population-year/solution.go similarity index 100% rename from problems_backup/maximum_population_year/solution.go rename to 1983-maximum-population-year/solution.go diff --git a/problems_backup/substrings_of_size_three_with_distinct_characters/solution.go b/1987-substrings-of-size-three-with-distinct-characters/solution.go similarity index 100% rename from problems_backup/substrings_of_size_three_with_distinct_characters/solution.go rename to 1987-substrings-of-size-three-with-distinct-characters/solution.go diff --git a/problems_backup/minimize_maximum_pair_sum_in_array/solution.go b/1988-minimize-maximum-pair-sum-in-array/solution.go similarity index 100% rename from problems_backup/minimize_maximum_pair_sum_in_array/solution.go rename to 1988-minimize-maximum-pair-sum-in-array/solution.go diff --git a/problems_backup/binary_tree_right_side_view/solution.go b/199-binary-tree-right-side-view/solution.go similarity index 100% rename from problems_backup/binary_tree_right_side_view/solution.go rename to 199-binary-tree-right-side-view/solution.go diff --git a/problems_backup/sort_linked_list_already_sorted_using_absolute_values/solution.go b/1992-sort-linked-list-already-sorted-using-absolute-values/solution.go similarity index 100% rename from problems_backup/sort_linked_list_already_sorted_using_absolute_values/solution.go rename to 1992-sort-linked-list-already-sorted-using-absolute-values/solution.go diff --git a/problems_backup/longer_contiguous_segments_of_ones_than_zeros/solution.go b/1999-longer-contiguous-segments-of-ones-than-zeros/solution.go similarity index 100% rename from problems_backup/longer_contiguous_segments_of_ones_than_zeros/solution.go rename to 1999-longer-contiguous-segments-of-ones-than-zeros/solution.go diff --git a/problems_backup/add_two_numbers/solution.go b/2-add-two-numbers/solution.go similarity index 100% rename from problems_backup/add_two_numbers/solution.go rename to 2-add-two-numbers/solution.go diff --git a/problems_backup/valid_parentheses/solution.java b/20-valid-parentheses/solution.java similarity index 100% rename from problems_backup/valid_parentheses/solution.java rename to 20-valid-parentheses/solution.java diff --git a/problems_backup/number_of_islands/solution.go b/200-number-of-islands/solution.go similarity index 100% rename from problems_backup/number_of_islands/solution.go rename to 200-number-of-islands/solution.go diff --git a/problems_backup/distinct_numbers_in_each_subarray/solution.go b/2003-distinct-numbers-in-each-subarray/solution.go similarity index 100% rename from problems_backup/distinct_numbers_in_each_subarray/solution.go rename to 2003-distinct-numbers-in-each-subarray/solution.go diff --git a/problems_backup/check_if_all_the_integers_in_a_range_are_covered/solution.go b/2005-check-if-all-the-integers-in-a-range-are-covered/solution.go similarity index 100% rename from problems_backup/check_if_all_the_integers_in_a_range_are_covered/solution.go rename to 2005-check-if-all-the-integers-in-a-range-are-covered/solution.go diff --git a/problems_backup/maximum_cost_of_trip_with_k_highways/solution.go b/2007-maximum-cost-of-trip-with-k-highways/solution.go similarity index 100% rename from problems_backup/maximum_cost_of_trip_with_k_highways/solution.go rename to 2007-maximum-cost-of-trip-with-k-highways/solution.go diff --git a/problems_backup/longest_word_with_all_prefixes/solution.go b/2009-longest-word-with-all-prefixes/solution.go similarity index 100% rename from problems_backup/longest_word_with_all_prefixes/solution.go rename to 2009-longest-word-with-all-prefixes/solution.go diff --git a/problems_backup/bitwise_and_of_numbers_range/solution.go b/201-bitwise-and-of-numbers-range/solution.go similarity index 100% rename from problems_backup/bitwise_and_of_numbers_range/solution.go rename to 201-bitwise-and-of-numbers-range/solution.go diff --git a/problems_backup/check_if_word_equals_summation_of_two_words/solution.go b/2010-check-if-word-equals-summation-of-two-words/solution.go similarity index 100% rename from problems_backup/check_if_word_equals_summation_of_two_words/solution.go rename to 2010-check-if-word-equals-summation-of-two-words/solution.go diff --git a/problems_backup/determine_whether_matrix_can_be_obtained_by_rotation/solution.go b/2015-determine-whether-matrix-can-be-obtained-by-rotation/solution.go similarity index 100% rename from problems_backup/determine_whether_matrix_can_be_obtained_by_rotation/solution.go rename to 2015-determine-whether-matrix-can-be-obtained-by-rotation/solution.go diff --git a/problems_backup/happy_number/solution.java b/202-happy-number/solution.java similarity index 100% rename from problems_backup/happy_number/solution.java rename to 202-happy-number/solution.java diff --git a/problems_backup/remove_all_occurrences_of_a_substring/solution.go b/2021-remove-all-occurrences-of-a-substring/solution.go similarity index 100% rename from problems_backup/remove_all_occurrences_of_a_substring/solution.go rename to 2021-remove-all-occurrences-of-a-substring/solution.go diff --git a/problems_backup/redistribute_characters_to_make_all_strings_equal/solution.go b/2025-redistribute-characters-to-make-all-strings-equal/solution.go similarity index 100% rename from problems_backup/redistribute_characters_to_make_all_strings_equal/solution.go rename to 2025-redistribute-characters-to-make-all-strings-equal/solution.go diff --git a/problems_backup/minimize_product_sum_of_two_arrays/solution.go b/2029-minimize-product-sum-of-two-arrays/solution.go similarity index 100% rename from problems_backup/minimize_product_sum_of_two_arrays/solution.go rename to 2029-minimize-product-sum-of-two-arrays/solution.go diff --git a/problems_backup/remove_linked_list_elements/solution.go b/203-remove-linked-list-elements/solution.go similarity index 100% rename from problems_backup/remove_linked_list_elements/solution.go rename to 203-remove-linked-list-elements/solution.go diff --git a/problems_backup/largest_odd_number_in_string/solution.go b/2032-largest-odd-number-in-string/solution.go similarity index 100% rename from problems_backup/largest_odd_number_in_string/solution.go rename to 2032-largest-odd-number-in-string/solution.go diff --git a/problems_backup/count_sub_islands/solution.go b/2035-count-sub-islands/solution.go similarity index 100% rename from problems_backup/count_sub_islands/solution.go rename to 2035-count-sub-islands/solution.go diff --git a/problems_backup/count_square_sum_triples/solution.go b/2037-count-square-sum-triples/solution.go similarity index 100% rename from problems_backup/count_square_sum_triples/solution.go rename to 2037-count-square-sum-triples/solution.go diff --git a/problems_backup/nearest_exit_from_entrance_in_maze/solution.go b/2038-nearest-exit-from-entrance-in-maze/solution.go similarity index 100% rename from problems_backup/nearest_exit_from_entrance_in_maze/solution.go rename to 2038-nearest-exit-from-entrance-in-maze/solution.go diff --git a/problems_backup/count_primes/solution.go b/204-count-primes/solution.go similarity index 100% rename from problems_backup/count_primes/solution.go rename to 204-count-primes/solution.go diff --git a/problems_backup/maximum_product_difference_between_two_pairs/solution.go b/2042-maximum-product-difference-between-two-pairs/solution.go similarity index 100% rename from problems_backup/maximum_product_difference_between_two_pairs/solution.go rename to 2042-maximum-product-difference-between-two-pairs/solution.go diff --git a/problems_backup/cyclically_rotating_a_grid/solution.go b/2043-cyclically-rotating-a-grid/solution.go similarity index 100% rename from problems_backup/cyclically_rotating_a_grid/solution.go rename to 2043-cyclically-rotating-a-grid/solution.go diff --git a/problems_backup/build_array_from_permutation/solution.go b/2048-build-array-from-permutation/solution.go similarity index 100% rename from problems_backup/build_array_from_permutation/solution.go rename to 2048-build-array-from-permutation/solution.go diff --git a/problems_backup/isomorphic_strings/solution.go b/205-isomorphic-strings/solution.go similarity index 100% rename from problems_backup/isomorphic_strings/solution.go rename to 205-isomorphic-strings/solution.go diff --git a/problems_backup/check_if_all_characters_have_equal_number_of_occurrences/solution.go b/2053-check-if-all-characters-have-equal-number-of-occurrences/solution.go similarity index 100% rename from problems_backup/check_if_all_characters_have_equal_number_of_occurrences/solution.go rename to 2053-check-if-all-characters-have-equal-number-of-occurrences/solution.go diff --git a/problems_backup/kth_distinct_string_in_an_array/solution.go b/2053-kth-distinct-string-in-an-array/solution.go similarity index 100% rename from problems_backup/kth_distinct_string_in_an_array/solution.go rename to 2053-kth-distinct-string-in-an-array/solution.go diff --git a/problems_backup/reverse_linked_list/solution.go b/206-reverse-linked-list/solution.go similarity index 100% rename from problems_backup/reverse_linked_list/solution.go rename to 206-reverse-linked-list/solution.go diff --git a/problems_backup/add_minimum_number_of_rungs/solution.go b/2066-add-minimum-number-of-rungs/solution.go similarity index 100% rename from problems_backup/add_minimum_number_of_rungs/solution.go rename to 2066-add-minimum-number-of-rungs/solution.go diff --git a/problems_backup/check_if_string_is_decomposable_into_value-equal_substrings/solution.go b/2070-check-if-string-is-decomposable-into-value-equal-substrings/solution.go similarity index 100% rename from problems_backup/check_if_string_is_decomposable_into_value-equal_substrings/solution.go rename to 2070-check-if-string-is-decomposable-into-value-equal-substrings/solution.go diff --git a/problems_backup/longest_common_subsequence_between_sorted_arrays/solution.go b/2071-longest-common-subsequence-between-sorted-arrays/solution.go similarity index 100% rename from problems_backup/longest_common_subsequence_between_sorted_arrays/solution.go rename to 2071-longest-common-subsequence-between-sorted-arrays/solution.go diff --git a/problems_backup/brightest_position_on_street/solution.go b/2075-brightest-position-on-street/solution.go similarity index 100% rename from problems_backup/brightest_position_on_street/solution.go rename to 2075-brightest-position-on-street/solution.go diff --git a/problems_backup/sum_of_digits_of_string_after_convert/solution.go b/2076-sum-of-digits-of-string-after-convert/solution.go similarity index 100% rename from problems_backup/sum_of_digits_of_string_after_convert/solution.go rename to 2076-sum-of-digits-of-string-after-convert/solution.go diff --git a/problems_backup/largest_number_after_mutating_substring/solution.go b/2077-largest-number-after-mutating-substring/solution.go similarity index 100% rename from problems_backup/largest_number_after_mutating_substring/solution.go rename to 2077-largest-number-after-mutating-substring/solution.go diff --git a/problems_backup/implement_trie_(prefix_tree)/solution.go b/208-implement-trie-(prefix-tree)/solution.go similarity index 100% rename from problems_backup/implement_trie_(prefix_tree)/solution.go rename to 208-implement-trie-(prefix-tree)/solution.go diff --git a/problems_backup/three_divisors/solution.go b/2083-three-divisors/solution.go similarity index 100% rename from problems_backup/three_divisors/solution.go rename to 2083-three-divisors/solution.go diff --git a/problems_backup/minimum_time_to_type_word_using_special_typewriter/solution.go b/2088-minimum-time-to-type-word-using-special-typewriter/solution.go similarity index 100% rename from problems_backup/minimum_time_to_type_word_using_special_typewriter/solution.go rename to 2088-minimum-time-to-type-word-using-special-typewriter/solution.go diff --git a/problems_backup/minimum_size_subarray_sum/solution.go b/209-minimum-size-subarray-sum/solution.go similarity index 100% rename from problems_backup/minimum_size_subarray_sum/solution.go rename to 209-minimum-size-subarray-sum/solution.go diff --git a/problems_backup/check_if_string_is_a_prefix_of_array/solution.go b/2093-check-if-string-is-a-prefix-of-array/solution.go similarity index 100% rename from problems_backup/check_if_string_is_a_prefix_of_array/solution.go rename to 2093-check-if-string-is-a-prefix-of-array/solution.go diff --git a/problems_backup/remove_stones_to_minimize_the_total/solution.go b/2094-remove-stones-to-minimize-the-total/solution.go similarity index 100% rename from problems_backup/remove_stones_to_minimize_the_total/solution.go rename to 2094-remove-stones-to-minimize-the-total/solution.go diff --git a/problems_backup/minimum_number_of_swaps_to_make_the_string_balanced/solution.go b/2095-minimum-number-of-swaps-to-make-the-string-balanced/solution.go similarity index 100% rename from problems_backup/minimum_number_of_swaps_to_make_the_string_balanced/solution.go rename to 2095-minimum-number-of-swaps-to-make-the-string-balanced/solution.go diff --git a/problems_backup/number_of_strings_that_appear_as_substrings_in_word/solution.go b/2099-number-of-strings-that-appear-as-substrings-in-word/solution.go similarity index 100% rename from problems_backup/number_of_strings_that_appear_as_substrings_in_word/solution.go rename to 2099-number-of-strings-that-appear-as-substrings-in-word/solution.go diff --git a/problems_backup/merge_two_sorted_lists/solution.go b/21-merge-two-sorted-lists/solution.go similarity index 100% rename from problems_backup/merge_two_sorted_lists/solution.go rename to 21-merge-two-sorted-lists/solution.go diff --git a/problems_backup/last_day_where_you_can_still_cross/solution.go b/2101-last-day-where-you-can-still-cross/solution.go similarity index 100% rename from problems_backup/last_day_where_you_can_still_cross/solution.go rename to 2101-last-day-where-you-can-still-cross/solution.go diff --git a/problems_backup/find_the_middle_index_in_array/solution.go b/2102-find-the-middle-index-in-array/solution.go similarity index 100% rename from problems_backup/find_the_middle_index_in_array/solution.go rename to 2102-find-the-middle-index-in-array/solution.go diff --git a/problems_backup/find_all_groups_of_farmland/solution.go b/2103-find-all-groups-of-farmland/solution.go similarity index 100% rename from problems_backup/find_all_groups_of_farmland/solution.go rename to 2103-find-all-groups-of-farmland/solution.go diff --git a/problems_backup/find_greatest_common_divisor_of_array/solution.go b/2106-find-greatest-common-divisor-of-array/solution.go similarity index 100% rename from problems_backup/find_greatest_common_divisor_of_array/solution.go rename to 2106-find-greatest-common-divisor-of-array/solution.go diff --git a/problems_backup/find_unique_binary_string/solution.go b/2107-find-unique-binary-string/solution.go similarity index 100% rename from problems_backup/find_unique_binary_string/solution.go rename to 2107-find-unique-binary-string/solution.go diff --git a/problems_backup/design_add_and_search_words_data_structure/solution.go b/211-design-add-and-search-words-data-structure/solution.go similarity index 100% rename from problems_backup/design_add_and_search_words_data_structure/solution.go rename to 211-design-add-and-search-words-data-structure/solution.go diff --git a/problems_backup/minimum_difference_between_highest_and_lowest_of_k_scores/solution.go b/2112-minimum-difference-between-highest-and-lowest-of-k-scores/solution.go similarity index 100% rename from problems_backup/minimum_difference_between_highest_and_lowest_of_k_scores/solution.go rename to 2112-minimum-difference-between-highest-and-lowest-of-k-scores/solution.go diff --git a/problems_backup/minimum_number_of_work_sessions_to_finish_the_tasks/solution.go b/2114-minimum-number-of-work-sessions-to-finish-the-tasks/solution.go similarity index 100% rename from problems_backup/minimum_number_of_work_sessions_to_finish_the_tasks/solution.go rename to 2114-minimum-number-of-work-sessions-to-finish-the-tasks/solution.go diff --git a/problems_backup/count_number_of_pairs_with_absolute_difference_k/solution.go b/2116-count-number-of-pairs-with-absolute-difference-k/solution.go similarity index 100% rename from problems_backup/count_number_of_pairs_with_absolute_difference_k/solution.go rename to 2116-count-number-of-pairs-with-absolute-difference-k/solution.go diff --git a/problems_backup/find_if_path_exists_in_graph/solution.go b/2121-find-if-path-exists-in-graph/solution.go similarity index 100% rename from problems_backup/find_if_path_exists_in_graph/solution.go rename to 2121-find-if-path-exists-in-graph/solution.go diff --git a/problems_backup/count_special_quadruplets/solution.go b/2122-count-special-quadruplets/solution.go similarity index 100% rename from problems_backup/count_special_quadruplets/solution.go rename to 2122-count-special-quadruplets/solution.go diff --git a/problems_backup/count_nodes_equal_to_sum_of_descendants/solution.go b/2126-count-nodes-equal-to-sum-of-descendants/solution.go similarity index 100% rename from problems_backup/count_nodes_equal_to_sum_of_descendants/solution.go rename to 2126-count-nodes-equal-to-sum-of-descendants/solution.go diff --git a/problems_backup/reverse_prefix_of_word/solution.go b/2128-reverse-prefix-of-word/solution.go similarity index 100% rename from problems_backup/reverse_prefix_of_word/solution.go rename to 2128-reverse-prefix-of-word/solution.go diff --git a/problems_backup/number_of_pairs_of_interchangeable_rectangles/solution.go b/2129-number-of-pairs-of-interchangeable-rectangles/solution.go similarity index 100% rename from problems_backup/number_of_pairs_of_interchangeable_rectangles/solution.go rename to 2129-number-of-pairs-of-interchangeable-rectangles/solution.go diff --git a/problems_backup/convert_1d_array_into_2d_array/solution.go b/2132-convert-1d-array-into-2d-array/solution.go similarity index 100% rename from problems_backup/convert_1d_array_into_2d_array/solution.go rename to 2132-convert-1d-array-into-2d-array/solution.go diff --git a/problems_backup/final_value_of_variable_after_performing_operations/solution.go b/2137-final-value-of-variable-after-performing-operations/solution.go similarity index 100% rename from problems_backup/final_value_of_variable_after_performing_operations/solution.go rename to 2137-final-value-of-variable-after-performing-operations/solution.go diff --git a/problems_backup/maximum_difference_between_increasing_elements/solution.go b/2144-maximum-difference-between-increasing-elements/solution.go similarity index 100% rename from problems_backup/maximum_difference_between_increasing_elements/solution.go rename to 2144-maximum-difference-between-increasing-elements/solution.go diff --git a/problems_backup/minimum_number_of_moves_to_seat_everyone/solution.go b/2148-minimum-number-of-moves-to-seat-everyone/solution.go similarity index 100% rename from problems_backup/minimum_number_of_moves_to_seat_everyone/solution.go rename to 2148-minimum-number-of-moves-to-seat-everyone/solution.go diff --git a/problems_backup/remove_colored_pieces_if_both_neighbors_are_the_same_color/solution.go b/2149-remove-colored-pieces-if-both-neighbors-are-the-same-color/solution.go similarity index 100% rename from problems_backup/remove_colored_pieces_if_both_neighbors_are_the_same_color/solution.go rename to 2149-remove-colored-pieces-if-both-neighbors-are-the-same-color/solution.go diff --git a/problems_backup/kth_largest_element_in_an_array/solution.go b/215-kth-largest-element-in-an-array/solution.go similarity index 100% rename from problems_backup/kth_largest_element_in_an_array/solution.go rename to 215-kth-largest-element-in-an-array/solution.go diff --git a/problems_backup/minimum_moves_to_convert_string/solution.go b/2154-minimum-moves-to-convert-string/solution.go similarity index 100% rename from problems_backup/minimum_moves_to_convert_string/solution.go rename to 2154-minimum-moves-to-convert-string/solution.go diff --git a/problems_backup/find_missing_observations/solution.go b/2155-find-missing-observations/solution.go similarity index 100% rename from problems_backup/find_missing_observations/solution.go rename to 2155-find-missing-observations/solution.go diff --git a/problems_backup/two_out_of_three/solution.go b/2159-two-out-of-three/solution.go similarity index 100% rename from problems_backup/two_out_of_three/solution.go rename to 2159-two-out-of-three/solution.go diff --git a/problems_backup/minimum_operations_to_make_a_uni-value_grid/solution.go b/2160-minimum-operations-to-make-a-uni-value-grid/solution.go similarity index 100% rename from problems_backup/minimum_operations_to_make_a_uni-value_grid/solution.go rename to 2160-minimum-operations-to-make-a-uni-value-grid/solution.go diff --git a/problems_backup/check_if_numbers_are_ascending_in_a_sentence/solution.go b/2168-check-if-numbers-are-ascending-in-a-sentence/solution.go similarity index 100% rename from problems_backup/check_if_numbers_are_ascending_in_a_sentence/solution.go rename to 2168-check-if-numbers-are-ascending-in-a-sentence/solution.go diff --git a/problems_backup/simple_bank_system/solution.go b/2169-simple-bank-system/solution.go similarity index 100% rename from problems_backup/simple_bank_system/solution.go rename to 2169-simple-bank-system/solution.go diff --git a/problems_backup/contains_duplicate/solution.java b/217-contains-duplicate/solution.java similarity index 100% rename from problems_backup/contains_duplicate/solution.java rename to 217-contains-duplicate/solution.java diff --git a/problems_backup/count_number_of_maximum_bitwise-or_subsets/solution.go b/2170-count-number-of-maximum-bitwise-or-subsets/solution.go similarity index 100% rename from problems_backup/count_number_of_maximum_bitwise-or_subsets/solution.go rename to 2170-count-number-of-maximum-bitwise-or-subsets/solution.go diff --git a/problems_backup/number_of_valid_words_in_a_sentence/solution.go b/2173-number-of-valid-words-in-a-sentence/solution.go similarity index 100% rename from problems_backup/number_of_valid_words_in_a_sentence/solution.go rename to 2173-number-of-valid-words-in-a-sentence/solution.go diff --git a/problems_backup/check_whether_two_strings_are_almost_equivalent/solution.go b/2177-check-whether-two-strings-are-almost-equivalent/solution.go similarity index 100% rename from problems_backup/check_whether_two_strings_are_almost_equivalent/solution.go rename to 2177-check-whether-two-strings-are-almost-equivalent/solution.go diff --git a/problems_backup/the_skyline_problem/solution.go b/218-the-skyline-problem/solution.go similarity index 100% rename from problems_backup/the_skyline_problem/solution.go rename to 218-the-skyline-problem/solution.go diff --git a/problems_backup/smallest_index_with_equal_value/solution.go b/2181-smallest-index-with-equal-value/solution.go similarity index 100% rename from problems_backup/smallest_index_with_equal_value/solution.go rename to 2181-smallest-index-with-equal-value/solution.go diff --git a/problems_backup/find_the_minimum_and_maximum_number_of_nodes_between_critical_points/solution.go b/2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points/solution.go similarity index 100% rename from problems_backup/find_the_minimum_and_maximum_number_of_nodes_between_critical_points/solution.go rename to 2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points/solution.go diff --git a/problems_backup/vowels_of_all_substrings/solution.go b/2187-vowels-of-all-substrings/solution.go similarity index 100% rename from problems_backup/vowels_of_all_substrings/solution.go rename to 2187-vowels-of-all-substrings/solution.go diff --git a/problems_backup/maximum_path_quality_of_a_graph/solution.go b/2189-maximum-path-quality-of-a-graph/solution.go similarity index 100% rename from problems_backup/maximum_path_quality_of_a_graph/solution.go rename to 2189-maximum-path-quality-of-a-graph/solution.go diff --git a/problems_backup/contains_duplicate_ii/solution.java b/219-contains-duplicate-ii/solution.java similarity index 100% rename from problems_backup/contains_duplicate_ii/solution.java rename to 219-contains-duplicate-ii/solution.java diff --git a/problems_backup/count_common_words_with_one_occurrence/solution.go b/2190-count-common-words-with-one-occurrence/solution.go similarity index 100% rename from problems_backup/count_common_words_with_one_occurrence/solution.go rename to 2190-count-common-words-with-one-occurrence/solution.go diff --git a/problems_backup/minimum_cost_homecoming_of_a_robot_in_a_grid/solution.go b/2192-minimum-cost-homecoming-of-a-robot-in-a-grid/solution.go similarity index 100% rename from problems_backup/minimum_cost_homecoming_of_a_robot_in_a_grid/solution.go rename to 2192-minimum-cost-homecoming-of-a-robot-in-a-grid/solution.go diff --git a/problems_backup/time_needed_to_buy_tickets/solution.go b/2195-time-needed-to-buy-tickets/solution.go similarity index 100% rename from problems_backup/time_needed_to_buy_tickets/solution.go rename to 2195-time-needed-to-buy-tickets/solution.go diff --git a/problems_backup/decode_the_slanted_ciphertext/solution.go b/2197-decode-the-slanted-ciphertext/solution.go similarity index 100% rename from problems_backup/decode_the_slanted_ciphertext/solution.go rename to 2197-decode-the-slanted-ciphertext/solution.go diff --git a/problems_backup/two_furthest_houses_with_different_colors/solution.go b/2199-two-furthest-houses-with-different-colors/solution.go similarity index 100% rename from problems_backup/two_furthest_houses_with_different_colors/solution.go rename to 2199-two-furthest-houses-with-different-colors/solution.go diff --git a/problems_backup/generate_parentheses/solution.go b/22-generate-parentheses/solution.go similarity index 100% rename from problems_backup/generate_parentheses/solution.go rename to 22-generate-parentheses/solution.go diff --git a/problems_backup/find_subsequence_of_length_k_with_the_largest_sum/solution.go b/2204-find-subsequence-of-length-k-with-the-largest-sum/solution.go similarity index 100% rename from problems_backup/find_subsequence_of_length_k_with_the_largest_sum/solution.go rename to 2204-find-subsequence-of-length-k-with-the-largest-sum/solution.go diff --git a/problems_backup/find_target_indices_after_sorting_array/solution.go b/2210-find-target-indices-after-sorting-array/solution.go similarity index 100% rename from problems_backup/find_target_indices_after_sorting_array/solution.go rename to 2210-find-target-indices-after-sorting-array/solution.go diff --git a/problems_backup/removing_minimum_and_maximum_from_array/solution.go b/2212-removing-minimum-and-maximum-from-array/solution.go similarity index 100% rename from problems_backup/removing_minimum_and_maximum_from_array/solution.go rename to 2212-removing-minimum-and-maximum-from-array/solution.go diff --git a/problems_backup/delete_the_middle_node_of_a_linked_list/solution.go b/2216-delete-the-middle-node-of-a-linked-list/solution.go similarity index 100% rename from problems_backup/delete_the_middle_node_of_a_linked_list/solution.go rename to 2216-delete-the-middle-node-of-a-linked-list/solution.go diff --git a/problems_backup/maximum_number_of_words_found_in_sentences/solution.go b/2219-maximum-number-of-words-found-in-sentences/solution.go similarity index 100% rename from problems_backup/maximum_number_of_words_found_in_sentences/solution.go rename to 2219-maximum-number-of-words-found-in-sentences/solution.go diff --git a/problems_backup/count_complete_tree_nodes/solution.go b/222-count-complete-tree-nodes/solution.go similarity index 100% rename from problems_backup/count_complete_tree_nodes/solution.go rename to 222-count-complete-tree-nodes/solution.go diff --git a/problems_backup/find_all_possible_recipes_from_given_supplies/solution.go b/2220-find-all-possible-recipes-from-given-supplies/solution.go similarity index 100% rename from problems_backup/find_all_possible_recipes_from_given_supplies/solution.go rename to 2220-find-all-possible-recipes-from-given-supplies/solution.go diff --git a/problems_backup/substrings_that_begin_and_end_with_the_same_letter/solution.go b/2225-substrings-that-begin-and-end-with-the-same-letter/solution.go similarity index 100% rename from problems_backup/substrings_that_begin_and_end_with_the_same_letter/solution.go rename to 2225-substrings-that-begin-and-end-with-the-same-letter/solution.go diff --git a/problems_backup/rings_and_rods/solution.go b/2226-rings-and-rods/solution.go similarity index 100% rename from problems_backup/rings_and_rods/solution.go rename to 2226-rings-and-rods/solution.go diff --git a/problems_backup/sum_of_subarray_ranges/solution.go b/2227-sum-of-subarray-ranges/solution.go similarity index 100% rename from problems_backup/sum_of_subarray_ranges/solution.go rename to 2227-sum-of-subarray-ranges/solution.go diff --git a/problems_backup/rectangle_area/solution.go b/223-rectangle-area/solution.go similarity index 100% rename from problems_backup/rectangle_area/solution.go rename to 223-rectangle-area/solution.go diff --git a/problems_backup/find_first_palindromic_string_in_the_array/solution.go b/2231-find-first-palindromic-string-in-the-array/solution.go similarity index 100% rename from problems_backup/find_first_palindromic_string_in_the_array/solution.go rename to 2231-find-first-palindromic-string-in-the-array/solution.go diff --git a/problems_backup/capitalize_the_title/solution.go b/2235-capitalize-the-title/solution.go similarity index 100% rename from problems_backup/capitalize_the_title/solution.go rename to 2235-capitalize-the-title/solution.go diff --git a/problems_backup/maximum_twin_sum_of_a_linked_list/solution.go b/2236-maximum-twin-sum-of-a-linked-list/solution.go similarity index 100% rename from problems_backup/maximum_twin_sum_of_a_linked_list/solution.go rename to 2236-maximum-twin-sum-of-a-linked-list/solution.go diff --git a/problems_backup/longest_palindrome_by_concatenating_two_letter_words/solution.go b/2237-longest-palindrome-by-concatenating-two-letter-words/solution.go similarity index 100% rename from problems_backup/longest_palindrome_by_concatenating_two_letter_words/solution.go rename to 2237-longest-palindrome-by-concatenating-two-letter-words/solution.go diff --git a/problems_backup/a_number_after_a_double_reversal/solution.go b/2238-a-number-after-a-double-reversal/solution.go similarity index 100% rename from problems_backup/a_number_after_a_double_reversal/solution.go rename to 2238-a-number-after-a-double-reversal/solution.go diff --git a/problems_backup/execution_of_all_suffix_instructions_staying_in_a_grid/solution.go b/2239-execution-of-all-suffix-instructions-staying-in-a-grid/solution.go similarity index 100% rename from problems_backup/execution_of_all_suffix_instructions_staying_in_a_grid/solution.go rename to 2239-execution-of-all-suffix-instructions-staying-in-a-grid/solution.go diff --git a/problems_backup/number_of_laser_beams_in_a_bank/solution.go b/2244-number-of-laser-beams-in-a-bank/solution.go similarity index 100% rename from problems_backup/number_of_laser_beams_in_a_bank/solution.go rename to 2244-number-of-laser-beams-in-a-bank/solution.go diff --git a/problems_backup/destroying_asteroids/solution.go b/2245-destroying-asteroids/solution.go similarity index 100% rename from problems_backup/destroying_asteroids/solution.go rename to 2245-destroying-asteroids/solution.go diff --git a/problems_backup/minimum_cost_of_buying_candies_with_discount/solution.go b/2248-minimum-cost-of-buying-candies-with-discount/solution.go similarity index 100% rename from problems_backup/minimum_cost_of_buying_candies_with_discount/solution.go rename to 2248-minimum-cost-of-buying-candies-with-discount/solution.go diff --git a/problems_backup/implement_stack_using_queues/solution.go b/225-implement-stack-using-queues/solution.go similarity index 100% rename from problems_backup/implement_stack_using_queues/solution.go rename to 225-implement-stack-using-queues/solution.go diff --git a/problems_backup/check_if_every_row_and_column_contains_all_numbers/solution.go b/2254-check-if-every-row-and-column-contains-all-numbers/solution.go similarity index 100% rename from problems_backup/check_if_every_row_and_column_contains_all_numbers/solution.go rename to 2254-check-if-every-row-and-column-contains-all-numbers/solution.go diff --git a/problems_backup/earliest_possible_day_of_full_bloom/solution.go b/2257-earliest-possible-day-of-full-bloom/solution.go similarity index 100% rename from problems_backup/earliest_possible_day_of_full_bloom/solution.go rename to 2257-earliest-possible-day-of-full-bloom/solution.go diff --git a/problems_backup/invert_binary_tree/solution.go b/226-invert-binary-tree/solution.go similarity index 100% rename from problems_backup/invert_binary_tree/solution.go rename to 226-invert-binary-tree/solution.go diff --git a/problems_backup/divide_a_string_into_groups_of_size_k/solution.go b/2260-divide-a-string-into-groups-of-size-k/solution.go similarity index 100% rename from problems_backup/divide_a_string_into_groups_of_size_k/solution.go rename to 2260-divide-a-string-into-groups-of-size-k/solution.go diff --git a/problems_backup/all_divisions_with_the_highest_score_of_a_binary_array/solution.go b/2261-all-divisions-with-the-highest-score-of-a-binary-array/solution.go similarity index 100% rename from problems_backup/all_divisions_with_the_highest_score_of_a_binary_array/solution.go rename to 2261-all-divisions-with-the-highest-score-of-a-binary-array/solution.go diff --git a/problems_backup/minimum_sum_of_four_digit_number_after_splitting_digits/solution.go b/2264-minimum-sum-of-four-digit-number-after-splitting-digits/solution.go similarity index 100% rename from problems_backup/minimum_sum_of_four_digit_number_after_splitting_digits/solution.go rename to 2264-minimum-sum-of-four-digit-number-after-splitting-digits/solution.go diff --git a/problems_backup/partition_array_according_to_given_pivot/solution.go b/2265-partition-array-according-to-given-pivot/solution.go similarity index 100% rename from problems_backup/partition_array_according_to_given_pivot/solution.go rename to 2265-partition-array-according-to-given-pivot/solution.go diff --git a/problems_backup/remove_all_ones_with_row_and_column_flips/solution.go b/2268-remove-all-ones-with-row-and-column-flips/solution.go similarity index 100% rename from problems_backup/remove_all_ones_with_row_and_column_flips/solution.go rename to 2268-remove-all-ones-with-row-and-column-flips/solution.go diff --git a/problems_backup/count_elements_with_strictly_smaller_and_greater_elements_/solution.go b/2269-count-elements-with-strictly-smaller-and-greater-elements/solution.go similarity index 100% rename from problems_backup/count_elements_with_strictly_smaller_and_greater_elements_/solution.go rename to 2269-count-elements-with-strictly-smaller-and-greater-elements/solution.go diff --git a/problems_backup/find_all_lonely_numbers_in_the_array/solution.go b/2270-find-all-lonely-numbers-in-the-array/solution.go similarity index 100% rename from problems_backup/find_all_lonely_numbers_in_the_array/solution.go rename to 2270-find-all-lonely-numbers-in-the-array/solution.go diff --git a/problems_backup/rearrange_array_elements_by_sign/solution.go b/2271-rearrange-array-elements-by-sign/solution.go similarity index 100% rename from problems_backup/rearrange_array_elements_by_sign/solution.go rename to 2271-rearrange-array-elements-by-sign/solution.go diff --git a/problems_backup/keep_multiplying_found_values_by_two/solution.go b/2274-keep-multiplying-found-values-by-two/solution.go similarity index 100% rename from problems_backup/keep_multiplying_found_values_by_two/solution.go rename to 2274-keep-multiplying-found-values-by-two/solution.go diff --git a/problems_backup/count_equal_and_divisible_pairs_in_an_array/solution.go b/2277-count-equal-and-divisible-pairs-in-an-array/solution.go similarity index 100% rename from problems_backup/count_equal_and_divisible_pairs_in_an_array/solution.go rename to 2277-count-equal-and-divisible-pairs-in-an-array/solution.go diff --git a/problems_backup/find_three_consecutive_integers_that_sum_to_a_given_number/solution.go b/2278-find-three-consecutive-integers-that-sum-to-a-given-number/solution.go similarity index 100% rename from problems_backup/find_three_consecutive_integers_that_sum_to_a_given_number/solution.go rename to 2278-find-three-consecutive-integers-that-sum-to-a-given-number/solution.go diff --git a/problems_backup/maximum_split_of_positive_even_integers/solution.go b/2279-maximum-split-of-positive-even-integers/solution.go similarity index 100% rename from problems_backup/maximum_split_of_positive_even_integers/solution.go rename to 2279-maximum-split-of-positive-even-integers/solution.go diff --git a/problems_backup/summary_ranges/solution.go b/228-summary-ranges/solution.go similarity index 100% rename from problems_backup/summary_ranges/solution.go rename to 228-summary-ranges/solution.go diff --git a/problems_backup/sort_even_and_odd_indices_independently/solution.go b/2283-sort-even-and-odd-indices-independently/solution.go similarity index 100% rename from problems_backup/sort_even_and_odd_indices_independently/solution.go rename to 2283-sort-even-and-odd-indices-independently/solution.go diff --git a/problems_backup/smallest_value_of_the_rearranged_number/solution.go b/2284-smallest-value-of-the-rearranged-number/solution.go similarity index 100% rename from problems_backup/smallest_value_of_the_rearranged_number/solution.go rename to 2284-smallest-value-of-the-rearranged-number/solution.go diff --git a/problems_backup/minimum_number_of_lines_to_cover_points/solution.go b/2287-minimum-number-of-lines-to-cover-points/solution.go similarity index 100% rename from problems_backup/minimum_number_of_lines_to_cover_points/solution.go rename to 2287-minimum-number-of-lines-to-cover-points/solution.go diff --git a/problems_backup/count_operations_to_obtain_zero/solution.go b/2288-count-operations-to-obtain-zero/solution.go similarity index 100% rename from problems_backup/count_operations_to_obtain_zero/solution.go rename to 2288-count-operations-to-obtain-zero/solution.go diff --git a/problems_backup/majority_element_ii/solution.go b/229-majority-element-ii/solution.go similarity index 100% rename from problems_backup/majority_element_ii/solution.go rename to 229-majority-element-ii/solution.go diff --git a/problems_backup/maximum_and_sum_of_array/solution.go b/2291-maximum-and-sum-of-array/solution.go similarity index 100% rename from problems_backup/maximum_and_sum_of_array/solution.go rename to 2291-maximum-and-sum-of-array/solution.go diff --git a/problems_backup/counting_words_with_a_given_prefix/solution.go b/2292-counting-words-with-a-given-prefix/solution.go similarity index 100% rename from problems_backup/counting_words_with_a_given_prefix/solution.go rename to 2292-counting-words-with-a-given-prefix/solution.go diff --git a/problems_backup/minimum_number_of_steps_to_make_two_strings_anagram_ii/solution.go b/2293-minimum-number-of-steps-to-make-two-strings-anagram-ii/solution.go similarity index 100% rename from problems_backup/minimum_number_of_steps_to_make_two_strings_anagram_ii/solution.go rename to 2293-minimum-number-of-steps-to-make-two-strings-anagram-ii/solution.go diff --git a/problems_backup/count_integers_with_even_digit_sum/solution.go b/2298-count-integers-with-even-digit-sum/solution.go similarity index 100% rename from problems_backup/count_integers_with_even_digit_sum/solution.go rename to 2298-count-integers-with-even-digit-sum/solution.go diff --git a/problems_backup/merge_nodes_in_between_zeros/solution.go b/2299-merge-nodes-in-between-zeros/solution.go similarity index 100% rename from problems_backup/merge_nodes_in_between_zeros/solution.go rename to 2299-merge-nodes-in-between-zeros/solution.go diff --git a/problems_backup/merge_k_sorted_lists/solution.go b/23-merge-k-sorted-lists/solution.go similarity index 100% rename from problems_backup/merge_k_sorted_lists/solution.go rename to 23-merge-k-sorted-lists/solution.go diff --git a/problems_backup/kth_smallest_element_in_a_bst/solution.go b/230-kth-smallest-element-in-a-bst/solution.go similarity index 100% rename from problems_backup/kth_smallest_element_in_a_bst/solution.go rename to 230-kth-smallest-element-in-a-bst/solution.go diff --git a/problems_backup/cells_in_a_range_on_an_excel_sheet/solution.go b/2304-cells-in-a-range-on-an-excel-sheet/solution.go similarity index 100% rename from problems_backup/cells_in_a_range_on_an_excel_sheet/solution.go rename to 2304-cells-in-a-range-on-an-excel-sheet/solution.go diff --git a/problems_backup/append_k_integers_with_minimal_sum/solution.go b/2305-append-k-integers-with-minimal-sum/solution.go similarity index 100% rename from problems_backup/append_k_integers_with_minimal_sum/solution.go rename to 2305-append-k-integers-with-minimal-sum/solution.go diff --git a/problems_backup/create_binary_tree_from_descriptions/solution.go b/2306-create-binary-tree-from-descriptions/solution.go similarity index 100% rename from problems_backup/create_binary_tree_from_descriptions/solution.go rename to 2306-create-binary-tree-from-descriptions/solution.go diff --git a/problems_backup/divide_array_into_equal_pairs/solution.go b/2308-divide-array-into-equal-pairs/solution.go similarity index 100% rename from problems_backup/divide_array_into_equal_pairs/solution.go rename to 2308-divide-array-into-equal-pairs/solution.go diff --git a/problems_backup/power_of_two/solution.go b/231-power-of-two/solution.go similarity index 100% rename from problems_backup/power_of_two/solution.go rename to 231-power-of-two/solution.go diff --git a/problems_backup/power_of_two/solution.java b/231-power-of-two/solution.java similarity index 100% rename from problems_backup/power_of_two/solution.java rename to 231-power-of-two/solution.java diff --git a/problems_backup/minimum_operations_to_halve_array_sum/solution.go b/2310-minimum-operations-to-halve-array-sum/solution.go similarity index 100% rename from problems_backup/minimum_operations_to_halve_array_sum/solution.go rename to 2310-minimum-operations-to-halve-array-sum/solution.go diff --git a/problems_backup/most_frequent_number_following_key_in_an_array/solution.go b/2312-most-frequent-number-following-key-in-an-array/solution.go similarity index 100% rename from problems_backup/most_frequent_number_following_key_in_an_array/solution.go rename to 2312-most-frequent-number-following-key-in-an-array/solution.go diff --git a/problems_backup/count_hills_and_valleys_in_an_array/solution.go b/2316-count-hills-and-valleys-in-an-array/solution.go similarity index 100% rename from problems_backup/count_hills_and_valleys_in_an_array/solution.go rename to 2316-count-hills-and-valleys-in-an-array/solution.go diff --git a/problems_backup/implement_queue_using_stacks/solution.go b/232-implement-queue-using-stacks/solution.go similarity index 100% rename from problems_backup/implement_queue_using_stacks/solution.go rename to 232-implement-queue-using-stacks/solution.go diff --git a/problems_backup/number_of_ways_to_build_sturdy_brick_wall/solution.go b/2322-number-of-ways-to-build-sturdy-brick-wall/solution.go similarity index 100% rename from problems_backup/number_of_ways_to_build_sturdy_brick_wall/solution.go rename to 2322-number-of-ways-to-build-sturdy-brick-wall/solution.go diff --git a/problems_backup/minimum_bit_flips_to_convert_number/solution.go b/2323-minimum-bit-flips-to-convert-number/solution.go similarity index 100% rename from problems_backup/minimum_bit_flips_to_convert_number/solution.go rename to 2323-minimum-bit-flips-to-convert-number/solution.go diff --git a/problems_backup/find_triangular_sum_of_an_array/solution.go b/2324-find-triangular-sum-of-an-array/solution.go similarity index 100% rename from problems_backup/find_triangular_sum_of_an_array/solution.go rename to 2324-find-triangular-sum-of-an-array/solution.go diff --git a/problems_backup/number_of_ways_to_select_buildings/solution.go b/2325-number-of-ways-to-select-buildings/solution.go similarity index 100% rename from problems_backup/number_of_ways_to_select_buildings/solution.go rename to 2325-number-of-ways-to-select-buildings/solution.go diff --git a/problems_backup/largest_number_after_digit_swaps_by_parity/solution.go b/2327-largest-number-after-digit-swaps-by-parity/solution.go similarity index 100% rename from problems_backup/largest_number_after_digit_swaps_by_parity/solution.go rename to 2327-largest-number-after-digit-swaps-by-parity/solution.go diff --git a/problems_backup/number_of_digit_one/solution.java b/233-number-of-digit-one/solution.java similarity index 100% rename from problems_backup/number_of_digit_one/solution.java rename to 233-number-of-digit-one/solution.java diff --git a/problems_backup/evaluate_boolean_binary_tree/solution.go b/2331-evaluate-boolean-binary-tree/solution.go similarity index 100% rename from problems_backup/evaluate_boolean_binary_tree/solution.go rename to 2331-evaluate-boolean-binary-tree/solution.go diff --git a/problems_backup/intersection_of_multiple_arrays/solution.go b/2331-intersection-of-multiple-arrays/solution.go similarity index 100% rename from problems_backup/intersection_of_multiple_arrays/solution.go rename to 2331-intersection-of-multiple-arrays/solution.go diff --git a/problems_backup/remove_digit_from_number_to_maximize_result/solution.go b/2337-remove-digit-from-number-to-maximize-result/solution.go similarity index 100% rename from problems_backup/remove_digit_from_number_to_maximize_result/solution.go rename to 2337-remove-digit-from-number-to-maximize-result/solution.go diff --git a/problems_backup/minimum_consecutive_cards_to_pick_up/solution.go b/2338-minimum-consecutive-cards-to-pick-up/solution.go similarity index 100% rename from problems_backup/minimum_consecutive_cards_to_pick_up/solution.go rename to 2338-minimum-consecutive-cards-to-pick-up/solution.go diff --git a/problems_backup/palindrome_linked_list/solution.go b/234-palindrome-linked-list/solution.go similarity index 100% rename from problems_backup/palindrome_linked_list/solution.go rename to 234-palindrome-linked-list/solution.go diff --git a/problems_backup/count_prefixes_of_a_given_string/solution.go b/2341-count-prefixes-of-a-given-string/solution.go similarity index 100% rename from problems_backup/count_prefixes_of_a_given_string/solution.go rename to 2341-count-prefixes-of-a-given-string/solution.go diff --git a/problems_backup/minimum_number_of_operations_to_convert_time/solution.go b/2345-minimum-number-of-operations-to-convert-time/solution.go similarity index 100% rename from problems_backup/minimum_number_of_operations_to_convert_time/solution.go rename to 2345-minimum-number-of-operations-to-convert-time/solution.go diff --git a/problems_backup/largest_3-same-digit_number_in_string/solution.go b/2346-largest-3-same-digit-number-in-string/solution.go similarity index 100% rename from problems_backup/largest_3-same-digit_number_in_string/solution.go rename to 2346-largest-3-same-digit-number-in-string/solution.go diff --git a/problems_backup/count_nodes_equal_to_average_of_subtree/solution.go b/2347-count-nodes-equal-to-average-of-subtree/solution.go similarity index 100% rename from problems_backup/count_nodes_equal_to_average_of_subtree/solution.go rename to 2347-count-nodes-equal-to-average-of-subtree/solution.go diff --git a/problems_backup/lowest_common_ancestor_of_a_binary_search_tree/solution.java b/235-lowest-common-ancestor-of-a-binary-search-tree/solution.java similarity index 100% rename from problems_backup/lowest_common_ancestor_of_a_binary_search_tree/solution.java rename to 235-lowest-common-ancestor-of-a-binary-search-tree/solution.java diff --git a/problems_backup/find_closest_number_to_zero/solution.go b/2350-find-closest-number-to-zero/solution.go similarity index 100% rename from problems_backup/find_closest_number_to_zero/solution.go rename to 2350-find-closest-number-to-zero/solution.go diff --git a/problems_backup/number_of_ways_to_buy_pens_and_pencils/solution.go b/2351-number-of-ways-to-buy-pens-and-pencils/solution.go similarity index 100% rename from problems_backup/number_of_ways_to_buy_pens_and_pencils/solution.go rename to 2351-number-of-ways-to-buy-pens-and-pencils/solution.go diff --git a/problems_backup/minimum_health_to_beat_game/solution.go b/2354-minimum-health-to-beat-game/solution.go similarity index 100% rename from problems_backup/minimum_health_to_beat_game/solution.go rename to 2354-minimum-health-to-beat-game/solution.go diff --git a/problems_backup/maximum_consecutive_floors_without_special_floors/solution.go b/2355-maximum-consecutive-floors-without-special-floors/solution.go similarity index 100% rename from problems_backup/maximum_consecutive_floors_without_special_floors/solution.go rename to 2355-maximum-consecutive-floors-without-special-floors/solution.go diff --git a/problems_backup/lowest_common_ancestor_of_a_binary_tree/solution.go b/236-lowest-common-ancestor-of-a-binary-tree/solution.go similarity index 100% rename from problems_backup/lowest_common_ancestor_of_a_binary_tree/solution.go rename to 236-lowest-common-ancestor-of-a-binary-tree/solution.go diff --git a/problems_backup/calculate_digit_sum_of_a_string/solution.go b/2361-calculate-digit-sum-of-a-string/solution.go similarity index 100% rename from problems_backup/calculate_digit_sum_of_a_string/solution.go rename to 2361-calculate-digit-sum-of-a-string/solution.go diff --git a/problems_backup/percentage_of_letter_in_string/solution.go b/2365-percentage-of-letter-in-string/solution.go similarity index 100% rename from problems_backup/percentage_of_letter_in_string/solution.go rename to 2365-percentage-of-letter-in-string/solution.go diff --git a/problems_backup/maximum_sum_score_of_array/solution.go b/2369-maximum-sum-score-of-array/solution.go similarity index 100% rename from problems_backup/maximum_sum_score_of_array/solution.go rename to 2369-maximum-sum-score-of-array/solution.go diff --git a/problems_backup/delete_node_in_a_linked_list/solution.go b/237-delete-node-in-a-linked-list/solution.go similarity index 100% rename from problems_backup/delete_node_in_a_linked_list/solution.go rename to 237-delete-node-in-a-linked-list/solution.go diff --git a/problems_backup/rearrange_characters_to_make_target_string/solution.go b/2372-rearrange-characters-to-make-target-string/solution.go similarity index 100% rename from problems_backup/rearrange_characters_to_make_target_string/solution.go rename to 2372-rearrange-characters-to-make-target-string/solution.go diff --git a/problems_backup/check_if_number_has_equal_digit_count_and_digit_value/solution.go b/2377-check-if-number-has-equal-digit-count-and-digit-value/solution.go similarity index 100% rename from problems_backup/check_if_number_has_equal_digit_count_and_digit_value/solution.go rename to 2377-check-if-number-has-equal-digit-count-and-digit-value/solution.go diff --git a/problems_backup/maximum_total_importance_of_roads/solution.go b/2379-maximum-total-importance-of-roads/solution.go similarity index 100% rename from problems_backup/maximum_total_importance_of_roads/solution.go rename to 2379-maximum-total-importance-of-roads/solution.go diff --git a/problems_backup/product_of_array_except_self/solution.go b/238-product-of-array-except-self/solution.go similarity index 100% rename from problems_backup/product_of_array_except_self/solution.go rename to 238-product-of-array-except-self/solution.go diff --git a/problems_backup/add_two_integers/solution.go b/2383-add-two-integers/solution.go similarity index 100% rename from problems_backup/add_two_integers/solution.go rename to 2383-add-two-integers/solution.go diff --git a/problems_backup/root_equals_sum_of_children/solution.go b/2384-root-equals-sum-of-children/solution.go similarity index 100% rename from problems_backup/root_equals_sum_of_children/solution.go rename to 2384-root-equals-sum-of-children/solution.go diff --git a/problems_backup/count_positions_on_street_with_required_brightness/solution.go b/2385-count-positions-on-street-with-required-brightness/solution.go similarity index 100% rename from problems_backup/count_positions_on_street_with_required_brightness/solution.go rename to 2385-count-positions-on-street-with-required-brightness/solution.go diff --git a/problems_backup/min_max_game/solution.go b/2386-min-max-game/solution.go similarity index 100% rename from problems_backup/min_max_game/solution.go rename to 2386-min-max-game/solution.go diff --git a/problems_backup/naming_a_company/solution.go b/2390-naming-a-company/solution.go similarity index 100% rename from problems_backup/naming_a_company/solution.go rename to 2390-naming-a-company/solution.go diff --git a/problems_backup/strong_password_checker_ii/solution.go b/2391-strong-password-checker-ii/solution.go similarity index 100% rename from problems_backup/strong_password_checker_ii/solution.go rename to 2391-strong-password-checker-ii/solution.go diff --git a/problems_backup/check_if_matrix_is_x-matrix/solution.go b/2398-check-if-matrix-is-x-matrix/solution.go similarity index 100% rename from problems_backup/check_if_matrix_is_x-matrix/solution.go rename to 2398-check-if-matrix-is-x-matrix/solution.go diff --git a/problems_backup/swap_nodes_in_pairs/solution.go b/24-swap-nodes-in-pairs/solution.go similarity index 100% rename from problems_backup/swap_nodes_in_pairs/solution.go rename to 24-swap-nodes-in-pairs/solution.go diff --git a/problems_backup/search_a_2d_matrix_ii/solution.go b/240-search-a-2d-matrix-ii/solution.go similarity index 100% rename from problems_backup/search_a_2d_matrix_ii/solution.go rename to 240-search-a-2d-matrix-ii/solution.go diff --git a/problems_backup/count_asterisks/solution.go b/2401-count-asterisks/solution.go similarity index 100% rename from problems_backup/count_asterisks/solution.go rename to 2401-count-asterisks/solution.go diff --git a/problems_backup/count_unreachable_pairs_of_nodes_in_an_undirected_graph/solution.go b/2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph/solution.go similarity index 100% rename from problems_backup/count_unreachable_pairs_of_nodes_in_an_undirected_graph/solution.go rename to 2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph/solution.go diff --git a/problems_backup/minimum_number_of_keypresses/solution.go b/2405-minimum-number-of-keypresses/solution.go similarity index 100% rename from problems_backup/minimum_number_of_keypresses/solution.go rename to 2405-minimum-number-of-keypresses/solution.go diff --git a/problems_backup/decode_the_message/solution.go b/2406-decode-the-message/solution.go similarity index 100% rename from problems_backup/decode_the_message/solution.go rename to 2406-decode-the-message/solution.go diff --git a/problems_backup/spiral_matrix_iv/solution.go b/2411-spiral-matrix-iv/solution.go similarity index 100% rename from problems_backup/spiral_matrix_iv/solution.go rename to 2411-spiral-matrix-iv/solution.go diff --git a/problems_backup/minimum_amount_of_time_to_fill_cups/solution.go b/2412-minimum-amount-of-time-to-fill-cups/solution.go similarity index 100% rename from problems_backup/minimum_amount_of_time_to_fill_cups/solution.go rename to 2412-minimum-amount-of-time-to-fill-cups/solution.go diff --git a/problems_backup/smallest_number_in_infinite_set/solution.go b/2413-smallest-number-in-infinite-set/solution.go similarity index 100% rename from problems_backup/smallest_number_in_infinite_set/solution.go rename to 2413-smallest-number-in-infinite-set/solution.go diff --git a/problems_backup/sort_the_people/solution.go b/2418-sort-the-people/solution.go similarity index 100% rename from problems_backup/sort_the_people/solution.go rename to 2418-sort-the-people/solution.go diff --git a/problems_backup/valid_anagram/solution.go b/242-valid-anagram/solution.go similarity index 100% rename from problems_backup/valid_anagram/solution.go rename to 242-valid-anagram/solution.go diff --git a/problems_backup/valid_anagram/solution.java b/242-valid-anagram/solution.java similarity index 100% rename from problems_backup/valid_anagram/solution.java rename to 242-valid-anagram/solution.java diff --git a/problems_backup/maximum_number_of_pairs_in_array/solution.go b/2421-maximum-number-of-pairs-in-array/solution.go similarity index 100% rename from problems_backup/maximum_number_of_pairs_in_array/solution.go rename to 2421-maximum-number-of-pairs-in-array/solution.go diff --git a/problems_backup/minimum_deletions_to_make_array_divisible/solution.go b/2423-minimum-deletions-to-make-array-divisible/solution.go similarity index 100% rename from problems_backup/minimum_deletions_to_make_array_divisible/solution.go rename to 2423-minimum-deletions-to-make-array-divisible/solution.go diff --git a/problems_backup/first_letter_to_appear_twice/solution.go b/2427-first-letter-to-appear-twice/solution.go similarity index 100% rename from problems_backup/first_letter_to_appear_twice/solution.go rename to 2427-first-letter-to-appear-twice/solution.go diff --git a/problems_backup/design_a_food_rating_system/solution.go b/2429-design-a-food-rating-system/solution.go similarity index 100% rename from problems_backup/design_a_food_rating_system/solution.go rename to 2429-design-a-food-rating-system/solution.go diff --git a/problems_backup/shortest_word_distance/solution.go b/243-shortest-word-distance/solution.go similarity index 100% rename from problems_backup/shortest_word_distance/solution.go rename to 243-shortest-word-distance/solution.go diff --git a/problems_backup/number_of_zero-filled_subarrays/solution.go b/2432-number-of-zero-filled-subarrays/solution.go similarity index 100% rename from problems_backup/number_of_zero-filled_subarrays/solution.go rename to 2432-number-of-zero-filled-subarrays/solution.go diff --git a/problems_backup/best_poker_hand/solution.go b/2433-best-poker-hand/solution.go similarity index 100% rename from problems_backup/best_poker_hand/solution.go rename to 2433-best-poker-hand/solution.go diff --git a/problems_backup/make_array_zero_by_subtracting_equal_amounts/solution.go b/2436-make-array-zero-by-subtracting-equal-amounts/solution.go similarity index 100% rename from problems_backup/make_array_zero_by_subtracting_equal_amounts/solution.go rename to 2436-make-array-zero-by-subtracting-equal-amounts/solution.go diff --git a/problems_backup/shortest_word_distance_ii/solution.go b/244-shortest-word-distance-ii/solution.go similarity index 100% rename from problems_backup/shortest_word_distance_ii/solution.go rename to 244-shortest-word-distance-ii/solution.go diff --git a/problems_backup/number_of_arithmetic_triplets/solution.go b/2442-number-of-arithmetic-triplets/solution.go similarity index 100% rename from problems_backup/number_of_arithmetic_triplets/solution.go rename to 2442-number-of-arithmetic-triplets/solution.go diff --git a/problems_backup/reachable_nodes_with_restrictions/solution.go b/2445-reachable-nodes-with-restrictions/solution.go similarity index 100% rename from problems_backup/reachable_nodes_with_restrictions/solution.go rename to 2445-reachable-nodes-with-restrictions/solution.go diff --git a/problems_backup/merge_similar_items/solution.go b/2447-merge-similar-items/solution.go similarity index 100% rename from problems_backup/merge_similar_items/solution.go rename to 2447-merge-similar-items/solution.go diff --git a/problems_backup/shortest_word_distance_iii/solution.go b/245-shortest-word-distance-iii/solution.go similarity index 100% rename from problems_backup/shortest_word_distance_iii/solution.go rename to 245-shortest-word-distance-iii/solution.go diff --git a/problems_backup/node_with_highest_edge_score/solution.go b/2455-node-with-highest-edge-score/solution.go similarity index 100% rename from problems_backup/node_with_highest_edge_score/solution.go rename to 2455-node-with-highest-edge-score/solution.go diff --git a/problems_backup/find_minimum_time_to_finish_all_jobs_ii/solution.go b/2458-find-minimum-time-to-finish-all-jobs-ii/solution.go similarity index 100% rename from problems_backup/find_minimum_time_to_finish_all_jobs_ii/solution.go rename to 2458-find-minimum-time-to-finish-all-jobs-ii/solution.go diff --git a/problems_backup/minimum_hours_of_training_to_win_a_competition/solution.go b/2459-minimum-hours-of-training-to-win-a-competition/solution.go similarity index 100% rename from problems_backup/minimum_hours_of_training_to_win_a_competition/solution.go rename to 2459-minimum-hours-of-training-to-win-a-competition/solution.go diff --git a/problems_backup/strobogrammatic_number/solution.go b/246-strobogrammatic-number/solution.go similarity index 100% rename from problems_backup/strobogrammatic_number/solution.go rename to 246-strobogrammatic-number/solution.go diff --git a/problems_backup/amount_of_time_for_binary_tree_to_be_infected/solution.go b/2461-amount-of-time-for-binary-tree-to-be-infected/solution.go similarity index 100% rename from problems_backup/amount_of_time_for_binary_tree_to_be_infected/solution.go rename to 2461-amount-of-time-for-binary-tree-to-be-infected/solution.go diff --git a/problems_backup/minimum_recolors_to_get_k_consecutive_black_blocks/solution.go b/2463-minimum-recolors-to-get-k-consecutive-black-blocks/solution.go similarity index 100% rename from problems_backup/minimum_recolors_to_get_k_consecutive_black_blocks/solution.go rename to 2463-minimum-recolors-to-get-k-consecutive-black-blocks/solution.go diff --git a/problems_backup/valid_palindrome_iv/solution.go b/2468-valid-palindrome-iv/solution.go similarity index 100% rename from problems_backup/valid_palindrome_iv/solution.go rename to 2468-valid-palindrome-iv/solution.go diff --git a/problems_backup/removing_stars_from_a_string/solution.go b/2470-removing-stars-from-a-string/solution.go similarity index 100% rename from problems_backup/removing_stars_from_a_string/solution.go rename to 2470-removing-stars-from-a-string/solution.go diff --git a/problems_backup/minimum_amount_of_time_to_collect_garbage/solution.go b/2471-minimum-amount-of-time-to-collect-garbage/solution.go similarity index 100% rename from problems_backup/minimum_amount_of_time_to_collect_garbage/solution.go rename to 2471-minimum-amount-of-time-to-collect-garbage/solution.go diff --git a/problems_backup/max_sum_of_a_pair_with_equal_sum_of_digits/solution.go b/2473-max-sum-of-a-pair-with-equal-sum-of-digits/solution.go similarity index 100% rename from problems_backup/max_sum_of_a_pair_with_equal_sum_of_digits/solution.go rename to 2473-max-sum-of-a-pair-with-equal-sum-of-digits/solution.go diff --git a/problems_backup/minimum_adjacent_swaps_to_make_a_valid_array/solution.go b/2474-minimum-adjacent-swaps-to-make-a-valid-array/solution.go similarity index 100% rename from problems_backup/minimum_adjacent_swaps_to_make_a_valid_array/solution.go rename to 2474-minimum-adjacent-swaps-to-make-a-valid-array/solution.go diff --git a/problems_backup/check_distances_between_same_letters/solution.go b/2476-check-distances-between-same-letters/solution.go similarity index 100% rename from problems_backup/check_distances_between_same_letters/solution.go rename to 2476-check-distances-between-same-letters/solution.go diff --git a/problems_backup/find_subarrays_with_equal_sum/solution.go b/2480-find-subarrays-with-equal-sum/solution.go similarity index 100% rename from problems_backup/find_subarrays_with_equal_sum/solution.go rename to 2480-find-subarrays-with-equal-sum/solution.go diff --git a/problems_backup/strictly_palindromic_number/solution.go b/2481-strictly-palindromic-number/solution.go similarity index 100% rename from problems_backup/strictly_palindromic_number/solution.go rename to 2481-strictly-palindromic-number/solution.go diff --git a/problems_backup/most_frequent_even_element/solution.go b/2486-most-frequent-even-element/solution.go similarity index 100% rename from problems_backup/most_frequent_even_element/solution.go rename to 2486-most-frequent-even-element/solution.go diff --git a/problems_backup/optimal_partition_of_string/solution.go b/2487-optimal-partition-of-string/solution.go similarity index 100% rename from problems_backup/optimal_partition_of_string/solution.go rename to 2487-optimal-partition-of-string/solution.go diff --git a/problems_backup/group_shifted_strings/solution.go b/249-group-shifted-strings/solution.go similarity index 100% rename from problems_backup/group_shifted_strings/solution.go rename to 249-group-shifted-strings/solution.go diff --git a/problems_backup/smallest_even_multiple/solution.go b/2491-smallest-even-multiple/solution.go similarity index 100% rename from problems_backup/smallest_even_multiple/solution.go rename to 2491-smallest-even-multiple/solution.go diff --git a/problems_backup/length_of_the_longest_alphabetical_continuous_substring/solution.go b/2492-length-of-the-longest-alphabetical-continuous-substring/solution.go similarity index 100% rename from problems_backup/length_of_the_longest_alphabetical_continuous_substring/solution.go rename to 2492-length-of-the-longest-alphabetical-continuous-substring/solution.go diff --git a/problems_backup/reverse_odd_levels_of_binary_tree/solution.go b/2493-reverse-odd-levels-of-binary-tree/solution.go similarity index 100% rename from problems_backup/reverse_odd_levels_of_binary_tree/solution.go rename to 2493-reverse-odd-levels-of-binary-tree/solution.go diff --git a/problems_backup/sum_of_prefix_scores_of_strings/solution.go b/2494-sum-of-prefix-scores-of-strings/solution.go similarity index 100% rename from problems_backup/sum_of_prefix_scores_of_strings/solution.go rename to 2494-sum-of-prefix-scores-of-strings/solution.go diff --git a/problems_backup/maximum_matching_of_players_with_trainers/solution.go b/2497-maximum-matching-of-players-with-trainers/solution.go similarity index 100% rename from problems_backup/maximum_matching_of_players_with_trainers/solution.go rename to 2497-maximum-matching-of-players-with-trainers/solution.go diff --git a/problems_backup/reverse_nodes_in_k-group/solution.go b/25-reverse-nodes-in-k-group/solution.go similarity index 100% rename from problems_backup/reverse_nodes_in_k-group/solution.go rename to 25-reverse-nodes-in-k-group/solution.go diff --git a/problems_backup/count_univalue_subtrees/solution.go b/250-count-univalue-subtrees/solution.go similarity index 100% rename from problems_backup/count_univalue_subtrees/solution.go rename to 250-count-univalue-subtrees/solution.go diff --git a/problems_backup/number_of_common_factors/solution.go b/2507-number-of-common-factors/solution.go similarity index 100% rename from problems_backup/number_of_common_factors/solution.go rename to 2507-number-of-common-factors/solution.go diff --git a/problems_backup/maximum_sum_of_an_hourglass/solution.go b/2508-maximum-sum-of-an-hourglass/solution.go similarity index 100% rename from problems_backup/maximum_sum_of_an_hourglass/solution.go rename to 2508-maximum-sum-of-an-hourglass/solution.go diff --git a/problems_backup/flatten_2d_vector/solution.go b/251-flatten-2d-vector/solution.go similarity index 100% rename from problems_backup/flatten_2d_vector/solution.go rename to 251-flatten-2d-vector/solution.go diff --git a/problems_backup/partition_string_into_substrings_with_values_at_most_k/solution.go b/2511-partition-string-into-substrings-with-values-at-most-k/solution.go similarity index 100% rename from problems_backup/partition_string_into_substrings_with_values_at_most_k/solution.go rename to 2511-partition-string-into-substrings-with-values-at-most-k/solution.go diff --git a/problems_backup/the_employee_that_worked_on_the_longest_task/solution.go b/2518-the-employee-that-worked-on-the-longest-task/solution.go similarity index 100% rename from problems_backup/the_employee_that_worked_on_the_longest_task/solution.go rename to 2518-the-employee-that-worked-on-the-longest-task/solution.go diff --git a/problems_backup/meeting_rooms/solution.go b/252-meeting-rooms/solution.go similarity index 100% rename from problems_backup/meeting_rooms/solution.go rename to 252-meeting-rooms/solution.go diff --git a/problems_backup/median_of_a_row_wise_sorted_matrix/solution.go b/2522-median-of-a-row-wise-sorted-matrix/solution.go similarity index 100% rename from problems_backup/median_of_a_row_wise_sorted_matrix/solution.go rename to 2522-median-of-a-row-wise-sorted-matrix/solution.go diff --git a/problems_backup/largest_positive_integer_that_exists_with_its_negative/solution.go b/2524-largest-positive-integer-that-exists-with-its-negative/solution.go similarity index 100% rename from problems_backup/largest_positive_integer_that_exists_with_its_negative/solution.go rename to 2524-largest-positive-integer-that-exists-with-its-negative/solution.go diff --git a/problems_backup/count_number_of_distinct_integers_after_reverse_operations/solution.go b/2525-count-number-of-distinct-integers-after-reverse-operations/solution.go similarity index 100% rename from problems_backup/count_number_of_distinct_integers_after_reverse_operations/solution.go rename to 2525-count-number-of-distinct-integers-after-reverse-operations/solution.go diff --git a/problems_backup/number_of_valid_clock_times/solution.go b/2528-number-of-valid-clock-times/solution.go similarity index 100% rename from problems_backup/number_of_valid_clock_times/solution.go rename to 2528-number-of-valid-clock-times/solution.go diff --git a/problems_backup/meeting_rooms_ii/solution.go b/253-meeting-rooms-ii/solution.go similarity index 100% rename from problems_backup/meeting_rooms_ii/solution.go rename to 253-meeting-rooms-ii/solution.go diff --git a/problems_backup/count_strictly_increasing_subarrays/solution.go b/2535-count-strictly-increasing-subarrays/solution.go similarity index 100% rename from problems_backup/count_strictly_increasing_subarrays/solution.go rename to 2535-count-strictly-increasing-subarrays/solution.go diff --git a/problems_backup/determine_if_two_events_have_conflict/solution.go b/2536-determine-if-two-events-have-conflict/solution.go similarity index 100% rename from problems_backup/determine_if_two_events_have_conflict/solution.go rename to 2536-determine-if-two-events-have-conflict/solution.go diff --git a/problems_backup/minimum_time_to_kill_all_monsters/solution.go b/2537-minimum-time-to-kill-all-monsters/solution.go similarity index 100% rename from problems_backup/minimum_time_to_kill_all_monsters/solution.go rename to 2537-minimum-time-to-kill-all-monsters/solution.go diff --git a/problems_backup/sum_of_number_and_its_reverse/solution.go b/2541-sum-of-number-and-its-reverse/solution.go similarity index 100% rename from problems_backup/sum_of_number_and_its_reverse/solution.go rename to 2541-sum-of-number-and-its-reverse/solution.go diff --git a/problems_backup/average_value_of_even_numbers_that_are_divisible_by_three/solution.go b/2542-average-value-of-even-numbers-that-are-divisible-by-three/solution.go similarity index 100% rename from problems_backup/average_value_of_even_numbers_that_are_divisible_by_three/solution.go rename to 2542-average-value-of-even-numbers-that-are-divisible-by-three/solution.go diff --git a/problems_backup/odd_string_difference/solution.go b/2547-odd-string-difference/solution.go similarity index 100% rename from problems_backup/odd_string_difference/solution.go rename to 2547-odd-string-difference/solution.go diff --git a/problems_backup/destroy_sequential_targets/solution.go b/2548-destroy-sequential-targets/solution.go similarity index 100% rename from problems_backup/destroy_sequential_targets/solution.go rename to 2548-destroy-sequential-targets/solution.go diff --git a/problems_backup/words_within_two_edits_of_dictionary/solution.go b/2550-words-within-two-edits-of-dictionary/solution.go similarity index 100% rename from problems_backup/words_within_two_edits_of_dictionary/solution.go rename to 2550-words-within-two-edits-of-dictionary/solution.go diff --git a/problems_backup/apply_operations_to_an_array/solution.go b/2551-apply-operations-to-an-array/solution.go similarity index 100% rename from problems_backup/apply_operations_to_an_array/solution.go rename to 2551-apply-operations-to-an-array/solution.go diff --git a/problems_backup/maximum_sum_of_distinct_subarrays_with_length_k/solution.go b/2552-maximum-sum-of-distinct-subarrays-with-length-k/solution.go similarity index 100% rename from problems_backup/maximum_sum_of_distinct_subarrays_with_length_k/solution.go rename to 2552-maximum-sum-of-distinct-subarrays-with-length-k/solution.go diff --git a/problems_backup/total_cost_to_hire_k_workers/solution.go b/2553-total-cost-to-hire-k-workers/solution.go similarity index 100% rename from problems_backup/total_cost_to_hire_k_workers/solution.go rename to 2553-total-cost-to-hire-k-workers/solution.go diff --git a/problems_backup/convert_the_temperature/solution.go b/2556-convert-the-temperature/solution.go similarity index 100% rename from problems_backup/convert_the_temperature/solution.go rename to 2556-convert-the-temperature/solution.go diff --git a/problems_backup/minimum_number_of_operations_to_sort_a_binary_tree_by_level/solution.go b/2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level/solution.go similarity index 100% rename from problems_backup/minimum_number_of_operations_to_sort_a_binary_tree_by_level/solution.go rename to 2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level/solution.go diff --git a/problems_backup/maximum_number_of_non-overlapping_palindrome_substrings/solution.go b/2559-maximum-number-of-non-overlapping-palindrome-substrings/solution.go similarity index 100% rename from problems_backup/maximum_number_of_non-overlapping_palindrome_substrings/solution.go rename to 2559-maximum-number-of-non-overlapping-palindrome-substrings/solution.go diff --git a/problems_backup/number_of_distinct_averages/solution.go b/2561-number-of-distinct-averages/solution.go similarity index 100% rename from problems_backup/number_of_distinct_averages/solution.go rename to 2561-number-of-distinct-averages/solution.go diff --git a/problems_backup/number_of_unequal_triplets_in_array/solution.go b/2566-number-of-unequal-triplets-in-array/solution.go similarity index 100% rename from problems_backup/number_of_unequal_triplets_in_array/solution.go rename to 2566-number-of-unequal-triplets-in-array/solution.go diff --git a/problems_backup/minimum_fuel_cost_to_report_to_the_capital/solution.go b/2568-minimum-fuel-cost-to-report-to-the-capital/solution.go similarity index 100% rename from problems_backup/minimum_fuel_cost_to_report_to_the_capital/solution.go rename to 2568-minimum-fuel-cost-to-report-to-the-capital/solution.go diff --git a/problems_backup/binary_tree_paths/solution.go b/257-binary-tree-paths/solution.go similarity index 100% rename from problems_backup/binary_tree_paths/solution.go rename to 257-binary-tree-paths/solution.go diff --git a/problems_backup/binary_tree_paths/solution.java b/257-binary-tree-paths/solution.java similarity index 100% rename from problems_backup/binary_tree_paths/solution.java rename to 257-binary-tree-paths/solution.java diff --git a/problems_backup/find_the_pivot_integer/solution.go b/2571-find-the-pivot-integer/solution.go similarity index 100% rename from problems_backup/find_the_pivot_integer/solution.go rename to 2571-find-the-pivot-integer/solution.go diff --git a/problems_backup/append_characters_to_string_to_make_subsequence/solution.go b/2572-append-characters-to-string-to-make-subsequence/solution.go similarity index 100% rename from problems_backup/append_characters_to_string_to_make_subsequence/solution.go rename to 2572-append-characters-to-string-to-make-subsequence/solution.go diff --git a/problems_backup/remove_nodes_from_linked_list/solution.go b/2573-remove-nodes-from-linked-list/solution.go similarity index 100% rename from problems_backup/remove_nodes_from_linked_list/solution.go rename to 2573-remove-nodes-from-linked-list/solution.go diff --git a/problems_backup/minimum_cuts_to_divide_a_circle/solution.go b/2575-minimum-cuts-to-divide-a-circle/solution.go similarity index 100% rename from problems_backup/minimum_cuts_to_divide_a_circle/solution.go rename to 2575-minimum-cuts-to-divide-a-circle/solution.go diff --git a/problems_backup/minimum_split_into_subarrays_with_gcd_greater_than_one/solution.go b/2579-minimum-split-into-subarrays-with-gcd-greater-than-one/solution.go similarity index 100% rename from problems_backup/minimum_split_into_subarrays_with_gcd_greater_than_one/solution.go rename to 2579-minimum-split-into-subarrays-with-gcd-greater-than-one/solution.go diff --git a/problems_backup/add_digits/solution.go b/258-add-digits/solution.go similarity index 100% rename from problems_backup/add_digits/solution.go rename to 258-add-digits/solution.go diff --git a/problems_backup/add_digits/solution.java b/258-add-digits/solution.java similarity index 100% rename from problems_backup/add_digits/solution.java rename to 258-add-digits/solution.java diff --git a/problems_backup/circular_sentence/solution.go b/2580-circular-sentence/solution.go similarity index 100% rename from problems_backup/circular_sentence/solution.go rename to 2580-circular-sentence/solution.go diff --git a/problems_backup/delete_greatest_value_in_each_row/solution.go b/2585-delete-greatest-value-in-each-row/solution.go similarity index 100% rename from problems_backup/delete_greatest_value_in_each_row/solution.go rename to 2585-delete-greatest-value-in-each-row/solution.go diff --git a/problems_backup/maximum_value_of_a_string_in_an_array/solution.go b/2589-maximum-value-of-a-string-in-an-array/solution.go similarity index 100% rename from problems_backup/maximum_value_of_a_string_in_an_array/solution.go rename to 2589-maximum-value-of-a-string-in-an-array/solution.go diff --git a/problems_backup/frog_jump_ii/solution.go b/2591-frog-jump-ii/solution.go similarity index 100% rename from problems_backup/frog_jump_ii/solution.go rename to 2591-frog-jump-ii/solution.go diff --git a/problems_backup/count_pairs_of_similar_strings/solution.go b/2594-count-pairs-of-similar-strings/solution.go similarity index 100% rename from problems_backup/count_pairs_of_similar_strings/solution.go rename to 2594-count-pairs-of-similar-strings/solution.go diff --git a/problems_backup/smallest_value_after_replacing_with_sum_of_prime_factors/solution.go b/2595-smallest-value-after-replacing-with-sum-of-prime-factors/solution.go similarity index 100% rename from problems_backup/smallest_value_after_replacing_with_sum_of_prime_factors/solution.go rename to 2595-smallest-value-after-replacing-with-sum-of-prime-factors/solution.go diff --git a/problems_backup/shortest_distance_to_target_string_in_a_circular_array/solution.go b/2598-shortest-distance-to-target-string-in-a-circular-array/solution.go similarity index 100% rename from problems_backup/shortest_distance_to_target_string_in_a_circular_array/solution.go rename to 2598-shortest-distance-to-target-string-in-a-circular-array/solution.go diff --git a/problems_backup/remove_duplicates_from_sorted_array/solution.java b/26-remove-duplicates-from-sorted-array/solution.java similarity index 100% rename from problems_backup/remove_duplicates_from_sorted_array/solution.java rename to 26-remove-duplicates-from-sorted-array/solution.java diff --git a/problems_backup/single_number_iii/solution.go b/260-single-number-iii/solution.go similarity index 100% rename from problems_backup/single_number_iii/solution.go rename to 260-single-number-iii/solution.go diff --git a/problems_backup/minimum_operations_to_make_array_equal_ii/solution.go b/2604-minimum-operations-to-make-array-equal-ii/solution.go similarity index 100% rename from problems_backup/minimum_operations_to_make_array_equal_ii/solution.go rename to 2604-minimum-operations-to-make-array-equal-ii/solution.go diff --git a/problems_backup/difference_between_ones_and_zeros_in_row_and_column/solution.go b/2606-difference-between-ones-and-zeros-in-row-and-column/solution.go similarity index 100% rename from problems_backup/difference_between_ones_and_zeros_in_row_and_column/solution.go rename to 2606-difference-between-ones-and-zeros-in-row-and-column/solution.go diff --git a/problems_backup/count_the_digits_that_divide_a_number/solution.go b/2608-count-the-digits-that-divide-a-number/solution.go similarity index 100% rename from problems_backup/count_the_digits_that_divide_a_number/solution.go rename to 2608-count-the-digits-that-divide-a-number/solution.go diff --git a/problems_backup/distinct_prime_factors_of_product_of_array/solution.go b/2609-distinct-prime-factors-of-product-of-array/solution.go similarity index 100% rename from problems_backup/distinct_prime_factors_of_product_of_array/solution.go rename to 2609-distinct-prime-factors-of-product-of-array/solution.go diff --git a/problems_backup/graph_valid_tree/solution.go b/261-graph-valid-tree/solution.go similarity index 100% rename from problems_backup/graph_valid_tree/solution.go rename to 261-graph-valid-tree/solution.go diff --git a/problems_backup/maximum_count_of_positive_integer_and_negative_integer/solution.go b/2614-maximum-count-of-positive-integer-and-negative-integer/solution.go similarity index 100% rename from problems_backup/maximum_count_of_positive_integer_and_negative_integer/solution.go rename to 2614-maximum-count-of-positive-integer-and-negative-integer/solution.go diff --git a/problems_backup/maximal_score_after_applying_k_operations/solution.go b/2616-maximal-score-after-applying-k-operations/solution.go similarity index 100% rename from problems_backup/maximal_score_after_applying_k_operations/solution.go rename to 2616-maximal-score-after-applying-k-operations/solution.go diff --git a/problems_backup/categorize_box_according_to_criteria/solution.go b/2619-categorize-box-according-to-criteria/solution.go similarity index 100% rename from problems_backup/categorize_box_according_to_criteria/solution.go rename to 2619-categorize-box-according-to-criteria/solution.go diff --git a/problems_backup/find_consecutive_integers_from_a_data_stream/solution.go b/2620-find-consecutive-integers-from-a-data-stream/solution.go similarity index 100% rename from problems_backup/find_consecutive_integers_from_a_data_stream/solution.go rename to 2620-find-consecutive-integers-from-a-data-stream/solution.go diff --git a/problems_backup/difference_between_element_sum_and_digit_sum_of_an_array/solution.go b/2624-difference-between-element-sum-and-digit-sum-of-an-array/solution.go similarity index 100% rename from problems_backup/difference_between_element_sum_and_digit_sum_of_an_array/solution.go rename to 2624-difference-between-element-sum-and-digit-sum-of-an-array/solution.go diff --git a/problems_backup/increment_submatrices_by_one/solution.go b/2625-increment-submatrices-by-one/solution.go similarity index 100% rename from problems_backup/increment_submatrices_by_one/solution.go rename to 2625-increment-submatrices-by-one/solution.go diff --git a/problems_backup/ugly_number/solution.java b/263-ugly-number/solution.java similarity index 100% rename from problems_backup/ugly_number/solution.java rename to 263-ugly-number/solution.java diff --git a/problems_backup/alternating_digit_sum/solution.go b/2630-alternating-digit-sum/solution.go similarity index 100% rename from problems_backup/alternating_digit_sum/solution.go rename to 2630-alternating-digit-sum/solution.go diff --git a/problems_backup/sort_the_students_by_their_kth_score/solution.go b/2631-sort-the-students-by-their-kth-score/solution.go similarity index 100% rename from problems_backup/sort_the_students_by_their_kth_score/solution.go rename to 2631-sort-the-students-by-their-kth-score/solution.go diff --git a/problems_backup/minimum_common_value/solution.go b/2634-minimum-common-value/solution.go similarity index 100% rename from problems_backup/minimum_common_value/solution.go rename to 2634-minimum-common-value/solution.go diff --git a/problems_backup/separate_the_digits_in_an_array/solution.go b/2639-separate-the-digits-in-an-array/solution.go similarity index 100% rename from problems_backup/separate_the_digits_in_an_array/solution.go rename to 2639-separate-the-digits-in-an-array/solution.go diff --git a/problems_backup/maximum_number_of_integers_to_choose_from_a_range_i/solution.go b/2640-maximum-number-of-integers-to-choose-from-a-range-i/solution.go similarity index 100% rename from problems_backup/maximum_number_of_integers_to_choose_from_a_range_i/solution.go rename to 2640-maximum-number-of-integers-to-choose-from-a-range-i/solution.go diff --git a/problems_backup/pass_the_pillow/solution.go b/2645-pass-the-pillow/solution.go similarity index 100% rename from problems_backup/pass_the_pillow/solution.go rename to 2645-pass-the-pillow/solution.go diff --git a/problems_backup/kth_largest_sum_in_a_binary_tree/solution.go b/2646-kth-largest-sum-in-a-binary-tree/solution.go similarity index 100% rename from problems_backup/kth_largest_sum_in_a_binary_tree/solution.go rename to 2646-kth-largest-sum-in-a-binary-tree/solution.go diff --git a/problems_backup/count_total_number_of_colored_cells/solution.go b/2649-count-total-number-of-colored-cells/solution.go similarity index 100% rename from problems_backup/count_total_number_of_colored_cells/solution.go rename to 2649-count-total-number-of-colored-cells/solution.go diff --git a/problems_backup/split_with_minimum_sum/solution.go b/2650-split-with-minimum-sum/solution.go similarity index 100% rename from problems_backup/split_with_minimum_sum/solution.go rename to 2650-split-with-minimum-sum/solution.go diff --git a/problems_backup/count_the_number_of_vowel_strings_in_range/solution.go b/2654-count-the-number-of-vowel-strings-in-range/solution.go similarity index 100% rename from problems_backup/count_the_number_of_vowel_strings_in_range/solution.go rename to 2654-count-the-number-of-vowel-strings-in-range/solution.go diff --git a/problems_backup/rearrange_array_to_maximize_prefix_score/solution.go b/2655-rearrange-array-to-maximize-prefix-score/solution.go similarity index 100% rename from problems_backup/rearrange_array_to_maximize_prefix_score/solution.go rename to 2655-rearrange-array-to-maximize-prefix-score/solution.go diff --git a/problems_backup/number_of_even_and_odd_bits/solution.go b/2659-number-of-even-and-odd-bits/solution.go similarity index 100% rename from problems_backup/number_of_even_and_odd_bits/solution.go rename to 2659-number-of-even-and-odd-bits/solution.go diff --git a/problems_backup/palindrome_permutation/solution.go b/266-palindrome-permutation/solution.go similarity index 100% rename from problems_backup/palindrome_permutation/solution.go rename to 266-palindrome-permutation/solution.go diff --git a/problems_backup/check_knight_tour_configuration/solution.go b/2662-check-knight-tour-configuration/solution.go similarity index 100% rename from problems_backup/check_knight_tour_configuration/solution.go rename to 2662-check-knight-tour-configuration/solution.go diff --git a/problems_backup/maximize_greatness_of_an_array/solution.go b/2664-maximize-greatness-of-an-array/solution.go similarity index 100% rename from problems_backup/maximize_greatness_of_an_array/solution.go rename to 2664-maximize-greatness-of-an-array/solution.go diff --git a/problems_backup/find_the_width_of_columns_of_a_grid/solution.go b/2675-find-the-width-of-columns-of-a-grid/solution.go similarity index 100% rename from problems_backup/find_the_width_of_columns_of_a_grid/solution.go rename to 2675-find-the-width-of-columns-of-a-grid/solution.go diff --git a/problems_backup/find_the_score_of_all_prefixes_of_an_array/solution.go b/2676-find-the-score-of-all-prefixes-of-an-array/solution.go similarity index 100% rename from problems_backup/find_the_score_of_all_prefixes_of_an_array/solution.go rename to 2676-find-the-score-of-all-prefixes-of-an-array/solution.go diff --git a/problems_backup/cousins_in_binary_tree_ii/solution.go b/2677-cousins-in-binary-tree-ii/solution.go similarity index 100% rename from problems_backup/cousins_in_binary_tree_ii/solution.go rename to 2677-cousins-in-binary-tree-ii/solution.go diff --git a/problems_backup/count_distinct_numbers_on_board/solution.go b/2679-count-distinct-numbers-on-board/solution.go similarity index 100% rename from problems_backup/count_distinct_numbers_on_board/solution.go rename to 2679-count-distinct-numbers-on-board/solution.go diff --git a/problems_backup/missing_number/solution.go b/268-missing-number/solution.go similarity index 100% rename from problems_backup/missing_number/solution.go rename to 268-missing-number/solution.go diff --git a/problems_backup/missing_number/solution.java b/268-missing-number/solution.java similarity index 100% rename from problems_backup/missing_number/solution.java rename to 268-missing-number/solution.java diff --git a/problems_backup/determine_the_winner_of_a_bowling_game/solution.go b/2684-determine-the-winner-of-a-bowling-game/solution.go similarity index 100% rename from problems_backup/determine_the_winner_of_a_bowling_game/solution.go rename to 2684-determine-the-winner-of-a-bowling-game/solution.go diff --git a/problems_backup/first_completely_painted_row_or_column/solution.go b/2685-first-completely-painted-row-or-column/solution.go similarity index 100% rename from problems_backup/first_completely_painted_row_or_column/solution.go rename to 2685-first-completely-painted-row-or-column/solution.go diff --git a/problems_backup/count_vowel_strings_in_ranges/solution.go b/2691-count-vowel-strings-in-ranges/solution.go similarity index 100% rename from problems_backup/count_vowel_strings_in_ranges/solution.go rename to 2691-count-vowel-strings-in-ranges/solution.go diff --git a/problems_backup/take_gifts_from_the_richest_pile/solution.go b/2692-take-gifts-from-the-richest-pile/solution.go similarity index 100% rename from problems_backup/take_gifts_from_the_richest_pile/solution.go rename to 2692-take-gifts-from-the-richest-pile/solution.go diff --git a/problems_backup/find_the_maximum_divisibility_score/solution.go b/2694-find-the-maximum-divisibility-score/solution.go similarity index 100% rename from problems_backup/find_the_maximum_divisibility_score/solution.go rename to 2694-find-the-maximum-divisibility-score/solution.go diff --git a/problems_backup/find_score_of_an_array_after_marking_all_elements/solution.go b/2695-find-score-of-an-array-after-marking-all-elements/solution.go similarity index 100% rename from problems_backup/find_score_of_an_array_after_marking_all_elements/solution.go rename to 2695-find-score-of-an-array-after-marking-all-elements/solution.go diff --git a/problems_backup/find_the_array_concatenation_value/solution.go b/2698-find-the-array-concatenation-value/solution.go similarity index 100% rename from problems_backup/find_the_array_concatenation_value/solution.go rename to 2698-find-the-array-concatenation-value/solution.go diff --git a/problems_backup/remove_element/solution.java b/27-remove-element/solution.java similarity index 100% rename from problems_backup/remove_element/solution.java rename to 27-remove-element/solution.java diff --git a/problems_backup/closest_binary_search_tree_value/solution.go b/270-closest-binary-search-tree-value/solution.go similarity index 100% rename from problems_backup/closest_binary_search_tree_value/solution.go rename to 270-closest-binary-search-tree-value/solution.go diff --git a/problems_backup/maximum_difference_by_remapping_a_digit/solution.go b/2704-maximum-difference-by-remapping-a-digit/solution.go similarity index 100% rename from problems_backup/maximum_difference_by_remapping_a_digit/solution.go rename to 2704-maximum-difference-by-remapping-a-digit/solution.go diff --git a/problems_backup/minimum_score_by_changing_two_elements/solution.go b/2706-minimum-score-by-changing-two-elements/solution.go similarity index 100% rename from problems_backup/minimum_score_by_changing_two_elements/solution.go rename to 2706-minimum-score-by-changing-two-elements/solution.go diff --git a/problems_backup/merge_two_2d_arrays_by_summing_values/solution.go b/2707-merge-two-2d-arrays-by-summing-values/solution.go similarity index 100% rename from problems_backup/merge_two_2d_arrays_by_summing_values/solution.go rename to 2707-merge-two-2d-arrays-by-summing-values/solution.go diff --git a/problems_backup/find_the_maximum_number_of_marked_indices/solution.go b/2712-find-the-maximum-number-of-marked-indices/solution.go similarity index 100% rename from problems_backup/find_the_maximum_number_of_marked_indices/solution.go rename to 2712-find-the-maximum-number-of-marked-indices/solution.go diff --git a/problems_backup/left_and_right_sum_differences/solution.go b/2714-left-and-right-sum-differences/solution.go similarity index 100% rename from problems_backup/left_and_right_sum_differences/solution.go rename to 2714-left-and-right-sum-differences/solution.go diff --git a/problems_backup/k_items_with_the_maximum_sum/solution.go b/2715-k-items-with-the-maximum-sum/solution.go similarity index 100% rename from problems_backup/k_items_with_the_maximum_sum/solution.go rename to 2715-k-items-with-the-maximum-sum/solution.go diff --git a/problems_backup/prime_subtraction_operation/solution.go b/2716-prime-subtraction-operation/solution.go similarity index 100% rename from problems_backup/prime_subtraction_operation/solution.go rename to 2716-prime-subtraction-operation/solution.go diff --git a/problems_backup/minimum_operations_to_make_all_array_elements_equal/solution.go b/2718-minimum-operations-to-make-all-array-elements-equal/solution.go similarity index 100% rename from problems_backup/minimum_operations_to_make_all_array_elements_equal/solution.go rename to 2718-minimum-operations-to-make-all-array-elements-equal/solution.go diff --git a/problems_backup/closest_binary_search_tree_value_ii/solution.go b/272-closest-binary-search-tree-value-ii/solution.go similarity index 100% rename from problems_backup/closest_binary_search_tree_value_ii/solution.go rename to 272-closest-binary-search-tree-value-ii/solution.go diff --git a/problems_backup/sum_of_distances/solution.go b/2721-sum-of-distances/solution.go similarity index 100% rename from problems_backup/sum_of_distances/solution.go rename to 2721-sum-of-distances/solution.go diff --git a/problems_backup/prime_in_diagonal/solution.go b/2722-prime-in-diagonal/solution.go similarity index 100% rename from problems_backup/prime_in_diagonal/solution.go rename to 2722-prime-in-diagonal/solution.go diff --git a/problems_backup/find_the_longest_balanced_substring_of_a_binary_string/solution.go b/2723-find-the-longest-balanced-substring-of-a-binary-string/solution.go similarity index 100% rename from problems_backup/find_the_longest_balanced_substring_of_a_binary_string/solution.go rename to 2723-find-the-longest-balanced-substring-of-a-binary-string/solution.go diff --git a/problems_backup/convert_an_array_into_a_2d_array_with_conditions/solution.go b/2724-convert-an-array-into-a-2d-array-with-conditions/solution.go similarity index 100% rename from problems_backup/convert_an_array_into_a_2d_array_with_conditions/solution.go rename to 2724-convert-an-array-into-a-2d-array-with-conditions/solution.go diff --git a/problems_backup/number_of_senior_citizens/solution.go b/2727-number-of-senior-citizens/solution.go similarity index 100% rename from problems_backup/number_of_senior_citizens/solution.go rename to 2727-number-of-senior-citizens/solution.go diff --git a/problems_backup/sum_in_a_matrix/solution.go b/2728-sum-in-a-matrix/solution.go similarity index 100% rename from problems_backup/sum_in_a_matrix/solution.go rename to 2728-sum-in-a-matrix/solution.go diff --git a/problems_backup/integer_to_english_words/solution.go b/273-integer-to-english-words/solution.go similarity index 100% rename from problems_backup/integer_to_english_words/solution.go rename to 273-integer-to-english-words/solution.go diff --git a/problems_backup/minimum_additions_to_make_valid_string/solution.go b/2736-minimum-additions-to-make-valid-string/solution.go similarity index 100% rename from problems_backup/minimum_additions_to_make_valid_string/solution.go rename to 2736-minimum-additions-to-make-valid-string/solution.go diff --git a/problems_backup/row_with_maximum_ones/solution.go b/2737-row-with-maximum-ones/solution.go similarity index 100% rename from problems_backup/row_with_maximum_ones/solution.go rename to 2737-row-with-maximum-ones/solution.go diff --git a/problems_backup/h-index/solution.go b/274-h-index/solution.go similarity index 100% rename from problems_backup/h-index/solution.go rename to 274-h-index/solution.go diff --git a/problems_backup/calculate_delayed_arrival_time/solution.go b/2748-calculate-delayed-arrival-time/solution.go similarity index 100% rename from problems_backup/calculate_delayed_arrival_time/solution.go rename to 2748-calculate-delayed-arrival-time/solution.go diff --git a/problems_backup/h-index_ii/solution.go b/275-h-index-ii/solution.go similarity index 100% rename from problems_backup/h-index_ii/solution.go rename to 275-h-index-ii/solution.go diff --git a/problems_backup/sum_multiples/solution.go b/2752-sum-multiples/solution.go similarity index 100% rename from problems_backup/sum_multiples/solution.go rename to 2752-sum-multiples/solution.go diff --git a/problems_backup/maximum_strength_of_a_group/solution.go b/2754-maximum-strength-of-a-group/solution.go similarity index 100% rename from problems_backup/maximum_strength_of_a_group/solution.go rename to 2754-maximum-strength-of-a-group/solution.go diff --git a/problems_backup/buy_two_chocolates/solution.go b/2756-buy-two-chocolates/solution.go similarity index 100% rename from problems_backup/buy_two_chocolates/solution.go rename to 2756-buy-two-chocolates/solution.go diff --git a/problems_backup/maximum_number_of_fish_in_a_grid/solution.go b/2764-maximum-number-of-fish-in-a-grid/solution.go similarity index 100% rename from problems_backup/maximum_number_of_fish_in_a_grid/solution.go rename to 2764-maximum-number-of-fish-in-a-grid/solution.go diff --git a/problems_backup/find_the_prefix_common_array_of_two_arrays/solution.go b/2766-find-the-prefix-common-array-of-two-arrays/solution.go similarity index 100% rename from problems_backup/find_the_prefix_common_array_of_two_arrays/solution.go rename to 2766-find-the-prefix-common-array-of-two-arrays/solution.go diff --git a/problems_backup/maximum_sum_with_exactly_k_elements_/solution.go b/2767-maximum-sum-with-exactly-k-elements/solution.go similarity index 100% rename from problems_backup/maximum_sum_with_exactly_k_elements_/solution.go rename to 2767-maximum-sum-with-exactly-k-elements/solution.go diff --git a/problems_backup/find_the_distinct_difference_array/solution.go b/2777-find-the-distinct-difference-array/solution.go similarity index 100% rename from problems_backup/find_the_distinct_difference_array/solution.go rename to 2777-find-the-distinct-difference-array/solution.go diff --git a/problems_backup/frequency_tracker/solution.go b/2778-frequency-tracker/solution.go similarity index 100% rename from problems_backup/frequency_tracker/solution.go rename to 2778-frequency-tracker/solution.go diff --git a/problems_backup/first_bad_version/solution.go b/278-first-bad-version/solution.go similarity index 100% rename from problems_backup/first_bad_version/solution.go rename to 278-first-bad-version/solution.go diff --git a/problems_backup/make_costs_of_paths_equal_in_a_binary_tree/solution.go b/2780-make-costs-of-paths-equal-in-a-binary-tree/solution.go similarity index 100% rename from problems_backup/make_costs_of_paths_equal_in_a_binary_tree/solution.go rename to 2780-make-costs-of-paths-equal-in-a-binary-tree/solution.go diff --git a/problems_backup/semi-ordered_permutation/solution.go b/2785-semi-ordered-permutation/solution.go similarity index 100% rename from problems_backup/semi-ordered_permutation/solution.go rename to 2785-semi-ordered-permutation/solution.go diff --git a/problems_backup/find_the_longest_semi-repetitive_substring/solution.go b/2786-find-the-longest-semi-repetitive-substring/solution.go similarity index 100% rename from problems_backup/find_the_longest_semi-repetitive_substring/solution.go rename to 2786-find-the-longest-semi-repetitive-substring/solution.go diff --git a/problems_backup/find_the_losers_of_the_circular_game/solution.go b/2791-find-the-losers-of-the-circular-game/solution.go similarity index 100% rename from problems_backup/find_the_losers_of_the_circular_game/solution.go rename to 2791-find-the-losers-of-the-circular-game/solution.go diff --git a/problems_backup/count_the_number_of_complete_components/solution.go b/2793-count-the-number-of-complete-components/solution.go similarity index 100% rename from problems_backup/count_the_number_of_complete_components/solution.go rename to 2793-count-the-number-of-complete-components/solution.go diff --git a/problems_backup/maximum_number_of_moves_in_a_grid/solution.go b/2794-maximum-number-of-moves-in-a-grid/solution.go similarity index 100% rename from problems_backup/maximum_number_of_moves_in_a_grid/solution.go rename to 2794-maximum-number-of-moves-in-a-grid/solution.go diff --git a/problems_backup/wiggle_sort/solution.go b/280-wiggle-sort/solution.go similarity index 100% rename from problems_backup/wiggle_sort/solution.go rename to 280-wiggle-sort/solution.go diff --git a/problems_backup/minimum_string_length_after_removing_substrings/solution.go b/2800-minimum-string-length-after-removing-substrings/solution.go similarity index 100% rename from problems_backup/minimum_string_length_after_removing_substrings/solution.go rename to 2800-minimum-string-length-after-removing-substrings/solution.go diff --git a/problems_backup/difference_of_number_of_distinct_values_on_diagonals/solution.go b/2801-difference-of-number-of-distinct-values-on-diagonals/solution.go similarity index 100% rename from problems_backup/difference_of_number_of_distinct_values_on_diagonals/solution.go rename to 2801-difference-of-number-of-distinct-values-on-diagonals/solution.go diff --git a/problems_backup/find_the_punishment_number_of_an_integer/solution.go b/2802-find-the-punishment-number-of-an-integer/solution.go similarity index 100% rename from problems_backup/find_the_punishment_number_of_an_integer/solution.go rename to 2802-find-the-punishment-number-of-an-integer/solution.go diff --git a/problems_backup/zigzag_iterator/solution.go b/281-zigzag-iterator/solution.go similarity index 100% rename from problems_backup/zigzag_iterator/solution.go rename to 281-zigzag-iterator/solution.go diff --git a/problems_backup/determine_the_minimum_sum_of_a_k-avoiding_array/solution.go b/2811-determine-the-minimum-sum-of-a-k-avoiding-array/solution.go similarity index 100% rename from problems_backup/determine_the_minimum_sum_of_a_k-avoiding_array/solution.go rename to 2811-determine-the-minimum-sum-of-a-k-avoiding-array/solution.go diff --git a/problems_backup/lexicographically_smallest_palindrome/solution.go b/2816-lexicographically-smallest-palindrome/solution.go similarity index 100% rename from problems_backup/lexicographically_smallest_palindrome/solution.go rename to 2816-lexicographically-smallest-palindrome/solution.go diff --git a/problems_backup/minimum_cost_to_make_all_characters_equal/solution.go b/2817-minimum-cost-to-make-all-characters-equal/solution.go similarity index 100% rename from problems_backup/minimum_cost_to_make_all_characters_equal/solution.go rename to 2817-minimum-cost-to-make-all-characters-equal/solution.go diff --git a/problems_backup/remove_trailing_zeros_from_a_string/solution.go b/2819-remove-trailing-zeros-from-a-string/solution.go similarity index 100% rename from problems_backup/remove_trailing_zeros_from_a_string/solution.go rename to 2819-remove-trailing-zeros-from-a-string/solution.go diff --git a/problems_backup/check_if_the_number_is_fascinating/solution.go b/2824-check-if-the-number-is-fascinating/solution.go similarity index 100% rename from problems_backup/check_if_the_number_is_fascinating/solution.go rename to 2824-check-if-the-number-is-fascinating/solution.go diff --git a/problems_backup/minimize_string_length/solution.go b/2825-minimize-string-length/solution.go similarity index 100% rename from problems_backup/minimize_string_length/solution.go rename to 2825-minimize-string-length/solution.go diff --git a/problems_backup/greatest_common_divisor_traversal/solution.go b/2827-greatest-common-divisor-traversal/solution.go similarity index 100% rename from problems_backup/greatest_common_divisor_traversal/solution.go rename to 2827-greatest-common-divisor-traversal/solution.go diff --git a/problems_backup/move_zeroes/solution.go b/283-move-zeroes/solution.go similarity index 100% rename from problems_backup/move_zeroes/solution.go rename to 283-move-zeroes/solution.go diff --git a/problems_backup/move_zeroes/solution.java b/283-move-zeroes/solution.java similarity index 100% rename from problems_backup/move_zeroes/solution.java rename to 283-move-zeroes/solution.java diff --git a/problems_backup/number_of_beautiful_pairs/solution.go b/2831-number-of-beautiful-pairs/solution.go similarity index 100% rename from problems_backup/number_of_beautiful_pairs/solution.go rename to 2831-number-of-beautiful-pairs/solution.go diff --git a/problems_backup/find_the_longest_equal_subarray/solution.go b/2832-find-the-longest-equal-subarray/solution.go similarity index 100% rename from problems_backup/find_the_longest_equal_subarray/solution.go rename to 2832-find-the-longest-equal-subarray/solution.go diff --git a/problems_backup/relocate_marbles/solution.go b/2834-relocate-marbles/solution.go similarity index 100% rename from problems_backup/relocate_marbles/solution.go rename to 2834-relocate-marbles/solution.go diff --git a/problems_backup/neither_minimum_nor_maximum/solution.go b/2836-neither-minimum-nor-maximum/solution.go similarity index 100% rename from problems_backup/neither_minimum_nor_maximum/solution.go rename to 2836-neither-minimum-nor-maximum/solution.go diff --git a/problems_backup/sum_of_matrix_after_queries/solution.go b/2838-sum-of-matrix-after-queries/solution.go similarity index 100% rename from problems_backup/sum_of_matrix_after_queries/solution.go rename to 2838-sum-of-matrix-after-queries/solution.go diff --git a/problems_backup/peeking_iterator/solution.go b/284-peeking-iterator/solution.go similarity index 100% rename from problems_backup/peeking_iterator/solution.go rename to 284-peeking-iterator/solution.go diff --git a/problems_backup/extract_kth_character_from_the_rope_tree/solution.go b/2843-extract-kth-character-from-the-rope-tree/solution.go similarity index 100% rename from problems_backup/extract_kth_character_from_the_rope_tree/solution.go rename to 2843-extract-kth-character-from-the-rope-tree/solution.go diff --git a/problems_backup/sum_of_squares_of_special_elements_/solution.go b/2844-sum-of-squares-of-special-elements/solution.go similarity index 100% rename from problems_backup/sum_of_squares_of_special_elements_/solution.go rename to 2844-sum-of-squares-of-special-elements/solution.go diff --git a/problems_backup/find_the_value_of_the_partition/solution.go b/2845-find-the-value-of-the-partition/solution.go similarity index 100% rename from problems_backup/find_the_value_of_the_partition/solution.go rename to 2845-find-the-value-of-the-partition/solution.go diff --git a/problems_backup/find_maximum_number_of_string_pairs/solution.go b/2847-find-maximum-number-of-string-pairs/solution.go similarity index 100% rename from problems_backup/find_maximum_number_of_string_pairs/solution.go rename to 2847-find-maximum-number-of-string-pairs/solution.go diff --git a/problems_backup/special_permutations/solution.go b/2848-special-permutations/solution.go similarity index 100% rename from problems_backup/special_permutations/solution.go rename to 2848-special-permutations/solution.go diff --git a/problems_backup/inorder_successor_in_bst/solution.go b/285-inorder-successor-in-bst/solution.go similarity index 100% rename from problems_backup/inorder_successor_in_bst/solution.go rename to 285-inorder-successor-in-bst/solution.go diff --git a/problems_backup/count_complete_subarrays_in_an_array/solution.go b/2856-count-complete-subarrays-in-an-array/solution.go similarity index 100% rename from problems_backup/count_complete_subarrays_in_an_array/solution.go rename to 2856-count-complete-subarrays-in-an-array/solution.go diff --git a/problems_backup/total_distance_traveled/solution.go b/2857-total-distance-traveled/solution.go similarity index 100% rename from problems_backup/total_distance_traveled/solution.go rename to 2857-total-distance-traveled/solution.go diff --git a/problems_backup/walls_and_gates/solution.go b/286-walls-and-gates/solution.go similarity index 100% rename from problems_backup/walls_and_gates/solution.go rename to 286-walls-and-gates/solution.go diff --git a/problems_backup/longest_even_odd_subarray_with_threshold/solution.go b/2866-longest-even-odd-subarray-with-threshold/solution.go similarity index 100% rename from problems_backup/longest_even_odd_subarray_with_threshold/solution.go rename to 2866-longest-even-odd-subarray-with-threshold/solution.go diff --git a/problems_backup/ways_to_split_array_into_good_subarrays/solution.go b/2867-ways-to-split-array-into-good-subarrays/solution.go similarity index 100% rename from problems_backup/ways_to_split_array_into_good_subarrays/solution.go rename to 2867-ways-to-split-array-into-good-subarrays/solution.go diff --git a/problems_backup/continuous_subarrays/solution.go b/2868-continuous-subarrays/solution.go similarity index 100% rename from problems_backup/continuous_subarrays/solution.go rename to 2868-continuous-subarrays/solution.go diff --git a/problems_backup/find_the_duplicate_number/solution.go b/287-find-the-duplicate-number/solution.go similarity index 100% rename from problems_backup/find_the_duplicate_number/solution.go rename to 287-find-the-duplicate-number/solution.go diff --git a/problems_backup/longest_alternating_subarray/solution.go b/2870-longest-alternating-subarray/solution.go similarity index 100% rename from problems_backup/longest_alternating_subarray/solution.go rename to 2870-longest-alternating-subarray/solution.go diff --git a/problems_backup/largest_element_in_an_array_after_merge_operations/solution.go b/2872-largest-element-in-an-array-after-merge-operations/solution.go similarity index 100% rename from problems_backup/largest_element_in_an_array_after_merge_operations/solution.go rename to 2872-largest-element-in-an-array-after-merge-operations/solution.go diff --git a/problems_backup/prime_pairs_with_target_sum/solution.go b/2873-prime-pairs-with-target-sum/solution.go similarity index 100% rename from problems_backup/prime_pairs_with_target_sum/solution.go rename to 2873-prime-pairs-with-target-sum/solution.go diff --git a/problems_backup/count_houses_in_a_circular_street/solution.go b/2875-count-houses-in-a-circular-street/solution.go similarity index 100% rename from problems_backup/count_houses_in_a_circular_street/solution.go rename to 2875-count-houses-in-a-circular-street/solution.go diff --git a/problems_backup/number_of_employees_who_met_the_target/solution.go b/2876-number-of-employees-who-met-the-target/solution.go similarity index 100% rename from problems_backup/number_of_employees_who_met_the_target/solution.go rename to 2876-number-of-employees-who-met-the-target/solution.go diff --git a/problems_backup/unique_word_abbreviation/solution.go b/288-unique-word-abbreviation/solution.go similarity index 100% rename from problems_backup/unique_word_abbreviation/solution.go rename to 288-unique-word-abbreviation/solution.go diff --git a/problems_backup/split_strings_by_separator/solution.go b/2881-split-strings-by-separator/solution.go similarity index 100% rename from problems_backup/split_strings_by_separator/solution.go rename to 2881-split-strings-by-separator/solution.go diff --git a/problems_backup/faulty_keyboard/solution.go b/2886-faulty-keyboard/solution.go similarity index 100% rename from problems_backup/faulty_keyboard/solution.go rename to 2886-faulty-keyboard/solution.go diff --git a/problems_backup/minimum_index_of_a_valid_split/solution.go b/2888-minimum-index-of-a-valid-split/solution.go similarity index 100% rename from problems_backup/minimum_index_of_a_valid_split/solution.go rename to 2888-minimum-index-of-a-valid-split/solution.go diff --git a/problems_backup/number_of_black_blocks/solution.go b/2889-number-of-black-blocks/solution.go similarity index 100% rename from problems_backup/number_of_black_blocks/solution.go rename to 2889-number-of-black-blocks/solution.go diff --git a/problems_backup/count_substrings_without_repeating_character/solution.go b/2890-count-substrings-without-repeating-character/solution.go similarity index 100% rename from problems_backup/count_substrings_without_repeating_character/solution.go rename to 2890-count-substrings-without-repeating-character/solution.go diff --git a/problems_backup/maximum_beauty_of_an_array_after_applying_operation/solution.go b/2891-maximum-beauty-of-an-array-after-applying-operation/solution.go similarity index 100% rename from problems_backup/maximum_beauty_of_an_array_after_applying_operation/solution.go rename to 2891-maximum-beauty-of-an-array-after-applying-operation/solution.go diff --git a/problems_backup/check_if_array_is_good/solution.go b/2892-check-if-array-is-good/solution.go similarity index 100% rename from problems_backup/check_if_array_is_good/solution.go rename to 2892-check-if-array-is-good/solution.go diff --git a/problems_backup/divide_two_integers/solution.go b/29-divide-two-integers/solution.go similarity index 100% rename from problems_backup/divide_two_integers/solution.go rename to 29-divide-two-integers/solution.go diff --git a/problems_backup/word_pattern/solution.go b/290-word-pattern/solution.go similarity index 100% rename from problems_backup/word_pattern/solution.go rename to 290-word-pattern/solution.go diff --git a/problems_backup/word_pattern/solution.java b/290-word-pattern/solution.java similarity index 100% rename from problems_backup/word_pattern/solution.java rename to 290-word-pattern/solution.java diff --git a/problems_backup/max_pair_sum_in_an_array/solution.go b/2902-max-pair-sum-in-an-array/solution.go similarity index 100% rename from problems_backup/max_pair_sum_in_an_array/solution.go rename to 2902-max-pair-sum-in-an-array/solution.go diff --git a/problems_backup/insert_greatest_common_divisors_in_linked_list/solution.go b/2903-insert-greatest-common-divisors-in-linked-list/solution.go similarity index 100% rename from problems_backup/insert_greatest_common_divisors_in_linked_list/solution.go rename to 2903-insert-greatest-common-divisors-in-linked-list/solution.go diff --git a/problems_backup/check_if_it_is_possible_to_split_array/solution.go b/2916-check-if-it-is-possible-to-split-array/solution.go similarity index 100% rename from problems_backup/check_if_it_is_possible_to_split_array/solution.go rename to 2916-check-if-it-is-possible-to-split-array/solution.go diff --git a/problems_backup/count_pairs_whose_sum_is_less_than_target/solution.go b/2917-count-pairs-whose-sum-is-less-than-target/solution.go similarity index 100% rename from problems_backup/count_pairs_whose_sum_is_less_than_target/solution.go rename to 2917-count-pairs-whose-sum-is-less-than-target/solution.go diff --git a/problems_backup/nim_game/solution.go b/292-nim-game/solution.go similarity index 100% rename from problems_backup/nim_game/solution.go rename to 292-nim-game/solution.go diff --git a/problems_backup/flip_game/solution.go b/293-flip-game/solution.go similarity index 100% rename from problems_backup/flip_game/solution.go rename to 293-flip-game/solution.go diff --git a/problems_backup/maximum_sum_of_almost_unique_subarray/solution.go b/2954-maximum-sum-of-almost-unique-subarray/solution.go similarity index 100% rename from problems_backup/maximum_sum_of_almost_unique_subarray/solution.go rename to 2954-maximum-sum-of-almost-unique-subarray/solution.go diff --git a/problems_backup/account_balance_after_rounded_purchase/solution.go b/2955-account-balance-after-rounded-purchase/solution.go similarity index 100% rename from problems_backup/account_balance_after_rounded_purchase/solution.go rename to 2955-account-balance-after-rounded-purchase/solution.go diff --git a/problems_backup/best_meeting_point/solution.go b/296-best-meeting-point/solution.go similarity index 100% rename from problems_backup/best_meeting_point/solution.go rename to 296-best-meeting-point/solution.go diff --git a/problems_backup/serialize_and_deserialize_binary_tree/solution.go b/297-serialize-and-deserialize-binary-tree/solution.go similarity index 100% rename from problems_backup/serialize_and_deserialize_binary_tree/solution.go rename to 297-serialize-and-deserialize-binary-tree/solution.go diff --git a/problems_backup/check_if_a_string_is_an_acronym_of_words/solution.go b/2977-check-if-a-string-is-an-acronym-of-words/solution.go similarity index 100% rename from problems_backup/check_if_a_string_is_an_acronym_of_words/solution.go rename to 2977-check-if-a-string-is-an-acronym-of-words/solution.go diff --git a/problems_backup/check_if_strings_can_be_made_equal_with_operations_ii/solution.go b/2978-check-if-strings-can-be-made-equal-with-operations-ii/solution.go similarity index 100% rename from problems_backup/check_if_strings_can_be_made_equal_with_operations_ii/solution.go rename to 2978-check-if-strings-can-be-made-equal-with-operations-ii/solution.go diff --git a/problems_backup/bulls_and_cows/solution.go b/299-bulls-and-cows/solution.go similarity index 100% rename from problems_backup/bulls_and_cows/solution.go rename to 299-bulls-and-cows/solution.go diff --git a/problems_backup/number_of_unique_categories/solution.go b/2995-number-of-unique-categories/solution.go similarity index 100% rename from problems_backup/number_of_unique_categories/solution.go rename to 2995-number-of-unique-categories/solution.go diff --git a/problems_backup/__count_symmetric_integers/solution.go b/2998-count-symmetric-integers/solution.go similarity index 100% rename from problems_backup/__count_symmetric_integers/solution.go rename to 2998-count-symmetric-integers/solution.go diff --git a/problems_backup/check_if_strings_can_be_made_equal_with_operations_i/solution.go b/2999-check-if-strings-can-be-made-equal-with-operations-i/solution.go similarity index 100% rename from problems_backup/check_if_strings_can_be_made_equal_with_operations_i/solution.go rename to 2999-check-if-strings-can-be-made-equal-with-operations-i/solution.go diff --git a/problems_backup/longest_substring_without_repeating_characters/solution.go b/3-longest-substring-without-repeating-characters/solution.go similarity index 100% rename from problems_backup/longest_substring_without_repeating_characters/solution.go rename to 3-longest-substring-without-repeating-characters/solution.go diff --git a/problems_backup/furthest_point_from_origin/solution.go b/3019-furthest-point-from-origin/solution.go similarity index 100% rename from problems_backup/furthest_point_from_origin/solution.go rename to 3019-furthest-point-from-origin/solution.go diff --git a/problems_backup/smallest_rectangle_enclosing_black_pixels/solution.go b/302-smallest-rectangle-enclosing-black-pixels/solution.go similarity index 100% rename from problems_backup/smallest_rectangle_enclosing_black_pixels/solution.go rename to 302-smallest-rectangle-enclosing-black-pixels/solution.go diff --git a/problems_backup/find_the_minimum_possible_sum_of_a_beautiful_array/solution.go b/3026-find-the-minimum-possible-sum-of-a-beautiful-array/solution.go similarity index 100% rename from problems_backup/find_the_minimum_possible_sum_of_a_beautiful_array/solution.go rename to 3026-find-the-minimum-possible-sum-of-a-beautiful-array/solution.go diff --git a/problems_backup/range_sum_query_-_immutable/solution.go b/303-range-sum-query---immutable/solution.go similarity index 100% rename from problems_backup/range_sum_query_-_immutable/solution.go rename to 303-range-sum-query---immutable/solution.go diff --git a/problems_backup/points_that_intersect_with_cars/solution.go b/3034-points-that-intersect-with-cars/solution.go similarity index 100% rename from problems_backup/points_that_intersect_with_cars/solution.go rename to 3034-points-that-intersect-with-cars/solution.go diff --git a/problems_backup/range_sum_query_2d_-_immutable/solution.go b/304-range-sum-query-2d---immutable/solution.go similarity index 100% rename from problems_backup/range_sum_query_2d_-_immutable/solution.go rename to 304-range-sum-query-2d---immutable/solution.go diff --git a/problems_backup/minimum_operations_to_collect_elements/solution.go b/3044-minimum-operations-to-collect-elements/solution.go similarity index 100% rename from problems_backup/minimum_operations_to_collect_elements/solution.go rename to 3044-minimum-operations-to-collect-elements/solution.go diff --git a/problems_backup/number_of_islands_ii/solution.go b/305-number-of-islands-ii/solution.go similarity index 100% rename from problems_backup/number_of_islands_ii/solution.go rename to 305-number-of-islands-ii/solution.go diff --git a/problems_backup/maximum_odd_binary_number/solution.go b/3055-maximum-odd-binary-number/solution.go similarity index 100% rename from problems_backup/maximum_odd_binary_number/solution.go rename to 3055-maximum-odd-binary-number/solution.go diff --git a/problems_backup/determine_if_a_cell_is_reachable_at_a_given_time/solution.go b/3056-determine-if-a-cell-is-reachable-at-a-given-time/solution.go similarity index 100% rename from problems_backup/determine_if_a_cell_is_reachable_at_a_given_time/solution.go rename to 3056-determine-if-a-cell-is-reachable-at-a-given-time/solution.go diff --git a/problems_backup/range_sum_query_-_mutable/solution.go b/307-range-sum-query---mutable/solution.go similarity index 100% rename from problems_backup/range_sum_query_-_mutable/solution.go rename to 307-range-sum-query---mutable/solution.go diff --git a/problems_backup/minimum_moves_to_spread_stones_over_grid/solution.go b/3092-minimum-moves-to-spread-stones-over-grid/solution.go similarity index 100% rename from problems_backup/minimum_moves_to_spread_stones_over_grid/solution.go rename to 3092-minimum-moves-to-spread-stones-over-grid/solution.go diff --git a/problems_backup/sum_of_values_at_indices_with_k_set_bits/solution.go b/3093-sum-of-values-at-indices-with-k-set-bits/solution.go similarity index 100% rename from problems_backup/sum_of_values_at_indices_with_k_set_bits/solution.go rename to 3093-sum-of-values-at-indices-with-k-set-bits/solution.go diff --git a/problems_backup/minimum_number_of_operations_to_make_array_empty/solution.go b/3094-minimum-number-of-operations-to-make-array-empty/solution.go similarity index 100% rename from problems_backup/minimum_number_of_operations_to_make_array_empty/solution.go rename to 3094-minimum-number-of-operations-to-make-array-empty/solution.go diff --git a/problems_backup/happy_students/solution.go b/3104-happy-students/solution.go similarity index 100% rename from problems_backup/happy_students/solution.go rename to 3104-happy-students/solution.go diff --git a/problems_backup/maximum_spending_after_buying_items/solution.go b/3107-maximum-spending-after-buying-items/solution.go similarity index 100% rename from problems_backup/maximum_spending_after_buying_items/solution.go rename to 3107-maximum-spending-after-buying-items/solution.go diff --git a/problems_backup/sparse_matrix_multiplication/solution.go b/311-sparse-matrix-multiplication/solution.go similarity index 100% rename from problems_backup/sparse_matrix_multiplication/solution.go rename to 311-sparse-matrix-multiplication/solution.go diff --git a/problems_backup/binary_tree_vertical_order_traversal/solution.go b/314-binary-tree-vertical-order-traversal/solution.go similarity index 100% rename from problems_backup/binary_tree_vertical_order_traversal/solution.go rename to 314-binary-tree-vertical-order-traversal/solution.go diff --git a/problems_backup/shortest_and_lexicographically_smallest_beautiful_string/solution.go b/3150-shortest-and-lexicographically-smallest-beautiful-string/solution.go similarity index 100% rename from problems_backup/shortest_and_lexicographically_smallest_beautiful_string/solution.go rename to 3150-shortest-and-lexicographically-smallest-beautiful-string/solution.go diff --git a/problems_backup/maximum_value_of_an_ordered_triplet_i/solution.go b/3154-maximum-value-of-an-ordered-triplet-i/solution.go similarity index 100% rename from problems_backup/maximum_value_of_an_ordered_triplet_i/solution.go rename to 3154-maximum-value-of-an-ordered-triplet-i/solution.go diff --git a/problems_backup/remove_duplicate_letters/solution.go b/316-remove-duplicate-letters/solution.go similarity index 100% rename from problems_backup/remove_duplicate_letters/solution.go rename to 316-remove-duplicate-letters/solution.go diff --git a/problems_backup/subarrays_distinct_element_sum_of_squares_i/solution.go b/3163-subarrays-distinct-element-sum-of-squares-i/solution.go similarity index 100% rename from problems_backup/subarrays_distinct_element_sum_of_squares_i/solution.go rename to 3163-subarrays-distinct-element-sum-of-squares-i/solution.go diff --git a/problems_backup/find_indices_with_index_and_value_difference_i/solution.go b/3165-find-indices-with-index-and-value-difference-i/solution.go similarity index 100% rename from problems_backup/find_indices_with_index_and_value_difference_i/solution.go rename to 3165-find-indices-with-index-and-value-difference-i/solution.go diff --git a/problems_backup/find_indices_with_index_and_value_difference_ii/solution.go b/3170-find-indices-with-index-and-value-difference-ii/solution.go similarity index 100% rename from problems_backup/find_indices_with_index_and_value_difference_ii/solution.go rename to 3170-find-indices-with-index-and-value-difference-ii/solution.go diff --git a/problems_backup/minimum_equal_sum_of_two_arrays_after_replacing_zeros/solution.go b/3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros/solution.go similarity index 100% rename from problems_backup/minimum_equal_sum_of_two_arrays_after_replacing_zeros/solution.go rename to 3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros/solution.go diff --git a/problems_backup/divisible_and_non-divisible_sums_difference/solution.go b/3172-divisible-and-non-divisible-sums-difference/solution.go similarity index 100% rename from problems_backup/divisible_and_non-divisible_sums_difference/solution.go rename to 3172-divisible-and-non-divisible-sums-difference/solution.go diff --git a/problems_backup/minimum_number_of_changes_to_make_binary_string_beautiful/solution.go b/3174-minimum-number-of-changes-to-make-binary-string-beautiful/solution.go similarity index 100% rename from problems_backup/minimum_number_of_changes_to_make_binary_string_beautiful/solution.go rename to 3174-minimum-number-of-changes-to-make-binary-string-beautiful/solution.go diff --git a/problems_backup/minimum_sum_of_mountain_triplets_i/solution.go b/3176-minimum-sum-of-mountain-triplets-i/solution.go similarity index 100% rename from problems_backup/minimum_sum_of_mountain_triplets_i/solution.go rename to 3176-minimum-sum-of-mountain-triplets-i/solution.go diff --git a/problems_backup/find_the_k-or_of_an_array/solution.go b/3183-find-the-k-or-of-an-array/solution.go similarity index 100% rename from problems_backup/find_the_k-or_of_an_array/solution.go rename to 3183-find-the-k-or-of-an-array/solution.go diff --git a/problems_backup/minimum_sum_of_mountain_triplets_ii/solution.go b/3186-minimum-sum-of-mountain-triplets-ii/solution.go similarity index 100% rename from problems_backup/minimum_sum_of_mountain_triplets_ii/solution.go rename to 3186-minimum-sum-of-mountain-triplets-ii/solution.go diff --git a/problems_backup/find_champion_i/solution.go b/3188-find-champion-i/solution.go similarity index 100% rename from problems_backup/find_champion_i/solution.go rename to 3188-find-champion-i/solution.go diff --git a/problems_backup/find_champion_ii/solution.go b/3189-find-champion-ii/solution.go similarity index 100% rename from problems_backup/find_champion_ii/solution.go rename to 3189-find-champion-ii/solution.go diff --git a/problems_backup/bulb_switcher/solution.go b/319-bulb-switcher/solution.go similarity index 100% rename from problems_backup/bulb_switcher/solution.go rename to 319-bulb-switcher/solution.go diff --git a/problems_backup/maximum_strong_pair_xor_i/solution.go b/3193-maximum-strong-pair-xor-i/solution.go similarity index 100% rename from problems_backup/maximum_strong_pair_xor_i/solution.go rename to 3193-maximum-strong-pair-xor-i/solution.go diff --git a/problems_backup/find_words_containing_character/solution.go b/3194-find-words-containing-character/solution.go similarity index 100% rename from problems_backup/find_words_containing_character/solution.go rename to 3194-find-words-containing-character/solution.go diff --git a/problems_backup/separate_black_and_white_balls/solution.go b/3195-separate-black-and-white-balls/solution.go similarity index 100% rename from problems_backup/separate_black_and_white_balls/solution.go rename to 3195-separate-black-and-white-balls/solution.go diff --git a/problems_backup/distribute_candies_among_children_i/solution.go b/3199-distribute-candies-among-children-i/solution.go similarity index 100% rename from problems_backup/distribute_candies_among_children_i/solution.go rename to 3199-distribute-candies-among-children-i/solution.go diff --git a/problems_backup/high-access_employees/solution.go b/3202-high-access-employees/solution.go similarity index 100% rename from problems_backup/high-access_employees/solution.go rename to 3202-high-access-employees/solution.go diff --git a/problems_backup/find_common_elements_between_two_arrays/solution.go b/3206-find-common-elements-between-two-arrays/solution.go similarity index 100% rename from problems_backup/find_common_elements_between_two_arrays/solution.go rename to 3206-find-common-elements-between-two-arrays/solution.go diff --git a/problems_backup/make_three_strings_equal/solution.go b/3207-make-three-strings-equal/solution.go similarity index 100% rename from problems_backup/make_three_strings_equal/solution.go rename to 3207-make-three-strings-equal/solution.go diff --git a/problems_backup/count_beautiful_substrings_i/solution.go b/3210-count-beautiful-substrings-i/solution.go similarity index 100% rename from problems_backup/count_beautiful_substrings_i/solution.go rename to 3210-count-beautiful-substrings-i/solution.go diff --git a/problems_backup/maximize_area_of_square_hole_in_grid/solution.go b/3214-maximize-area-of-square-hole-in-grid/solution.go similarity index 100% rename from problems_backup/maximize_area_of_square_hole_in_grid/solution.go rename to 3214-maximize-area-of-square-hole-in-grid/solution.go diff --git a/problems_backup/matrix_similarity_after_cyclic_shifts/solution.go b/3215-matrix-similarity-after-cyclic-shifts/solution.go similarity index 100% rename from problems_backup/matrix_similarity_after_cyclic_shifts/solution.go rename to 3215-matrix-similarity-after-cyclic-shifts/solution.go diff --git a/problems_backup/count_tested_devices_after_test_operations/solution.go b/3220-count-tested-devices-after-test-operations/solution.go similarity index 100% rename from problems_backup/count_tested_devices_after_test_operations/solution.go rename to 3220-count-tested-devices-after-test-operations/solution.go diff --git a/problems_backup/find_the_peaks/solution.go b/3221-find-the-peaks/solution.go similarity index 100% rename from problems_backup/find_the_peaks/solution.go rename to 3221-find-the-peaks/solution.go diff --git a/problems_backup/length_of_longest_subarray_with_at_most_k_frequency/solution.go b/3225-length-of-longest-subarray-with-at-most-k-frequency/solution.go similarity index 100% rename from problems_backup/length_of_longest_subarray_with_at_most_k_frequency/solution.go rename to 3225-length-of-longest-subarray-with-at-most-k-frequency/solution.go diff --git a/problems_backup/minimum_number_game/solution.go b/3226-minimum-number-game/solution.go similarity index 100% rename from problems_backup/minimum_number_game/solution.go rename to 3226-minimum-number-game/solution.go diff --git a/problems_backup/find_missing_and_repeated_values/solution.go b/3227-find-missing-and-repeated-values/solution.go similarity index 100% rename from problems_backup/find_missing_and_repeated_values/solution.go rename to 3227-find-missing-and-repeated-values/solution.go diff --git a/problems_backup/maximum_size_of_a_set_after_removals/solution.go b/3228-maximum-size-of-a-set-after-removals/solution.go similarity index 100% rename from problems_backup/maximum_size_of_a_set_after_removals/solution.go rename to 3228-maximum-size-of-a-set-after-removals/solution.go diff --git a/problems_backup/number_of_connected_components_in_an_undirected_graph/solution.go b/323-number-of-connected-components-in-an-undirected-graph/solution.go similarity index 100% rename from problems_backup/number_of_connected_components_in_an_undirected_graph/solution.go rename to 323-number-of-connected-components-in-an-undirected-graph/solution.go diff --git a/problems_backup/number_of_divisible_substrings/solution.go b/3237-number-of-divisible-substrings/solution.go similarity index 100% rename from problems_backup/number_of_divisible_substrings/solution.go rename to 3237-number-of-divisible-substrings/solution.go diff --git a/problems_backup/divide_array_into_arrays_with_max_difference/solution.go b/3241-divide-array-into-arrays-with-max-difference/solution.go similarity index 100% rename from problems_backup/divide_array_into_arrays_with_max_difference/solution.go rename to 3241-divide-array-into-arrays-with-max-difference/solution.go diff --git a/problems_backup/check_if_bitwise_or_has_trailing_zeros/solution.go b/3246-check-if-bitwise-or-has-trailing-zeros/solution.go similarity index 100% rename from problems_backup/check_if_bitwise_or_has_trailing_zeros/solution.go rename to 3246-check-if-bitwise-or-has-trailing-zeros/solution.go diff --git a/problems_backup/maximum_area_of_longest_diagonal_rectangle/solution.go b/3251-maximum-area-of-longest-diagonal-rectangle/solution.go similarity index 100% rename from problems_backup/maximum_area_of_longest_diagonal_rectangle/solution.go rename to 3251-maximum-area-of-longest-diagonal-rectangle/solution.go diff --git a/problems_backup/count_the_number_of_incremovable_subarrays_i/solution.go b/3252-count-the-number-of-incremovable-subarrays-i/solution.go similarity index 100% rename from problems_backup/count_the_number_of_incremovable_subarrays_i/solution.go rename to 3252-count-the-number-of-incremovable-subarrays-i/solution.go diff --git a/problems_backup/power_of_three/solution.java b/326-power-of-three/solution.java similarity index 100% rename from problems_backup/power_of_three/solution.java rename to 326-power-of-three/solution.java diff --git a/problems_backup/find_polygon_with_the_largest_perimeter/solution.go b/3262-find-polygon-with-the-largest-perimeter/solution.go similarity index 100% rename from problems_backup/find_polygon_with_the_largest_perimeter/solution.go rename to 3262-find-polygon-with-the-largest-perimeter/solution.go diff --git a/problems_backup/find_longest_special_substring_that_occurs_thrice_i/solution.go b/3267-find-longest-special-substring-that-occurs-thrice-i/solution.go similarity index 100% rename from problems_backup/find_longest_special_substring_that_occurs_thrice_i/solution.go rename to 3267-find-longest-special-substring-that-occurs-thrice-i/solution.go diff --git a/problems_backup/minimum_moves_to_capture_the_queen/solution.go b/3270-minimum-moves-to-capture-the-queen/solution.go similarity index 100% rename from problems_backup/minimum_moves_to_capture_the_queen/solution.go rename to 3270-minimum-moves-to-capture-the-queen/solution.go diff --git a/problems_backup/odd_even_linked_list/solution.go b/328-odd-even-linked-list/solution.go similarity index 100% rename from problems_backup/odd_even_linked_list/solution.go rename to 328-odd-even-linked-list/solution.go diff --git a/problems_backup/number_of_self-divisible_permutations/solution.go b/3294-number-of-self-divisible-permutations/solution.go similarity index 100% rename from problems_backup/number_of_self-divisible_permutations/solution.go rename to 3294-number-of-self-divisible-permutations/solution.go diff --git a/problems_backup/minimum_time_to_revert_word_to_initial_state_i/solution.go b/3297-minimum-time-to-revert-word-to-initial-state-i/solution.go similarity index 100% rename from problems_backup/minimum_time_to_revert_word_to_initial_state_i/solution.go rename to 3297-minimum-time-to-revert-word-to-initial-state-i/solution.go diff --git a/problems_backup/search_in_rotated_sorted_array/solution.go b/33-search-in-rotated-sorted-array/solution.go similarity index 100% rename from problems_backup/search_in_rotated_sorted_array/solution.go rename to 33-search-in-rotated-sorted-array/solution.go diff --git a/problems_backup/maximum_subtree_of_the_same_color/solution.go b/3304-maximum-subtree-of-the-same-color/solution.go similarity index 100% rename from problems_backup/maximum_subtree_of_the_same_color/solution.go rename to 3304-maximum-subtree-of-the-same-color/solution.go diff --git a/problems_backup/apply_operations_to_make_string_empty/solution.go b/3308-apply-operations-to-make-string-empty/solution.go similarity index 100% rename from problems_backup/apply_operations_to_make_string_empty/solution.go rename to 3308-apply-operations-to-make-string-empty/solution.go diff --git a/problems_backup/count_prefix_and_suffix_pairs_i/solution.go b/3309-count-prefix-and-suffix-pairs-i/solution.go similarity index 100% rename from problems_backup/count_prefix_and_suffix_pairs_i/solution.go rename to 3309-count-prefix-and-suffix-pairs-i/solution.go diff --git a/problems_backup/ant_on_the_boundary/solution.go b/3311-ant-on-the-boundary/solution.go similarity index 100% rename from problems_backup/ant_on_the_boundary/solution.go rename to 3311-ant-on-the-boundary/solution.go diff --git a/problems_backup/most_frequent_prime/solution.go b/3314-most-frequent-prime/solution.go similarity index 100% rename from problems_backup/most_frequent_prime/solution.go rename to 3314-most-frequent-prime/solution.go diff --git a/problems_backup/maximum_number_of_operations_with_the_same_score_i/solution.go b/3320-maximum-number-of-operations-with-the-same-score-i/solution.go similarity index 100% rename from problems_backup/maximum_number_of_operations_with_the_same_score_i/solution.go rename to 3320-maximum-number-of-operations-with-the-same-score-i/solution.go diff --git a/problems_backup/split_the_array/solution.go b/3324-split-the-array/solution.go similarity index 100% rename from problems_backup/split_the_array/solution.go rename to 3324-split-the-array/solution.go diff --git a/problems_backup/find_the_length_of_the_longest_common_prefix/solution.go b/3329-find-the-length-of-the-longest-common-prefix/solution.go similarity index 100% rename from problems_backup/find_the_length_of_the_longest_common_prefix/solution.go rename to 3329-find-the-length-of-the-longest-common-prefix/solution.go diff --git a/problems_backup/modify_the_matrix/solution.go b/3330-modify-the-matrix/solution.go similarity index 100% rename from problems_backup/modify_the_matrix/solution.go rename to 3330-modify-the-matrix/solution.go diff --git a/problems_backup/increasing_triplet_subsequence/solution.go b/334-increasing-triplet-subsequence/solution.go similarity index 100% rename from problems_backup/increasing_triplet_subsequence/solution.go rename to 334-increasing-triplet-subsequence/solution.go diff --git a/problems_backup/count_numbers_with_unique_digits_ii/solution.go b/3343-count-numbers-with-unique-digits-ii/solution.go similarity index 100% rename from problems_backup/count_numbers_with_unique_digits_ii/solution.go rename to 3343-count-numbers-with-unique-digits-ii/solution.go diff --git a/problems_backup/counting_bits/solution.go b/338-counting-bits/solution.go similarity index 100% rename from problems_backup/counting_bits/solution.go rename to 338-counting-bits/solution.go diff --git a/problems_backup/find_first_and_last_position_of_element_in_sorted_array/solution.go b/34-find-first-and-last-position-of-element-in-sorted-array/solution.go similarity index 100% rename from problems_backup/find_first_and_last_position_of_element_in_sorted_array/solution.go rename to 34-find-first-and-last-position-of-element-in-sorted-array/solution.go diff --git a/problems_backup/longest_substring_with_at_most_k_distinct_characters/solution.go b/340-longest-substring-with-at-most-k-distinct-characters/solution.go similarity index 100% rename from problems_backup/longest_substring_with_at_most_k_distinct_characters/solution.go rename to 340-longest-substring-with-at-most-k-distinct-characters/solution.go diff --git a/problems_backup/power_of_four/solution.go b/342-power-of-four/solution.go similarity index 100% rename from problems_backup/power_of_four/solution.go rename to 342-power-of-four/solution.go diff --git a/problems_backup/power_of_four/solution.java b/342-power-of-four/solution.java similarity index 100% rename from problems_backup/power_of_four/solution.java rename to 342-power-of-four/solution.java diff --git a/problems_backup/integer_break/solution.go b/343-integer-break/solution.go similarity index 100% rename from problems_backup/integer_break/solution.go rename to 343-integer-break/solution.go diff --git a/problems_backup/reverse_string/solution.go b/344-reverse-string/solution.go similarity index 100% rename from problems_backup/reverse_string/solution.go rename to 344-reverse-string/solution.go diff --git a/problems_backup/reverse_string/solution.java b/344-reverse-string/solution.java similarity index 100% rename from problems_backup/reverse_string/solution.java rename to 344-reverse-string/solution.java diff --git a/problems_backup/reverse_vowels_of_a_string/solution.java b/345-reverse-vowels-of-a-string/solution.java similarity index 100% rename from problems_backup/reverse_vowels_of_a_string/solution.java rename to 345-reverse-vowels-of-a-string/solution.java diff --git a/problems_backup/moving_average_from_data_stream/solution.go b/346-moving-average-from-data-stream/solution.go similarity index 100% rename from problems_backup/moving_average_from_data_stream/solution.go rename to 346-moving-average-from-data-stream/solution.go diff --git a/problems_backup/top_k_frequent_elements/solution.go b/347-top-k-frequent-elements/solution.go similarity index 100% rename from problems_backup/top_k_frequent_elements/solution.go rename to 347-top-k-frequent-elements/solution.go diff --git a/problems_backup/design_tic-tac-toe/solution.go b/348-design-tic-tac-toe/solution.go similarity index 100% rename from problems_backup/design_tic-tac-toe/solution.go rename to 348-design-tic-tac-toe/solution.go diff --git a/problems_backup/intersection_of_two_arrays/solution.java b/349-intersection-of-two-arrays/solution.java similarity index 100% rename from problems_backup/intersection_of_two_arrays/solution.java rename to 349-intersection-of-two-arrays/solution.java diff --git a/problems_backup/search_insert_position/solution.go b/35-search-insert-position/solution.go similarity index 100% rename from problems_backup/search_insert_position/solution.go rename to 35-search-insert-position/solution.go diff --git a/problems_backup/intersection_of_two_arrays_ii/solution.java b/350-intersection-of-two-arrays-ii/solution.java similarity index 100% rename from problems_backup/intersection_of_two_arrays_ii/solution.java rename to 350-intersection-of-two-arrays-ii/solution.java diff --git a/problems_backup/design_snake_game/solution.go b/353-design-snake-game/solution.go similarity index 100% rename from problems_backup/design_snake_game/solution.go rename to 353-design-snake-game/solution.go diff --git a/problems_backup/logger_rate_limiter/solution.go b/359-logger-rate-limiter/solution.go similarity index 100% rename from problems_backup/logger_rate_limiter/solution.go rename to 359-logger-rate-limiter/solution.go diff --git a/problems_backup/valid_sudoku/solution.go b/36-valid-sudoku/solution.go similarity index 100% rename from problems_backup/valid_sudoku/solution.go rename to 36-valid-sudoku/solution.go diff --git a/problems_backup/sort_transformed_array/solution.go b/360-sort-transformed-array/solution.go similarity index 100% rename from problems_backup/sort_transformed_array/solution.go rename to 360-sort-transformed-array/solution.go diff --git a/problems_backup/bomb_enemy/solution.go b/361-bomb-enemy/solution.go similarity index 100% rename from problems_backup/bomb_enemy/solution.go rename to 361-bomb-enemy/solution.go diff --git a/problems_backup/design_hit_counter/solution.go b/362-design-hit-counter/solution.go similarity index 100% rename from problems_backup/design_hit_counter/solution.go rename to 362-design-hit-counter/solution.go diff --git a/problems_backup/valid_perfect_square/solution.java b/367-valid-perfect-square/solution.java similarity index 100% rename from problems_backup/valid_perfect_square/solution.java rename to 367-valid-perfect-square/solution.java diff --git a/problems_backup/plus_one_linked_list/solution.go b/369-plus-one-linked-list/solution.go similarity index 100% rename from problems_backup/plus_one_linked_list/solution.go rename to 369-plus-one-linked-list/solution.go diff --git a/problems_backup/range_addition/solution.go b/370-range-addition/solution.go similarity index 100% rename from problems_backup/range_addition/solution.go rename to 370-range-addition/solution.go diff --git a/problems_backup/find_k_pairs_with_smallest_sums/solution.go b/373-find-k-pairs-with-smallest-sums/solution.go similarity index 100% rename from problems_backup/find_k_pairs_with_smallest_sums/solution.go rename to 373-find-k-pairs-with-smallest-sums/solution.go diff --git a/problems_backup/guess_number_higher_or_lower/solution.java b/374-guess-number-higher-or-lower/solution.java similarity index 100% rename from problems_backup/guess_number_higher_or_lower/solution.java rename to 374-guess-number-higher-or-lower/solution.java diff --git a/problems_backup/kth_smallest_element_in_a_sorted_matrix/solution.go b/378-kth-smallest-element-in-a-sorted-matrix/solution.go similarity index 100% rename from problems_backup/kth_smallest_element_in_a_sorted_matrix/solution.go rename to 378-kth-smallest-element-in-a-sorted-matrix/solution.go diff --git a/problems_backup/design_phone_directory/solution.go b/379-design-phone-directory/solution.go similarity index 100% rename from problems_backup/design_phone_directory/solution.go rename to 379-design-phone-directory/solution.go diff --git a/problems_backup/linked_list_random_node/solution.go b/382-linked-list-random-node/solution.go similarity index 100% rename from problems_backup/linked_list_random_node/solution.go rename to 382-linked-list-random-node/solution.go diff --git a/problems_backup/ransom_note/solution.go b/383-ransom-note/solution.go similarity index 100% rename from problems_backup/ransom_note/solution.go rename to 383-ransom-note/solution.go diff --git a/problems_backup/ransom_note/solution.java b/383-ransom-note/solution.java similarity index 100% rename from problems_backup/ransom_note/solution.java rename to 383-ransom-note/solution.java diff --git a/problems_backup/lexicographical_numbers/solution.go b/386-lexicographical-numbers/solution.go similarity index 100% rename from problems_backup/lexicographical_numbers/solution.go rename to 386-lexicographical-numbers/solution.go diff --git a/problems_backup/first_unique_character_in_a_string/solution.java b/387-first-unique-character-in-a-string/solution.java similarity index 100% rename from problems_backup/first_unique_character_in_a_string/solution.java rename to 387-first-unique-character-in-a-string/solution.java diff --git a/problems_backup/find_the_difference/solution.go b/389-find-the-difference/solution.go similarity index 100% rename from problems_backup/find_the_difference/solution.go rename to 389-find-the-difference/solution.go diff --git a/problems_backup/find_the_difference/solution.java b/389-find-the-difference/solution.java similarity index 100% rename from problems_backup/find_the_difference/solution.java rename to 389-find-the-difference/solution.java diff --git a/problems_backup/combination_sum/solution.go b/39-combination-sum/solution.go similarity index 100% rename from problems_backup/combination_sum/solution.go rename to 39-combination-sum/solution.go diff --git a/problems_backup/is_subsequence/solution.go b/392-is-subsequence/solution.go similarity index 100% rename from problems_backup/is_subsequence/solution.go rename to 392-is-subsequence/solution.go diff --git a/problems_backup/decode_string/solution.go b/394-decode-string/solution.go similarity index 100% rename from problems_backup/decode_string/solution.go rename to 394-decode-string/solution.go diff --git a/problems_backup/rotate_function/solution.go b/396-rotate-function/solution.go similarity index 100% rename from problems_backup/rotate_function/solution.go rename to 396-rotate-function/solution.go diff --git a/problems_backup/median_of_two_sorted_arrays/solution.go b/4-median-of-two-sorted-arrays/solution.go similarity index 100% rename from problems_backup/median_of_two_sorted_arrays/solution.go rename to 4-median-of-two-sorted-arrays/solution.go diff --git a/problems_backup/binary_watch/solution.go b/401-binary-watch/solution.go similarity index 100% rename from problems_backup/binary_watch/solution.go rename to 401-binary-watch/solution.go diff --git a/problems_backup/remove_k_digits/solution.go b/402-remove-k-digits/solution.go similarity index 100% rename from problems_backup/remove_k_digits/solution.go rename to 402-remove-k-digits/solution.go diff --git a/problems_backup/sum_of_left_leaves/solution.java b/404-sum-of-left-leaves/solution.java similarity index 100% rename from problems_backup/sum_of_left_leaves/solution.java rename to 404-sum-of-left-leaves/solution.java diff --git a/problems_backup/queue_reconstruction_by_height/solution.go b/406-queue-reconstruction-by-height/solution.go similarity index 100% rename from problems_backup/queue_reconstruction_by_height/solution.go rename to 406-queue-reconstruction-by-height/solution.go diff --git a/problems_backup/trapping_rain_water_ii/solution.go b/407-trapping-rain-water-ii/solution.go similarity index 100% rename from problems_backup/trapping_rain_water_ii/solution.go rename to 407-trapping-rain-water-ii/solution.go diff --git a/problems_backup/longest_palindrome/solution.java b/409-longest-palindrome/solution.java similarity index 100% rename from problems_backup/longest_palindrome/solution.java rename to 409-longest-palindrome/solution.java diff --git a/problems_backup/first_missing_positive/solution.go b/41-first-missing-positive/solution.go similarity index 100% rename from problems_backup/first_missing_positive/solution.go rename to 41-first-missing-positive/solution.go diff --git a/problems_backup/split_array_largest_sum/solution.go b/410-split-array-largest-sum/solution.go similarity index 100% rename from problems_backup/split_array_largest_sum/solution.go rename to 410-split-array-largest-sum/solution.go diff --git a/problems_backup/fizz_buzz/solution.go b/412-fizz-buzz/solution.go similarity index 100% rename from problems_backup/fizz_buzz/solution.go rename to 412-fizz-buzz/solution.go diff --git a/problems_backup/third_maximum_number/solution.java b/414-third-maximum-number/solution.java similarity index 100% rename from problems_backup/third_maximum_number/solution.java rename to 414-third-maximum-number/solution.java diff --git a/problems_backup/add_strings/solution.go b/415-add-strings/solution.go similarity index 100% rename from problems_backup/add_strings/solution.go rename to 415-add-strings/solution.go diff --git a/problems_backup/pacific_atlantic_water_flow/solution.go b/417-pacific-atlantic-water-flow/solution.go similarity index 100% rename from problems_backup/pacific_atlantic_water_flow/solution.go rename to 417-pacific-atlantic-water-flow/solution.go diff --git a/problems_backup/battleships_in_a_board/solution.go b/419-battleships-in-a-board/solution.go similarity index 100% rename from problems_backup/battleships_in_a_board/solution.go rename to 419-battleships-in-a-board/solution.go diff --git a/problems_backup/trapping_rain_water/solution.go b/42-trapping-rain-water/solution.go similarity index 100% rename from problems_backup/trapping_rain_water/solution.go rename to 42-trapping-rain-water/solution.go diff --git a/problems_backup/valid_word_square/solution.go b/422-valid-word-square/solution.go similarity index 100% rename from problems_backup/valid_word_square/solution.go rename to 422-valid-word-square/solution.go diff --git a/problems_backup/multiply_strings/solution.java b/43-multiply-strings/solution.java similarity index 100% rename from problems_backup/multiply_strings/solution.java rename to 43-multiply-strings/solution.java diff --git a/problems_backup/number_of_segments_in_a_string/solution.go b/434-number-of-segments-in-a-string/solution.go similarity index 100% rename from problems_backup/number_of_segments_in_a_string/solution.go rename to 434-number-of-segments-in-a-string/solution.go diff --git a/problems_backup/number_of_segments_in_a_string/solution.java b/434-number-of-segments-in-a-string/solution.java similarity index 100% rename from problems_backup/number_of_segments_in_a_string/solution.java rename to 434-number-of-segments-in-a-string/solution.java diff --git a/problems_backup/non-overlapping_intervals/solution.go b/435-non-overlapping-intervals/solution.go similarity index 100% rename from problems_backup/non-overlapping_intervals/solution.go rename to 435-non-overlapping-intervals/solution.go diff --git a/problems_backup/path_sum_iii/solution.go b/437-path-sum-iii/solution.go similarity index 100% rename from problems_backup/path_sum_iii/solution.go rename to 437-path-sum-iii/solution.go diff --git a/problems_backup/find_all_anagrams_in_a_string/solution.go b/438-find-all-anagrams-in-a-string/solution.go similarity index 100% rename from problems_backup/find_all_anagrams_in_a_string/solution.go rename to 438-find-all-anagrams-in-a-string/solution.go diff --git a/problems_backup/arranging_coins/solution.go b/441-arranging-coins/solution.go similarity index 100% rename from problems_backup/arranging_coins/solution.go rename to 441-arranging-coins/solution.go diff --git a/problems_backup/find_all_duplicates_in_an_array/solution.java b/442-find-all-duplicates-in-an-array/solution.java similarity index 100% rename from problems_backup/find_all_duplicates_in_an_array/solution.java rename to 442-find-all-duplicates-in-an-array/solution.java diff --git a/problems_backup/string_compression/solution.go b/443-string-compression/solution.go similarity index 100% rename from problems_backup/string_compression/solution.go rename to 443-string-compression/solution.go diff --git a/problems_backup/add_two_numbers_ii/solution.go b/445-add-two-numbers-ii/solution.go similarity index 100% rename from problems_backup/add_two_numbers_ii/solution.go rename to 445-add-two-numbers-ii/solution.go diff --git a/problems_backup/find_all_numbers_disappeared_in_an_array/solution.go b/448-find-all-numbers-disappeared-in-an-array/solution.go similarity index 100% rename from problems_backup/find_all_numbers_disappeared_in_an_array/solution.go rename to 448-find-all-numbers-disappeared-in-an-array/solution.go diff --git a/problems_backup/serialize_and_deserialize_bst/solution.go b/449-serialize-and-deserialize-bst/solution.go similarity index 100% rename from problems_backup/serialize_and_deserialize_bst/solution.go rename to 449-serialize-and-deserialize-bst/solution.go diff --git a/problems_backup/jump_game_ii/solution.go b/45-jump-game-ii/solution.go similarity index 100% rename from problems_backup/jump_game_ii/solution.go rename to 45-jump-game-ii/solution.go diff --git a/problems_backup/sort_characters_by_frequency/solution.java b/451-sort-characters-by-frequency/solution.java similarity index 100% rename from problems_backup/sort_characters_by_frequency/solution.java rename to 451-sort-characters-by-frequency/solution.java diff --git a/problems_backup/minimum_moves_to_equal_array_elements/solution.go b/453-minimum-moves-to-equal-array-elements/solution.go similarity index 100% rename from problems_backup/minimum_moves_to_equal_array_elements/solution.go rename to 453-minimum-moves-to-equal-array-elements/solution.go diff --git a/problems_backup/4sum_ii/solution.go b/454-4sum-ii/solution.go similarity index 100% rename from problems_backup/4sum_ii/solution.go rename to 454-4sum-ii/solution.go diff --git a/problems_backup/assign_cookies/solution.java b/455-assign-cookies/solution.java similarity index 100% rename from problems_backup/assign_cookies/solution.java rename to 455-assign-cookies/solution.java diff --git a/problems_backup/poor_pigs/solution.go b/458-poor-pigs/solution.go similarity index 100% rename from problems_backup/poor_pigs/solution.go rename to 458-poor-pigs/solution.go diff --git a/problems_backup/repeated_substring_pattern/solution.go b/459-repeated-substring-pattern/solution.go similarity index 100% rename from problems_backup/repeated_substring_pattern/solution.go rename to 459-repeated-substring-pattern/solution.go diff --git a/problems_backup/permutations/solution.go b/46-permutations/solution.go similarity index 100% rename from problems_backup/permutations/solution.go rename to 46-permutations/solution.go diff --git a/problems_backup/hamming_distance/solution.go b/461-hamming-distance/solution.go similarity index 100% rename from problems_backup/hamming_distance/solution.go rename to 461-hamming-distance/solution.go diff --git a/problems_backup/hamming_distance/solution.java b/461-hamming-distance/solution.java similarity index 100% rename from problems_backup/hamming_distance/solution.java rename to 461-hamming-distance/solution.java diff --git a/problems_backup/minimum_moves_to_equal_array_elements_ii/solution.go b/462-minimum-moves-to-equal-array-elements-ii/solution.go similarity index 100% rename from problems_backup/minimum_moves_to_equal_array_elements_ii/solution.go rename to 462-minimum-moves-to-equal-array-elements-ii/solution.go diff --git a/problems_backup/island_perimeter/solution.go b/463-island-perimeter/solution.go similarity index 100% rename from problems_backup/island_perimeter/solution.go rename to 463-island-perimeter/solution.go diff --git a/problems_backup/number_complement/solution.go b/476-number-complement/solution.go similarity index 100% rename from problems_backup/number_complement/solution.go rename to 476-number-complement/solution.go diff --git a/problems_backup/rotate_image/solution.go b/48-rotate-image/solution.go similarity index 100% rename from problems_backup/rotate_image/solution.go rename to 48-rotate-image/solution.go diff --git a/problems_backup/license_key_formatting/solution.go b/482-license-key-formatting/solution.go similarity index 100% rename from problems_backup/license_key_formatting/solution.go rename to 482-license-key-formatting/solution.go diff --git a/problems_backup/find_permutation/solution.go b/484-find-permutation/solution.go similarity index 100% rename from problems_backup/find_permutation/solution.go rename to 484-find-permutation/solution.go diff --git a/problems_backup/max_consecutive_ones/solution.go b/485-max-consecutive-ones/solution.go similarity index 100% rename from problems_backup/max_consecutive_ones/solution.go rename to 485-max-consecutive-ones/solution.go diff --git a/problems_backup/max_consecutive_ones_ii/solution.go b/487-max-consecutive-ones-ii/solution.go similarity index 100% rename from problems_backup/max_consecutive_ones_ii/solution.go rename to 487-max-consecutive-ones-ii/solution.go diff --git a/problems_backup/group_anagrams/solution.go b/49-group-anagrams/solution.go similarity index 100% rename from problems_backup/group_anagrams/solution.go rename to 49-group-anagrams/solution.go diff --git a/problems_backup/the_maze/solution.go b/490-the-maze/solution.go similarity index 100% rename from problems_backup/the_maze/solution.go rename to 490-the-maze/solution.go diff --git a/problems_backup/construct_the_rectangle/solution.go b/492-construct-the-rectangle/solution.go similarity index 100% rename from problems_backup/construct_the_rectangle/solution.go rename to 492-construct-the-rectangle/solution.go diff --git a/problems_backup/teemo_attacking/solution.go b/495-teemo-attacking/solution.go similarity index 100% rename from problems_backup/teemo_attacking/solution.go rename to 495-teemo-attacking/solution.go diff --git a/problems_backup/next_greater_element_i/solution.java b/496-next-greater-element-i/solution.java similarity index 100% rename from problems_backup/next_greater_element_i/solution.java rename to 496-next-greater-element-i/solution.java diff --git a/problems_backup/diagonal_traverse/solution.go b/498-diagonal-traverse/solution.go similarity index 100% rename from problems_backup/diagonal_traverse/solution.go rename to 498-diagonal-traverse/solution.go diff --git a/problems_backup/longest_palindromic_substring/solution.go b/5-longest-palindromic-substring/solution.go similarity index 100% rename from problems_backup/longest_palindromic_substring/solution.go rename to 5-longest-palindromic-substring/solution.go diff --git a/problems_backup/pow(x,_n)/solution.go b/50-pow(x,-n)/solution.go similarity index 100% rename from problems_backup/pow(x,_n)/solution.go rename to 50-pow(x,-n)/solution.go diff --git a/problems_backup/keyboard_row/solution.go b/500-keyboard-row/solution.go similarity index 100% rename from problems_backup/keyboard_row/solution.go rename to 500-keyboard-row/solution.go diff --git a/problems_backup/find_mode_in_binary_search_tree/solution.go b/501-find-mode-in-binary-search-tree/solution.go similarity index 100% rename from problems_backup/find_mode_in_binary_search_tree/solution.go rename to 501-find-mode-in-binary-search-tree/solution.go diff --git a/problems_backup/next_greater_element_ii/solution.go b/503-next-greater-element-ii/solution.go similarity index 100% rename from problems_backup/next_greater_element_ii/solution.go rename to 503-next-greater-element-ii/solution.go diff --git a/problems_backup/base_7/solution.go b/504-base-7/solution.go similarity index 100% rename from problems_backup/base_7/solution.go rename to 504-base-7/solution.go diff --git a/problems_backup/relative_ranks/solution.go b/506-relative-ranks/solution.go similarity index 100% rename from problems_backup/relative_ranks/solution.go rename to 506-relative-ranks/solution.go diff --git a/problems_backup/perfect_number/solution.java b/507-perfect-number/solution.java similarity index 100% rename from problems_backup/perfect_number/solution.java rename to 507-perfect-number/solution.java diff --git a/problems_backup/most_frequent_subtree_sum/solution.go b/508-most-frequent-subtree-sum/solution.go similarity index 100% rename from problems_backup/most_frequent_subtree_sum/solution.go rename to 508-most-frequent-subtree-sum/solution.go diff --git a/problems_backup/inorder_successor_in_bst_ii/solution.go b/509-inorder-successor-in-bst-ii/solution.go similarity index 100% rename from problems_backup/inorder_successor_in_bst_ii/solution.go rename to 509-inorder-successor-in-bst-ii/solution.go diff --git a/problems_backup/find_bottom_left_tree_value/solution.go b/513-find-bottom-left-tree-value/solution.go similarity index 100% rename from problems_backup/find_bottom_left_tree_value/solution.go rename to 513-find-bottom-left-tree-value/solution.go diff --git a/problems_backup/find_largest_value_in_each_tree_row/solution.go b/515-find-largest-value-in-each-tree-row/solution.go similarity index 100% rename from problems_backup/find_largest_value_in_each_tree_row/solution.go rename to 515-find-largest-value-in-each-tree-row/solution.go diff --git a/problems_backup/coin_change_2/solution.go b/518-coin-change-2/solution.go similarity index 100% rename from problems_backup/coin_change_2/solution.go rename to 518-coin-change-2/solution.go diff --git a/problems_backup/detect_capital/solution.go b/520-detect-capital/solution.go similarity index 100% rename from problems_backup/detect_capital/solution.go rename to 520-detect-capital/solution.go diff --git a/problems_backup/detect_capital/solution.java b/520-detect-capital/solution.java similarity index 100% rename from problems_backup/detect_capital/solution.java rename to 520-detect-capital/solution.java diff --git a/problems_backup/longest_uncommon_subsequence_i/solution.go b/521-longest-uncommon-subsequence-i/solution.go similarity index 100% rename from problems_backup/longest_uncommon_subsequence_i/solution.go rename to 521-longest-uncommon-subsequence-i/solution.go diff --git a/problems_backup/longest_word_in_dictionary_through_deleting/solution.go b/524-longest-word-in-dictionary-through-deleting/solution.go similarity index 100% rename from problems_backup/longest_word_in_dictionary_through_deleting/solution.go rename to 524-longest-word-in-dictionary-through-deleting/solution.go diff --git a/problems_backup/contiguous_array/solution.go b/525-contiguous-array/solution.go similarity index 100% rename from problems_backup/contiguous_array/solution.go rename to 525-contiguous-array/solution.go diff --git a/problems_backup/beautiful_arrangement/solution.go b/526-beautiful-arrangement/solution.go similarity index 100% rename from problems_backup/beautiful_arrangement/solution.go rename to 526-beautiful-arrangement/solution.go diff --git a/problems_backup/swapping_nodes_in_a_linked_list/solution.go b/528-swapping-nodes-in-a-linked-list/solution.go similarity index 100% rename from problems_backup/swapping_nodes_in_a_linked_list/solution.go rename to 528-swapping-nodes-in-a-linked-list/solution.go diff --git a/problems_backup/maximum_subarray/solution.go b/53-maximum-subarray/solution.go similarity index 100% rename from problems_backup/maximum_subarray/solution.go rename to 53-maximum-subarray/solution.go diff --git a/problems_backup/minimum_absolute_difference_in_bst/solution.go b/530-minimum-absolute-difference-in-bst/solution.go similarity index 100% rename from problems_backup/minimum_absolute_difference_in_bst/solution.go rename to 530-minimum-absolute-difference-in-bst/solution.go diff --git a/problems_backup/minimum_absolute_difference_in_bst/solution.java b/530-minimum-absolute-difference-in-bst/solution.java similarity index 100% rename from problems_backup/minimum_absolute_difference_in_bst/solution.java rename to 530-minimum-absolute-difference-in-bst/solution.java diff --git a/problems_backup/lonely_pixel_i/solution.go b/531-lonely-pixel-i/solution.go similarity index 100% rename from problems_backup/lonely_pixel_i/solution.go rename to 531-lonely-pixel-i/solution.go diff --git a/problems_backup/k-diff_pairs_in_an_array/solution.go b/532-k-diff-pairs-in-an-array/solution.go similarity index 100% rename from problems_backup/k-diff_pairs_in_an_array/solution.go rename to 532-k-diff-pairs-in-an-array/solution.go diff --git a/problems_backup/encode_and_decode_tinyurl/solution.go b/535-encode-and-decode-tinyurl/solution.go similarity index 100% rename from problems_backup/encode_and_decode_tinyurl/solution.go rename to 535-encode-and-decode-tinyurl/solution.go diff --git a/problems_backup/complex_number_multiplication/solution.go b/537-complex-number-multiplication/solution.go similarity index 100% rename from problems_backup/complex_number_multiplication/solution.go rename to 537-complex-number-multiplication/solution.go diff --git a/problems_backup/convert_bst_to_greater_tree/solution.go b/538-convert-bst-to-greater-tree/solution.go similarity index 100% rename from problems_backup/convert_bst_to_greater_tree/solution.go rename to 538-convert-bst-to-greater-tree/solution.go diff --git a/problems_backup/convert_bst_to_greater_tree/solution.java b/538-convert-bst-to-greater-tree/solution.java similarity index 100% rename from problems_backup/convert_bst_to_greater_tree/solution.java rename to 538-convert-bst-to-greater-tree/solution.java diff --git a/problems_backup/spiral_matrix/solution.go b/54-spiral-matrix/solution.go similarity index 100% rename from problems_backup/spiral_matrix/solution.go rename to 54-spiral-matrix/solution.go diff --git a/problems_backup/single_element_in_a_sorted_array/solution.go b/540-single-element-in-a-sorted-array/solution.go similarity index 100% rename from problems_backup/single_element_in_a_sorted_array/solution.go rename to 540-single-element-in-a-sorted-array/solution.go diff --git a/problems_backup/reverse_string_ii/solution.go b/541-reverse-string-ii/solution.go similarity index 100% rename from problems_backup/reverse_string_ii/solution.go rename to 541-reverse-string-ii/solution.go diff --git a/problems_backup/diameter_of_binary_tree/solution.go b/543-diameter-of-binary-tree/solution.go similarity index 100% rename from problems_backup/diameter_of_binary_tree/solution.go rename to 543-diameter-of-binary-tree/solution.go diff --git a/problems_backup/output_contest_matches/solution.go b/544-output-contest-matches/solution.go similarity index 100% rename from problems_backup/output_contest_matches/solution.go rename to 544-output-contest-matches/solution.go diff --git a/problems_backup/number_of_provinces/solution.go b/547-number-of-provinces/solution.go similarity index 100% rename from problems_backup/number_of_provinces/solution.go rename to 547-number-of-provinces/solution.go diff --git a/problems_backup/jump_game/solution.go b/55-jump-game/solution.go similarity index 100% rename from problems_backup/jump_game/solution.go rename to 55-jump-game/solution.go diff --git a/problems_backup/student_attendance_record_i/solution.java b/551-student-attendance-record-i/solution.java similarity index 100% rename from problems_backup/student_attendance_record_i/solution.java rename to 551-student-attendance-record-i/solution.java diff --git a/problems_backup/optimal_division/solution.go b/553-optimal-division/solution.go similarity index 100% rename from problems_backup/optimal_division/solution.go rename to 553-optimal-division/solution.go diff --git a/problems_backup/brick_wall/solution.go b/554-brick-wall/solution.go similarity index 100% rename from problems_backup/brick_wall/solution.go rename to 554-brick-wall/solution.go diff --git a/problems_backup/reverse_words_in_a_string_iii/solution.java b/557-reverse-words-in-a-string-iii/solution.java similarity index 100% rename from problems_backup/reverse_words_in_a_string_iii/solution.java rename to 557-reverse-words-in-a-string-iii/solution.java diff --git a/problems_backup/merge_intervals/solution.go b/56-merge-intervals/solution.go similarity index 100% rename from problems_backup/merge_intervals/solution.go rename to 56-merge-intervals/solution.go diff --git a/problems_backup/subarray_sum_equals_k/solution.go b/560-subarray-sum-equals-k/solution.go similarity index 100% rename from problems_backup/subarray_sum_equals_k/solution.go rename to 560-subarray-sum-equals-k/solution.go diff --git a/problems_backup/binary_tree_tilt/solution.go b/563-binary-tree-tilt/solution.go similarity index 100% rename from problems_backup/binary_tree_tilt/solution.go rename to 563-binary-tree-tilt/solution.go diff --git a/problems_backup/reshape_the_matrix/solution.go b/566-reshape-the-matrix/solution.go similarity index 100% rename from problems_backup/reshape_the_matrix/solution.go rename to 566-reshape-the-matrix/solution.go diff --git a/problems_backup/permutation_in_string/solution.go b/567-permutation-in-string/solution.go similarity index 100% rename from problems_backup/permutation_in_string/solution.go rename to 567-permutation-in-string/solution.go diff --git a/problems_backup/subtree_of_another_tree/solution.go b/572-subtree-of-another-tree/solution.go similarity index 100% rename from problems_backup/subtree_of_another_tree/solution.go rename to 572-subtree-of-another-tree/solution.go diff --git a/problems_backup/distribute_candies/solution.java b/575-distribute-candies/solution.java similarity index 100% rename from problems_backup/distribute_candies/solution.java rename to 575-distribute-candies/solution.java diff --git a/problems_backup/out_of_boundary_paths/solution.go b/576-out-of-boundary-paths/solution.go similarity index 100% rename from problems_backup/out_of_boundary_paths/solution.go rename to 576-out-of-boundary-paths/solution.go diff --git a/problems_backup/length_of_last_word/solution.go b/58-length-of-last-word/solution.go similarity index 100% rename from problems_backup/length_of_last_word/solution.go rename to 58-length-of-last-word/solution.go diff --git a/problems_backup/length_of_last_word/solution.java b/58-length-of-last-word/solution.java similarity index 100% rename from problems_backup/length_of_last_word/solution.java rename to 58-length-of-last-word/solution.java diff --git a/problems_backup/kill_process/solution.go b/582-kill-process/solution.go similarity index 100% rename from problems_backup/kill_process/solution.go rename to 582-kill-process/solution.go diff --git a/problems_backup/find_customer_referee/solution.sql b/584-find-customer-referee/solution.sql similarity index 100% rename from problems_backup/find_customer_referee/solution.sql rename to 584-find-customer-referee/solution.sql diff --git a/problems_backup/spiral_matrix_ii/solution.go b/59-spiral-matrix-ii/solution.go similarity index 100% rename from problems_backup/spiral_matrix_ii/solution.go rename to 59-spiral-matrix-ii/solution.go diff --git a/problems_backup/valid_square/solution.java b/593-valid-square/solution.java similarity index 100% rename from problems_backup/valid_square/solution.java rename to 593-valid-square/solution.java diff --git a/problems_backup/big_countries/solution.sql b/595-big-countries/solution.sql similarity index 100% rename from problems_backup/big_countries/solution.sql rename to 595-big-countries/solution.sql diff --git a/problems_backup/range_addition_ii/solution.go b/598-range-addition-ii/solution.go similarity index 100% rename from problems_backup/range_addition_ii/solution.go rename to 598-range-addition-ii/solution.go diff --git a/problems_backup/minimum_index_sum_of_two_lists/solution.go b/599-minimum-index-sum-of-two-lists/solution.go similarity index 100% rename from problems_backup/minimum_index_sum_of_two_lists/solution.go rename to 599-minimum-index-sum-of-two-lists/solution.go diff --git a/problems_backup/zigzag_conversion/solution.go b/6-zigzag-conversion/solution.go similarity index 100% rename from problems_backup/zigzag_conversion/solution.go rename to 6-zigzag-conversion/solution.go diff --git a/problems_backup/can_place_flowers/solution.go b/605-can-place-flowers/solution.go similarity index 100% rename from problems_backup/can_place_flowers/solution.go rename to 605-can-place-flowers/solution.go diff --git a/problems_backup/can_place_flowers/solution.java b/605-can-place-flowers/solution.java similarity index 100% rename from problems_backup/can_place_flowers/solution.java rename to 605-can-place-flowers/solution.java diff --git a/problems_backup/construct_string_from_binary_tree/solution.go b/606-construct-string-from-binary-tree/solution.go similarity index 100% rename from problems_backup/construct_string_from_binary_tree/solution.go rename to 606-construct-string-from-binary-tree/solution.go diff --git a/problems_backup/rotate_list/solution.go b/61-rotate-list/solution.go similarity index 100% rename from problems_backup/rotate_list/solution.go rename to 61-rotate-list/solution.go diff --git a/problems_backup/merge_two_binary_trees/solution.java b/617-merge-two-binary-trees/solution.java similarity index 100% rename from problems_backup/merge_two_binary_trees/solution.java rename to 617-merge-two-binary-trees/solution.java diff --git a/problems_backup/unique_paths/solution.go b/62-unique-paths/solution.go similarity index 100% rename from problems_backup/unique_paths/solution.go rename to 62-unique-paths/solution.go diff --git a/problems_backup/add_one_row_to_tree/solution.go b/623-add-one-row-to-tree/solution.go similarity index 100% rename from problems_backup/add_one_row_to_tree/solution.go rename to 623-add-one-row-to-tree/solution.go diff --git a/problems_backup/maximum_product_of_three_numbers/solution.go b/628-maximum-product-of-three-numbers/solution.go similarity index 100% rename from problems_backup/maximum_product_of_three_numbers/solution.go rename to 628-maximum-product-of-three-numbers/solution.go diff --git a/problems_backup/unique_paths_ii/solution.go b/63-unique-paths-ii/solution.go similarity index 100% rename from problems_backup/unique_paths_ii/solution.go rename to 63-unique-paths-ii/solution.go diff --git a/problems_backup/sum_of_square_numbers/solution.go b/633-sum-of-square-numbers/solution.go similarity index 100% rename from problems_backup/sum_of_square_numbers/solution.go rename to 633-sum-of-square-numbers/solution.go diff --git a/problems_backup/average_of_levels_in_binary_tree/solution.go b/637-average-of-levels-in-binary-tree/solution.go similarity index 100% rename from problems_backup/average_of_levels_in_binary_tree/solution.go rename to 637-average-of-levels-in-binary-tree/solution.go diff --git a/problems_backup/minimum_path_sum/solution.go b/64-minimum-path-sum/solution.go similarity index 100% rename from problems_backup/minimum_path_sum/solution.go rename to 64-minimum-path-sum/solution.go diff --git a/problems_backup/maximum_average_subarray_i/solution.go b/643-maximum-average-subarray-i/solution.go similarity index 100% rename from problems_backup/maximum_average_subarray_i/solution.go rename to 643-maximum-average-subarray-i/solution.go diff --git a/problems_backup/set_mismatch/solution.go b/645-set-mismatch/solution.go similarity index 100% rename from problems_backup/set_mismatch/solution.go rename to 645-set-mismatch/solution.go diff --git a/problems_backup/maximum_length_of_pair_chain/solution.go b/646-maximum-length-of-pair-chain/solution.go similarity index 100% rename from problems_backup/maximum_length_of_pair_chain/solution.go rename to 646-maximum-length-of-pair-chain/solution.go diff --git a/problems_backup/palindromic_substrings/solution.go b/647-palindromic-substrings/solution.go similarity index 100% rename from problems_backup/palindromic_substrings/solution.go rename to 647-palindromic-substrings/solution.go diff --git a/problems_backup/replace_words/solution.go b/648-replace-words/solution.go similarity index 100% rename from problems_backup/replace_words/solution.go rename to 648-replace-words/solution.go diff --git a/problems_backup/two_sum_iv_-_input_is_a_bst/solution.java b/653-two-sum-iv---input-is-a-bst/solution.java similarity index 100% rename from problems_backup/two_sum_iv_-_input_is_a_bst/solution.java rename to 653-two-sum-iv---input-is-a-bst/solution.java diff --git a/problems_backup/maximum_binary_tree/solution.go b/654-maximum-binary-tree/solution.go similarity index 100% rename from problems_backup/maximum_binary_tree/solution.go rename to 654-maximum-binary-tree/solution.go diff --git a/problems_backup/robot_return_to_origin/solution.go b/657-robot-return-to-origin/solution.go similarity index 100% rename from problems_backup/robot_return_to_origin/solution.go rename to 657-robot-return-to-origin/solution.go diff --git a/problems_backup/robot_return_to_origin/solution.java b/657-robot-return-to-origin/solution.java similarity index 100% rename from problems_backup/robot_return_to_origin/solution.java rename to 657-robot-return-to-origin/solution.java diff --git a/problems_backup/find_k_closest_elements/solution.go b/658-find-k-closest-elements/solution.go similarity index 100% rename from problems_backup/find_k_closest_elements/solution.go rename to 658-find-k-closest-elements/solution.go diff --git a/problems_backup/plus_one/solution.java b/66-plus-one/solution.java similarity index 100% rename from problems_backup/plus_one/solution.java rename to 66-plus-one/solution.java diff --git a/problems_backup/remove_9/solution.go b/660-remove-9/solution.go similarity index 100% rename from problems_backup/remove_9/solution.go rename to 660-remove-9/solution.go diff --git a/problems_backup/non-decreasing_array/solution.java b/665-non-decreasing-array/solution.java similarity index 100% rename from problems_backup/non-decreasing_array/solution.java rename to 665-non-decreasing-array/solution.java diff --git a/problems_backup/path_sum_iv/solution.go b/666-path-sum-iv/solution.go similarity index 100% rename from problems_backup/path_sum_iv/solution.go rename to 666-path-sum-iv/solution.go diff --git a/problems_backup/add_binary/solution.java b/67-add-binary/solution.java similarity index 100% rename from problems_backup/add_binary/solution.java rename to 67-add-binary/solution.java diff --git a/problems_backup/second_minimum_node_in_a_binary_tree/solution.java b/671-second-minimum-node-in-a-binary-tree/solution.java similarity index 100% rename from problems_backup/second_minimum_node_in_a_binary_tree/solution.java rename to 671-second-minimum-node-in-a-binary-tree/solution.java diff --git a/problems_backup/longest_continuous_increasing_subsequence/solution.java b/674-longest-continuous-increasing-subsequence/solution.java similarity index 100% rename from problems_backup/longest_continuous_increasing_subsequence/solution.java rename to 674-longest-continuous-increasing-subsequence/solution.java diff --git a/problems_backup/implement_magic_dictionary/solution.go b/676-implement-magic-dictionary/solution.go similarity index 100% rename from problems_backup/implement_magic_dictionary/solution.go rename to 676-implement-magic-dictionary/solution.go diff --git a/problems_backup/map_sum_pairs/solution.go b/677-map-sum-pairs/solution.go similarity index 100% rename from problems_backup/map_sum_pairs/solution.go rename to 677-map-sum-pairs/solution.go diff --git a/problems_backup/text_justification/solution.go b/68-text-justification/solution.go similarity index 100% rename from problems_backup/text_justification/solution.go rename to 68-text-justification/solution.go diff --git a/problems_backup/valid_palindrome_ii/solution.go b/680-valid-palindrome-ii/solution.go similarity index 100% rename from problems_backup/valid_palindrome_ii/solution.go rename to 680-valid-palindrome-ii/solution.go diff --git a/problems_backup/baseball_game/solution.go b/682-baseball-game/solution.go similarity index 100% rename from problems_backup/baseball_game/solution.go rename to 682-baseball-game/solution.go diff --git a/problems_backup/baseball_game/solution.java b/682-baseball-game/solution.java similarity index 100% rename from problems_backup/baseball_game/solution.java rename to 682-baseball-game/solution.java diff --git a/problems_backup/redundant_connection/solution.go b/684-redundant-connection/solution.go similarity index 100% rename from problems_backup/redundant_connection/solution.go rename to 684-redundant-connection/solution.go diff --git a/problems_backup/sqrt(x)/solution.java b/69-sqrt(x)/solution.java similarity index 100% rename from problems_backup/sqrt(x)/solution.java rename to 69-sqrt(x)/solution.java diff --git a/problems_backup/employee_importance/solution.java b/690-employee-importance/solution.java similarity index 100% rename from problems_backup/employee_importance/solution.java rename to 690-employee-importance/solution.java diff --git a/problems_backup/top_k_frequent_words/solution.go b/692-top-k-frequent-words/solution.go similarity index 100% rename from problems_backup/top_k_frequent_words/solution.go rename to 692-top-k-frequent-words/solution.go diff --git a/problems_backup/binary_number_with_alternating_bits/solution.go b/693-binary-number-with-alternating-bits/solution.go similarity index 100% rename from problems_backup/binary_number_with_alternating_bits/solution.go rename to 693-binary-number-with-alternating-bits/solution.go diff --git a/problems_backup/number_of_distinct_islands/solution.go b/694-number-of-distinct-islands/solution.go similarity index 100% rename from problems_backup/number_of_distinct_islands/solution.go rename to 694-number-of-distinct-islands/solution.go diff --git a/problems_backup/max_area_of_island/solution.go b/695-max-area-of-island/solution.go similarity index 100% rename from problems_backup/max_area_of_island/solution.go rename to 695-max-area-of-island/solution.go diff --git a/problems_backup/degree_of_an_array/solution.go b/697-degree-of-an-array/solution.go similarity index 100% rename from problems_backup/degree_of_an_array/solution.go rename to 697-degree-of-an-array/solution.go diff --git a/problems_backup/reverse_integer/solution.go b/7-reverse-integer/solution.go similarity index 100% rename from problems_backup/reverse_integer/solution.go rename to 7-reverse-integer/solution.go diff --git a/problems_backup/reverse_integer/solution.java b/7-reverse-integer/solution.java similarity index 100% rename from problems_backup/reverse_integer/solution.java rename to 7-reverse-integer/solution.java diff --git a/problems_backup/climbing_stairs/solution.go b/70-climbing-stairs/solution.go similarity index 100% rename from problems_backup/climbing_stairs/solution.go rename to 70-climbing-stairs/solution.go diff --git a/problems_backup/climbing_stairs/solution.java b/70-climbing-stairs/solution.java similarity index 100% rename from problems_backup/climbing_stairs/solution.java rename to 70-climbing-stairs/solution.java diff --git a/problems_backup/1-bit_and_2-bit_characters/solution.go b/717-1-bit-and-2-bit-characters/solution.go similarity index 100% rename from problems_backup/1-bit_and_2-bit_characters/solution.go rename to 717-1-bit-and-2-bit-characters/solution.go diff --git a/problems_backup/longest_word_in_dictionary/solution.go b/720-longest-word-in-dictionary/solution.go similarity index 100% rename from problems_backup/longest_word_in_dictionary/solution.go rename to 720-longest-word-in-dictionary/solution.go diff --git a/problems_backup/find_pivot_index/solution.go b/724-find-pivot-index/solution.go similarity index 100% rename from problems_backup/find_pivot_index/solution.go rename to 724-find-pivot-index/solution.go diff --git a/problems_backup/split_linked_list_in_parts/solution.go b/725-split-linked-list-in-parts/solution.go similarity index 100% rename from problems_backup/split_linked_list_in_parts/solution.go rename to 725-split-linked-list-in-parts/solution.go diff --git a/problems_backup/number_of_atoms/solution.go b/726-number-of-atoms/solution.go similarity index 100% rename from problems_backup/number_of_atoms/solution.go rename to 726-number-of-atoms/solution.go diff --git a/problems_backup/self_dividing_numbers/solution.java b/728-self-dividing-numbers/solution.java similarity index 100% rename from problems_backup/self_dividing_numbers/solution.java rename to 728-self-dividing-numbers/solution.java diff --git a/problems_backup/set_matrix_zeroes/solution.go b/73-set-matrix-zeroes/solution.go similarity index 100% rename from problems_backup/set_matrix_zeroes/solution.go rename to 73-set-matrix-zeroes/solution.go diff --git a/problems_backup/flood_fill/solution.go b/733-flood-fill/solution.go similarity index 100% rename from problems_backup/flood_fill/solution.go rename to 733-flood-fill/solution.go diff --git a/problems_backup/sentence_similarity/solution.go b/734-sentence-similarity/solution.go similarity index 100% rename from problems_backup/sentence_similarity/solution.go rename to 734-sentence-similarity/solution.go diff --git a/problems_backup/asteroid_collision/solution.go b/735-asteroid-collision/solution.go similarity index 100% rename from problems_backup/asteroid_collision/solution.go rename to 735-asteroid-collision/solution.go diff --git a/problems_backup/daily_temperatures/solution.go b/739-daily-temperatures/solution.go similarity index 100% rename from problems_backup/daily_temperatures/solution.go rename to 739-daily-temperatures/solution.go diff --git a/problems_backup/search_a_2d_matrix/solution.go b/74-search-a-2d-matrix/solution.go similarity index 100% rename from problems_backup/search_a_2d_matrix/solution.go rename to 74-search-a-2d-matrix/solution.go diff --git a/problems_backup/to_lower_case/solution.java b/742-to-lower-case/solution.java similarity index 100% rename from problems_backup/to_lower_case/solution.java rename to 742-to-lower-case/solution.java diff --git a/problems_backup/find_smallest_letter_greater_than_target/solution.go b/745-find-smallest-letter-greater-than-target/solution.go similarity index 100% rename from problems_backup/find_smallest_letter_greater_than_target/solution.go rename to 745-find-smallest-letter-greater-than-target/solution.go diff --git a/problems_backup/min_cost_climbing_stairs/solution.go b/747-min-cost-climbing-stairs/solution.go similarity index 100% rename from problems_backup/min_cost_climbing_stairs/solution.go rename to 747-min-cost-climbing-stairs/solution.go diff --git a/problems_backup/largest_number_at_least_twice_of_others/solution.go b/748-largest-number-at-least-twice-of-others/solution.go similarity index 100% rename from problems_backup/largest_number_at_least_twice_of_others/solution.go rename to 748-largest-number-at-least-twice-of-others/solution.go diff --git a/problems_backup/shortest_completing_word/solution.go b/749-shortest-completing-word/solution.go similarity index 100% rename from problems_backup/shortest_completing_word/solution.go rename to 749-shortest-completing-word/solution.go diff --git a/problems_backup/sort_colors/solution.go b/75-sort-colors/solution.go similarity index 100% rename from problems_backup/sort_colors/solution.go rename to 75-sort-colors/solution.go diff --git a/problems_backup/employee_free_time/solution.go b/761-employee-free-time/solution.go similarity index 100% rename from problems_backup/employee_free_time/solution.go rename to 761-employee-free-time/solution.go diff --git a/problems_backup/find_anagram_mappings/solution.go b/762-find-anagram-mappings/solution.go similarity index 100% rename from problems_backup/find_anagram_mappings/solution.go rename to 762-find-anagram-mappings/solution.go diff --git a/problems_backup/n-ary_tree_level_order_traversal/solution.go b/764-n-ary-tree-level-order-traversal/solution.go similarity index 100% rename from problems_backup/n-ary_tree_level_order_traversal/solution.go rename to 764-n-ary-tree-level-order-traversal/solution.go diff --git a/problems_backup/serialize_and_deserialize_n-ary_tree/solution.go b/765-serialize-and-deserialize-n-ary-tree/solution.go similarity index 100% rename from problems_backup/serialize_and_deserialize_n-ary_tree/solution.go rename to 765-serialize-and-deserialize-n-ary-tree/solution.go diff --git a/problems_backup/prime_number_of_set_bits_in_binary_representation/solution.java b/767-prime-number-of-set-bits-in-binary-representation/solution.java similarity index 100% rename from problems_backup/prime_number_of_set_bits_in_binary_representation/solution.java rename to 767-prime-number-of-set-bits-in-binary-representation/solution.java diff --git a/problems_backup/partition_labels/solution.go b/768-partition-labels/solution.go similarity index 100% rename from problems_backup/partition_labels/solution.go rename to 768-partition-labels/solution.go diff --git a/problems_backup/combinations/solution.go b/77-combinations/solution.go similarity index 100% rename from problems_backup/combinations/solution.go rename to 77-combinations/solution.go diff --git a/problems_backup/maximum_depth_of_n-ary_tree/solution.java b/774-maximum-depth-of-n-ary-tree/solution.java similarity index 100% rename from problems_backup/maximum_depth_of_n-ary_tree/solution.java rename to 774-maximum-depth-of-n-ary-tree/solution.java diff --git a/problems_backup/n-ary_tree_preorder_traversal/solution.go b/775-n-ary-tree-preorder-traversal/solution.go similarity index 100% rename from problems_backup/n-ary_tree_preorder_traversal/solution.go rename to 775-n-ary-tree-preorder-traversal/solution.go diff --git a/problems_backup/n-ary_tree_postorder_traversal/solution.go b/776-n-ary-tree-postorder-traversal/solution.go similarity index 100% rename from problems_backup/n-ary_tree_postorder_traversal/solution.go rename to 776-n-ary-tree-postorder-traversal/solution.go diff --git a/problems_backup/toeplitz_matrix/solution.go b/777-toeplitz-matrix/solution.go similarity index 100% rename from problems_backup/toeplitz_matrix/solution.go rename to 777-toeplitz-matrix/solution.go diff --git a/problems_backup/subsets/solution.go b/78-subsets/solution.go similarity index 100% rename from problems_backup/subsets/solution.go rename to 78-subsets/solution.go diff --git a/problems_backup/jewels_and_stones/solution.java b/782-jewels-and-stones/solution.java similarity index 100% rename from problems_backup/jewels_and_stones/solution.java rename to 782-jewels-and-stones/solution.java diff --git a/problems_backup/search_in_a_binary_search_tree/solution.java b/783-search-in-a-binary-search-tree/solution.java similarity index 100% rename from problems_backup/search_in_a_binary_search_tree/solution.java rename to 783-search-in-a-binary-search-tree/solution.java diff --git a/problems_backup/insert_into_a_binary_search_tree/solution.go b/784-insert-into-a-binary-search-tree/solution.go similarity index 100% rename from problems_backup/insert_into_a_binary_search_tree/solution.go rename to 784-insert-into-a-binary-search-tree/solution.go diff --git a/problems_backup/kth_largest_element_in_a_stream/solution.go b/789-kth-largest-element-in-a-stream/solution.go similarity index 100% rename from problems_backup/kth_largest_element_in_a_stream/solution.go rename to 789-kth-largest-element-in-a-stream/solution.go diff --git a/problems_backup/word_search/solution.go b/79-word-search/solution.go similarity index 100% rename from problems_backup/word_search/solution.go rename to 79-word-search/solution.go diff --git a/problems_backup/binary_search/solution.go b/792-binary-search/solution.go similarity index 100% rename from problems_backup/binary_search/solution.go rename to 792-binary-search/solution.go diff --git a/problems_backup/swim_in_rising_water/solution.go b/794-swim-in-rising-water/solution.go similarity index 100% rename from problems_backup/swim_in_rising_water/solution.go rename to 794-swim-in-rising-water/solution.go diff --git a/problems_backup/rabbits_in_forest/solution.go b/797-rabbits-in-forest/solution.go similarity index 100% rename from problems_backup/rabbits_in_forest/solution.go rename to 797-rabbits-in-forest/solution.go diff --git a/problems_backup/minimum_distance_between_bst_nodes/solution.go b/799-minimum-distance-between-bst-nodes/solution.go similarity index 100% rename from problems_backup/minimum_distance_between_bst_nodes/solution.go rename to 799-minimum-distance-between-bst-nodes/solution.go diff --git a/problems_backup/string_to_integer_(atoi)/solution.go b/8-string-to-integer-(atoi)/solution.go similarity index 100% rename from problems_backup/string_to_integer_(atoi)/solution.go rename to 8-string-to-integer-(atoi)/solution.go diff --git a/problems_backup/remove_duplicates_from_sorted_array_ii/solution.go b/80-remove-duplicates-from-sorted-array-ii/solution.go similarity index 100% rename from problems_backup/remove_duplicates_from_sorted_array_ii/solution.go rename to 80-remove-duplicates-from-sorted-array-ii/solution.go diff --git a/problems_backup/letter_case_permutation/solution.go b/800-letter-case-permutation/solution.go similarity index 100% rename from problems_backup/letter_case_permutation/solution.go rename to 800-letter-case-permutation/solution.go diff --git a/problems_backup/custom_sort_string/solution.go b/807-custom-sort-string/solution.go similarity index 100% rename from problems_backup/custom_sort_string/solution.go rename to 807-custom-sort-string/solution.go diff --git a/problems_backup/search_in_rotated_sorted_array_ii/solution.go b/81-search-in-rotated-sorted-array-ii/solution.go similarity index 100% rename from problems_backup/search_in_rotated_sorted_array_ii/solution.go rename to 81-search-in-rotated-sorted-array-ii/solution.go diff --git a/problems_backup/rotate_string/solution.java b/812-rotate-string/solution.java similarity index 100% rename from problems_backup/rotate_string/solution.java rename to 812-rotate-string/solution.java diff --git a/problems_backup/all_paths_from_source_to_target/solution.go b/813-all-paths-from-source-to-target/solution.go similarity index 100% rename from problems_backup/all_paths_from_source_to_target/solution.go rename to 813-all-paths-from-source-to-target/solution.go diff --git a/problems_backup/design_hashset/solution.go b/816-design-hashset/solution.go similarity index 100% rename from problems_backup/design_hashset/solution.go rename to 816-design-hashset/solution.go diff --git a/problems_backup/design_hashmap/solution.go b/817-design-hashmap/solution.go similarity index 100% rename from problems_backup/design_hashmap/solution.go rename to 817-design-hashmap/solution.go diff --git a/problems_backup/remove_duplicates_from_sorted_list_ii/solution.go b/82-remove-duplicates-from-sorted-list-ii/solution.go similarity index 100% rename from problems_backup/remove_duplicates_from_sorted_list_ii/solution.go rename to 82-remove-duplicates-from-sorted-list-ii/solution.go diff --git a/problems_backup/unique_morse_code_words/solution.go b/822-unique-morse-code-words/solution.go similarity index 100% rename from problems_backup/unique_morse_code_words/solution.go rename to 822-unique-morse-code-words/solution.go diff --git a/problems_backup/number_of_lines_to_write_string/solution.go b/824-number-of-lines-to-write-string/solution.go similarity index 100% rename from problems_backup/number_of_lines_to_write_string/solution.go rename to 824-number-of-lines-to-write-string/solution.go diff --git a/problems_backup/max_increase_to_keep_city_skyline/solution.go b/825-max-increase-to-keep-city-skyline/solution.go similarity index 100% rename from problems_backup/max_increase_to_keep_city_skyline/solution.go rename to 825-max-increase-to-keep-city-skyline/solution.go diff --git a/problems_backup/expressive_words/solution.go b/827-expressive-words/solution.go similarity index 100% rename from problems_backup/expressive_words/solution.go rename to 827-expressive-words/solution.go diff --git a/problems_backup/subdomain_visit_count/solution.java b/829-subdomain-visit-count/solution.java similarity index 100% rename from problems_backup/subdomain_visit_count/solution.java rename to 829-subdomain-visit-count/solution.java diff --git a/problems_backup/remove_duplicates_from_sorted_list/solution.go b/83-remove-duplicates-from-sorted-list/solution.go similarity index 100% rename from problems_backup/remove_duplicates_from_sorted_list/solution.go rename to 83-remove-duplicates-from-sorted-list/solution.go diff --git a/problems_backup/binary_tree_pruning/solution.go b/832-binary-tree-pruning/solution.go similarity index 100% rename from problems_backup/binary_tree_pruning/solution.go rename to 832-binary-tree-pruning/solution.go diff --git a/problems_backup/linked_list_components/solution.go b/835-linked-list-components/solution.go similarity index 100% rename from problems_backup/linked_list_components/solution.go rename to 835-linked-list-components/solution.go diff --git a/problems_backup/most_common_word/solution.go b/837-most-common-word/solution.go similarity index 100% rename from problems_backup/most_common_word/solution.go rename to 837-most-common-word/solution.go diff --git a/problems_backup/largest_rectangle_in_histogram/solution.go b/84-largest-rectangle-in-histogram/solution.go similarity index 100% rename from problems_backup/largest_rectangle_in_histogram/solution.go rename to 84-largest-rectangle-in-histogram/solution.go diff --git a/problems_backup/shortest_distance_to_a_character/solution.java b/841-shortest-distance-to-a-character/solution.java similarity index 100% rename from problems_backup/shortest_distance_to_a_character/solution.java rename to 841-shortest-distance-to-a-character/solution.java diff --git a/problems_backup/goat_latin/solution.go b/851-goat-latin/solution.go similarity index 100% rename from problems_backup/goat_latin/solution.go rename to 851-goat-latin/solution.go diff --git a/problems_backup/most_profit_assigning_work/solution.go b/853-most-profit-assigning-work/solution.go similarity index 100% rename from problems_backup/most_profit_assigning_work/solution.go rename to 853-most-profit-assigning-work/solution.go diff --git a/problems_backup/making_a_large_island/solution.go b/854-making-a-large-island/solution.go similarity index 100% rename from problems_backup/making_a_large_island/solution.go rename to 854-making-a-large-island/solution.go diff --git a/problems_backup/positions_of_large_groups/solution.java b/857-positions-of-large-groups/solution.java similarity index 100% rename from problems_backup/positions_of_large_groups/solution.java rename to 857-positions-of-large-groups/solution.java diff --git a/problems_backup/design_circular_deque/solution.go b/859-design-circular-deque/solution.go similarity index 100% rename from problems_backup/design_circular_deque/solution.go rename to 859-design-circular-deque/solution.go diff --git a/problems_backup/partition_list/solution.go b/86-partition-list/solution.go similarity index 100% rename from problems_backup/partition_list/solution.go rename to 86-partition-list/solution.go diff --git a/problems_backup/design_circular_queue/solution.go b/860-design-circular-queue/solution.go similarity index 100% rename from problems_backup/design_circular_queue/solution.go rename to 860-design-circular-queue/solution.go diff --git a/problems_backup/flipping_an_image/solution.java b/861-flipping-an-image/solution.java similarity index 100% rename from problems_backup/flipping_an_image/solution.java rename to 861-flipping-an-image/solution.java diff --git a/problems_backup/find_and_replace_in_string/solution.go b/862-find-and-replace-in-string/solution.go similarity index 100% rename from problems_backup/find_and_replace_in_string/solution.go rename to 862-find-and-replace-in-string/solution.go diff --git a/problems_backup/rectangle_overlap/solution.go b/866-rectangle-overlap/solution.go similarity index 100% rename from problems_backup/rectangle_overlap/solution.go rename to 866-rectangle-overlap/solution.go diff --git a/problems_backup/rectangle_overlap/solution.java b/866-rectangle-overlap/solution.java similarity index 100% rename from problems_backup/rectangle_overlap/solution.java rename to 866-rectangle-overlap/solution.java diff --git a/problems_backup/scramble_string/solution.go b/87-scramble-string/solution.go similarity index 100% rename from problems_backup/scramble_string/solution.go rename to 87-scramble-string/solution.go diff --git a/problems_backup/keys_and_rooms/solution.go b/871-keys-and-rooms/solution.go similarity index 100% rename from problems_backup/keys_and_rooms/solution.go rename to 871-keys-and-rooms/solution.go diff --git a/problems_backup/backspace_string_compare/solution.go b/874-backspace-string-compare/solution.go similarity index 100% rename from problems_backup/backspace_string_compare/solution.go rename to 874-backspace-string-compare/solution.go diff --git a/problems_backup/backspace_string_compare/solution.java b/874-backspace-string-compare/solution.java similarity index 100% rename from problems_backup/backspace_string_compare/solution.java rename to 874-backspace-string-compare/solution.java diff --git a/problems_backup/hand_of_straights/solution.java b/876-hand-of-straights/solution.java similarity index 100% rename from problems_backup/hand_of_straights/solution.java rename to 876-hand-of-straights/solution.java diff --git a/problems_backup/shifting_letters/solution.go b/878-shifting-letters/solution.go similarity index 100% rename from problems_backup/shifting_letters/solution.go rename to 878-shifting-letters/solution.go diff --git a/problems_backup/maximize_distance_to_closest_person/solution.go b/879-maximize-distance-to-closest-person/solution.go similarity index 100% rename from problems_backup/maximize_distance_to_closest_person/solution.go rename to 879-maximize-distance-to-closest-person/solution.go diff --git a/problems_backup/merge_sorted_array/solution.java b/88-merge-sorted-array/solution.java similarity index 100% rename from problems_backup/merge_sorted_array/solution.java rename to 88-merge-sorted-array/solution.java diff --git a/problems_backup/peak_index_in_a_mountain_array/solution.go b/882-peak-index-in-a-mountain-array/solution.go similarity index 100% rename from problems_backup/peak_index_in_a_mountain_array/solution.go rename to 882-peak-index-in-a-mountain-array/solution.go diff --git a/problems_backup/peak_index_in_a_mountain_array/solution.java b/882-peak-index-in-a-mountain-array/solution.java similarity index 100% rename from problems_backup/peak_index_in_a_mountain_array/solution.java rename to 882-peak-index-in-a-mountain-array/solution.java diff --git a/problems_backup/score_of_parentheses/solution.go b/886-score-of-parentheses/solution.go similarity index 100% rename from problems_backup/score_of_parentheses/solution.go rename to 886-score-of-parentheses/solution.go diff --git a/problems_backup/buddy_strings/solution.go b/889-buddy-strings/solution.go similarity index 100% rename from problems_backup/buddy_strings/solution.go rename to 889-buddy-strings/solution.go diff --git a/problems_backup/lemonade_change/solution.java b/890-lemonade-change/solution.java similarity index 100% rename from problems_backup/lemonade_change/solution.java rename to 890-lemonade-change/solution.java diff --git a/problems_backup/transpose_matrix/solution.go b/898-transpose-matrix/solution.go similarity index 100% rename from problems_backup/transpose_matrix/solution.go rename to 898-transpose-matrix/solution.go diff --git a/problems_backup/transpose_matrix/solution.java b/898-transpose-matrix/solution.java similarity index 100% rename from problems_backup/transpose_matrix/solution.java rename to 898-transpose-matrix/solution.java diff --git a/problems_backup/binary_gap/solution.go b/899-binary-gap/solution.go similarity index 100% rename from problems_backup/binary_gap/solution.go rename to 899-binary-gap/solution.go diff --git a/problems_backup/palindrome_number/solution.java b/9-palindrome-number/solution.java similarity index 100% rename from problems_backup/palindrome_number/solution.java rename to 9-palindrome-number/solution.java diff --git a/problems_backup/reordered_power_of_2/solution.go b/900-reordered-power-of-2/solution.go similarity index 100% rename from problems_backup/reordered_power_of_2/solution.go rename to 900-reordered-power-of-2/solution.go diff --git a/problems_backup/leaf-similar_trees/solution.java b/904-leaf-similar-trees/solution.java similarity index 100% rename from problems_backup/leaf-similar_trees/solution.java rename to 904-leaf-similar-trees/solution.java diff --git a/problems_backup/walking_robot_simulation/solution.go b/906-walking-robot-simulation/solution.go similarity index 100% rename from problems_backup/walking_robot_simulation/solution.go rename to 906-walking-robot-simulation/solution.go diff --git a/problems_backup/koko_eating_bananas/solution.go b/907-koko-eating-bananas/solution.go similarity index 100% rename from problems_backup/koko_eating_bananas/solution.go rename to 907-koko-eating-bananas/solution.go diff --git a/problems_backup/middle_of_the_linked_list/solution.go b/908-middle-of-the-linked-list/solution.go similarity index 100% rename from problems_backup/middle_of_the_linked_list/solution.go rename to 908-middle-of-the-linked-list/solution.go diff --git a/problems_backup/stone_game/solution.go b/909-stone-game/solution.go similarity index 100% rename from problems_backup/stone_game/solution.go rename to 909-stone-game/solution.go diff --git a/problems_backup/boats_to_save_people/solution.go b/917-boats-to-save-people/solution.go similarity index 100% rename from problems_backup/boats_to_save_people/solution.go rename to 917-boats-to-save-people/solution.go diff --git a/problems_backup/projection_area_of_3d_shapes/solution.go b/919-projection-area-of-3d-shapes/solution.go similarity index 100% rename from problems_backup/projection_area_of_3d_shapes/solution.go rename to 919-projection-area-of-3d-shapes/solution.go diff --git a/problems_backup/reverse_linked_list_ii/solution.go b/92-reverse-linked-list-ii/solution.go similarity index 100% rename from problems_backup/reverse_linked_list_ii/solution.go rename to 92-reverse-linked-list-ii/solution.go diff --git a/problems_backup/uncommon_words_from_two_sentences/solution.java b/920-uncommon-words-from-two-sentences/solution.java similarity index 100% rename from problems_backup/uncommon_words_from_two_sentences/solution.java rename to 920-uncommon-words-from-two-sentences/solution.java diff --git a/problems_backup/fair_candy_swap/solution.go b/924-fair-candy-swap/solution.go similarity index 100% rename from problems_backup/fair_candy_swap/solution.go rename to 924-fair-candy-swap/solution.go diff --git a/problems_backup/find_and_replace_pattern/solution.java b/926-find-and-replace-pattern/solution.java similarity index 100% rename from problems_backup/find_and_replace_pattern/solution.java rename to 926-find-and-replace-pattern/solution.java diff --git a/problems_backup/surface_area_of_3d_shapes/solution.go b/928-surface-area-of-3d-shapes/solution.go similarity index 100% rename from problems_backup/surface_area_of_3d_shapes/solution.go rename to 928-surface-area-of-3d-shapes/solution.go diff --git a/problems_backup/monotonic_array/solution.java b/932-monotonic-array/solution.java similarity index 100% rename from problems_backup/monotonic_array/solution.java rename to 932-monotonic-array/solution.java diff --git a/problems_backup/increasing_order_search_tree/solution.java b/933-increasing-order-search-tree/solution.java similarity index 100% rename from problems_backup/increasing_order_search_tree/solution.java rename to 933-increasing-order-search-tree/solution.java diff --git a/problems_backup/binary_tree_inorder_traversal/solution.go b/94-binary-tree-inorder-traversal/solution.go similarity index 100% rename from problems_backup/binary_tree_inorder_traversal/solution.go rename to 94-binary-tree-inorder-traversal/solution.go diff --git a/problems_backup/sort_array_by_parity/solution.java b/941-sort-array-by-parity/solution.java similarity index 100% rename from problems_backup/sort_array_by_parity/solution.java rename to 941-sort-array-by-parity/solution.java diff --git a/problems_backup/smallest_range_i/solution.go b/944-smallest-range-i/solution.go similarity index 100% rename from problems_backup/smallest_range_i/solution.go rename to 944-smallest-range-i/solution.go diff --git a/problems_backup/sort_an_array/solution.go b/948-sort-an-array/solution.go similarity index 100% rename from problems_backup/sort_an_array/solution.go rename to 948-sort-an-array/solution.go diff --git a/problems_backup/x_of_a_kind_in_a_deck_of_cards/solution.go b/950-x-of-a-kind-in-a-deck-of-cards/solution.go similarity index 100% rename from problems_backup/x_of_a_kind_in_a_deck_of_cards/solution.go rename to 950-x-of-a-kind-in-a-deck-of-cards/solution.go diff --git a/problems_backup/partition_array_into_disjoint_intervals/solution.go b/951-partition-array-into-disjoint-intervals/solution.go similarity index 100% rename from problems_backup/partition_array_into_disjoint_intervals/solution.go rename to 951-partition-array-into-disjoint-intervals/solution.go diff --git a/problems_backup/word_subsets/solution.go b/952-word-subsets/solution.go similarity index 100% rename from problems_backup/word_subsets/solution.go rename to 952-word-subsets/solution.go diff --git a/problems_backup/reverse_only_letters/solution.java b/953-reverse-only-letters/solution.java similarity index 100% rename from problems_backup/reverse_only_letters/solution.java rename to 953-reverse-only-letters/solution.java diff --git a/problems_backup/minimum_add_to_make_parentheses_valid/solution.java b/957-minimum-add-to-make-parentheses-valid/solution.java similarity index 100% rename from problems_backup/minimum_add_to_make_parentheses_valid/solution.java rename to 957-minimum-add-to-make-parentheses-valid/solution.java diff --git a/problems_backup/sort_array_by_parity_ii/solution.java b/958-sort-array-by-parity-ii/solution.java similarity index 100% rename from problems_backup/sort_array_by_parity_ii/solution.java rename to 958-sort-array-by-parity-ii/solution.java diff --git a/problems_backup/long_pressed_name/solution.java b/961-long-pressed-name/solution.java similarity index 100% rename from problems_backup/long_pressed_name/solution.java rename to 961-long-pressed-name/solution.java diff --git a/problems_backup/unique_email_addresses/solution.go b/965-unique-email-addresses/solution.go similarity index 100% rename from problems_backup/unique_email_addresses/solution.go rename to 965-unique-email-addresses/solution.go diff --git a/problems_backup/minimum_falling_path_sum/solution.go b/967-minimum-falling-path-sum/solution.go similarity index 100% rename from problems_backup/minimum_falling_path_sum/solution.go rename to 967-minimum-falling-path-sum/solution.go diff --git a/problems_backup/number_of_recent_calls/solution.go b/969-number-of-recent-calls/solution.go similarity index 100% rename from problems_backup/number_of_recent_calls/solution.go rename to 969-number-of-recent-calls/solution.go diff --git a/problems_backup/shortest_bridge/solution.go b/971-shortest-bridge/solution.go similarity index 100% rename from problems_backup/shortest_bridge/solution.go rename to 971-shortest-bridge/solution.go diff --git a/problems_backup/range_sum_of_bst/solution.go b/975-range-sum-of-bst/solution.go similarity index 100% rename from problems_backup/range_sum_of_bst/solution.go rename to 975-range-sum-of-bst/solution.go diff --git a/problems_backup/range_sum_of_bst/solution.java b/975-range-sum-of-bst/solution.java similarity index 100% rename from problems_backup/range_sum_of_bst/solution.java rename to 975-range-sum-of-bst/solution.java diff --git a/problems_backup/valid_mountain_array/solution.go b/978-valid-mountain-array/solution.go similarity index 100% rename from problems_backup/valid_mountain_array/solution.go rename to 978-valid-mountain-array/solution.go diff --git a/problems_backup/valid_mountain_array/solution.java b/978-valid-mountain-array/solution.java similarity index 100% rename from problems_backup/valid_mountain_array/solution.java rename to 978-valid-mountain-array/solution.java diff --git a/problems_backup/di_string_match/solution.go b/979-di-string-match/solution.go similarity index 100% rename from problems_backup/di_string_match/solution.go rename to 979-di-string-match/solution.go diff --git a/problems_backup/di_string_match/solution.java b/979-di-string-match/solution.java similarity index 100% rename from problems_backup/di_string_match/solution.java rename to 979-di-string-match/solution.java diff --git a/problems_backup/validate_binary_search_tree/solution.go b/98-validate-binary-search-tree/solution.go similarity index 100% rename from problems_backup/validate_binary_search_tree/solution.go rename to 98-validate-binary-search-tree/solution.go diff --git a/problems_backup/delete_columns_to_make_sorted/solution.go b/981-delete-columns-to-make-sorted/solution.go similarity index 100% rename from problems_backup/delete_columns_to_make_sorted/solution.go rename to 981-delete-columns-to-make-sorted/solution.go diff --git a/problems_backup/validate_stack_sequences/solution.go b/983-validate-stack-sequences/solution.go similarity index 100% rename from problems_backup/validate_stack_sequences/solution.go rename to 983-validate-stack-sequences/solution.go diff --git a/problems_backup/verifying_an_alien_dictionary/solution.go b/990-verifying-an-alien-dictionary/solution.go similarity index 100% rename from problems_backup/verifying_an_alien_dictionary/solution.go rename to 990-verifying-an-alien-dictionary/solution.go diff --git a/problems_backup/check_completeness_of_a_binary_tree/solution.go b/998-check-completeness-of-a-binary-tree/solution.go similarity index 100% rename from problems_backup/check_completeness_of_a_binary_tree/solution.go rename to 998-check-completeness-of-a-binary-tree/solution.go diff --git a/cmd/rename_problems/main.go b/cmd/rename_problems/main.go new file mode 100644 index 0000000..2c70ab8 --- /dev/null +++ b/cmd/rename_problems/main.go @@ -0,0 +1,199 @@ +package main + +import ( + "bytes" + "encoding/json" + "fmt" + "net/http" + "os" + "path/filepath" + "strconv" + "strings" +) + +type Problem struct { + Title string `json:"title"` + TitleSlug string `json:"titleSlug"` + Difficulty string `json:"difficulty"` + Number int `json:"questionId"` +} + +type ProblemListResponse struct { + Data struct { + Problems []Problem `json:"problemsetQuestionList"` + } `json:"data"` +} + +func fetchProblems() (map[string]int, error) { + query := `{ + problemsetQuestionList(limit: 5000) { + questionId + title + titleSlug + difficulty + } + }` + + jsonData := map[string]interface{}{ + "query": query, + } + + jsonValue, _ := json.Marshal(jsonData) + req, err := http.NewRequest("POST", "https://leetcode.com/graphql", bytes.NewBuffer(jsonValue)) + if err != nil { + return nil, err + } + + req.Header.Set("Content-Type", "application/json") + req.Header.Set("User-Agent", "Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/91.0.4472.114 Safari/537.36") + req.Header.Set("Origin", "https://leetcode.com") + req.Header.Set("Accept", "*/*") + req.Header.Set("Accept-Language", "en-US,en;q=0.9") + req.Header.Set("x-csrftoken", os.Getenv("LEETCODE_CSRF_TOKEN")) + req.Header.Set("Cookie", fmt.Sprintf("csrftoken=%s; LEETCODE_SESSION=%s", os.Getenv("LEETCODE_CSRF_TOKEN"), os.Getenv("LEETCODE_SESSION"))) + + client := &http.Client{} + resp, err := client.Do(req) + if err != nil { + return nil, err + } + defer resp.Body.Close() + + var result ProblemListResponse + if err := json.NewDecoder(resp.Body).Decode(&result); err != nil { + return nil, err + } + + slugToNumber := make(map[string]int) + for _, p := range result.Data.Problems { + slugToNumber[p.TitleSlug] = p.Number + } + + return slugToNumber, nil +} + +func normalizeTitle(title string) string { + // Convert to lowercase + title = strings.ToLower(title) + // Replace spaces and special characters with underscore + title = strings.ReplaceAll(title, " ", "_") + title = strings.ReplaceAll(title, "-", "_") + title = strings.ReplaceAll(title, "'", "") + title = strings.ReplaceAll(title, ".", "") + title = strings.ReplaceAll(title, ",", "") + title = strings.ReplaceAll(title, "(", "") + title = strings.ReplaceAll(title, ")", "") + return title +} + +func main() { + if os.Getenv("LEETCODE_CSRF_TOKEN") == "" || os.Getenv("LEETCODE_SESSION") == "" { + fmt.Println("Please set LEETCODE_CSRF_TOKEN and LEETCODE_SESSION environment variables") + fmt.Println("You can get these values from your browser after logging into LeetCode:") + fmt.Println("1. Open Chrome DevTools (F12)") + fmt.Println("2. Go to Application > Cookies > https://leetcode.com") + fmt.Println("3. Find the csrftoken and LEETCODE_SESSION cookies") + return + } + + // Get the absolute path of the workspace root + workspaceRoot, err := os.Getwd() + if err != nil { + fmt.Printf("Error getting current directory: %v\n", err) + return + } + workspaceRoot = filepath.Dir(workspaceRoot) // Go up one directory to reach the root + + fmt.Printf("Processing directories in: %s\n", workspaceRoot) + + // Fetch problem numbers from LeetCode API + slugToNumber, err := fetchProblems() + if err != nil { + fmt.Printf("Error fetching problems: %v\n", err) + return + } + + fmt.Printf("Found %d problems from LeetCode\n", len(slugToNumber)) + + // Read workspace root directory + entries, err := os.ReadDir(workspaceRoot) + if err != nil { + fmt.Printf("Error reading directory: %v\n", err) + return + } + + // System directories to skip + systemDirs := map[string]bool{ + "cmd": true, + "leetcode-db": true, + "problems_backup": true, + ".git": true, + ".github": true, + } + + // Process each directory + for _, entry := range entries { + if !entry.IsDir() { + continue + } + + oldName := entry.Name() + + // Skip system directories and hidden directories + if systemDirs[oldName] || strings.HasPrefix(oldName, ".") { + continue + } + + // Skip if already has a number prefix + if _, err := strconv.Atoi(strings.Split(oldName, "-")[0]); err == nil { + continue + } + + // Skip if it's not a LeetCode problem directory (should contain at least one .go file) + files, err := os.ReadDir(filepath.Join(workspaceRoot, oldName)) + if err != nil { + continue + } + hasGoFile := false + for _, file := range files { + if !file.IsDir() && strings.HasSuffix(file.Name(), ".go") { + hasGoFile = true + break + } + } + if !hasGoFile { + continue + } + + normalizedName := normalizeTitle(oldName) + + // Try exact match first + number, ok := slugToNumber[normalizedName] + if !ok { + // Try without special characters + for slug, num := range slugToNumber { + if normalizeTitle(slug) == normalizedName { + number = num + ok = true + break + } + } + } + + if ok && number > 0 { + // Create new directory name with problem number + newName := fmt.Sprintf("%d-%s", number, strings.ReplaceAll(oldName, "_", "-")) + oldPath := filepath.Join(workspaceRoot, oldName) + newPath := filepath.Join(workspaceRoot, newName) + + // Move directory + if err := os.Rename(oldPath, newPath); err != nil { + fmt.Printf("Error renaming %s to %s: %v\n", oldPath, newPath, err) + } else { + fmt.Printf("Renamed %s to %s\n", oldName, newName) + } + } else { + fmt.Printf("Could not find problem number for: %s (normalized: %s)\n", oldName, normalizedName) + } + } +} diff --git a/leetcode-db/cmd/rename_problems/main.go b/leetcode-db/cmd/rename_problems/main.go new file mode 100644 index 0000000..7e8f7d1 --- /dev/null +++ b/leetcode-db/cmd/rename_problems/main.go @@ -0,0 +1,360 @@ +package main + +import ( + "bytes" + "encoding/json" + "fmt" + "io/ioutil" + "net/http" + "os" + "path/filepath" + "regexp" + "strings" +) + +type Problem struct { + StatStatusPairs []struct { + Stat struct { + QuestionID int `json:"question_id"` + QuestionTitle string `json:"question__title"` + QuestionTitleSlug string `json:"question__title_slug"` + } `json:"stat"` + } `json:"stat_status_pairs"` +} + +type GraphQLResponse struct { + Data struct { + Question struct { + QuestionID string `json:"questionId"` + Title string `json:"title"` + TitleSlug string `json:"titleSlug"` + } `json:"question"` + } `json:"data"` +} + +// Known problem mappings that might not be in the API response +var knownProblemMappings = map[string]string{ + "bulb-switcher-iii": "1375", +} + +func fetchProblemBySlug(slug string) (string, error) { + // Check known mappings first + if id, ok := knownProblemMappings[slug]; ok { + return id, nil + } + + query := fmt.Sprintf(`{ + "query": "query questionData($titleSlug: String!) { question(titleSlug: $titleSlug) { questionId title titleSlug } }", + "variables": {"titleSlug": "%s"} + }`, slug) + + req, err := http.NewRequest("POST", "https://leetcode.com/graphql", bytes.NewBuffer([]byte(query))) + if err != nil { + return "", err + } + + req.Header.Set("Content-Type", "application/json") + req.Header.Set("User-Agent", "Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/91.0.4472.124 Safari/537.36") + req.Header.Set("Accept", "application/json") + req.Header.Set("Accept-Language", "en-US,en;q=0.9") + + client := &http.Client{} + resp, err := client.Do(req) + if err != nil { + return "", err + } + defer resp.Body.Close() + + body, err := ioutil.ReadAll(resp.Body) + if err != nil { + return "", err + } + + var result GraphQLResponse + if err := json.Unmarshal(body, &result); err != nil { + return "", err + } + + if result.Data.Question.QuestionID == "" { + return "", fmt.Errorf("problem not found") + } + + return result.Data.Question.QuestionID, nil +} + +func normalizeTitle(title string) string { + // Remove leading "0-" prefix if it exists + if strings.HasPrefix(title, "0-") { + title = title[2:] + } + + // Convert to lowercase + title = strings.ToLower(title) + + // Remove special characters + title = strings.ReplaceAll(title, "'", "") + title = strings.ReplaceAll(title, ".", "") + title = strings.ReplaceAll(title, ",", "") + title = strings.ReplaceAll(title, "(", "") + title = strings.ReplaceAll(title, ")", "") + title = strings.ReplaceAll(title, "?", "") + title = strings.ReplaceAll(title, "!", "") + title = strings.ReplaceAll(title, ":", "") + title = strings.ReplaceAll(title, ";", "") + title = strings.ReplaceAll(title, "+", "plus") + title = strings.ReplaceAll(title, "=", "equals") + title = strings.ReplaceAll(title, "&", "and") + + // Replace spaces and underscores with hyphens + title = strings.ReplaceAll(title, " ", "-") + title = strings.ReplaceAll(title, "_", "-") + + // Handle consecutive hyphens + for strings.Contains(title, "--") { + title = strings.ReplaceAll(title, "--", "-") + } + + // Remove leading/trailing hyphens + title = strings.Trim(title, "-") + + return title +} + +func generateVariations(title string) []string { + variations := []string{title} + + // Add variations with different number formats + re := regexp.MustCompile(`-([0-9]+|[ivx]+)$`) + if matches := re.FindStringSubmatch(title); len(matches) > 1 { + num := matches[1] + base := title[:len(title)-len(num)-1] + + // Convert roman numerals to numbers + romanToNum := map[string]string{ + "ii": "2", + "iii": "3", + "iv": "4", + "v": "5", + "vi": "6", + "vii": "7", + "viii": "8", + "ix": "9", + } + if arabic, ok := romanToNum[num]; ok { + variations = append(variations, base+"-"+arabic) + } + + // Convert numbers to roman numerals + numToRoman := map[string]string{ + "2": "ii", + "3": "iii", + "4": "iv", + "5": "v", + "6": "vi", + "7": "vii", + "8": "viii", + "9": "ix", + } + if roman, ok := numToRoman[num]; ok { + variations = append(variations, base+"-"+roman) + } + } + + // Add variations without hyphens + variations = append(variations, strings.ReplaceAll(title, "-", "")) + variations = append(variations, strings.ReplaceAll(title, "-", " ")) + + return variations +} + +func fetchProblems() (map[string]string, map[string]string, error) { + url := "https://leetcode.com/api/problems/all/" + req, err := http.NewRequest("GET", url, nil) + if err != nil { + return nil, nil, err + } + + req.Header.Set("User-Agent", "Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/91.0.4472.124 Safari/537.36") + req.Header.Set("Accept", "application/json") + req.Header.Set("Accept-Language", "en-US,en;q=0.9") + + client := &http.Client{} + resp, err := client.Do(req) + if err != nil { + return nil, nil, err + } + defer resp.Body.Close() + + body, err := ioutil.ReadAll(resp.Body) + if err != nil { + return nil, nil, err + } + + var problemList Problem + if err := json.Unmarshal(body, &problemList); err != nil { + return nil, nil, err + } + + slugToID := make(map[string]string) + titleToID := make(map[string]string) + for _, problem := range problemList.StatStatusPairs { + slug := problem.Stat.QuestionTitleSlug + id := fmt.Sprintf("%d", problem.Stat.QuestionID) + slugToID[slug] = id + slugToID[normalizeTitle(slug)] = id + titleToID[normalizeTitle(problem.Stat.QuestionTitle)] = id + + // Print out any problems with "bulb" in the title + if strings.Contains(strings.ToLower(slug), "bulb") { + fmt.Printf("Found bulb problem: %s (ID: %s)\n", slug, id) + } + } + + // Add known mappings + for slug, id := range knownProblemMappings { + slugToID[slug] = id + slugToID[normalizeTitle(slug)] = id + } + + fmt.Printf("Found %d problems from LeetCode\n", len(problemList.StatStatusPairs)) + return slugToID, titleToID, nil +} + +func isLeetCodeProblemDir(path string) bool { + // Skip if it's a system directory + base := filepath.Base(path) + if strings.HasPrefix(base, ".") || strings.HasPrefix(base, "_") { + return false + } + + // Skip if it's a known non-problem directory + knownNonProblems := map[string]bool{ + "cmd": true, + "leetcode-db": true, + "problems_backup": true, + } + if knownNonProblems[base] { + return false + } + + // Check if it contains a Go file + files, err := os.ReadDir(path) + if err != nil { + return false + } + + hasGoFile := false + for _, file := range files { + if !file.IsDir() && strings.HasSuffix(file.Name(), ".go") { + hasGoFile = true + break + } + } + + return hasGoFile +} + +func main() { + // Get current working directory + workspaceRoot, err := os.Getwd() + if err != nil { + fmt.Printf("Error getting current directory: %v\n", err) + return + } + + // Fetch problems from LeetCode API + slugToID, titleToID, err := fetchProblems() + if err != nil { + fmt.Printf("Error fetching problems: %v\n", err) + return + } + + // Read all directories + entries, err := os.ReadDir(workspaceRoot) + if err != nil { + fmt.Printf("Error reading directory: %v\n", err) + return + } + + // Process each directory + for _, entry := range entries { + if !entry.IsDir() { + continue + } + + dirName := entry.Name() + dirPath := filepath.Join(workspaceRoot, dirName) + + // Skip if not a LeetCode problem directory + if !isLeetCodeProblemDir(dirPath) { + continue + } + + // Skip if already in correct format (starts with a number but not "0-") + if matched, _ := regexp.MatchString(`^[1-9]\d*-`, dirName); matched { + continue + } + + // Get the problem name without the "0-" prefix + problemName := dirName + if strings.HasPrefix(dirName, "0-") { + problemName = dirName[2:] + } + + // Try different variations of the directory name + normalizedName := normalizeTitle(problemName) + variations := generateVariations(normalizedName) + + var id string + var found bool + for _, variation := range variations { + if id, found = slugToID[variation]; found { + break + } + if id, found = titleToID[variation]; found { + break + } + } + + // If not found in the list, try fetching directly from GraphQL API + if !found { + id, err = fetchProblemBySlug(normalizedName) + if err == nil { + found = true + } + } + + if found { + newName := fmt.Sprintf("%s-%s", id, normalizedName) + newPath := filepath.Join(workspaceRoot, newName) + + if err := os.Rename(dirPath, newPath); err != nil { + fmt.Printf("Error renaming %s to %s: %v\n", dirPath, newPath, err) + } else { + fmt.Printf("Renamed %s to %s\n", dirName, newName) + } + } else { + fmt.Printf("Could not find problem number for: %s (normalized: %s)\n", dirName, normalizedName) + fmt.Printf(" Tried variations: %v\n", variations) + // Print a few similar slugs for debugging + fmt.Printf(" Similar slugs in LeetCode:\n") + count := 0 + for slug := range slugToID { + if strings.Contains(slug, normalizedName[:min(5, len(normalizedName))]) { + fmt.Printf(" - %s\n", slug) + count++ + if count >= 5 { + break + } + } + } + } + } +} + +func min(a, b int) int { + if a < b { + return a + } + return b +} diff --git a/scripts/process_problems.go b/scripts/process_problems.go new file mode 100644 index 0000000..221bc27 --- /dev/null +++ b/scripts/process_problems.go @@ -0,0 +1,68 @@ +package main + +import ( + "log" + "os" + "path/filepath" + "strings" +) + +func main() { + // Process all directories in the root directory + entries, err := os.ReadDir(".") + if err != nil { + log.Fatal("Error reading directory:", err) + } + + for _, entry := range entries { + if !entry.IsDir() { + continue + } + + name := entry.Name() + + // Skip the problems directory and hidden directories + if name == "problems" || strings.HasPrefix(name, ".") { + continue + } + + // Check if it's a problem directory (starts with a number) + if len(name) > 0 && (name[0] >= '0' && name[0] <= '9') { + // Create the new directory path + newDir := filepath.Join("problems", name) + + // Create the new directory + err = os.MkdirAll(newDir, 0755) + if err != nil { + log.Printf("Error creating directory %s: %v", newDir, err) + continue + } + + // Move all files from the old directory to the new one + oldDir := name + files, err := os.ReadDir(oldDir) + if err != nil { + log.Printf("Error reading directory %s: %v", oldDir, err) + continue + } + + for _, file := range files { + oldPath := filepath.Join(oldDir, file.Name()) + newPath := filepath.Join(newDir, file.Name()) + err = os.Rename(oldPath, newPath) + if err != nil { + log.Printf("Error moving file %s to %s: %v", oldPath, newPath, err) + continue + } + } + + // Remove the old directory + err = os.Remove(oldDir) + if err != nil { + log.Printf("Error removing directory %s: %v", oldDir, err) + } + + log.Printf("Moved problem directory: %s", name) + } + } +}