Renamed problems and introduced gh action

nathannaveen · Feb 28, 2025 · c0e185b · c0e185b
1 parent c9a9e9e
commit c0e185b
Show file tree

Hide file tree

Showing 1,262 changed files with 663 additions and 0 deletions.
diff --git a/.github/workflows/process_leetcode.yml 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 "[email protected]"
+          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 
diff --git a/...ms_backup/array_partition_i/solution.java → 0-array-partition-i/solution.java b/...ms_backup/array_partition_i/solution.java → 0-array-partition-i/solution.java
diff --git a/...re_than_25%_in_sorted_array/solution.java → ...re-than-25%-in-sorted-array/solution.java b/...re_than_25%_in_sorted_array/solution.java → ...re-than-25%-in-sorted-array/solution.java
diff --git a/...s_backup/implement_strstr()/solution.java → 0-implement-strstr()/solution.java b/...s_backup/implement_strstr()/solution.java → 0-implement-strstr()/solution.java
diff --git a/...ual_by_reversing_sub-arrays/solution.java → ...ual-by-reversing-sub-arrays/solution.java b/...ual_by_reversing_sub-arrays/solution.java → ...ual-by-reversing-sub-arrays/solution.java
diff --git a/problems_backup/two_sum/solution.java → 1-two-sum/solution.java b/problems_backup/two_sum/solution.java → 1-two-sum/solution.java
diff --git a/problems_backup/same_tree/solution.go → 100-same-tree/solution.go b/problems_backup/same_tree/solution.go → 100-same-tree/solution.go
diff --git a/problems_backup/same_tree/solution.java → 100-same-tree/solution.java b/problems_backup/same_tree/solution.java → 100-same-tree/solution.java
diff --git a/...ed_element_in_size_2n_array/solution.java → ...ed-element-in-size-2n-array/solution.java b/...ed_element_in_size_2n_array/solution.java → ...ed-element-in-size-2n-array/solution.java
diff --git a/...ackup/univalued_binary_tree/solution.java → 1005-univalued-binary-tree/solution.java b/...ackup/univalued_binary_tree/solution.java → 1005-univalued-binary-tree/solution.java
diff --git a/problems_backup/symmetric_tree/solution.java → 101-symmetric-tree/solution.java b/problems_backup/symmetric_tree/solution.java → 101-symmetric-tree/solution.java
diff --git a/problems_backup/fibonacci_number/solution.go → 1013-fibonacci-number/solution.go b/problems_backup/fibonacci_number/solution.go → 1013-fibonacci-number/solution.go
diff --git a/...ems_backup/fibonacci_number/solution.java → 1013-fibonacci-number/solution.java b/...ems_backup/fibonacci_number/solution.java → 1013-fibonacci-number/solution.java
diff --git a/...up/k_closest_points_to_origin/solution.go → 1014-k-closest-points-to-origin/solution.go b/...up/k_closest_points_to_origin/solution.go → 1014-k-closest-points-to-origin/solution.go
diff --git a/...up/largest_perimeter_triangle/solution.go → 1018-largest-perimeter-triangle/solution.go b/...up/largest_perimeter_triangle/solution.go → 1018-largest-perimeter-triangle/solution.go
diff --git a/...kup/squares_of_a_sorted_array/solution.go → 1019-squares-of-a-sorted-array/solution.go b/...kup/squares_of_a_sorted_array/solution.go → 1019-squares-of-a-sorted-array/solution.go
diff --git a/...p/squares_of_a_sorted_array/solution.java → 1019-squares-of-a-sorted-array/solution.java b/...p/squares_of_a_sorted_array/solution.java → 1019-squares-of-a-sorted-array/solution.java
diff --git a/...ry_tree_level_order_traversal/solution.go → ...ry-tree-level-order-traversal/solution.go b/...ry_tree_level_order_traversal/solution.go → ...ry-tree-level-order-traversal/solution.go
diff --git a/...of_even_numbers_after_queries/solution.go → ...of-even-numbers-after-queries/solution.go b/...of_even_numbers_after_queries/solution.go → ...of-even-numbers-after-queries/solution.go
diff --git a/...er_traversal_of_a_binary_tree/solution.go → ...er-traversal-of-a-binary-tree/solution.go b/...er_traversal_of_a_binary_tree/solution.go → ...er-traversal-of-a-binary-tree/solution.go
diff --git a/..._zigzag_level_order_traversal/solution.go → ...-zigzag-level-order-traversal/solution.go b/..._zigzag_level_order_traversal/solution.go → ...-zigzag-level-order-traversal/solution.go
diff --git a/...est_string_starting_from_leaf/solution.go → ...est-string-starting-from-leaf/solution.go b/...est_string_starting_from_leaf/solution.go → ...est-string-starting-from-leaf/solution.go
diff --git a/.../add_to_array-form_of_integer/solution.go → ...-add-to-array-form-of-integer/solution.go b/.../add_to_array-form_of_integer/solution.go → ...-add-to-array-form-of-integer/solution.go
diff --git a/...backup/cousins_in_binary_tree/solution.go → 1035-cousins-in-binary-tree/solution.go b/...backup/cousins_in_binary_tree/solution.go → 1035-cousins-in-binary-tree/solution.go
diff --git a/problems_backup/rotting_oranges/solution.go → 1036-rotting-oranges/solution.go b/problems_backup/rotting_oranges/solution.go → 1036-rotting-oranges/solution.go
diff --git a/...up/number_of_squareful_arrays/solution.go → 1038-number-of-squareful-arrays/solution.go b/...up/number_of_squareful_arrays/solution.go → 1038-number-of-squareful-arrays/solution.go
diff --git a/...ms_backup/find_the_town_judge/solution.go → 1039-find-the-town-judge/solution.go b/...ms_backup/find_the_town_judge/solution.go → 1039-find-the-town-judge/solution.go
diff --git a/.../maximum_depth_of_binary_tree/solution.go → 104-maximum-depth-of-binary-tree/solution.go b/.../maximum_depth_of_binary_tree/solution.go → 104-maximum-depth-of-binary-tree/solution.go
diff --git a/...aximum_depth_of_binary_tree/solution.java → ...aximum-depth-of-binary-tree/solution.java b/...aximum_depth_of_binary_tree/solution.java → ...aximum-depth-of-binary-tree/solution.java
diff --git a/...p/available_captures_for_rook/solution.go → 1041-available-captures-for-rook/solution.go b/...p/available_captures_for_rook/solution.go → 1041-available-captures-for-rook/solution.go
diff --git a/...ckup/find_common_characters/solution.java → 1044-find-common-characters/solution.java b/...ckup/find_common_characters/solution.java → 1044-find-common-characters/solution.java
diff --git a/...ckup/max_consecutive_ones_iii/solution.go → 1046-max-consecutive-ones-iii/solution.go b/...ckup/max_consecutive_ones_iii/solution.go → 1046-max-consecutive-ones-iii/solution.go
diff --git a/..._of_array_after_k_negations/solution.java → ...-of-array-after-k-negations/solution.java b/..._of_array_after_k_negations/solution.java → ...-of-array-after-k-negations/solution.java
diff --git a/...complement_of_base_10_integer/solution.go → ...complement-of-base-10-integer/solution.go b/...complement_of_base_10_integer/solution.go → ...complement-of-base-10-integer/solution.go
diff --git a/...kup/number_of_valid_subarrays/solution.go → 1061-number-of-valid-subarrays/solution.go b/...kup/number_of_valid_subarrays/solution.go → 1061-number-of-valid-subarrays/solution.go
diff --git a/...ubstrings_representing_1_to_n/solution.go → ...ubstrings-representing-1-to-n/solution.go b/...ubstrings_representing_1_to_n/solution.go → ...ubstrings-representing-1-to-n/solution.go
diff --git a/problems_backup/fixed_point/solution.go → 1066-fixed-point/solution.go b/problems_backup/fixed_point/solution.go → 1066-fixed-point/solution.go
diff --git a/problems_backup/confusing_number/solution.go → 1069-confusing-number/solution.go b/problems_backup/confusing_number/solution.go → 1069-confusing-number/solution.go
diff --git a/...tree_level_order_traversal_ii/solution.go → ...tree-level-order-traversal-ii/solution.go b/...tree_level_order_traversal_ii/solution.go → ...tree-level-order-traversal-ii/solution.go
diff --git a/.../binary_prefix_divisible_by_5/solution.go → ...-binary-prefix-divisible-by-5/solution.go b/.../binary_prefix_divisible_by_5/solution.go → ...-binary-prefix-divisible-by-5/solution.go
diff --git a/...t_greater_node_in_linked_list/solution.go → ...t-greater-node-in-linked-list/solution.go b/...t_greater_node_in_linked_list/solution.go → ...t-greater-node-in-linked-list/solution.go
diff --git a/...ems_backup/number_of_enclaves/solution.go → 1073-number-of-enclaves/solution.go b/...ems_backup/number_of_enclaves/solution.go → 1073-number-of-enclaves/solution.go
diff --git a/problems_backup/high_five/solution.go → 1074-high-five/solution.go b/problems_backup/high_five/solution.go → 1074-high-five/solution.go
diff --git a/...ackup/index_pairs_of_a_string/solution.go → 1075-index-pairs-of-a-string/solution.go b/...ackup/index_pairs_of_a_string/solution.go → 1075-index-pairs-of-a-string/solution.go
diff --git a/problems_backup/brace_expansion/solution.go → 1076-brace-expansion/solution.go b/problems_backup/brace_expansion/solution.go → 1076-brace-expansion/solution.go
diff --git a/.../remove_outermost_parentheses/solution.go → ...-remove-outermost-parentheses/solution.go b/.../remove_outermost_parentheses/solution.go → ...-remove-outermost-parentheses/solution.go
diff --git a/...emove_outermost_parentheses/solution.java → ...emove-outermost-parentheses/solution.java b/...emove_outermost_parentheses/solution.java → ...emove-outermost-parentheses/solution.java
diff --git a/...f_root_to_leaf_binary_numbers/solution.go → ...f-root-to-leaf-binary-numbers/solution.go b/...f_root_to_leaf_binary_numbers/solution.go → ...f-root-to-leaf-binary-numbers/solution.go
diff --git a/...d_array_to_binary_search_tree/solution.go → ...d-array-to-binary-search-tree/solution.go b/...d_array_to_binary_search_tree/solution.go → ...d-array-to-binary-search-tree/solution.go
diff --git a/...ems_backup/camelcase_matching/solution.go → 1080-camelcase-matching/solution.go b/...ems_backup/camelcase_matching/solution.go → 1080-camelcase-matching/solution.go
diff --git a/..._digits_in_the_minimum_number/solution.go → ...-digits-in-the-minimum-number/solution.go b/..._digits_in_the_minimum_number/solution.go → ...-digits-in-the-minimum-number/solution.go
diff --git a/...s_with_no_repeated_characters/solution.go → ...s-with-no-repeated-characters/solution.go b/...s_with_no_repeated_characters/solution.go → ...s-with-no-repeated-characters/solution.go
diff --git a/..._when_everyone_become_friends/solution.go → ...-when-everyone-become-friends/solution.go b/..._when_everyone_become_friends/solution.go → ...-when-everyone-become-friends/solution.go
diff --git a/problems_backup/divisor_game/solution.go → 1086-divisor-game/solution.go b/problems_backup/divisor_game/solution.go → 1086-divisor-game/solution.go
diff --git a/problems_backup/divisor_game/solution.java → 1086-divisor-game/solution.java b/problems_backup/divisor_game/solution.java → 1086-divisor-game/solution.java
diff --git a/...kup/number_of_days_in_a_month/solution.go → 1088-number-of-days-in-a-month/solution.go b/...kup/number_of_days_in_a_month/solution.go → 1088-number-of-days-in-a-month/solution.go
diff --git a/...ed_list_to_binary_search_tree/solution.go → ...ed-list-to-binary-search-tree/solution.go b/...ed_list_to_binary_search_tree/solution.go → ...ed-list-to-binary-search-tree/solution.go
diff --git a/problems_backup/armstrong_number/solution.go → 1090-armstrong-number/solution.go b/problems_backup/armstrong_number/solution.go → 1090-armstrong-number/solution.go
diff --git a/...ackup/maximum_average_subtree/solution.go → 1091-maximum-average-subtree/solution.go b/...ackup/maximum_average_subtree/solution.go → 1091-maximum-average-subtree/solution.go
diff --git a/...nce_between_node_and_ancestor/solution.go → ...nce-between-node-and-ancestor/solution.go b/...nce_between_node_and_ancestor/solution.go → ...nce-between-node-and-ancestor/solution.go
diff --git a/..._tree_from_preorder_traversal/solution.go → ...-tree-from-preorder-traversal/solution.go b/..._tree_from_preorder_traversal/solution.go → ...-tree-from-preorder-traversal/solution.go
diff --git a/...atrix_cells_in_distance_order/solution.go → ...atrix-cells-in-distance-order/solution.go b/...atrix_cells_in_distance_order/solution.go → ...atrix-cells-in-distance-order/solution.go
diff --git a/...ms_backup/two_city_scheduling/solution.go → 1095-two-city-scheduling/solution.go b/...ms_backup/two_city_scheduling/solution.go → 1095-two-city-scheduling/solution.go
diff --git a/..._backup/largest_unique_number/solution.go → 1098-largest-unique-number/solution.go b/..._backup/largest_unique_number/solution.go → 1098-largest-unique-number/solution.go
diff --git a/...th_with_maximum_minimum_value/solution.go → ...th-with-maximum-minimum-value/solution.go b/...th_with_maximum_minimum_value/solution.go → ...th-with-maximum-minimum-value/solution.go
diff --git a/...kup/container_with_most_water/solution.go → 11-container-with-most-water/solution.go b/...kup/container_with_most_water/solution.go → 11-container-with-most-water/solution.go
diff --git a/...s_backup/balanced_binary_tree/solution.go → 110-balanced-binary-tree/solution.go b/...s_backup/balanced_binary_tree/solution.go → 110-balanced-binary-tree/solution.go
diff --git a/...ting_cities_with_minimum_cost/solution.go → ...ting-cities-with-minimum-cost/solution.go b/...ting_cities_with_minimum_cost/solution.go → ...ting-cities-with-minimum-cost/solution.go
diff --git a/problems_backup/parallel_courses/solution.go → 1101-parallel-courses/solution.go b/problems_backup/parallel_courses/solution.go → 1101-parallel-courses/solution.go
diff --git a/...ity_element_in_a_sorted_array/solution.go → ...ity-element-in-a-sorted-array/solution.go b/...ity_element_in_a_sorted_array/solution.go → ...ity-element-in-a-sorted-array/solution.go
diff --git a/problems_backup/uncrossed_lines/solution.go → 1105-uncrossed-lines/solution.go b/problems_backup/uncrossed_lines/solution.go → 1105-uncrossed-lines/solution.go
diff --git a/.../minimum_depth_of_binary_tree/solution.go → 111-minimum-depth-of-binary-tree/solution.go b/.../minimum_depth_of_binary_tree/solution.go → 111-minimum-depth-of-binary-tree/solution.go
diff --git a/...can_be_formed_by_characters/solution.java → ...can-be-formed-by-characters/solution.java b/...can_be_formed_by_characters/solution.java → ...can-be-formed-by-characters/solution.java
diff --git a/...arch_tree_to_greater_sum_tree/solution.go → ...arch-tree-to-greater-sum-tree/solution.go b/...arch_tree_to_greater_sum_tree/solution.go → ...arch-tree-to-greater-sum-tree/solution.go
diff --git a/...ch_tree_to_greater_sum_tree/solution.java → ...ch-tree-to-greater-sum-tree/solution.java b/...ch_tree_to_greater_sum_tree/solution.java → ...ch-tree-to-greater-sum-tree/solution.java
diff --git a/problems_backup/valid_boomerang/solution.go → 1115-valid-boomerang/solution.go b/problems_backup/valid_boomerang/solution.go → 1115-valid-boomerang/solution.go
diff --git a/...um_level_sum_of_a_binary_tree/solution.go → ...um-level-sum-of-a-binary-tree/solution.go b/...um_level_sum_of_a_binary_tree/solution.go → ...um-level-sum-of-a-binary-tree/solution.go
diff --git a/.../as_far_from_land_as_possible/solution.go → ...-as-far-from-land-as-possible/solution.go b/.../as_far_from_land_as_possible/solution.go → ...-as-far-from-land-as-possible/solution.go
diff --git a/...ray_into_increasing_sequences/solution.go → ...ray-into-increasing-sequences/solution.go b/...ray_into_increasing_sequences/solution.go → ...ray-into-increasing-sequences/solution.go
diff --git a/...p/remove_vowels_from_a_string/solution.go → 1119-remove-vowels-from-a-string/solution.go b/...p/remove_vowels_from_a_string/solution.go → 1119-remove-vowels-from-a-string/solution.go
diff --git a/...ackup/robot_bounded_in_circle/solution.go → 1119-robot-bounded-in-circle/solution.go b/...ackup/robot_bounded_in_circle/solution.go → 1119-robot-bounded-in-circle/solution.go
diff --git a/problems_backup/path_sum/solution.go → 112-path-sum/solution.go b/problems_backup/path_sum/solution.go → 112-path-sum/solution.go
diff --git a/...ms_backup/single-row_keyboard/solution.go → 1123-single-row-keyboard/solution.go b/...ms_backup/single-row_keyboard/solution.go → 1123-single-row-keyboard/solution.go
diff --git a/...inimum_cost_to_connect_sticks/solution.go → ...inimum-cost-to-connect-sticks/solution.go b/...inimum_cost_to_connect_sticks/solution.go → ...inimum-cost-to-connect-sticks/solution.go
diff --git a/...lems_backup/last_stone_weight/solution.go → 1127-last-stone-weight/solution.go b/...lems_backup/last_stone_weight/solution.go → 1127-last-stone-weight/solution.go
diff --git a/...jacent_duplicates_in_string/solution.java → ...jacent-duplicates-in-string/solution.java b/...jacent_duplicates_in_string/solution.java → ...jacent-duplicates-in-string/solution.java
diff --git a/problems_backup/path_sum_ii/solution.go → 113-path-sum-ii/solution.go b/problems_backup/path_sum_ii/solution.go → 113-path-sum-ii/solution.go
diff --git a/...with_only_one_distinct_letter/solution.go → ...with-only-one-distinct-letter/solution.go b/...with_only_one_distinct_letter/solution.go → ...with-only-one-distinct-letter/solution.go
diff --git a/problems_backup/height_checker/solution.java → 1137-height-checker/solution.java b/problems_backup/height_checker/solution.java → 1137-height-checker/solution.java
diff --git a/...backup/grumpy_bookstore_owner/solution.go → 1138-grumpy-bookstore-owner/solution.go b/...backup/grumpy_bookstore_owner/solution.go → 1138-grumpy-bookstore-owner/solution.go
diff --git a/...en_binary_tree_to_linked_list/solution.go → ...en-binary-tree-to-linked-list/solution.go b/...en_binary_tree_to_linked_list/solution.go → ...en-binary-tree-to-linked-list/solution.go
diff --git a/problems_backup/distant_barcodes/solution.go → 1140-distant-barcodes/solution.go b/problems_backup/distant_barcodes/solution.go → 1140-distant-barcodes/solution.go
diff --git a/...s_can_you_put_into_the_basket/solution.go → ...s-can-you-put-into-the-basket/solution.go b/...s_can_you_put_into_the_basket/solution.go → ...s-can-you-put-into-the-basket/solution.go
diff --git a/...st_common_element_in_all_rows/solution.go → ...st-common-element-in-all-rows/solution.go b/...st_common_element_in_all_rows/solution.go → ...st-common-element-in-all-rows/solution.go
diff --git a/...est_common_divisor_of_strings/solution.go → ...est-common-divisor-of-strings/solution.go b/...est_common_divisor_of_strings/solution.go → ...est-common-divisor-of-strings/solution.go
diff --git a/...ection_of_three_sorted_arrays/solution.go → ...ection-of-three-sorted-arrays/solution.go b/...ection_of_three_sorted_arrays/solution.go → ...ection-of-three-sorted-arrays/solution.go
diff --git a/problems_backup/two_sum_bsts/solution.go → 1150-two-sum-bsts/solution.go b/problems_backup/two_sum_bsts/solution.go → 1150-two-sum-bsts/solution.go
diff --git a/...up/occurrences_after_bigram/solution.java → 1156-occurrences-after-bigram/solution.java b/...up/occurrences_after_bigram/solution.java → 1156-occurrences-after-bigram/solution.java
diff --git a/...quence_of_distinct_characters/solution.go → ...quence-of-distinct-characters/solution.go b/...quence_of_distinct_characters/solution.go → ...quence-of-distinct-characters/solution.go
diff --git a/...t_right_pointers_in_each_node/solution.go → ...t-right-pointers-in-each-node/solution.go b/...t_right_pointers_in_each_node/solution.go → ...t-right-pointers-in-each-node/solution.go
diff --git a/...kup/letter_tile_possibilities/solution.go → 1160-letter-tile-possibilities/solution.go b/...kup/letter_tile_possibilities/solution.go → 1160-letter-tile-possibilities/solution.go
diff --git a/...ber_in_arithmetic_progression/solution.go → ...ber-in-arithmetic-progression/solution.go b/...ber_in_arithmetic_progression/solution.go → ...ber-in-arithmetic-progression/solution.go
diff --git a/problems_backup/duplicate_zeros/solution.go → 1168-duplicate-zeros/solution.go b/problems_backup/duplicate_zeros/solution.go → 1168-duplicate-zeros/solution.go
diff --git a/...ight_pointers_in_each_node_ii/solution.go → ...ight-pointers-in-each-node-ii/solution.go b/...ight_pointers_in_each_node_ii/solution.go → ...ight-pointers-in-each-node-ii/solution.go
diff --git a/...s_backup/array_transformation/solution.go → 1175-array-transformation/solution.go b/...s_backup/array_transformation/solution.go → 1175-array-transformation/solution.go
diff --git a/...s_backup/design_a_leaderboard/solution.go → 1176-design-a-leaderboard/solution.go b/...s_backup/design_a_leaderboard/solution.go → 1176-design-a-leaderboard/solution.go
diff --git a/...lems_backup/pascal's_triangle/solution.go → 118-pascal's-triangle/solution.go b/...lems_backup/pascal's_triangle/solution.go → 118-pascal's-triangle/solution.go
diff --git a/...s_backup/pascal's_triangle_ii/solution.go → 119-pascal's-triangle-ii/solution.go b/...s_backup/pascal's_triangle_ii/solution.go → 119-pascal's-triangle-ii/solution.go
diff --git a/...backup/smallest_common_region/solution.go → 1190-smallest-common-region/solution.go b/...backup/smallest_common_region/solution.go → 1190-smallest-common-region/solution.go
diff --git a/...istribute_candies_to_people/solution.java → ...istribute-candies-to-people/solution.java b/...istribute_candies_to_people/solution.java → ...istribute-candies-to-people/solution.java
diff --git a/problems_backup/integer_to_roman/solution.go → 12-integer-to-roman/solution.go b/problems_backup/integer_to_roman/solution.go → 12-integer-to-roman/solution.go
diff --git a/problems_backup/triangle/solution.go → 120-triangle/solution.go b/problems_backup/triangle/solution.go → 120-triangle/solution.go
diff --git a/problems_backup/remove_interval/solution.go → 1200-remove-interval/solution.go b/problems_backup/remove_interval/solution.go → 1200-remove-interval/solution.go
diff --git a/...lems_backup/delete_tree_nodes/solution.go → 1201-delete-tree-nodes/solution.go b/...lems_backup/delete_tree_nodes/solution.go → 1201-delete-tree-nodes/solution.go
diff --git a/...kup/defanging_an_ip_address/solution.java → 1205-defanging-an-ip-address/solution.java b/...kup/defanging_an_ip_address/solution.java → 1205-defanging-an-ip-address/solution.java
diff --git a/...kup/corporate_flight_bookings/solution.go → 1206-corporate-flight-bookings/solution.go b/...kup/corporate_flight_bookings/solution.go → 1206-corporate-flight-bookings/solution.go
diff --git a/...two_valid_parentheses_strings/solution.go → ...two-valid-parentheses-strings/solution.go b/...two_valid_parentheses_strings/solution.go → ...two-valid-parentheses-strings/solution.go
diff --git a/...st_time_to_buy_and_sell_stock/solution.go → ...st-time-to-buy-and-sell-stock/solution.go b/...st_time_to_buy_and_sell_stock/solution.go → ...st-time-to-buy-and-sell-stock/solution.go
diff --git a/..._after_removing_some_elements/solution.go → ...-after-removing-some-elements/solution.go b/..._after_removing_some_elements/solution.go → ...-after-removing-some-elements/solution.go
diff --git a/...lems_backup/sequential_digits/solution.go → 1212-sequential-digits/solution.go b/...lems_backup/sequential_digits/solution.go → 1212-sequential-digits/solution.go
diff --git a/...ms_backup/relative_sort_array/solution.go → 1217-relative-sort-array/solution.go b/...ms_backup/relative_sort_array/solution.go → 1217-relative-sort-array/solution.go
diff --git a/..._backup/relative_sort_array/solution.java → 1217-relative-sort-array/solution.java b/..._backup/relative_sort_array/solution.java → 1217-relative-sort-array/solution.java
diff --git a/...on_ancestor_of_deepest_leaves/solution.go → ...on-ancestor-of-deepest-leaves/solution.go b/...on_ancestor_of_deepest_leaves/solution.go → ...on-ancestor-of-deepest-leaves/solution.go
diff --git a/...backup/path_with_maximum_gold/solution.go → 1219-path-with-maximum-gold/solution.go b/...backup/path_with_maximum_gold/solution.go → 1219-path-with-maximum-gold/solution.go
diff --git a/...ckup/remove_covered_intervals/solution.go → 1222-remove-covered-intervals/solution.go b/...ckup/remove_covered_intervals/solution.go → 1222-remove-covered-intervals/solution.go
diff --git a/...er_of_equivalent_domino_pairs/solution.go → ...er-of-equivalent-domino-pairs/solution.go b/...er_of_equivalent_domino_pairs/solution.go → ...er-of-equivalent-domino-pairs/solution.go
diff --git a/...ime_to_buy_and_sell_stock_iii/solution.go → ...ime-to-buy-and-sell-stock-iii/solution.go b/...ime_to_buy_and_sell_stock_iii/solution.go → ...ime-to-buy-and-sell-stock-iii/solution.go
diff --git a/...reatest_element_on_right_side/solution.go → ...reatest-element-on-right-side/solution.go b/...reatest_element_on_right_side/solution.go → ...reatest-element-on-right-side/solution.go
diff --git a/...atest_element_on_right_side/solution.java → ...atest-element-on-right-side/solution.java b/...atest_element_on_right_side/solution.java → ...atest-element-on-right-side/solution.java
diff --git a/...ckup/n-th_tribonacci_number/solution.java → 1236-n-th-tribonacci-number/solution.java b/...ckup/n-th_tribonacci_number/solution.java → 1236-n-th-tribonacci-number/solution.java
diff --git a/...ms_backup/alphabet_board_path/solution.go → 1238-alphabet-board-path/solution.go b/...ms_backup/alphabet_board_path/solution.go → 1238-alphabet-board-path/solution.go
diff --git a/.../binary_tree_maximum_path_sum/solution.go → 124-binary-tree-maximum-path-sum/solution.go b/.../binary_tree_maximum_path_sum/solution.go → 124-binary-tree-maximum-path-sum/solution.go
diff --git a/...ess_run-length_encoded_list/solution.java → ...ess-run-length-encoded-list/solution.java b/...ess_run-length_encoded_list/solution.java → ...ess-run-length-encoded-list/solution.java
diff --git a/...ith_even-valued_grandparent/solution.java → ...ith-even-valued-grandparent/solution.java b/...ith_even-valued_grandparent/solution.java → ...ith-even-valued-grandparent/solution.java
diff --git a/...ckup/distinct_echo_substrings/solution.go → 1244-distinct-echo-substrings/solution.go b/...ckup/distinct_echo_substrings/solution.go → 1244-distinct-echo-substrings/solution.go
diff --git a/...kup/binary_tree_coloring_game/solution.go → 1248-binary-tree-coloring-game/solution.go b/...kup/binary_tree_coloring_game/solution.go → 1248-binary-tree-coloring-game/solution.go
diff --git a/problems_backup/snapshot_array/solution.go → 1249-snapshot-array/solution.go b/problems_backup/snapshot_array/solution.go → 1249-snapshot-array/solution.go
diff --git a/...ems_backup/valid_palindrome/solution.java → 125-valid-palindrome/solution.java b/...ems_backup/valid_palindrome/solution.java → 125-valid-palindrome/solution.java
diff --git a/...up/sort_the_matrix_diagonally/solution.go → 1253-sort-the-matrix-diagonally/solution.go b/...up/sort_the_matrix_diagonally/solution.go → 1253-sort-the-matrix-diagonally/solution.go
diff --git a/...ems_backup/deepest_leaves_sum/solution.go → 1254-deepest-leaves-sum/solution.go b/...ems_backup/deepest_leaves_sum/solution.go → 1254-deepest-leaves-sum/solution.go
diff --git a/...up/rank_transform_of_an_array/solution.go → 1256-rank-transform-of-an-array/solution.go b/...up/rank_transform_of_an_array/solution.go → 1256-rank-transform-of-an-array/solution.go
diff --git a/problems_backup/day_of_the_year/solution.go → 1260-day-of-the-year/solution.go b/problems_backup/day_of_the_year/solution.go → 1260-day-of-the-year/solution.go
diff --git a/..._number_of_words_you_can_type/solution.go → ...-number-of-words-you-can-type/solution.go b/..._number_of_words_you_can_type/solution.go → ...-number-of-words-you-can-type/solution.go
diff --git a/...ncy_of_the_smallest_character/solution.go → ...ncy-of-the-smallest-character/solution.go b/...ncy_of_the_smallest_character/solution.go → ...ncy-of-the-smallest-character/solution.go
diff --git a/...ems_backup/closest_divisors/solution.java → 1276-closest-divisors/solution.java b/...ems_backup/closest_divisors/solution.java → 1276-closest-divisors/solution.java
diff --git a/.../longest_consecutive_sequence/solution.go → 128-longest-consecutive-sequence/solution.go b/.../longest_consecutive_sequence/solution.go → 128-longest-consecutive-sequence/solution.go
diff --git a/..._backup/diet_plan_performance/solution.go → 1280-diet-plan-performance/solution.go b/..._backup/diet_plan_performance/solution.go → 1280-diet-plan-performance/solution.go
diff --git a/problems_backup/reformat_date/solution.go → 1283-reformat-date/solution.go b/problems_backup/reformat_date/solution.go → 1283-reformat-date/solution.go
diff --git a/...ckup/sum_root_to_leaf_numbers/solution.go → 129-sum-root-to-leaf-numbers/solution.go b/...ckup/sum_root_to_leaf_numbers/solution.go → 129-sum-root-to-leaf-numbers/solution.go
diff --git a/...ckup/three_consecutive_odds/solution.java → 1293-three-consecutive-odds/solution.java b/...ckup/three_consecutive_odds/solution.java → 1293-three-consecutive-odds/solution.java
diff --git a/...eter_to_collect_enough_apples/solution.go → ...eter-to-collect-enough-apples/solution.go b/...eter_to_collect_enough_apples/solution.go → ...eter-to-collect-enough-apples/solution.go
diff --git a/...up/maximum_number_of_balloons/solution.go → 1297-maximum-number-of-balloons/solution.go b/...up/maximum_number_of_balloons/solution.go → 1297-maximum-number-of-balloons/solution.go
diff --git a/...ween_each_pair_of_parentheses/solution.go → ...ween-each-pair-of-parentheses/solution.go b/...ween_each_pair_of_parentheses/solution.go → ...ween-each-pair-of-parentheses/solution.go
diff --git a/problems_backup/roman_to_integer/solution.go → 13-roman-to-integer/solution.go b/problems_backup/roman_to_integer/solution.go → 13-roman-to-integer/solution.go
diff --git a/...ems_backup/roman_to_integer/solution.java → 13-roman-to-integer/solution.java b/...ems_backup/roman_to_integer/solution.java → 13-roman-to-integer/solution.java
diff --git a/...ems_backup/surrounded_regions/solution.go → 130-surrounded-regions/solution.go b/...ems_backup/surrounded_regions/solution.go → 130-surrounded-regions/solution.go
diff --git a/...m_moves_to_reach_target_score/solution.go → ...m-moves-to-reach-target-score/solution.go b/...m_moves_to_reach_target_score/solution.go → ...m-moves-to-reach-target-score/solution.go
diff --git a/..._of_visible_people_in_a_queue/solution.go → ...-of-visible-people-in-a-queue/solution.go b/..._of_visible_people_in_a_queue/solution.go → ...-of-visible-people-in-a-queue/solution.go
diff --git a/...minimum_absolute_difference/solution.java → ...minimum-absolute-difference/solution.java b/...minimum_absolute_difference/solution.java → ...minimum-absolute-difference/solution.java
diff --git a/problems_backup/watering_plants/solution.go → 1310-watering-plants/solution.go b/problems_backup/watering_plants/solution.go → 1310-watering-plants/solution.go
diff --git a/...nique_number_of_occurrences/solution.java → ...nique-number-of-occurrences/solution.java b/...nique_number_of_occurrences/solution.java → ...nique-number-of-occurrences/solution.java
diff --git a/...acent_duplicates_in_string_ii/solution.go → ...acent-duplicates-in-string-ii/solution.go b/...acent_duplicates_in_string_ii/solution.go → ...acent-duplicates-in-string-ii/solution.go
diff --git a/...ckup/where_will_the_ball_fall/solution.go → 1324-where-will-the-ball-fall/solution.go b/...ckup/where_will_the_ball_fall/solution.go → 1324-where-will-the-ball-fall/solution.go
diff --git a/...ve_chips_to_the_same_position/solution.go → ...ve-chips-to-the-same-position/solution.go b/...ve_chips_to_the_same_position/solution.go → ...ve-chips-to-the-same-position/solution.go
diff --git a/problems_backup/clone_graph/solution.go → 133-clone-graph/solution.go b/problems_backup/clone_graph/solution.go → 133-clone-graph/solution.go
diff --git a/problems_backup/gas_station/solution.go → 134-gas-station/solution.go b/problems_backup/gas_station/solution.go → 134-gas-station/solution.go
diff --git a/..._string_in_balanced_strings/solution.java → ...-string-in-balanced-strings/solution.java b/..._string_in_balanced_strings/solution.java → ...-string-in-balanced-strings/solution.java
diff --git a/...eens_that_can_attack_the_king/solution.go → ...eens-that-can-attack-the-king/solution.go b/...eens_that_can_attack_the_king/solution.go → ...eens-that-can-attack-the-king/solution.go
diff --git a/..._backup/perform_string_shifts/solution.go → 1345-perform-string-shifts/solution.go b/..._backup/perform_string_shifts/solution.go → 1345-perform-string-shifts/solution.go
diff --git a/...heck_if_it_is_a_straight_line/solution.go → ...heck-if-it-is-a-straight-line/solution.go b/...heck_if_it_is_a_straight_line/solution.go → ...heck-if-it-is-a-straight-line/solution.go
diff --git a/...product_of_the_last_k_numbers/solution.go → ...product-of-the-last-k-numbers/solution.go b/...product_of_the_last_k_numbers/solution.go → ...product-of-the-last-k-numbers/solution.go
diff --git a/...array_after_removing_anagrams/solution.go → ...array-after-removing-anagrams/solution.go b/...array_after_removing_anagrams/solution.go → ...array-after-removing-anagrams/solution.go
diff --git a/...ayers_with_zero_or_one_losses/solution.go → ...ayers-with-zero-or-one-losses/solution.go b/...ayers_with_zero_or_one_losses/solution.go → ...ayers-with-zero-or-one-losses/solution.go
diff --git a/problems_backup/single_number/solution.go → 136-single-number/solution.go b/problems_backup/single_number/solution.go → 136-single-number/solution.go
diff --git a/problems_backup/single_number/solution.java → 136-single-number/solution.java b/problems_backup/single_number/solution.java → 136-single-number/solution.java
diff --git a/...e_seat_assignment_probability/solution.go → ...e-seat-assignment-probability/solution.go b/...e_seat_assignment_probability/solution.go → ...e-seat-assignment-probability/solution.go
diff --git a/...etter_in_upper_and_lower_case/solution.go → ...etter-in-upper-and-lower-case/solution.go b/...etter_in_upper_and_lower_case/solution.go → ...etter-in-upper-and-lower-case/solution.go
diff --git a/...ms_backup/first_unique_number/solution.go → 1366-first-unique-number/solution.go b/...ms_backup/first_unique_number/solution.go → 1366-first-unique-number/solution.go
diff --git a/problems_backup/single_number_ii/solution.go → 137-single-number-ii/solution.go b/problems_backup/single_number_ii/solution.go → 137-single-number-ii/solution.go
diff --git a/...ove_to_make_valid_parentheses/solution.go → ...ove-to-make-valid-parentheses/solution.go b/...ove_to_make_valid_parentheses/solution.go → ...ove-to-make-valid-parentheses/solution.go
diff --git a/...st_column_with_at_least_a_one/solution.go → ...st-column-with-at-least-a-one/solution.go b/...st_column_with_at_least_a_one/solution.go → ...st-column-with-at-least-a-one/solution.go
diff --git a/...lems_backup/bulb_switcher_iii/solution.go → 1375-bulb-switcher-iii/solution.go b/...lems_backup/bulb_switcher_iii/solution.go → 1375-bulb-switcher-iii/solution.go
diff --git a/..._palindrome_with_fixed_length/solution.go → ...-palindrome-with-fixed-length/solution.go b/..._palindrome_with_fixed_length/solution.go → ...-palindrome-with-fixed-length/solution.go
diff --git a/...s_with_odd_values_in_a_matrix/solution.go → ...s-with-odd-values-in-a-matrix/solution.go b/...s_with_odd_values_in_a_matrix/solution.go → ...s-with-odd-values-in-a-matrix/solution.go
diff --git a/...nstruct_a_2-row_binary_matrix/solution.go → ...nstruct-a-2-row-binary-matrix/solution.go b/...nstruct_a_2-row_binary_matrix/solution.go → ...nstruct-a-2-row-binary-matrix/solution.go
diff --git a/...ckup/number_of_closed_islands/solution.go → 1380-number-of-closed-islands/solution.go b/...ckup/number_of_closed_islands/solution.go → 1380-number-of-closed-islands/solution.go
diff --git a/...score_words_formed_by_letters/solution.go → ...score-words-formed-by-letters/solution.go b/...score_words_formed_by_letters/solution.go → ...score-words-formed-by-letters/solution.go
diff --git a/...alculate_amount_paid_in_taxes/solution.go → ...alculate-amount-paid-in-taxes/solution.go b/...alculate_amount_paid_in_taxes/solution.go → ...alculate-amount-paid-in-taxes/solution.go
diff --git a/..._ways_to_build_house_of_cards/solution.go → ...-ways-to-build-house-of-cards/solution.go b/..._ways_to_build_house_of_cards/solution.go → ...-ways-to-build-house-of-cards/solution.go
diff --git a/problems_backup/shift_2d_grid/solution.go → 1386-shift-2d-grid/solution.go b/problems_backup/shift_2d_grid/solution.go → 1386-shift-2d-grid/solution.go
diff --git a/...lems_backup/counting_elements/solution.go → 1391-counting-elements/solution.go b/...lems_backup/counting_elements/solution.go → 1391-counting-elements/solution.go
diff --git a/..._the_difference_of_two_arrays/solution.go → ...-the-difference-of-two-arrays/solution.go b/..._the_difference_of_two_arrays/solution.go → ...-the-difference-of-two-arrays/solution.go
diff --git a/...um_time_visiting_all_points/solution.java → ...um-time-visiting-all-points/solution.java b/...um_time_visiting_all_points/solution.java → ...um-time-visiting-all-points/solution.java
diff --git a/...ount_servers_that_communicate/solution.go → ...ount-servers-that-communicate/solution.go b/...ount_servers_that_communicate/solution.go → ...ount-servers-that-communicate/solution.go
diff --git a/...kup/search_suggestions_system/solution.go → 1397-search-suggestions-system/solution.go b/...kup/search_suggestions_system/solution.go → 1397-search-suggestions-system/solution.go
diff --git a/...ackup/longest_common_prefix/solution.java → 14-longest-common-prefix/solution.java b/...ackup/longest_common_prefix/solution.java → 14-longest-common-prefix/solution.java
diff --git a/problems_backup/word_break_ii/solution.go → 140-word-break-ii/solution.go b/problems_backup/word_break_ii/solution.go → 140-word-break-ii/solution.go
diff --git a/..._winner_on_a_tic_tac_toe_game/solution.go → ...-winner-on-a-tic-tac-toe-game/solution.go b/..._winner_on_a_tic_tac_toe_game/solution.go → ...-winner-on-a-tic-tac-toe-game/solution.go
diff --git a/..._with_no_waste_of_ingredients/solution.go → ...-with-no-waste-of-ingredients/solution.go b/..._with_no_waste_of_ingredients/solution.go → ...-with-no-waste-of-ingredients/solution.go
diff --git a/...utable_linked_list_in_reverse/solution.go → ...utable-linked-list-in-reverse/solution.go b/...utable_linked_list_in_reverse/solution.go → ...utable-linked-list-in-reverse/solution.go
diff --git a/...d_sum_of_digits_of_an_integer/solution.go → ...d-sum-of-digits-of-an-integer/solution.go b/...d_sum_of_digits_of_an_integer/solution.go → ...d-sum-of-digits-of-an-integer/solution.go
diff --git a/...sum_of_digits_of_an_integer/solution.java → ...sum-of-digits-of-an-integer/solution.java b/...sum_of_digits_of_an_integer/solution.java → ...sum-of-digits-of-an-integer/solution.java
diff --git a/...e_group_size_they_belong_to/solution.java → ...e-group-size-they-belong-to/solution.java b/...e_group_size_they_belong_to/solution.java → ...e-group-size-they-belong-to/solution.java
diff --git a/...lems_backup/linked_list_cycle/solution.go → 141-linked-list-cycle/solution.go b/...lems_backup/linked_list_cycle/solution.go → 141-linked-list-cycle/solution.go
diff --git a/...r_in_a_linked_list_to_integer/solution.go → ...r-in-a-linked-list-to-integer/solution.go b/...r_in_a_linked_list_to_integer/solution.go → ...r-in-a-linked-list-to-integer/solution.go
diff --git a/...ck_if_an_array_is_consecutive/solution.go → ...ck-if-an-array-is-consecutive/solution.go b/...ck_if_an_array_is_consecutive/solution.go → ...ck-if-an-array-is-consecutive/solution.go
diff --git a/...s_backup/linked_list_cycle_ii/solution.go → 142-linked-list-cycle-ii/solution.go b/...s_backup/linked_list_cycle_ii/solution.go → 142-linked-list-cycle-ii/solution.go
diff --git a/..._with_even_number_of_digits/solution.java → ...-with-even-number-of-digits/solution.java b/..._with_even_number_of_digits/solution.java → ...-with-even-number-of-digits/solution.java
diff --git a/...sets_of_k_consecutive_numbers/solution.go → ...sets-of-k-consecutive-numbers/solution.go b/...sets_of_k_consecutive_numbers/solution.go → ...sets-of-k-consecutive-numbers/solution.go
diff --git a/...que_integers_sum_up_to_zero/solution.java → ...que-integers-sum-up-to-zero/solution.java b/...que_integers_sum_up_to_zero/solution.java → ...que-integers-sum-up-to-zero/solution.java
diff --git a/...ts_in_two_binary_search_trees/solution.go → ...ts-in-two-binary-search-trees/solution.go b/...ts_in_two_binary_search_trees/solution.go → ...ts-in-two-binary-search-trees/solution.go
diff --git a/problems_backup/reorder_list/solution.go → 143-reorder-list/solution.go b/problems_backup/reorder_list/solution.go → 143-reorder-list/solution.go
diff --git a/...find_the_k-beauty_of_a_number/solution.go → ...find-the-k-beauty-of-a-number/solution.go b/...find_the_k-beauty_of_a_number/solution.go → ...find-the-k-beauty-of-a-number/solution.go
diff --git a/...alphabet_to_integer_mapping/solution.java → ...alphabet-to-integer-mapping/solution.java b/...alphabet_to_integer_mapping/solution.java → ...alphabet-to-integer-mapping/solution.java
diff --git a/...inary_tree_preorder_traversal/solution.go → ...inary-tree-preorder-traversal/solution.go b/...inary_tree_preorder_traversal/solution.go → ...inary-tree-preorder-traversal/solution.go
diff --git a/...e_sum_of_two_no-zero_integers/solution.go → ...e-sum-of-two-no-zero-integers/solution.go b/...e_sum_of_two_no-zero_integers/solution.go → ...e-sum-of-two-no-zero-integers/solution.go
diff --git a/...ips_to_make_a_or_b_equal_to_c/solution.go → ...ips-to-make-a-or-b-equal-to-c/solution.go b/...ips_to_make_a_or_b_equal_to_c/solution.go → ...ips-to-make-a-or-b-equal-to-c/solution.go
diff --git a/...ons_to_make_network_connected/solution.go → ...ons-to-make-network-connected/solution.go b/...ons_to_make_network_connected/solution.go → ...ons-to-make-network-connected/solution.go
diff --git a/...ps_to_reduce_a_number_to_zero/solution.go → ...ps-to-reduce-a-number-to-zero/solution.go b/...ps_to_reduce_a_number_to_zero/solution.go → ...ps-to-reduce-a-number-to-zero/solution.go
diff --git a/..._to_reduce_a_number_to_zero/solution.java → ...-to-reduce-a-number-to-zero/solution.java b/..._to_reduce_a_number_to_zero/solution.java → ...-to-reduce-a-number-to-zero/solution.java
diff --git a/...er_than_or_equal_to_threshold/solution.go → ...er-than-or-equal-to-threshold/solution.go b/...er_than_or_equal_to_threshold/solution.go → ...er-than-or-equal-to-threshold/solution.go
diff --git a/...ngle_between_hands_of_a_clock/solution.go → ...ngle-between-hands-of-a-clock/solution.go b/...ngle_between_hands_of_a_clock/solution.go → ...ngle-between-hands-of-a-clock/solution.go
diff --git a/...lems_backup/maximum_69_number/solution.go → 1448-maximum-69-number/solution.go b/...lems_backup/maximum_69_number/solution.go → 1448-maximum-69-number/solution.go
diff --git a/...ms_backup/maximum_69_number/solution.java → 1448-maximum-69-number/solution.java b/...ms_backup/maximum_69_number/solution.java → 1448-maximum-69-number/solution.java
diff --git a/...backup/print_words_vertically/solution.go → 1449-print-words-vertically/solution.go b/...backup/print_words_vertically/solution.go → 1449-print-words-vertically/solution.go
diff --git a/...nary_tree_postorder_traversal/solution.go → ...nary-tree-postorder-traversal/solution.go b/...nary_tree_postorder_traversal/solution.go → ...nary-tree-postorder-traversal/solution.go
diff --git a/...ete_leaves_with_a_given_value/solution.go → ...ete-leaves-with-a-given-value/solution.go b/...ete_leaves_with_a_given_value/solution.go → ...ete-leaves-with-a-given-value/solution.go
diff --git a/...move_palindromic_subsequences/solution.go → ...move-palindromic-subsequences/solution.go b/...move_palindromic_subsequences/solution.go → ...move-palindromic-subsequences/solution.go
diff --git a/...egers_by_the_number_of_1_bits/solution.go → ...egers-by-the-number-of-1-bits/solution.go b/...egers_by_the_number_of_1_bits/solution.go → ...egers-by-the-number-of-1-bits/solution.go
diff --git a/...he_k_weakest_rows_in_a_matrix/solution.go → ...he-k-weakest-rows-in-a-matrix/solution.go b/...he_k_weakest_rows_in_a_matrix/solution.go → ...he-k-weakest-rows-in-a-matrix/solution.go
diff --git a/...reduce_array_size_to_the_half/solution.go → ...reduce-array-size-to-the-half/solution.go b/...reduce_array_size_to_the_half/solution.go → ...reduce-array-size-to-the-half/solution.go
diff --git a/...k_if_n_and_its_double_exist/solution.java → ...k-if-n-and-its-double-exist/solution.java b/...k_if_n_and_its_double_exist/solution.java → ...k-if-n-and-its-double-exist/solution.java
diff --git a/...to_make_two_strings_anagram/solution.java → ...to-make-two-strings-anagram/solution.java b/...to_make_two_strings_anagram/solution.java → ...to-make-two-strings-anagram/solution.java
diff --git a/...ms_backup/insertion_sort_list/solution.go → 147-insertion-sort-list/solution.go b/...ms_backup/insertion_sort_list/solution.go → 147-insertion-sort-list/solution.go
diff --git a/.../maximum_students_taking_exam/solution.go → ...-maximum-students-taking-exam/solution.go b/.../maximum_students_taking_exam/solution.go → ...-maximum-students-taking-exam/solution.go
diff --git a/...ncreasing_decreasing_string/solution.java → ...ncreasing-decreasing-string/solution.java b/...ncreasing_decreasing_string/solution.java → ...ncreasing-decreasing-string/solution.java
diff --git a/...ve_numbers_in_a_sorted_matrix/solution.go → ...ve-numbers-in-a-sorted-matrix/solution.go b/...ve_numbers_in_a_sorted_matrix/solution.go → ...ve-numbers-in-a-sorted-matrix/solution.go
diff --git a/..._numbers_in_a_sorted_matrix/solution.java → ...-numbers-in-a-sorted-matrix/solution.java b/..._numbers_in_a_sorted_matrix/solution.java → ...-numbers-in-a-sorted-matrix/solution.java
diff --git a/problems_backup/sort_list/solution.go → 148-sort-list/solution.go b/problems_backup/sort_list/solution.go → 148-sort-list/solution.go
diff --git a/...ler_than_the_current_number/solution.java → ...ler-than-the-current-number/solution.java b/...ler_than_the_current_number/solution.java → ...ler-than-the-current-number/solution.java
diff --git a/...up/linked_list_in_binary_tree/solution.go → 1484-linked-list-in-binary-tree/solution.go b/...up/linked_list_in_binary_tree/solution.go → 1484-linked-list-in-binary-tree/solution.go
diff --git a/...ance_value_between_two_arrays/solution.go → ...ance-value-between-two-arrays/solution.go b/...ance_value_between_two_arrays/solution.go → ...ance-value-between-two-arrays/solution.go
diff --git a/...s_backup/max_points_on_a_line/solution.go → 149-max-points-on-a-line/solution.go b/...s_backup/max_points_on_a_line/solution.go → 149-max-points-on-a-line/solution.go
diff --git a/...aracters_that_have_odd_counts/solution.go → ...aracters-that-have-odd-counts/solution.go b/...aracters_that_have_odd_counts/solution.go → ...aracters-that-have-odd-counts/solution.go
diff --git a/...frog_position_after_t_seconds/solution.go → ...frog-position-after-t-seconds/solution.go b/...frog_position_after_t_seconds/solution.go → ...frog-position-after-t-seconds/solution.go
diff --git a/...p/lucky_numbers_in_a_matrix/solution.java → 1496-lucky-numbers-in-a-matrix/solution.java b/...p/lucky_numbers_in_a_matrix/solution.java → 1496-lucky-numbers-in-a-matrix/solution.java
diff --git a/...tack_with_increment_operation/solution.go → ...tack-with-increment-operation/solution.go b/...tack_with_increment_operation/solution.go → ...tack-with-increment-operation/solution.go
diff --git a/...ree_in_a_clone_of_that_tree/solution.java → ...ree-in-a-clone-of-that-tree/solution.java b/...ree_in_a_clone_of_that_tree/solution.java → ...ree-in-a-clone-of-that-tree/solution.java
diff --git a/...luate_reverse_polish_notation/solution.go → ...luate-reverse-polish-notation/solution.go b/...luate_reverse_polish_notation/solution.go → ...luate-reverse-polish-notation/solution.go
diff --git a/..._backup/count_largest_group/solution.java → 1500-count-largest-group/solution.java b/..._backup/count_largest_group/solution.java → 1500-count-largest-group/solution.java
diff --git a/...cle_and_rectangle_overlapping/solution.go → ...cle-and-rectangle-overlapping/solution.go b/...cle_and_rectangle_overlapping/solution.go → ...cle-and-rectangle-overlapping/solution.go
diff --git a/problems_backup/reducing_dishes/solution.go → 1503-reducing-dishes/solution.go b/problems_backup/reducing_dishes/solution.go → 1503-reducing-dishes/solution.go
diff --git a/...et_array_in_the_given_order/solution.java → ...et-array-in-the-given-order/solution.java b/...et_array_in_the_given_order/solution.java → ...et-array-in-the-given-order/solution.java
diff --git a/...s_backup/longest_happy_prefix/solution.go → 1508-longest-happy-prefix/solution.go b/...s_backup/longest_happy_prefix/solution.go → 1508-longest-happy-prefix/solution.go
diff --git a/...kup/reverse_words_in_a_string/solution.go → 151-reverse-words-in-a-string/solution.go b/...kup/reverse_words_in_a_string/solution.go → 151-reverse-words-in-a-string/solution.go
diff --git a/...d_lucky_integer_in_an_array/solution.java → ...d-lucky-integer-in-an-array/solution.java b/...d_lucky_integer_in_an_array/solution.java → ...d-lucky-integer-in-an-array/solution.java
diff --git a/...ackup/count_number_of_teams/solution.java → 1511-count-number-of-teams/solution.java b/...ackup/count_number_of_teams/solution.java → 1511-count-number-of-teams/solution.java
diff --git a/...kup/design_underground_system/solution.go → 1512-design-underground-system/solution.go b/...kup/design_underground_system/solution.go → 1512-design-underground-system/solution.go
diff --git a/...get_positive_step_by_step_sum/solution.go → ...get-positive-step-by-step-sum/solution.go b/...get_positive_step_by_step_sum/solution.go → ...get-positive-step-by-step-sum/solution.go
diff --git a/...onacci_numbers_whose_sum_is_k/solution.go → ...onacci-numbers-whose-sum-is-k/solution.go b/...onacci_numbers_whose_sum_is_k/solution.go → ...onacci-numbers-whose-sum-is-k/solution.go
diff --git a/...uence_in_non-increasing_order/solution.go → ...uence-in-non-increasing-order/solution.go b/...uence_in_non-increasing_order/solution.go → ...uence-in-non-increasing-order/solution.go
diff --git a/..._binary_representation_to_one/solution.go → ...-binary-representation-to-one/solution.go b/..._binary_representation_to_one/solution.go → ...-binary-representation-to-one/solution.go
diff --git a/...string_matching_in_an_array/solution.java → ...string-matching-in-an-array/solution.java b/...string_matching_in_an_array/solution.java → ...string-matching-in-an-array/solution.java
diff --git a/..._greatest_number_of_candies/solution.java → ...-greatest-number-of-candies/solution.java b/..._greatest_number_of_candies/solution.java → ...-greatest-number-of-candies/solution.java
diff --git a/...nimum_in_rotated_sorted_array/solution.go → ...nimum-in-rotated-sorted-array/solution.go b/...nimum_in_rotated_sorted_array/solution.go → ...nimum-in-rotated-sorted-array/solution.go
diff --git a/...ring_can_break_another_string/solution.go → ...ring-can-break-another-string/solution.go b/...ring_can_break_another_string/solution.go → ...ring-can-break-another-string/solution.go
diff --git a/..._backup/reformat_the_string/solution.java → 1532-reformat-the-string/solution.java b/..._backup/reformat_the_string/solution.java → 1532-reformat-the-string/solution.java
diff --git a/...imum_number_of_frogs_croaking/solution.go → ...imum-number-of-frogs-croaking/solution.go b/...imum_number_of_frogs_croaking/solution.go → ...imum-number-of-frogs-croaking/solution.go
diff --git a/...core_after_splitting_a_string/solution.go → ...core-after-splitting-a-string/solution.go b/...core_after_splitting_a_string/solution.go → ...core-after-splitting-a-string/solution.go
diff --git a/...s_backup/diagonal_traverse_ii/solution.go → 1539-diagonal-traverse-ii/solution.go b/...s_backup/diagonal_traverse_ii/solution.go → 1539-diagonal-traverse-ii/solution.go
diff --git a/...um_in_rotated_sorted_array_ii/solution.go → ...um-in-rotated-sorted-array-ii/solution.go b/...um_in_rotated_sorted_array_ii/solution.go → ...um-in-rotated-sorted-array-ii/solution.go
diff --git a/...ckup/consecutive_characters/solution.java → 1542-consecutive-characters/solution.java b/...ckup/consecutive_characters/solution.java → 1542-consecutive-characters/solution.java
diff --git a/...unt_good_nodes_in_binary_tree/solution.go → ...unt-good-nodes-in-binary-tree/solution.go b/...unt_good_nodes_in_binary_tree/solution.go → ...unt-good-nodes-in-binary-tree/solution.go
diff --git a/problems_backup/destination_city/solution.go → 1547-destination-city/solution.go b/problems_backup/destination_city/solution.go → 1547-destination-city/solution.go
diff --git a/...ems_backup/destination_city/solution.java → 1547-destination-city/solution.java b/...ems_backup/destination_city/solution.java → 1547-destination-city/solution.java
diff --git a/problems_backup/min_stack/solution.java → 155-min-stack/solution.java b/problems_backup/min_stack/solution.java → 155-min-stack/solution.java
diff --git a/...array_with_stack_operations/solution.java → ...array-with-stack-operations/solution.java b/...array_with_stack_operations/solution.java → ...array-with-stack-operations/solution.java
diff --git a/...ns_all_binary_codes_of_size_k/solution.go → ...ns-all-binary-codes-of-size-k/solution.go b/...ns_all_binary_codes_of_size_k/solution.go → ...ns-all-binary-codes-of-size-k/solution.go
diff --git a/...ng_homework_at_a_given_time/solution.java → ...ng-homework-at-a-given-time/solution.java b/...ng_homework_at_a_given_time/solution.java → ...ng-homework-at-a-given-time/solution.java
diff --git a/...rearrange_words_in_a_sentence/solution.go → ...rearrange-words-in-a-sentence/solution.go b/...rearrange_words_in_a_sentence/solution.go → ...rearrange-words-in-a-sentence/solution.go
diff --git a/...fix_of_any_word_in_a_sentence/solution.go → ...fix-of-any-word-in-a-sentence/solution.go b/...fix_of_any_word_in_a_sentence/solution.go → ...fix-of-any-word-in-a-sentence/solution.go
diff --git a/...n_a_substring_of_given_length/solution.go → ...n-a-substring-of-given-length/solution.go b/...n_a_substring_of_given_length/solution.go → ...n-a-substring-of-given-length/solution.go
diff --git a/...dromic_paths_in_a_binary_tree/solution.go → ...dromic-paths-in-a-binary-tree/solution.go b/...dromic_paths_in_a_binary_tree/solution.go → ...dromic-paths-in-a-binary-tree/solution.go
diff --git a/..._a_special_discount_in_a_shop/solution.go → ...-a-special-discount-in-a-shop/solution.go b/..._a_special_discount_in_a_shop/solution.go → ...-a-special-discount-in-a-shop/solution.go
diff --git a/...s_backup/subrectangle_queries/solution.go → 1572-subrectangle-queries/solution.go b/...s_backup/subrectangle_queries/solution.go → 1572-subrectangle-queries/solution.go
diff --git a/...of_two_elements_in_an_array/solution.java → ...of-two-elements-in-an-array/solution.java b/...of_two_elements_in_an_array/solution.java → ...of-two-elements-in-an-array/solution.java
diff --git a/..._horizontal_and_vertical_cuts/solution.go → ...-horizontal-and-vertical-cuts/solution.go b/..._horizontal_and_vertical_cuts/solution.go → ...-horizontal-and-vertical-cuts/solution.go
diff --git a/...ms_backup/shuffle_the_array/solution.java → 1580-shuffle-the-array/solution.java b/...ms_backup/shuffle_the_array/solution.java → 1580-shuffle-the-array/solution.java
diff --git a/...backup/design_browser_history/solution.go → 1582-design-browser-history/solution.go b/...backup/design_browser_history/solution.go → 1582-design-browser-history/solution.go
diff --git a/..._minimum_and_maximum_salary/solution.java → ...-minimum-and-maximum-salary/solution.java b/..._minimum_and_maximum_salary/solution.java → ...-minimum-and-maximum-salary/solution.java
diff --git a/...ms_backup/the_kth_factor_of_n/solution.go → 1585-the-kth-factor-of-n/solution.go b/...ms_backup/the_kth_factor_of_n/solution.go → 1585-the-kth-factor-of-n/solution.go
diff --git a/...ersection_of_two_linked_lists/solution.go → ...ersection-of-two-linked-lists/solution.go b/...ersection_of_two_linked_lists/solution.go → ...ersection-of-two-linked-lists/solution.go
diff --git a/...ackup/running_sum_of_1d_array/solution.go → 1603-running-sum-of-1d-array/solution.go b/...ackup/running_sum_of_1d_array/solution.go → 1603-running-sum-of-1d-array/solution.go
diff --git a/...kup/running_sum_of_1d_array/solution.java → 1603-running-sum-of-1d-array/solution.java b/...kup/running_sum_of_1d_array/solution.java → 1603-running-sum-of-1d-array/solution.java
diff --git a/...kup/find_all_the_lonely_nodes/solution.go → 1609-find-all-the-lonely-nodes/solution.go b/...kup/find_all_the_lonely_nodes/solution.go → 1609-find-all-the-lonely-nodes/solution.go
diff --git a/...p/xor_operation_in_an_array/solution.java → 1610-xor-operation-in-an-array/solution.java b/...p/xor_operation_in_an_array/solution.java → 1610-xor-operation-in-an-array/solution.java
diff --git a/problems_backup/stone_game_iv/solution.go → 1617-stone-game-iv/solution.go b/problems_backup/stone_game_iv/solution.go → 1617-stone-game-iv/solution.go
diff --git a/...fter_m_nodes_of_a_linked_list/solution.go → ...fter-m-nodes-of-a-linked-list/solution.go b/...fter_m_nodes_of_a_linked_list/solution.go → ...fter-m-nodes-of-a-linked-list/solution.go
diff --git a/problems_backup/path_crossing/solution.go → 1619-path-crossing/solution.go b/problems_backup/path_crossing/solution.go → 1619-path-crossing/solution.go
diff --git a/...lems_backup/find_peak_element/solution.go → 162-find-peak-element/solution.go b/...lems_backup/find_peak_element/solution.go → 162-find-peak-element/solution.go